ods-component-lib 1.22.3 → 1.22.5

package/dist/node_modules/fflate/esm/browser.js.map

@@ -1 +1 @@
-{"version":3,"file":"browser.js","sources":["../../../../node_modules/fflate/esm/browser.js"],"sourcesContent":["// DEFLATE is a complex format; to read this code, you should probably check the RFC first:\n// https://tools.ietf.org/html/rfc1951\n// You may also wish to take a look at the guide I made about this program:\n// https://gist.github.com/101arrowz/253f31eb5abc3d9275ab943003ffecad\n// Much of the following code is similar to that of UZIP.js:\n// https://github.com/photopea/UZIP.js\n// Many optimizations have been made, so the bundle size is ultimately smaller but performance is similar.\n// Sometimes 0 will appear where -1 would be more appropriate. This is because using a uint\n// is better for memory in most engines (I *think*).\nvar ch2 = {};\nvar wk = (function (c, id, msg, transfer, cb) {\n    var u = ch2[id] || (ch2[id] = URL.createObjectURL(new Blob([c], { type: 'text/javascript' })));\n    var w = new Worker(u);\n    w.onerror = function (e) { return cb(e.error, null); };\n    w.onmessage = function (e) { return cb(null, e.data); };\n    w.postMessage(msg, transfer);\n    return w;\n});\n\n// aliases for shorter compressed code (most minifers don't do this)\nvar u8 = Uint8Array, u16 = Uint16Array, u32 = Uint32Array;\n// fixed length extra bits\nvar fleb = new u8([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, /* unused */ 0, 0, /* impossible */ 0]);\n// fixed distance extra bits\n// see fleb note\nvar fdeb = new u8([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, /* unused */ 0, 0]);\n// code length index map\nvar clim = new u8([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]);\n// get base, reverse index map from extra bits\nvar freb = function (eb, start) {\n    var b = new u16(31);\n    for (var i = 0; i < 31; ++i) {\n        b[i] = start += 1 << eb[i - 1];\n    }\n    // numbers here are at max 18 bits\n    var r = new u32(b[30]);\n    for (var i = 1; i < 30; ++i) {\n        for (var j = b[i]; j < b[i + 1]; ++j) {\n            r[j] = ((j - b[i]) << 5) | i;\n        }\n    }\n    return [b, r];\n};\nvar _a = freb(fleb, 2), fl = _a[0], revfl = _a[1];\n// we can ignore the fact that the other numbers are wrong; they never happen anyway\nfl[28] = 258, revfl[258] = 28;\nvar _b = freb(fdeb, 0), fd = _b[0], revfd = _b[1];\n// map of value to reverse (assuming 16 bits)\nvar rev = new u16(32768);\nfor (var i = 0; i < 32768; ++i) {\n    // reverse table algorithm from SO\n    var x = ((i & 0xAAAA) >>> 1) | ((i & 0x5555) << 1);\n    x = ((x & 0xCCCC) >>> 2) | ((x & 0x3333) << 2);\n    x = ((x & 0xF0F0) >>> 4) | ((x & 0x0F0F) << 4);\n    rev[i] = (((x & 0xFF00) >>> 8) | ((x & 0x00FF) << 8)) >>> 1;\n}\n// create huffman tree from u8 \"map\": index -> code length for code index\n// mb (max bits) must be at most 15\n// TODO: optimize/split up?\nvar hMap = (function (cd, mb, r) {\n    var s = cd.length;\n    // index\n    var i = 0;\n    // u16 \"map\": index -> # of codes with bit length = index\n    var l = new u16(mb);\n    // length of cd must be 288 (total # of codes)\n    for (; i < s; ++i)\n        ++l[cd[i] - 1];\n    // u16 \"map\": index -> minimum code for bit length = index\n    var le = new u16(mb);\n    for (i = 0; i < mb; ++i) {\n        le[i] = (le[i - 1] + l[i - 1]) << 1;\n    }\n    var co;\n    if (r) {\n        // u16 \"map\": index -> number of actual bits, symbol for code\n        co = new u16(1 << mb);\n        // bits to remove for reverser\n        var rvb = 15 - mb;\n        for (i = 0; i < s; ++i) {\n            // ignore 0 lengths\n            if (cd[i]) {\n                // num encoding both symbol and bits read\n                var sv = (i << 4) | cd[i];\n                // free bits\n                var r_1 = mb - cd[i];\n                // start value\n                var v = le[cd[i] - 1]++ << r_1;\n                // m is end value\n                for (var m = v | ((1 << r_1) - 1); v <= m; ++v) {\n                    // every 16 bit value starting with the code yields the same result\n                    co[rev[v] >>> rvb] = sv;\n                }\n            }\n        }\n    }\n    else {\n        co = new u16(s);\n        for (i = 0; i < s; ++i)\n            co[i] = rev[le[cd[i] - 1]++] >>> (15 - cd[i]);\n    }\n    return co;\n});\n// fixed length tree\nvar flt = new u8(288);\nfor (var i = 0; i < 144; ++i)\n    flt[i] = 8;\nfor (var i = 144; i < 256; ++i)\n    flt[i] = 9;\nfor (var i = 256; i < 280; ++i)\n    flt[i] = 7;\nfor (var i = 280; i < 288; ++i)\n    flt[i] = 8;\n// fixed distance tree\nvar fdt = new u8(32);\nfor (var i = 0; i < 32; ++i)\n    fdt[i] = 5;\n// fixed length map\nvar flm = /*#__PURE__*/ hMap(flt, 9, 0), flrm = /*#__PURE__*/ hMap(flt, 9, 1);\n// fixed distance map\nvar fdm = /*#__PURE__*/ hMap(fdt, 5, 0), fdrm = /*#__PURE__*/ hMap(fdt, 5, 1);\n// find max of array\nvar max = function (a) {\n    var m = a[0];\n    for (var i = 1; i < a.length; ++i) {\n        if (a[i] > m)\n            m = a[i];\n    }\n    return m;\n};\n// read d, starting at bit p and mask with m\nvar bits = function (d, p, m) {\n    var o = (p / 8) >> 0;\n    return ((d[o] | (d[o + 1] << 8)) >>> (p & 7)) & m;\n};\n// read d, starting at bit p continuing for at least 16 bits\nvar bits16 = function (d, p) {\n    var o = (p / 8) >> 0;\n    return ((d[o] | (d[o + 1] << 8) | (d[o + 2] << 16)) >>> (p & 7));\n};\n// get end of byte\nvar shft = function (p) { return ((p / 8) >> 0) + (p & 7 && 1); };\n// typed array slice - allows garbage collector to free original reference,\n// while being more compatible than .slice\nvar slc = function (v, s, e) {\n    if (s == null || s < 0)\n        s = 0;\n    if (e == null || e > v.length)\n        e = v.length;\n    // can't use .constructor in case user-supplied\n    var n = new (v instanceof u16 ? u16 : v instanceof u32 ? u32 : u8)(e - s);\n    n.set(v.subarray(s, e));\n    return n;\n};\n// expands raw DEFLATE data\nvar inflt = function (dat, buf, st) {\n    // source length\n    var sl = dat.length;\n    // have to estimate size\n    var noBuf = !buf || st;\n    // no state\n    var noSt = !st || st.i;\n    if (!st)\n        st = {};\n    // Assumes roughly 33% compression ratio average\n    if (!buf)\n        buf = new u8(sl * 3);\n    // ensure buffer can fit at least l elements\n    var cbuf = function (l) {\n        var bl = buf.length;\n        // need to increase size to fit\n        if (l > bl) {\n            // Double or set to necessary, whichever is greater\n            var nbuf = new u8(Math.max(bl * 2, l));\n            nbuf.set(buf);\n            buf = nbuf;\n        }\n    };\n    //  last chunk         bitpos           bytes\n    var final = st.f || 0, pos = st.p || 0, bt = st.b || 0, lm = st.l, dm = st.d, lbt = st.m, dbt = st.n;\n    // total bits\n    var tbts = sl * 8;\n    do {\n        if (!lm) {\n            // BFINAL - this is only 1 when last chunk is next\n            st.f = final = bits(dat, pos, 1);\n            // type: 0 = no compression, 1 = fixed huffman, 2 = dynamic huffman\n            var type = bits(dat, pos + 1, 3);\n            pos += 3;\n            if (!type) {\n                // go to end of byte boundary\n                var s = shft(pos) + 4, l = dat[s - 4] | (dat[s - 3] << 8), t = s + l;\n                if (t > sl) {\n                    if (noSt)\n                        throw 'unexpected EOF';\n                    break;\n                }\n                // ensure size\n                if (noBuf)\n                    cbuf(bt + l);\n                // Copy over uncompressed data\n                buf.set(dat.subarray(s, t), bt);\n                // Get new bitpos, update byte count\n                st.b = bt += l, st.p = pos = t * 8;\n                continue;\n            }\n            else if (type == 1)\n                lm = flrm, dm = fdrm, lbt = 9, dbt = 5;\n            else if (type == 2) {\n                //  literal                            lengths\n                var hLit = bits(dat, pos, 31) + 257, hcLen = bits(dat, pos + 10, 15) + 4;\n                var tl = hLit + bits(dat, pos + 5, 31) + 1;\n                pos += 14;\n                // length+distance tree\n                var ldt = new u8(tl);\n                // code length tree\n                var clt = new u8(19);\n                for (var i = 0; i < hcLen; ++i) {\n                    // use index map to get real code\n                    clt[clim[i]] = bits(dat, pos + i * 3, 7);\n                }\n                pos += hcLen * 3;\n                // code lengths bits\n                var clb = max(clt), clbmsk = (1 << clb) - 1;\n                if (!noSt && pos + tl * (clb + 7) > tbts)\n                    break;\n                // code lengths map\n                var clm = hMap(clt, clb, 1);\n                for (var i = 0; i < tl;) {\n                    var r = clm[bits(dat, pos, clbmsk)];\n                    // bits read\n                    pos += r & 15;\n                    // symbol\n                    var s = r >>> 4;\n                    // code length to copy\n                    if (s < 16) {\n                        ldt[i++] = s;\n                    }\n                    else {\n                        //  copy   count\n                        var c = 0, n = 0;\n                        if (s == 16)\n                            n = 3 + bits(dat, pos, 3), pos += 2, c = ldt[i - 1];\n                        else if (s == 17)\n                            n = 3 + bits(dat, pos, 7), pos += 3;\n                        else if (s == 18)\n                            n = 11 + bits(dat, pos, 127), pos += 7;\n                        while (n--)\n                            ldt[i++] = c;\n                    }\n                }\n                //    length tree                 distance tree\n                var lt = ldt.subarray(0, hLit), dt = ldt.subarray(hLit);\n                // max length bits\n                lbt = max(lt);\n                // max dist bits\n                dbt = max(dt);\n                lm = hMap(lt, lbt, 1);\n                dm = hMap(dt, dbt, 1);\n            }\n            else\n                throw 'invalid block type';\n            if (pos > tbts)\n                throw 'unexpected EOF';\n        }\n        // Make sure the buffer can hold this + the largest possible addition\n        // Maximum chunk size (practically, theoretically infinite) is 2^17;\n        if (noBuf)\n            cbuf(bt + 131072);\n        var lms = (1 << lbt) - 1, dms = (1 << dbt) - 1;\n        var mxa = lbt + dbt + 18;\n        while (noSt || pos + mxa < tbts) {\n            // bits read, code\n            var c = lm[bits16(dat, pos) & lms], sym = c >>> 4;\n            pos += c & 15;\n            if (pos > tbts)\n                throw 'unexpected EOF';\n            if (!c)\n                throw 'invalid length/literal';\n            if (sym < 256)\n                buf[bt++] = sym;\n            else if (sym == 256) {\n                lm = null;\n                break;\n            }\n            else {\n                var add = sym - 254;\n                // no extra bits needed if less\n                if (sym > 264) {\n                    // index\n                    var i = sym - 257, b = fleb[i];\n                    add = bits(dat, pos, (1 << b) - 1) + fl[i];\n                    pos += b;\n                }\n                // dist\n                var d = dm[bits16(dat, pos) & dms], dsym = d >>> 4;\n                if (!d)\n                    throw 'invalid distance';\n                pos += d & 15;\n                var dt = fd[dsym];\n                if (dsym > 3) {\n                    var b = fdeb[dsym];\n                    dt += bits16(dat, pos) & ((1 << b) - 1), pos += b;\n                }\n                if (pos > tbts)\n                    throw 'unexpected EOF';\n                if (noBuf)\n                    cbuf(bt + 131072);\n                var end = bt + add;\n                for (; bt < end; bt += 4) {\n                    buf[bt] = buf[bt - dt];\n                    buf[bt + 1] = buf[bt + 1 - dt];\n                    buf[bt + 2] = buf[bt + 2 - dt];\n                    buf[bt + 3] = buf[bt + 3 - dt];\n                }\n                bt = end;\n            }\n        }\n        st.l = lm, st.p = pos, st.b = bt;\n        if (lm)\n            final = 1, st.m = lbt, st.d = dm, st.n = dbt;\n    } while (!final);\n    return bt == buf.length ? buf : slc(buf, 0, bt);\n};\n// starting at p, write the minimum number of bits that can hold v to d\nvar wbits = function (d, p, v) {\n    v <<= p & 7;\n    var o = (p / 8) >> 0;\n    d[o] |= v;\n    d[o + 1] |= v >>> 8;\n};\n// starting at p, write the minimum number of bits (>8) that can hold v to d\nvar wbits16 = function (d, p, v) {\n    v <<= p & 7;\n    var o = (p / 8) >> 0;\n    d[o] |= v;\n    d[o + 1] |= v >>> 8;\n    d[o + 2] |= v >>> 16;\n};\n// creates code lengths from a frequency table\nvar hTree = function (d, mb) {\n    // Need extra info to make a tree\n    var t = [];\n    for (var i = 0; i < d.length; ++i) {\n        if (d[i])\n            t.push({ s: i, f: d[i] });\n    }\n    var s = t.length;\n    var t2 = t.slice();\n    if (!s)\n        return [new u8(0), 0];\n    if (s == 1) {\n        var v = new u8(t[0].s + 1);\n        v[t[0].s] = 1;\n        return [v, 1];\n    }\n    t.sort(function (a, b) { return a.f - b.f; });\n    // after i2 reaches last ind, will be stopped\n    // freq must be greater than largest possible number of symbols\n    t.push({ s: -1, f: 25001 });\n    var l = t[0], r = t[1], i0 = 0, i1 = 1, i2 = 2;\n    t[0] = { s: -1, f: l.f + r.f, l: l, r: r };\n    // efficient algorithm from UZIP.js\n    // i0 is lookbehind, i2 is lookahead - after processing two low-freq\n    // symbols that combined have high freq, will start processing i2 (high-freq,\n    // non-composite) symbols instead\n    // see https://reddit.com/r/photopea/comments/ikekht/uzipjs_questions/\n    while (i1 != s - 1) {\n        l = t[t[i0].f < t[i2].f ? i0++ : i2++];\n        r = t[i0 != i1 && t[i0].f < t[i2].f ? i0++ : i2++];\n        t[i1++] = { s: -1, f: l.f + r.f, l: l, r: r };\n    }\n    var maxSym = t2[0].s;\n    for (var i = 1; i < s; ++i) {\n        if (t2[i].s > maxSym)\n            maxSym = t2[i].s;\n    }\n    // code lengths\n    var tr = new u16(maxSym + 1);\n    // max bits in tree\n    var mbt = ln(t[i1 - 1], tr, 0);\n    if (mbt > mb) {\n        // more algorithms from UZIP.js\n        // TODO: find out how this code works (debt)\n        //  ind    debt\n        var i = 0, dt = 0;\n        //    left            cost\n        var lft = mbt - mb, cst = 1 << lft;\n        t2.sort(function (a, b) { return tr[b.s] - tr[a.s] || a.f - b.f; });\n        for (; i < s; ++i) {\n            var i2_1 = t2[i].s;\n            if (tr[i2_1] > mb) {\n                dt += cst - (1 << (mbt - tr[i2_1]));\n                tr[i2_1] = mb;\n            }\n            else\n                break;\n        }\n        dt >>>= lft;\n        while (dt > 0) {\n            var i2_2 = t2[i].s;\n            if (tr[i2_2] < mb)\n                dt -= 1 << (mb - tr[i2_2]++ - 1);\n            else\n                ++i;\n        }\n        for (; i >= 0 && dt; --i) {\n            var i2_3 = t2[i].s;\n            if (tr[i2_3] == mb) {\n                --tr[i2_3];\n                ++dt;\n            }\n        }\n        mbt = mb;\n    }\n    return [new u8(tr), mbt];\n};\n// get the max length and assign length codes\nvar ln = function (n, l, d) {\n    return n.s == -1\n        ? Math.max(ln(n.l, l, d + 1), ln(n.r, l, d + 1))\n        : (l[n.s] = d);\n};\n// length codes generation\nvar lc = function (c) {\n    var s = c.length;\n    // Note that the semicolon was intentional\n    while (s && !c[--s])\n        ;\n    var cl = new u16(++s);\n    //  ind      num         streak\n    var cli = 0, cln = c[0], cls = 1;\n    var w = function (v) { cl[cli++] = v; };\n    for (var i = 1; i <= s; ++i) {\n        if (c[i] == cln && i != s)\n            ++cls;\n        else {\n            if (!cln && cls > 2) {\n                for (; cls > 138; cls -= 138)\n                    w(32754);\n                if (cls > 2) {\n                    w(cls > 10 ? ((cls - 11) << 5) | 28690 : ((cls - 3) << 5) | 12305);\n                    cls = 0;\n                }\n            }\n            else if (cls > 3) {\n                w(cln), --cls;\n                for (; cls > 6; cls -= 6)\n                    w(8304);\n                if (cls > 2)\n                    w(((cls - 3) << 5) | 8208), cls = 0;\n            }\n            while (cls--)\n                w(cln);\n            cls = 1;\n            cln = c[i];\n        }\n    }\n    return [cl.subarray(0, cli), s];\n};\n// calculate the length of output from tree, code lengths\nvar clen = function (cf, cl) {\n    var l = 0;\n    for (var i = 0; i < cl.length; ++i)\n        l += cf[i] * cl[i];\n    return l;\n};\n// writes a fixed block\n// returns the new bit pos\nvar wfblk = function (out, pos, dat) {\n    // no need to write 00 as type: TypedArray defaults to 0\n    var s = dat.length;\n    var o = shft(pos + 2);\n    out[o] = s & 255;\n    out[o + 1] = s >>> 8;\n    out[o + 2] = out[o] ^ 255;\n    out[o + 3] = out[o + 1] ^ 255;\n    for (var i = 0; i < s; ++i)\n        out[o + i + 4] = dat[i];\n    return (o + 4 + s) * 8;\n};\n// writes a block\nvar wblk = function (dat, out, final, syms, lf, df, eb, li, bs, bl, p) {\n    wbits(out, p++, final);\n    ++lf[256];\n    var _a = hTree(lf, 15), dlt = _a[0], mlb = _a[1];\n    var _b = hTree(df, 15), ddt = _b[0], mdb = _b[1];\n    var _c = lc(dlt), lclt = _c[0], nlc = _c[1];\n    var _d = lc(ddt), lcdt = _d[0], ndc = _d[1];\n    var lcfreq = new u16(19);\n    for (var i = 0; i < lclt.length; ++i)\n        lcfreq[lclt[i] & 31]++;\n    for (var i = 0; i < lcdt.length; ++i)\n        lcfreq[lcdt[i] & 31]++;\n    var _e = hTree(lcfreq, 7), lct = _e[0], mlcb = _e[1];\n    var nlcc = 19;\n    for (; nlcc > 4 && !lct[clim[nlcc - 1]]; --nlcc)\n        ;\n    var flen = (bl + 5) << 3;\n    var ftlen = clen(lf, flt) + clen(df, fdt) + eb;\n    var dtlen = clen(lf, dlt) + clen(df, ddt) + eb + 14 + 3 * nlcc + clen(lcfreq, lct) + (2 * lcfreq[16] + 3 * lcfreq[17] + 7 * lcfreq[18]);\n    if (flen <= ftlen && flen <= dtlen)\n        return wfblk(out, p, dat.subarray(bs, bs + bl));\n    var lm, ll, dm, dl;\n    wbits(out, p, 1 + (dtlen < ftlen)), p += 2;\n    if (dtlen < ftlen) {\n        lm = hMap(dlt, mlb, 0), ll = dlt, dm = hMap(ddt, mdb, 0), dl = ddt;\n        var llm = hMap(lct, mlcb, 0);\n        wbits(out, p, nlc - 257);\n        wbits(out, p + 5, ndc - 1);\n        wbits(out, p + 10, nlcc - 4);\n        p += 14;\n        for (var i = 0; i < nlcc; ++i)\n            wbits(out, p + 3 * i, lct[clim[i]]);\n        p += 3 * nlcc;\n        var lcts = [lclt, lcdt];\n        for (var it = 0; it < 2; ++it) {\n            var clct = lcts[it];\n            for (var i = 0; i < clct.length; ++i) {\n                var len = clct[i] & 31;\n                wbits(out, p, llm[len]), p += lct[len];\n                if (len > 15)\n                    wbits(out, p, (clct[i] >>> 5) & 127), p += clct[i] >>> 12;\n            }\n        }\n    }\n    else {\n        lm = flm, ll = flt, dm = fdm, dl = fdt;\n    }\n    for (var i = 0; i < li; ++i) {\n        if (syms[i] > 255) {\n            var len = (syms[i] >>> 18) & 31;\n            wbits16(out, p, lm[len + 257]), p += ll[len + 257];\n            if (len > 7)\n                wbits(out, p, (syms[i] >>> 23) & 31), p += fleb[len];\n            var dst = syms[i] & 31;\n            wbits16(out, p, dm[dst]), p += dl[dst];\n            if (dst > 3)\n                wbits16(out, p, (syms[i] >>> 5) & 8191), p += fdeb[dst];\n        }\n        else {\n            wbits16(out, p, lm[syms[i]]), p += ll[syms[i]];\n        }\n    }\n    wbits16(out, p, lm[256]);\n    return p + ll[256];\n};\n// deflate options (nice << 13) | chain\nvar deo = /*#__PURE__*/ new u32([65540, 131080, 131088, 131104, 262176, 1048704, 1048832, 2114560, 2117632]);\n// empty\nvar et = /*#__PURE__*/ new u8(0);\n// compresses data into a raw DEFLATE buffer\nvar dflt = function (dat, lvl, plvl, pre, post, lst) {\n    var s = dat.length;\n    var o = new u8(pre + s + 5 * (1 + Math.floor(s / 7000)) + post);\n    // writing to this writes to the output buffer\n    var w = o.subarray(pre, o.length - post);\n    var pos = 0;\n    if (!lvl || s < 8) {\n        for (var i = 0; i <= s; i += 65535) {\n            // end\n            var e = i + 65535;\n            if (e < s) {\n                // write full block\n                pos = wfblk(w, pos, dat.subarray(i, e));\n            }\n            else {\n                // write final block\n                w[i] = lst;\n                pos = wfblk(w, pos, dat.subarray(i, s));\n            }\n        }\n    }\n    else {\n        var opt = deo[lvl - 1];\n        var n = opt >>> 13, c = opt & 8191;\n        var msk_1 = (1 << plvl) - 1;\n        //    prev 2-byte val map    curr 2-byte val map\n        var prev = new u16(32768), head = new u16(msk_1 + 1);\n        var bs1_1 = Math.ceil(plvl / 3), bs2_1 = 2 * bs1_1;\n        var hsh = function (i) { return (dat[i] ^ (dat[i + 1] << bs1_1) ^ (dat[i + 2] << bs2_1)) & msk_1; };\n        // 24576 is an arbitrary number of maximum symbols per block\n        // 424 buffer for last block\n        var syms = new u32(25000);\n        // length/literal freq   distance freq\n        var lf = new u16(288), df = new u16(32);\n        //  l/lcnt  exbits  index  l/lind  waitdx  bitpos\n        var lc_1 = 0, eb = 0, i = 0, li = 0, wi = 0, bs = 0;\n        for (; i < s; ++i) {\n            // hash value\n            var hv = hsh(i);\n            // index mod 32768\n            var imod = i & 32767;\n            // previous index with this value\n            var pimod = head[hv];\n            prev[imod] = pimod;\n            head[hv] = imod;\n            // We always should modify head and prev, but only add symbols if\n            // this data is not yet processed (\"wait\" for wait index)\n            if (wi <= i) {\n                // bytes remaining\n                var rem = s - i;\n                if ((lc_1 > 7000 || li > 24576) && rem > 423) {\n                    pos = wblk(dat, w, 0, syms, lf, df, eb, li, bs, i - bs, pos);\n                    li = lc_1 = eb = 0, bs = i;\n                    for (var j = 0; j < 286; ++j)\n                        lf[j] = 0;\n                    for (var j = 0; j < 30; ++j)\n                        df[j] = 0;\n                }\n                //  len    dist   chain\n                var l = 2, d = 0, ch_1 = c, dif = (imod - pimod) & 32767;\n                if (rem > 2 && hv == hsh(i - dif)) {\n                    var maxn = Math.min(n, rem) - 1;\n                    var maxd = Math.min(32767, i);\n                    // max possible length\n                    // not capped at dif because decompressors implement \"rolling\" index population\n                    var ml = Math.min(258, rem);\n                    while (dif <= maxd && --ch_1 && imod != pimod) {\n                        if (dat[i + l] == dat[i + l - dif]) {\n                            var nl = 0;\n                            for (; nl < ml && dat[i + nl] == dat[i + nl - dif]; ++nl)\n                                ;\n                            if (nl > l) {\n                                l = nl, d = dif;\n                                // break out early when we reach \"nice\" (we are satisfied enough)\n                                if (nl > maxn)\n                                    break;\n                                // now, find the rarest 2-byte sequence within this\n                                // length of literals and search for that instead.\n                                // Much faster than just using the start\n                                var mmd = Math.min(dif, nl - 2);\n                                var md = 0;\n                                for (var j = 0; j < mmd; ++j) {\n                                    var ti = (i - dif + j + 32768) & 32767;\n                                    var pti = prev[ti];\n                                    var cd = (ti - pti + 32768) & 32767;\n                                    if (cd > md)\n                                        md = cd, pimod = ti;\n                                }\n                            }\n                        }\n                        // check the previous match\n                        imod = pimod, pimod = prev[imod];\n                        dif += (imod - pimod + 32768) & 32767;\n                    }\n                }\n                // d will be nonzero only when a match was found\n                if (d) {\n                    // store both dist and len data in one Uint32\n                    // Make sure this is recognized as a len/dist with 28th bit (2^28)\n                    syms[li++] = 268435456 | (revfl[l] << 18) | revfd[d];\n                    var lin = revfl[l] & 31, din = revfd[d] & 31;\n                    eb += fleb[lin] + fdeb[din];\n                    ++lf[257 + lin];\n                    ++df[din];\n                    wi = i + l;\n                    ++lc_1;\n                }\n                else {\n                    syms[li++] = dat[i];\n                    ++lf[dat[i]];\n                }\n            }\n        }\n        pos = wblk(dat, w, lst, syms, lf, df, eb, li, bs, i - bs, pos);\n        // this is the easiest way to avoid needing to maintain state\n        if (!lst)\n            pos = wfblk(w, pos, et);\n    }\n    return slc(o, 0, pre + shft(pos) + post);\n};\n// CRC32 table\nvar crct = /*#__PURE__*/ (function () {\n    var t = new u32(256);\n    for (var i = 0; i < 256; ++i) {\n        var c = i, k = 9;\n        while (--k)\n            c = ((c & 1) && 0xEDB88320) ^ (c >>> 1);\n        t[i] = c;\n    }\n    return t;\n})();\n// CRC32\nvar crc = function () {\n    var c = 0xFFFFFFFF;\n    return {\n        p: function (d) {\n            // closures have awful performance\n            var cr = c;\n            for (var i = 0; i < d.length; ++i)\n                cr = crct[(cr & 255) ^ d[i]] ^ (cr >>> 8);\n            c = cr;\n        },\n        d: function () { return c ^ 0xFFFFFFFF; }\n    };\n};\n// Alder32\nvar adler = function () {\n    var a = 1, b = 0;\n    return {\n        p: function (d) {\n            // closures have awful performance\n            var n = a, m = b;\n            var l = d.length;\n            for (var i = 0; i != l;) {\n                var e = Math.min(i + 5552, l);\n                for (; i < e; ++i)\n                    n += d[i], m += n;\n                n %= 65521, m %= 65521;\n            }\n            a = n, b = m;\n        },\n        d: function () { return ((a >>> 8) << 16 | (b & 255) << 8 | (b >>> 8)) + ((a & 255) << 23) * 2; }\n    };\n};\n;\n// deflate with opts\nvar dopt = function (dat, opt, pre, post, st) {\n    return dflt(dat, opt.level == null ? 6 : opt.level, opt.mem == null ? Math.ceil(Math.max(8, Math.min(13, Math.log(dat.length))) * 1.5) : (12 + opt.mem), pre, post, !st);\n};\n// Walmart object spread\nvar mrg = function (a, b) {\n    var o = {};\n    for (var k in a)\n        o[k] = a[k];\n    for (var k in b)\n        o[k] = b[k];\n    return o;\n};\n// worker clone\n// This is possibly the craziest part of the entire codebase, despite how simple it may seem.\n// The only parameter to this function is a closure that returns an array of variables outside of the function scope.\n// We're going to try to figure out the variable names used in the closure as strings because that is crucial for workerization.\n// We will return an object mapping of true variable name to value (basically, the current scope as a JS object).\n// The reason we can't just use the original variable names is minifiers mangling the toplevel scope.\n// This took me three weeks to figure out how to do.\nvar wcln = function (fn, fnStr, td) {\n    var dt = fn();\n    var st = fn.toString();\n    var ks = st.slice(st.indexOf('[') + 1, st.lastIndexOf(']')).replace(/ /g, '').split(',');\n    for (var i = 0; i < dt.length; ++i) {\n        var v = dt[i], k = ks[i];\n        if (typeof v == 'function') {\n            fnStr += ';' + k + '=';\n            var st_1 = v.toString();\n            if (v.prototype) {\n                // for global objects\n                if (st_1.indexOf('[native code]') != -1) {\n                    var spInd = st_1.indexOf(' ', 8) + 1;\n                    fnStr += st_1.slice(spInd, st_1.indexOf('(', spInd));\n                }\n                else {\n                    fnStr += st_1;\n                    for (var t in v.prototype)\n                        fnStr += ';' + k + '.prototype.' + t + '=' + v.prototype[t].toString();\n                }\n            }\n            else\n                fnStr += st_1;\n        }\n        else\n            td[k] = v;\n    }\n    return [fnStr, td];\n};\nvar ch = [];\n// clone bufs\nvar cbfs = function (v) {\n    var tl = [];\n    for (var k in v) {\n        if (v[k] instanceof u8 || v[k] instanceof u16 || v[k] instanceof u32)\n            tl.push((v[k] = new v[k].constructor(v[k])).buffer);\n    }\n    return tl;\n};\n// use a worker to execute code\nvar wrkr = function (fns, init, id, cb) {\n    var _a;\n    if (!ch[id]) {\n        var fnStr = '', td_1 = {}, m = fns.length - 1;\n        for (var i = 0; i < m; ++i)\n            _a = wcln(fns[i], fnStr, td_1), fnStr = _a[0], td_1 = _a[1];\n        ch[id] = wcln(fns[m], fnStr, td_1);\n    }\n    var td = mrg({}, ch[id][1]);\n    return wk(ch[id][0] + ';onmessage=function(e){for(var k in e.data)self[k]=e.data[k];onmessage=' + init.toString() + '}', id, td, cbfs(td), cb);\n};\n// base async inflate fn\nvar bInflt = function () { return [u8, u16, u32, fleb, fdeb, clim, fl, fd, flrm, fdrm, rev, hMap, max, bits, bits16, shft, slc, inflt, inflateSync, pbf, gu8]; };\nvar bDflt = function () { return [u8, u16, u32, fleb, fdeb, clim, revfl, revfd, flm, flt, fdm, fdt, rev, deo, et, hMap, wbits, wbits16, hTree, ln, lc, clen, wfblk, wblk, shft, slc, dflt, dopt, deflateSync, pbf]; };\n// gzip extra\nvar gze = function () { return [gzh, gzhl, wbytes, crc, crct]; };\n// gunzip extra\nvar guze = function () { return [gzs, gzl]; };\n// zlib extra\nvar zle = function () { return [zlh, wbytes, adler]; };\n// unzlib extra\nvar zule = function () { return [zlv]; };\n// post buf\nvar pbf = function (msg) { return postMessage(msg, [msg.buffer]); };\n// get u8\nvar gu8 = function (o) { return o && o.size && new u8(o.size); };\n// async helper\nvar cbify = function (dat, opts, fns, init, id, cb) {\n    var w = wrkr(fns, init, id, function (err, dat) {\n        w.terminate();\n        cb(err, dat);\n    });\n    if (!opts.consume)\n        dat = new u8(dat);\n    w.postMessage([dat, opts], [dat.buffer]);\n    return function () { w.terminate(); };\n};\n// auto stream\nvar astrm = function (strm) {\n    strm.ondata = function (dat, final) { return postMessage([dat, final], [dat.buffer]); };\n    return function (ev) { return strm.push(ev.data[0], ev.data[1]); };\n};\n// async stream attach\nvar astrmify = function (fns, strm, opts, init, id) {\n    var t;\n    var w = wrkr(fns, init, id, function (err, dat) {\n        if (err)\n            w.terminate(), strm.ondata.call(strm, err);\n        else {\n            if (dat[1])\n                w.terminate();\n            strm.ondata.call(strm, err, dat[0], dat[1]);\n        }\n    });\n    w.postMessage(opts);\n    strm.push = function (d, f) {\n        if (t)\n            throw 'stream finished';\n        if (!strm.ondata)\n            throw 'no stream handler';\n        w.postMessage([d, t = f], [d.buffer]);\n    };\n    strm.terminate = function () { w.terminate(); };\n};\n// read 2 bytes\nvar b2 = function (d, b) { return d[b] | (d[b + 1] << 8); };\n// read 4 bytes\nvar b4 = function (d, b) { return (d[b] | (d[b + 1] << 8) | (d[b + 2] << 16)) + (d[b + 3] << 23) * 2; };\n// write bytes\nvar wbytes = function (d, b, v) {\n    for (; v; ++b)\n        d[b] = v, v >>>= 8;\n};\n// gzip header\nvar gzh = function (c, o) {\n    var fn = o.filename;\n    c[0] = 31, c[1] = 139, c[2] = 8, c[8] = o.level < 2 ? 4 : o.level == 9 ? 2 : 0, c[9] = 3; // assume Unix\n    if (o.mtime != 0)\n        wbytes(c, 4, Math.floor(new Date(o.mtime || Date.now()) / 1000));\n    if (fn) {\n        c[3] = 8;\n        for (var i = 0; i <= fn.length; ++i)\n            c[i + 10] = fn.charCodeAt(i);\n    }\n};\n// gzip footer: -8 to -4 = CRC, -4 to -0 is length\n// gzip start\nvar gzs = function (d) {\n    if (d[0] != 31 || d[1] != 139 || d[2] != 8)\n        throw 'invalid gzip data';\n    var flg = d[3];\n    var st = 10;\n    if (flg & 4)\n        st += d[10] | (d[11] << 8) + 2;\n    for (var zs = (flg >> 3 & 1) + (flg >> 4 & 1); zs > 0; zs -= !d[st++])\n        ;\n    return st + (flg & 2);\n};\n// gzip length\nvar gzl = function (d) {\n    var l = d.length;\n    return (d[l - 4] | d[l - 3] << 8 | d[l - 2] << 16) + (2 * (d[l - 1] << 23));\n};\n// gzip header length\nvar gzhl = function (o) { return 10 + ((o.filename && (o.filename.length + 1)) || 0); };\n// zlib header\nvar zlh = function (c, o) {\n    var lv = o.level, fl = lv == 0 ? 0 : lv < 6 ? 1 : lv == 9 ? 3 : 2;\n    c[0] = 120, c[1] = (fl << 6) | (fl ? (32 - 2 * fl) : 1);\n};\n// zlib valid\nvar zlv = function (d) {\n    if ((d[0] & 15) != 8 || (d[0] >>> 4) > 7 || ((d[0] << 8 | d[1]) % 31))\n        throw 'invalid zlib data';\n    if (d[1] & 32)\n        throw 'invalid zlib data: preset dictionaries not supported';\n};\nfunction AsyncCmpStrm(opts, cb) {\n    if (!cb && typeof opts == 'function')\n        cb = opts, opts = {};\n    this.ondata = cb;\n    return opts;\n}\n// zlib footer: -4 to -0 is Adler32\n/**\n * Streaming DEFLATE compression\n */\nvar Deflate = /*#__PURE__*/ (function () {\n    function Deflate(opts, cb) {\n        if (!cb && typeof opts == 'function')\n            cb = opts, opts = {};\n        this.ondata = cb;\n        this.o = opts || {};\n    }\n    Deflate.prototype.p = function (c, f) {\n        this.ondata(dopt(c, this.o, 0, 0, !f), f);\n    };\n    /**\n     * Pushes a chunk to be deflated\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Deflate.prototype.push = function (chunk, final) {\n        if (this.d)\n            throw 'stream finished';\n        if (!this.ondata)\n            throw 'no stream handler';\n        this.d = final;\n        this.p(chunk, final || false);\n    };\n    return Deflate;\n}());\nexport { Deflate };\n/**\n * Asynchronous streaming DEFLATE compression\n */\nvar AsyncDeflate = /*#__PURE__*/ (function () {\n    function AsyncDeflate(opts, cb) {\n        astrmify([\n            bDflt,\n            function () { return [astrm, Deflate]; }\n        ], this, AsyncCmpStrm.call(this, opts, cb), function (ev) {\n            var strm = new Deflate(ev.data);\n            onmessage = astrm(strm);\n        }, 6);\n    }\n    return AsyncDeflate;\n}());\nexport { AsyncDeflate };\nexport function deflate(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        throw 'no callback';\n    return cbify(data, opts, [\n        bDflt,\n    ], function (ev) { return pbf(deflateSync(ev.data[0], ev.data[1])); }, 0, cb);\n}\n/**\n * Compresses data with DEFLATE without any wrapper\n * @param data The data to compress\n * @param opts The compression options\n * @returns The deflated version of the data\n */\nexport function deflateSync(data, opts) {\n    if (opts === void 0) { opts = {}; }\n    return dopt(data, opts, 0, 0);\n}\n/**\n * Streaming DEFLATE decompression\n */\nvar Inflate = /*#__PURE__*/ (function () {\n    /**\n     * Creates an inflation stream\n     * @param cb The callback to call whenever data is inflated\n     */\n    function Inflate(cb) {\n        this.s = {};\n        this.p = new u8(0);\n        this.ondata = cb;\n    }\n    Inflate.prototype.e = function (c) {\n        if (this.d)\n            throw 'stream finished';\n        if (!this.ondata)\n            throw 'no stream handler';\n        var l = this.p.length;\n        var n = new u8(l + c.length);\n        n.set(this.p), n.set(c, l), this.p = n;\n    };\n    Inflate.prototype.c = function (final) {\n        this.d = this.s.i = final || false;\n        var bts = this.s.b;\n        var dt = inflt(this.p, this.o, this.s);\n        this.ondata(slc(dt, bts, this.s.b), this.d);\n        this.o = slc(dt, this.s.b - 32768), this.s.b = this.o.length;\n        this.p = slc(this.p, (this.s.p / 8) >> 0), this.s.p &= 7;\n    };\n    /**\n     * Pushes a chunk to be inflated\n     * @param chunk The chunk to push\n     * @param final Whether this is the final chunk\n     */\n    Inflate.prototype.push = function (chunk, final) {\n        this.e(chunk), this.c(final);\n    };\n    return Inflate;\n}());\nexport { Inflate };\n/**\n * Asynchronous streaming DEFLATE decompression\n */\nvar AsyncInflate = /*#__PURE__*/ (function () {\n    /**\n     * Creates an asynchronous inflation stream\n     * @param cb The callback to call whenever data is deflated\n     */\n    function AsyncInflate(cb) {\n        this.ondata = cb;\n        astrmify([\n            bInflt,\n            function () { return [astrm, Inflate]; }\n        ], this, 0, function () {\n            var strm = new Inflate();\n            onmessage = astrm(strm);\n        }, 7);\n    }\n    return AsyncInflate;\n}());\nexport { AsyncInflate };\nexport function inflate(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        throw 'no callback';\n    return cbify(data, opts, [\n        bInflt\n    ], function (ev) { return pbf(inflateSync(ev.data[0], gu8(ev.data[1]))); }, 1, cb);\n}\n/**\n * Expands DEFLATE data with no wrapper\n * @param data The data to decompress\n * @param out Where to write the data. Saves memory if you know the decompressed size and provide an output buffer of that length.\n * @returns The decompressed version of the data\n */\nexport function inflateSync(data, out) {\n    return inflt(data, out);\n}\n// before you yell at me for not just using extends, my reason is that TS inheritance is hard to workerize.\n/**\n * Streaming GZIP compression\n */\nvar Gzip = /*#__PURE__*/ (function () {\n    function Gzip(opts, cb) {\n        this.c = crc();\n        this.l = 0;\n        this.v = 1;\n        Deflate.call(this, opts, cb);\n    }\n    /**\n     * Pushes a chunk to be GZIPped\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Gzip.prototype.push = function (chunk, final) {\n        Deflate.prototype.push.call(this, chunk, final);\n    };\n    Gzip.prototype.p = function (c, f) {\n        this.c.p(c);\n        this.l += c.length;\n        var raw = dopt(c, this.o, this.v && gzhl(this.o), f && 8, !f);\n        if (this.v)\n            gzh(raw, this.o), this.v = 0;\n        if (f)\n            wbytes(raw, raw.length - 8, this.c.d()), wbytes(raw, raw.length - 4, this.l);\n        this.ondata(raw, f);\n    };\n    return Gzip;\n}());\nexport { Gzip };\n/**\n * Asynchronous streaming GZIP compression\n */\nvar AsyncGzip = /*#__PURE__*/ (function () {\n    function AsyncGzip(opts, cb) {\n        astrmify([\n            bDflt,\n            gze,\n            function () { return [astrm, Deflate, Gzip]; }\n        ], this, AsyncCmpStrm.call(this, opts, cb), function (ev) {\n            var strm = new Gzip(ev.data);\n            onmessage = astrm(strm);\n        }, 8);\n    }\n    return AsyncGzip;\n}());\nexport { AsyncGzip };\nexport function gzip(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        throw 'no callback';\n    return cbify(data, opts, [\n        bDflt,\n        gze,\n        function () { return [gzipSync]; }\n    ], function (ev) { return pbf(gzipSync(ev.data[0], ev.data[1])); }, 2, cb);\n}\n/**\n * Compresses data with GZIP\n * @param data The data to compress\n * @param opts The compression options\n * @returns The gzipped version of the data\n */\nexport function gzipSync(data, opts) {\n    if (opts === void 0) { opts = {}; }\n    var c = crc(), l = data.length;\n    c.p(data);\n    var d = dopt(data, opts, gzhl(opts), 8), s = d.length;\n    return gzh(d, opts), wbytes(d, s - 8, c.d()), wbytes(d, s - 4, l), d;\n}\n/**\n * Streaming GZIP decompression\n */\nvar Gunzip = /*#__PURE__*/ (function () {\n    /**\n     * Creates a GUNZIP stream\n     * @param cb The callback to call whenever data is inflated\n     */\n    function Gunzip(cb) {\n        this.v = 1;\n        Inflate.call(this, cb);\n    }\n    /**\n     * Pushes a chunk to be GUNZIPped\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Gunzip.prototype.push = function (chunk, final) {\n        Inflate.prototype.e.call(this, chunk);\n        if (this.v) {\n            var s = gzs(this.p);\n            if (s >= this.p.length && !final)\n                return;\n            this.p = this.p.subarray(s), this.v = 0;\n        }\n        if (final) {\n            if (this.p.length < 8)\n                throw 'invalid gzip stream';\n            this.p = this.p.subarray(0, -8);\n        }\n        // necessary to prevent TS from using the closure value\n        // This allows for workerization to function correctly\n        Inflate.prototype.c.call(this, final);\n    };\n    return Gunzip;\n}());\nexport { Gunzip };\n/**\n * Asynchronous streaming GZIP decompression\n */\nvar AsyncGunzip = /*#__PURE__*/ (function () {\n    /**\n     * Creates an asynchronous GUNZIP stream\n     * @param cb The callback to call whenever data is deflated\n     */\n    function AsyncGunzip(cb) {\n        this.ondata = cb;\n        astrmify([\n            bInflt,\n            guze,\n            function () { return [astrm, Inflate, Gunzip]; }\n        ], this, 0, function () {\n            var strm = new Gunzip();\n            onmessage = astrm(strm);\n        }, 9);\n    }\n    return AsyncGunzip;\n}());\nexport { AsyncGunzip };\nexport function gunzip(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        throw 'no callback';\n    return cbify(data, opts, [\n        bInflt,\n        guze,\n        function () { return [gunzipSync]; }\n    ], function (ev) { return pbf(gunzipSync(ev.data[0])); }, 3, cb);\n}\n/**\n * Expands GZIP data\n * @param data The data to decompress\n * @param out Where to write the data. GZIP already encodes the output size, so providing this doesn't save memory.\n * @returns The decompressed version of the data\n */\nexport function gunzipSync(data, out) {\n    return inflt(data.subarray(gzs(data), -8), out || new u8(gzl(data)));\n}\n/**\n * Streaming Zlib compression\n */\nvar Zlib = /*#__PURE__*/ (function () {\n    function Zlib(opts, cb) {\n        this.c = adler();\n        this.v = 1;\n        Deflate.call(this, opts, cb);\n    }\n    /**\n     * Pushes a chunk to be zlibbed\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Zlib.prototype.push = function (chunk, final) {\n        Deflate.prototype.push.call(this, chunk, final);\n    };\n    Zlib.prototype.p = function (c, f) {\n        this.c.p(c);\n        var raw = dopt(c, this.o, this.v && 2, f && 4, !f);\n        if (this.v)\n            zlh(raw, this.o), this.v = 0;\n        if (f)\n            wbytes(raw, raw.length - 4, this.c.d());\n        this.ondata(raw, f);\n    };\n    return Zlib;\n}());\nexport { Zlib };\n/**\n * Asynchronous streaming Zlib compression\n */\nvar AsyncZlib = /*#__PURE__*/ (function () {\n    function AsyncZlib(opts, cb) {\n        astrmify([\n            bDflt,\n            zle,\n            function () { return [astrm, Deflate, Zlib]; }\n        ], this, AsyncCmpStrm.call(this, opts, cb), function (ev) {\n            var strm = new Zlib(ev.data);\n            onmessage = astrm(strm);\n        }, 10);\n    }\n    return AsyncZlib;\n}());\nexport { AsyncZlib };\nexport function zlib(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        throw 'no callback';\n    return cbify(data, opts, [\n        bDflt,\n        zle,\n        function () { return [zlibSync]; }\n    ], function (ev) { return pbf(zlibSync(ev.data[0], ev.data[1])); }, 4, cb);\n}\n/**\n * Compress data with Zlib\n * @param data The data to compress\n * @param opts The compression options\n * @returns The zlib-compressed version of the data\n */\nexport function zlibSync(data, opts) {\n    if (opts === void 0) { opts = {}; }\n    var a = adler();\n    a.p(data);\n    var d = dopt(data, opts, 2, 4);\n    return zlh(d, opts), wbytes(d, d.length - 4, a.d()), d;\n}\n/**\n * Streaming Zlib decompression\n */\nvar Unzlib = /*#__PURE__*/ (function () {\n    /**\n     * Creates a Zlib decompression stream\n     * @param cb The callback to call whenever data is inflated\n     */\n    function Unzlib(cb) {\n        this.v = 1;\n        Inflate.call(this, cb);\n    }\n    /**\n     * Pushes a chunk to be unzlibbed\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Unzlib.prototype.push = function (chunk, final) {\n        Inflate.prototype.e.call(this, chunk);\n        if (this.v) {\n            if (this.p.length < 2 && !final)\n                return;\n            this.p = this.p.subarray(2), this.v = 0;\n        }\n        if (final) {\n            if (this.p.length < 4)\n                throw 'invalid zlib stream';\n            this.p = this.p.subarray(0, -4);\n        }\n        // necessary to prevent TS from using the closure value\n        // This allows for workerization to function correctly\n        Inflate.prototype.c.call(this, final);\n    };\n    return Unzlib;\n}());\nexport { Unzlib };\n/**\n * Asynchronous streaming Zlib decompression\n */\nvar AsyncUnzlib = /*#__PURE__*/ (function () {\n    /**\n     * Creates an asynchronous Zlib decompression stream\n     * @param cb The callback to call whenever data is deflated\n     */\n    function AsyncUnzlib(cb) {\n        this.ondata = cb;\n        astrmify([\n            bInflt,\n            zule,\n            function () { return [astrm, Inflate, Unzlib]; }\n        ], this, 0, function () {\n            var strm = new Unzlib();\n            onmessage = astrm(strm);\n        }, 11);\n    }\n    return AsyncUnzlib;\n}());\nexport { AsyncUnzlib };\nexport function unzlib(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        throw 'no callback';\n    return cbify(data, opts, [\n        bInflt,\n        zule,\n        function () { return [unzlibSync]; }\n    ], function (ev) { return pbf(unzlibSync(ev.data[0], gu8(ev.data[1]))); }, 5, cb);\n}\n/**\n * Expands Zlib data\n * @param data The data to decompress\n * @param out Where to write the data. Saves memory if you know the decompressed size and provide an output buffer of that length.\n * @returns The decompressed version of the data\n */\nexport function unzlibSync(data, out) {\n    return inflt((zlv(data), data.subarray(2, -4)), out);\n}\n// Default algorithm for compression (used because having a known output size allows faster decompression)\nexport { gzip as compress, AsyncGzip as AsyncCompress };\n// Default algorithm for compression (used because having a known output size allows faster decompression)\nexport { gzipSync as compressSync, Gzip as Compress };\n/**\n * Streaming GZIP, Zlib, or raw DEFLATE decompression\n */\nvar Decompress = /*#__PURE__*/ (function () {\n    /**\n     * Creates a decompression stream\n     * @param cb The callback to call whenever data is decompressed\n     */\n    function Decompress(cb) {\n        this.G = Gunzip;\n        this.I = Inflate;\n        this.Z = Unzlib;\n        this.ondata = cb;\n    }\n    /**\n     * Pushes a chunk to be decompressed\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Decompress.prototype.push = function (chunk, final) {\n        if (!this.ondata)\n            throw 'no stream handler';\n        if (!this.s) {\n            if (this.p && this.p.length) {\n                var n = new u8(this.p.length + chunk.length);\n                n.set(this.p), n.set(chunk, this.p.length);\n            }\n            else\n                this.p = chunk;\n            if (this.p.length > 2) {\n                var _this_1 = this;\n                var cb = function () { _this_1.ondata.apply(_this_1, arguments); };\n                this.s = (this.p[0] == 31 && this.p[1] == 139 && this.p[2] == 8)\n                    ? new this.G(cb)\n                    : ((this.p[0] & 15) != 8 || (this.p[0] >> 4) > 7 || ((this.p[0] << 8 | this.p[1]) % 31))\n                        ? new this.I(cb)\n                        : new this.Z(cb);\n                this.s.push(this.p, final);\n                this.p = null;\n            }\n        }\n        else\n            this.s.push(chunk, final);\n    };\n    return Decompress;\n}());\nexport { Decompress };\n/**\n * Asynchronous streaming GZIP, Zlib, or raw DEFLATE decompression\n */\nvar AsyncDecompress = /*#__PURE__*/ (function () {\n    /**\n   * Creates an asynchronous decompression stream\n   * @param cb The callback to call whenever data is decompressed\n   */\n    function AsyncDecompress(cb) {\n        this.G = AsyncGunzip;\n        this.I = AsyncInflate;\n        this.Z = AsyncUnzlib;\n        this.ondata = cb;\n    }\n    /**\n     * Pushes a chunk to be decompressed\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    AsyncDecompress.prototype.push = function (chunk, final) {\n        Decompress.prototype.push.call(this, chunk, final);\n    };\n    return AsyncDecompress;\n}());\nexport { AsyncDecompress };\nexport function decompress(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        throw 'no callback';\n    return (data[0] == 31 && data[1] == 139 && data[2] == 8)\n        ? gunzip(data, opts, cb)\n        : ((data[0] & 15) != 8 || (data[0] >> 4) > 7 || ((data[0] << 8 | data[1]) % 31))\n            ? inflate(data, opts, cb)\n            : unzlib(data, opts, cb);\n}\n/**\n * Expands compressed GZIP, Zlib, or raw DEFLATE data, automatically detecting the format\n * @param data The data to decompress\n * @param out Where to write the data. Saves memory if you know the decompressed size and provide an output buffer of that length.\n * @returns The decompressed version of the data\n */\nexport function decompressSync(data, out) {\n    return (data[0] == 31 && data[1] == 139 && data[2] == 8)\n        ? gunzipSync(data, out)\n        : ((data[0] & 15) != 8 || (data[0] >> 4) > 7 || ((data[0] << 8 | data[1]) % 31))\n            ? inflateSync(data, out)\n            : unzlibSync(data, out);\n}\n// flatten a directory structure\nvar fltn = function (d, p, t, o) {\n    for (var k in d) {\n        var val = d[k], n = p + k;\n        if (val instanceof u8)\n            t[n] = [val, o];\n        else if (Array.isArray(val))\n            t[n] = [val[0], mrg(o, val[1])];\n        else\n            fltn(val, n + '/', t, o);\n    }\n};\n/**\n * Converts a string into a Uint8Array for use with compression/decompression methods\n * @param str The string to encode\n * @param latin1 Whether or not to interpret the data as Latin-1. This should\n *               not need to be true unless decoding a binary string.\n * @returns The string encoded in UTF-8/Latin-1 binary\n */\nexport function strToU8(str, latin1) {\n    var l = str.length;\n    if (!latin1 && typeof TextEncoder != 'undefined')\n        return new TextEncoder().encode(str);\n    var ar = new u8(str.length + (str.length >>> 1));\n    var ai = 0;\n    var w = function (v) { ar[ai++] = v; };\n    for (var i = 0; i < l; ++i) {\n        if (ai + 5 > ar.length) {\n            var n = new u8(ai + 8 + ((l - i) << 1));\n            n.set(ar);\n            ar = n;\n        }\n        var c = str.charCodeAt(i);\n        if (c < 128 || latin1)\n            w(c);\n        else if (c < 2048)\n            w(192 | (c >>> 6)), w(128 | (c & 63));\n        else if (c > 55295 && c < 57344)\n            c = 65536 + (c & 1023 << 10) | (str.charCodeAt(++i) & 1023),\n                w(240 | (c >>> 18)), w(128 | ((c >>> 12) & 63)), w(128 | ((c >>> 6) & 63)), w(128 | (c & 63));\n        else\n            w(224 | (c >>> 12)), w(128 | ((c >>> 6) & 63)), w(128 | (c & 63));\n    }\n    return slc(ar, 0, ai);\n}\n/**\n * Converts a Uint8Array to a string\n * @param dat The data to decode to string\n * @param latin1 Whether or not to interpret the data as Latin-1. This should\n *               not need to be true unless encoding to binary string.\n * @returns The original UTF-8/Latin-1 string\n */\nexport function strFromU8(dat, latin1) {\n    var r = '';\n    if (!latin1 && typeof TextDecoder != 'undefined')\n        return new TextDecoder().decode(dat);\n    for (var i = 0; i < dat.length;) {\n        var c = dat[i++];\n        if (c < 128 || latin1)\n            r += String.fromCharCode(c);\n        else if (c < 224)\n            r += String.fromCharCode((c & 31) << 6 | (dat[i++] & 63));\n        else if (c < 240)\n            r += String.fromCharCode((c & 15) << 12 | (dat[i++] & 63) << 6 | (dat[i++] & 63));\n        else\n            c = ((c & 15) << 18 | (dat[i++] & 63) << 12 | (dat[i++] & 63) << 6 | (dat[i++] & 63)) - 65536,\n                r += String.fromCharCode(55296 | (c >> 10), 56320 | (c & 1023));\n    }\n    return r;\n}\n;\n// skip local zip header\nvar slzh = function (d, b) { return b + 30 + b2(d, b + 26) + b2(d, b + 28); };\n// read zip header\nvar zh = function (d, b, z) {\n    var fnl = b2(d, b + 28), fn = strFromU8(d.subarray(b + 46, b + 46 + fnl), !(b2(d, b + 8) & 2048)), es = b + 46 + fnl;\n    var _a = z ? z64e(d, es) : [b4(d, b + 20), b4(d, b + 24), b4(d, b + 42)], sc = _a[0], su = _a[1], off = _a[2];\n    return [b2(d, b + 10), sc, su, fn, es + b2(d, b + 30) + b2(d, b + 32), off];\n};\n// read zip64 extra field\nvar z64e = function (d, b) {\n    for (; b2(d, b) != 1; b += 4 + b2(d, b + 2))\n        ;\n    return [b4(d, b + 12), b4(d, b + 4), b4(d, b + 20)];\n};\n// write zip header\nvar wzh = function (d, b, c, cmp, su, fn, u, o, ce, t) {\n    var fl = fn.length, l = cmp.length;\n    wbytes(d, b, ce != null ? 0x2014B50 : 0x4034B50), b += 4;\n    if (ce != null)\n        d[b] = 20, b += 2;\n    d[b] = 20, b += 2; // spec compliance? what's that?\n    d[b++] = (t == 8 && (o.level == 1 ? 6 : o.level < 6 ? 4 : o.level == 9 ? 2 : 0)), d[b++] = u && 8;\n    d[b] = t, b += 2;\n    var dt = new Date(o.mtime || Date.now()), y = dt.getFullYear() - 1980;\n    if (y < 0 || y > 119)\n        throw 'date not in range 1980-2099';\n    wbytes(d, b, ((y << 24) * 2) | ((dt.getMonth() + 1) << 21) | (dt.getDate() << 16) | (dt.getHours() << 11) | (dt.getMinutes() << 5) | (dt.getSeconds() >>> 1));\n    b += 4;\n    wbytes(d, b, c);\n    wbytes(d, b + 4, l);\n    wbytes(d, b + 8, su);\n    wbytes(d, b + 12, fl), b += 16; // skip extra field, comment\n    if (ce != null)\n        wbytes(d, b += 10, ce), b += 4;\n    d.set(fn, b);\n    b += fl;\n    if (ce == null)\n        d.set(cmp, b);\n};\n// write zip footer (end of central directory)\nvar wzf = function (o, b, c, d, e) {\n    wbytes(o, b, 0x6054B50); // skip disk\n    wbytes(o, b + 8, c);\n    wbytes(o, b + 10, c);\n    wbytes(o, b + 12, d);\n    wbytes(o, b + 16, e);\n};\nexport function zip(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        throw 'no callback';\n    var r = {};\n    fltn(data, '', r, opts);\n    var k = Object.keys(r);\n    var lft = k.length, o = 0, tot = 0;\n    var slft = lft, files = new Array(lft);\n    var term = [];\n    var tAll = function () {\n        for (var i = 0; i < term.length; ++i)\n            term[i]();\n    };\n    var cbf = function () {\n        var out = new u8(tot + 22), oe = o, cdl = tot - o;\n        tot = 0;\n        for (var i = 0; i < slft; ++i) {\n            var f = files[i];\n            try {\n                wzh(out, tot, f.c, f.d, f.m, f.n, f.u, f.p, null, f.t);\n                wzh(out, o, f.c, f.d, f.m, f.n, f.u, f.p, tot, f.t), o += 46 + f.n.length, tot += 30 + f.n.length + f.d.length;\n            }\n            catch (e) {\n                return cb(e, null);\n            }\n        }\n        wzf(out, o, files.length, cdl, oe);\n        cb(null, out);\n    };\n    if (!lft)\n        cbf();\n    var _loop_1 = function (i) {\n        var fn = k[i];\n        var _a = r[fn], file = _a[0], p = _a[1];\n        var c = crc(), m = file.length;\n        c.p(file);\n        var n = strToU8(fn), s = n.length;\n        var t = p.level == 0 ? 0 : 8;\n        var cbl = function (e, d) {\n            if (e) {\n                tAll();\n                cb(e, null);\n            }\n            else {\n                var l = d.length;\n                files[i] = {\n                    t: t,\n                    d: d,\n                    m: m,\n                    c: c.d(),\n                    u: fn.length != l,\n                    n: n,\n                    p: p\n                };\n                o += 30 + s + l;\n                tot += 76 + 2 * s + l;\n                if (!--lft)\n                    cbf();\n            }\n        };\n        if (n.length > 65535)\n            cbl('filename too long', null);\n        if (!t)\n            cbl(null, file);\n        else if (m < 160000) {\n            try {\n                cbl(null, deflateSync(file, p));\n            }\n            catch (e) {\n                cbl(e, null);\n            }\n        }\n        else\n            term.push(deflate(file, p, cbl));\n    };\n    // Cannot use lft because it can decrease\n    for (var i = 0; i < slft; ++i) {\n        _loop_1(i);\n    }\n    return tAll;\n}\n/**\n * Synchronously creates a ZIP file. Prefer using `zip` for better performance\n * with more than one file.\n * @param data The directory structure for the ZIP archive\n * @param opts The main options, merged with per-file options\n * @returns The generated ZIP archive\n */\nexport function zipSync(data, opts) {\n    if (opts === void 0) { opts = {}; }\n    var r = {};\n    var files = [];\n    fltn(data, '', r, opts);\n    var o = 0;\n    var tot = 0;\n    for (var fn in r) {\n        var _a = r[fn], file = _a[0], p = _a[1];\n        var t = p.level == 0 ? 0 : 8;\n        var n = strToU8(fn), s = n.length;\n        if (n.length > 65535)\n            throw 'filename too long';\n        var d = t ? deflateSync(file, p) : file, l = d.length;\n        var c = crc();\n        c.p(file);\n        files.push({\n            t: t,\n            d: d,\n            m: file.length,\n            c: c.d(),\n            u: fn.length != s,\n            n: n,\n            o: o,\n            p: p\n        });\n        o += 30 + s + l;\n        tot += 76 + 2 * s + l;\n    }\n    var out = new u8(tot + 22), oe = o, cdl = tot - o;\n    for (var i = 0; i < files.length; ++i) {\n        var f = files[i];\n        wzh(out, f.o, f.c, f.d, f.m, f.n, f.u, f.p, null, f.t);\n        wzh(out, o, f.c, f.d, f.m, f.n, f.u, f.p, f.o, f.t), o += 46 + f.n.length;\n    }\n    wzf(out, o, files.length, cdl, oe);\n    return out;\n}\n/**\n * Asynchronously decompresses a ZIP archive\n * @param data The raw compressed ZIP file\n * @param cb The callback to call with the decompressed files\n * @returns A function that can be used to immediately terminate the unzipping\n */\nexport function unzip(data, cb) {\n    if (typeof cb != 'function')\n        throw 'no callback';\n    var term = [];\n    var tAll = function () {\n        for (var i = 0; i < term.length; ++i)\n            term[i]();\n    };\n    var files = {};\n    var e = data.length - 22;\n    for (; b4(data, e) != 0x6054B50; --e) {\n        if (!e || data.length - e > 65558) {\n            cb('invalid zip file', null);\n            return;\n        }\n    }\n    ;\n    var lft = b2(data, e + 8);\n    if (!lft)\n        cb(null, {});\n    var c = lft;\n    var o = b4(data, e + 16);\n    var z = o == 4294967295;\n    if (z) {\n        e = b4(data, e - 12);\n        if (b4(data, e) != 0x6064B50)\n            throw 'invalid zip file';\n        c = lft = b4(data, e + 32);\n        o = b4(data, e + 48);\n    }\n    var _loop_2 = function (i) {\n        var _a = zh(data, o, z), c_1 = _a[0], sc = _a[1], su = _a[2], fn = _a[3], no = _a[4], off = _a[5], b = slzh(data, off);\n        o = no;\n        var cbl = function (e, d) {\n            if (e) {\n                tAll();\n                cb(e, null);\n            }\n            else {\n                files[fn] = d;\n                if (!--lft)\n                    cb(null, files);\n            }\n        };\n        if (!c_1)\n            cbl(null, slc(data, b, b + sc));\n        else if (c_1 == 8) {\n            var infl = data.subarray(b, b + sc);\n            if (sc < 320000) {\n                try {\n                    cbl(null, inflateSync(infl, new u8(su)));\n                }\n                catch (e) {\n                    cbl(e, null);\n                }\n            }\n            else\n                term.push(inflate(infl, { size: su }, cbl));\n        }\n        else\n            cbl('unknown compression type ' + c_1, null);\n    };\n    for (var i = 0; i < c; ++i) {\n        _loop_2(i);\n    }\n    return tAll;\n}\n/**\n * Synchronously decompresses a ZIP archive. Prefer using `unzip` for better\n * performance with more than one file.\n * @param data The raw compressed ZIP file\n * @returns The decompressed files\n */\nexport function unzipSync(data) {\n    var files = {};\n    var e = data.length - 22;\n    for (; b4(data, e) != 0x6054B50; --e) {\n        if (!e || data.length - e > 65558)\n            throw 'invalid zip file';\n    }\n    ;\n    var c = b2(data, e + 8);\n    if (!c)\n        return {};\n    var o = b4(data, e + 16);\n    var z = o == 4294967295;\n    if (z) {\n        e = b4(data, e - 12);\n        if (b4(data, e) != 0x6064B50)\n            throw 'invalid zip file';\n        c = b4(data, e + 32);\n        o = b4(data, e + 48);\n    }\n    for (var i = 0; i < c; ++i) {\n        var _a = zh(data, o, z), c_2 = _a[0], sc = _a[1], su = _a[2], fn = _a[3], no = _a[4], off = _a[5], b = slzh(data, off);\n        o = no;\n        if (!c_2)\n            files[fn] = slc(data, b, b + sc);\n        else if (c_2 == 8)\n            files[fn] = inflateSync(data.subarray(b, b + sc), new u8(su));\n        else\n            throw 'unknown compression type ' + c_2;\n    }\n    return files;\n}\n"],"names":["u8","u16","u32","fleb","fdeb","clim","freb","eb","start","b","i","r","j","_a","fl","revfl","_b","fd","revfd","rev","x","hMap","cd","mb","s","l","le","co","rvb","sv","r_1","v","m","flt","fdt","flm","flrm","fdm","fdrm","max","a","bits","d","p","o","bits16","shft","slc","e","inflt","dat","buf","st","sl","noBuf","noSt","cbuf","bl","nbuf","final","pos","bt","lm","dm","lbt","dbt","tbts","type","hLit","hcLen","tl","ldt","clt","clb","clbmsk","clm","c","n","lt","dt","t","lms","dms","mxa","sym","add","dsym","end","wbits","wbits16","hTree","t2","i0","i1","i2","maxSym","tr","mbt","ln","lft","cst","i2_1","i2_2","i2_3","lc","cl","cli","cln","cls","w","clen","cf","wfblk","out","wblk","syms","lf","df","li","bs","dlt","mlb","ddt","mdb","_c","lclt","nlc","_d","lcdt","ndc","lcfreq","_e","lct","mlcb","nlcc","flen","ftlen","dtlen","ll","dl","llm","lcts","it","clct","len","dst","deo","dflt","lvl","plvl","pre","post","lst","opt","msk_1","prev","head","bs1_1","bs2_1","hsh","lc_1","wi","hv","imod","pimod","rem","ch_1","dif","maxn","maxd","ml","nl","mmd","md","ti","pti","lin","din","adler","dopt","wbytes","zlh","lv","zlv","zlibSync","data","opts","unzlibSync"],"mappings":"AAoBA,IAAIA,IAAK,YAAYC,IAAM,aAAaC,KAAM,aAE1CC,KAAO,IAAIH,EAAG;AAAA,EAAC;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA;AAAA,EAAgB;AAAA,EAAG;AAAA;AAAA,EAAoB;AAAC,CAAC,GAG5II,KAAO,IAAIJ,EAAG;AAAA,EAAC;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA;AAAA,EAAiB;AAAA,EAAG;AAAC,CAAC,GAEnIK,KAAO,IAAIL,EAAG,CAAC,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,EAAE,CAAC,GAEhFM,KAAO,SAAUC,GAAIC,GAAO;AAE5B,WADIC,IAAI,IAAIR,EAAI,EAAE,GACTS,IAAI,GAAGA,IAAI,IAAI,EAAEA;AACtB,IAAAD,EAAEC,CAAC,IAAIF,KAAS,KAAKD,EAAGG,IAAI,CAAC;AAIjC,WADIC,IAAI,IAAIT,GAAIO,EAAE,EAAE,CAAC,GACZC,IAAI,GAAGA,IAAI,IAAI,EAAEA;AACtB,aAASE,IAAIH,EAAEC,CAAC,GAAGE,IAAIH,EAAEC,IAAI,CAAC,GAAG,EAAEE;AAC/B,MAAAD,EAAEC,CAAC,IAAMA,IAAIH,EAAEC,CAAC,KAAM,IAAKA;AAGnC,SAAO,CAACD,GAAGE,CAAC;AAChB,GACIE,KAAKP,GAAKH,IAAM,CAAC,GAAGW,KAAKD,GAAG,CAAC,GAAGE,KAAQF,GAAG,CAAC;AAEhDC,GAAG,EAAE,IAAI,KAAKC,GAAM,GAAG,IAAI;AAC3B,IAAIC,KAAKV,GAAKF,IAAM,CAAC,GAAGa,KAAKD,GAAG,CAAC,GAAGE,KAAQF,GAAG,CAAC,GAE5CG,KAAM,IAAIlB,EAAI,KAAK;AACvB,SAASS,IAAI,GAAGA,IAAI,OAAO,EAAEA,GAAG;AAE5B,MAAIU,KAAMV,IAAI,WAAY,KAAOA,IAAI,UAAW;AAChD,EAAAU,KAAMA,IAAI,WAAY,KAAOA,IAAI,UAAW,GAC5CA,KAAMA,IAAI,WAAY,KAAOA,IAAI,SAAW,GAC5CD,GAAIT,CAAC,MAAOU,IAAI,WAAY,KAAOA,IAAI,QAAW,OAAQ;AAC9D;AAIA,IAAIC,KAAQ,SAAUC,GAAIC,GAAIZ,GAAG;AAO7B,WANIa,IAAIF,EAAG,QAEPZ,IAAI,GAEJe,IAAI,IAAIxB,EAAIsB,CAAE,GAEXb,IAAIc,GAAG,EAAEd;AACZ,MAAEe,EAAEH,EAAGZ,CAAC,IAAI,CAAC;AAEjB,MAAIgB,IAAK,IAAIzB,EAAIsB,CAAE;AACnB,OAAKb,IAAI,GAAGA,IAAIa,GAAI,EAAEb;AAClB,IAAAgB,EAAGhB,CAAC,IAAKgB,EAAGhB,IAAI,CAAC,IAAIe,EAAEf,IAAI,CAAC,KAAM;AAEtC,MAAIiB;AACJ,MAAIhB,GAAG;AAEH,IAAAgB,IAAK,IAAI1B,EAAI,KAAKsB,CAAE;AAEpB,QAAIK,IAAM,KAAKL;AACf,SAAKb,IAAI,GAAGA,IAAIc,GAAG,EAAEd;AAEjB,UAAIY,EAAGZ,CAAC;AAQJ,iBANImB,IAAMnB,KAAK,IAAKY,EAAGZ,CAAC,GAEpBoB,IAAMP,IAAKD,EAAGZ,CAAC,GAEfqB,IAAIL,EAAGJ,EAAGZ,CAAC,IAAI,CAAC,OAAOoB,GAElBE,IAAID,KAAM,KAAKD,KAAO,GAAIC,KAAKC,GAAG,EAAED;AAEzC,UAAAJ,EAAGR,GAAIY,CAAC,MAAMH,CAAG,IAAIC;AAAA,EAIrC;AAGI,SADAF,IAAK,IAAI1B,EAAIuB,CAAC,GACTd,IAAI,GAAGA,IAAIc,GAAG,EAAEd;AACjB,MAAAiB,EAAGjB,CAAC,IAAIS,GAAIO,EAAGJ,EAAGZ,CAAC,IAAI,CAAC,GAAG,MAAO,KAAKY,EAAGZ,CAAC;AAEnD,SAAOiB;AACX,IAEIM,IAAM,IAAIjC,EAAG,GAAG;AACpB,SAASU,IAAI,GAAGA,IAAI,KAAK,EAAEA;AACvB,EAAAuB,EAAIvB,CAAC,IAAI;AACb,SAASA,IAAI,KAAKA,IAAI,KAAK,EAAEA;AACzB,EAAAuB,EAAIvB,CAAC,IAAI;AACb,SAASA,IAAI,KAAKA,IAAI,KAAK,EAAEA;AACzB,EAAAuB,EAAIvB,CAAC,IAAI;AACb,SAASA,IAAI,KAAKA,IAAI,KAAK,EAAEA;AACzB,EAAAuB,EAAIvB,CAAC,IAAI;AAEb,IAAIwB,KAAM,IAAIlC,EAAG,EAAE;AACnB,SAASU,IAAI,GAAGA,IAAI,IAAI,EAAEA;AACtB,EAAAwB,GAAIxB,CAAC,IAAI;AAEb,IAAIyB,KAAoB,gBAAAd,EAAKY,GAAK,GAAG,CAAC,GAAGG,KAAqB,gBAAAf,EAAKY,GAAK,GAAG,CAAC,GAExEI,KAAoB,gBAAAhB,EAAKa,IAAK,GAAG,CAAC,GAAGI,KAAqB,gBAAAjB,EAAKa,IAAK,GAAG,CAAC,GAExEK,KAAM,SAAUC,GAAG;AAEnB,WADIR,IAAIQ,EAAE,CAAC,GACF9B,IAAI,GAAGA,IAAI8B,EAAE,QAAQ,EAAE9B;AAC5B,IAAI8B,EAAE9B,CAAC,IAAIsB,MACPA,IAAIQ,EAAE9B,CAAC;AAEf,SAAOsB;AACX,GAEIS,IAAO,SAAUC,GAAGC,GAAGX,GAAG;AAC1B,MAAIY,IAAKD,IAAI,KAAM;AACnB,UAASD,EAAEE,CAAC,IAAKF,EAAEE,IAAI,CAAC,KAAK,QAASD,IAAI,KAAMX;AACpD,GAEIa,KAAS,SAAUH,GAAGC,GAAG;AACzB,MAAIC,IAAKD,IAAI,KAAM;AACnB,UAASD,EAAEE,CAAC,IAAKF,EAAEE,IAAI,CAAC,KAAK,IAAMF,EAAEE,IAAI,CAAC,KAAK,SAAUD,IAAI;AACjE,GAEIG,KAAO,SAAUH,GAAG;AAAE,UAASA,IAAI,KAAM,MAAMA,IAAI,KAAK;AAAI,GAG5DI,KAAM,SAAUhB,GAAGP,GAAGwB,GAAG;AAGzB,GAAIA,KAAK,QAAQA,IAAIjB,EAAE,YACnBiB,IAAIjB,EAAE;AAEV,MAAI,IAAI,KAAKA,aAAa9B,IAAMA,IAAM8B,aAAa7B,KAAMA,KAAMF,GAAIgD,IAAIxB,CAAC;AACxE,WAAE,IAAIO,EAAE,SAASP,GAAGwB,CAAC,CAAC,GACf;AACX,GAEIC,KAAQ,SAAUC,GAAKC,GAAKC,GAAI;AAEhC,MAAIC,IAAKH,EAAI,QAETI,IAAQ,CAACH,KAAOC,GAEhBG,IAAO,CAACH,KAAMA,EAAG;AACrB,EAAKA,MACDA,IAAK,CAAA,IAEJD,MACDA,IAAM,IAAInD,EAAGqD,IAAK,CAAC;AAEvB,MAAIG,IAAO,SAAU/B,IAAG;AACpB,QAAIgC,IAAKN,EAAI;AAEb,QAAI1B,KAAIgC,GAAI;AAER,UAAIC,IAAO,IAAI1D,EAAG,KAAK,IAAIyD,IAAK,GAAGhC,EAAC,CAAC;AACrC,MAAAiC,EAAK,IAAIP,CAAG,GACZA,IAAMO;AAAA,IACV;AAAA,EACJ,GAEIC,IAAQP,EAAG,KAAK,GAAGQ,IAAMR,EAAG,KAAK,GAAGS,IAAKT,EAAG,KAAK,GAAGU,IAAKV,EAAG,GAAGW,IAAKX,EAAG,GAAGY,IAAMZ,EAAG,GAAGa,IAAMb,EAAG,GAE/Fc,IAAOb,IAAK;AAChB,KAAG;AACC,QAAI,CAACS,GAAI;AAEL,MAAAV,EAAG,IAAIO,IAAQlB,EAAKS,GAAKU,GAAK,CAAC;AAE/B,UAAIO,IAAO1B,EAAKS,GAAKU,IAAM,GAAG,CAAC;AAE/B,UADAA,KAAO,GACFO;AAiBA,YAAIA,KAAQ;AACb,UAAAL,IAAK1B,IAAM2B,IAAKzB,IAAM0B,IAAM,GAAGC,IAAM;AAAA,iBAChCE,KAAQ,GAAG;AAEhB,cAAIC,IAAO3B,EAAKS,GAAKU,GAAK,EAAE,IAAI,KAAKS,IAAQ5B,EAAKS,GAAKU,IAAM,IAAI,EAAE,IAAI,GACnEU,IAAKF,IAAO3B,EAAKS,GAAKU,IAAM,GAAG,EAAE,IAAI;AACzC,UAAAA,KAAO;AAKP,mBAHIW,IAAM,IAAIvE,EAAGsE,CAAE,GAEfE,IAAM,IAAIxE,EAAG,EAAE,GACVU,IAAI,GAAGA,IAAI2D,GAAO,EAAE3D;AAEzB,YAAA8D,EAAInE,GAAKK,CAAC,CAAC,IAAI+B,EAAKS,GAAKU,IAAMlD,IAAI,GAAG,CAAC;AAE3C,UAAAkD,KAAOS,IAAQ;AAEf,cAAII,IAAMlC,GAAIiC,CAAG,GAAGE,KAAU,KAAKD,KAAO;AAC1C,cAAI,CAAClB,KAAQK,IAAMU,KAAMG,IAAM,KAAKP;AAChC;AAGJ,mBADIS,IAAMtD,EAAKmD,GAAKC,GAAK,CAAC,GACjB/D,IAAI,GAAGA,IAAI4D,KAAK;AACrB,gBAAI3D,IAAIgE,EAAIlC,EAAKS,GAAKU,GAAKc,CAAM,CAAC;AAElC,YAAAd,KAAOjD,IAAI;AAEX,gBAAIa,IAAIb,MAAM;AAEd,gBAAIa,IAAI;AACJ,cAAA+C,EAAI7D,GAAG,IAAIc;AAAA,iBAEV;AAED,kBAAIoD,IAAI,GAAGC,IAAI;AAOf,mBANIrD,KAAK,MACLqD,IAAI,IAAIpC,EAAKS,GAAKU,GAAK,CAAC,GAAGA,KAAO,GAAGgB,IAAIL,EAAI7D,IAAI,CAAC,KAC7Cc,KAAK,MACVqD,IAAI,IAAIpC,EAAKS,GAAKU,GAAK,CAAC,GAAGA,KAAO,KAC7BpC,KAAK,OACVqD,IAAI,KAAKpC,EAAKS,GAAKU,GAAK,GAAG,GAAGA,KAAO,IAClCiB;AACH,gBAAAN,EAAI7D,GAAG,IAAIkE;AAAA,YACnB;AAAA,UACJ;AAEA,cAAIE,IAAKP,EAAI,SAAS,GAAGH,CAAI,GAAGW,IAAKR,EAAI,SAASH,CAAI;AAEtD,UAAAJ,IAAMzB,GAAIuC,CAAE,GAEZb,IAAM1B,GAAIwC,CAAE,GACZjB,IAAKzC,EAAKyD,GAAId,GAAK,CAAC,GACpBD,IAAK1C,EAAK0D,GAAId,GAAK,CAAC;AAAA,QACxB;AAEI,gBAAM;AAAA,WAxEC;AAEP,YAAIzC,IAAIsB,GAAKc,CAAG,IAAI,GAAGnC,IAAIyB,EAAI1B,IAAI,CAAC,IAAK0B,EAAI1B,IAAI,CAAC,KAAK,GAAIwD,IAAIxD,IAAIC;AACnE,YAAIuD,IAAI3B,GAAI;AACR,cAAIE;AACA,kBAAM;AACV;AAAA,QACJ;AAEA,QAAID,KACAE,EAAKK,IAAKpC,CAAC,GAEf0B,EAAI,IAAID,EAAI,SAAS1B,GAAGwD,CAAC,GAAGnB,CAAE,GAE9BT,EAAG,IAAIS,KAAMpC,GAAG2B,EAAG,IAAIQ,IAAMoB,IAAI;AACjC;AAAA,MACJ;AAyDA,UAAIpB,IAAMM;AACN,cAAM;AAAA,IACd;AAGA,IAAIZ,KACAE,EAAKK,IAAK,MAAM;AAGpB,aAFIoB,KAAO,KAAKjB,KAAO,GAAGkB,KAAO,KAAKjB,KAAO,GACzCkB,IAAMnB,IAAMC,IAAM,IACfV,KAAQK,IAAMuB,IAAMjB,KAAM;AAE7B,UAAIU,IAAId,EAAGjB,GAAOK,GAAKU,CAAG,IAAIqB,CAAG,GAAGG,IAAMR,MAAM;AAEhD,UADAhB,KAAOgB,IAAI,IACPhB,IAAMM;AACN,cAAM;AACV,UAAI,CAACU;AACD,cAAM;AACV,UAAIQ,IAAM;AACN,QAAAjC,EAAIU,GAAI,IAAIuB;AAAA,eACPA,KAAO,KAAK;AACjB,QAAAtB,IAAK;AACL;AAAA,MACJ,OACK;AACD,YAAIuB,IAAMD,IAAM;AAEhB,YAAIA,IAAM,KAAK;AAEX,cAAI1E,IAAI0E,IAAM,KAAK3E,IAAIN,GAAKO,CAAC;AAC7B,UAAA2E,IAAM5C,EAAKS,GAAKU,IAAM,KAAKnD,KAAK,CAAC,IAAIK,GAAGJ,CAAC,GACzCkD,KAAOnD;AAAA,QACX;AAEA,YAAIiC,IAAIqB,EAAGlB,GAAOK,GAAKU,CAAG,IAAIsB,CAAG,GAAGI,IAAO5C,MAAM;AACjD,YAAI,CAACA;AACD,gBAAM;AACV,QAAAkB,KAAOlB,IAAI;AACX,YAAIqC,IAAK9D,GAAGqE,CAAI;AAChB,YAAIA,IAAO,GAAG;AACV,cAAI7E,IAAIL,GAAKkF,CAAI;AACjB,UAAAP,KAAMlC,GAAOK,GAAKU,CAAG,KAAM,KAAKnD,KAAK,GAAImD,KAAOnD;AAAA,QACpD;AACA,YAAImD,IAAMM;AACN,gBAAM;AACV,QAAIZ,KACAE,EAAKK,IAAK,MAAM;AAEpB,iBADI0B,IAAM1B,IAAKwB,GACRxB,IAAK0B,GAAK1B,KAAM;AACnB,UAAAV,EAAIU,CAAE,IAAIV,EAAIU,IAAKkB,CAAE,GACrB5B,EAAIU,IAAK,CAAC,IAAIV,EAAIU,IAAK,IAAIkB,CAAE,GAC7B5B,EAAIU,IAAK,CAAC,IAAIV,EAAIU,IAAK,IAAIkB,CAAE,GAC7B5B,EAAIU,IAAK,CAAC,IAAIV,EAAIU,IAAK,IAAIkB,CAAE;AAEjC,QAAAlB,IAAK0B;AAAA,MACT;AAAA,IACJ;AACA,IAAAnC,EAAG,IAAIU,GAAIV,EAAG,IAAIQ,GAAKR,EAAG,IAAIS,GAC1BC,MACAH,IAAQ,GAAGP,EAAG,IAAIY,GAAKZ,EAAG,IAAIW,GAAIX,EAAG,IAAIa;AAAA,EACjD,SAAS,CAACN;AACV,SAAOE,KAAMV,EAAI,SAASA,IAAMJ,GAAII,GAAK,GAAGU,CAAE;AAClD,GAEI2B,IAAQ,SAAU9C,GAAGC,GAAG,GAAG;AAC3B,QAAMA,IAAI;AACV,MAAIC,IAAKD,IAAI,KAAM;AACnB,EAAAD,EAAEE,CAAC,KAAK,GACRF,EAAEE,IAAI,CAAC,KAAK,MAAM;AACtB,GAEI6C,IAAU,SAAU/C,GAAGC,GAAG,GAAG;AAC7B,QAAMA,IAAI;AACV,MAAIC,IAAKD,IAAI,KAAM;AACnB,EAAAD,EAAEE,CAAC,KAAK,GACRF,EAAEE,IAAI,CAAC,KAAK,MAAM,GAClBF,EAAEE,IAAI,CAAC,KAAK,MAAM;AACtB,GAEI8C,KAAQ,SAAUhD,GAAGnB,GAAI;AAGzB,WADIyD,IAAI,CAAA,GACCtE,IAAI,GAAGA,IAAIgC,EAAE,QAAQ,EAAEhC;AAC5B,IAAIgC,EAAEhC,CAAC,KACHsE,EAAE,KAAK,EAAE,GAAGtE,GAAG,GAAGgC,EAAEhC,CAAC,GAAG;AAEhC,MAAIc,IAAIwD,EAAE,QACNW,IAAKX,EAAE,MAAK;AAChB,MAAI,CAACxD;AACD,WAAO,CAAC,IAAIxB,EAAG,CAAC,GAAG,CAAC;AACxB,MAAIwB,KAAK,GAAG;AACR,QAAIO,IAAI,IAAI/B,EAAGgF,EAAE,CAAC,EAAE,IAAI,CAAC;AACzB,WAAAjD,EAAEiD,EAAE,CAAC,EAAE,CAAC,IAAI,GACL,CAACjD,GAAG,CAAC;AAAA,EAChB;AACA,EAAAiD,EAAE,KAAK,SAAUxC,GAAG/B,GAAG;AAAE,WAAO+B,EAAE,IAAI/B,EAAE;AAAA,EAAG,CAAC,GAG5CuE,EAAE,KAAK,EAAE,GAAG,IAAI,GAAG,OAAO;AAC1B,MAAIvD,IAAIuD,EAAE,CAAC,GAAGrE,IAAIqE,EAAE,CAAC,GAAGY,IAAK,GAAGC,IAAK,GAAGC,IAAK;AAO7C,OANAd,EAAE,CAAC,IAAI,EAAE,GAAG,IAAI,GAAGvD,EAAE,IAAId,EAAE,GAAG,GAAGc,GAAG,GAAGd,EAAC,GAMjCkF,KAAMrE,IAAI;AACb,IAAAC,IAAIuD,EAAEA,EAAEY,CAAE,EAAE,IAAIZ,EAAEc,CAAE,EAAE,IAAIF,MAAOE,GAAI,GACrCnF,IAAIqE,EAAEY,KAAMC,KAAMb,EAAEY,CAAE,EAAE,IAAIZ,EAAEc,CAAE,EAAE,IAAIF,MAAOE,GAAI,GACjDd,EAAEa,GAAI,IAAI,EAAE,GAAG,IAAI,GAAGpE,EAAE,IAAId,EAAE,GAAG,GAAGc,GAAG,GAAGd,EAAC;AAG/C,WADIoF,IAASJ,EAAG,CAAC,EAAE,GACVjF,IAAI,GAAGA,IAAIc,GAAG,EAAEd;AACrB,IAAIiF,EAAGjF,CAAC,EAAE,IAAIqF,MACVA,IAASJ,EAAGjF,CAAC,EAAE;AAGvB,MAAIsF,IAAK,IAAI/F,EAAI8F,IAAS,CAAC,GAEvBE,IAAMC,GAAGlB,EAAEa,IAAK,CAAC,GAAGG,GAAI,CAAC;AAC7B,MAAIC,IAAM1E,GAAI;AAIV,QAAIb,IAAI,GAAGqE,IAAK,GAEZoB,IAAMF,IAAM1E,GAAI6E,IAAM,KAAKD;AAE/B,SADAR,EAAG,KAAK,SAAUnD,GAAG/B,GAAG;AAAE,aAAOuF,EAAGvF,EAAE,CAAC,IAAIuF,EAAGxD,EAAE,CAAC,KAAKA,EAAE,IAAI/B,EAAE;AAAA,IAAG,CAAC,GAC3DC,IAAIc,GAAG,EAAEd,GAAG;AACf,UAAI2F,IAAOV,EAAGjF,CAAC,EAAE;AACjB,UAAIsF,EAAGK,CAAI,IAAI9E;AACX,QAAAwD,KAAMqB,KAAO,KAAMH,IAAMD,EAAGK,CAAI,IAChCL,EAAGK,CAAI,IAAI9E;AAAA;AAGX;AAAA,IACR;AAEA,SADAwD,OAAQoB,GACDpB,IAAK,KAAG;AACX,UAAIuB,IAAOX,EAAGjF,CAAC,EAAE;AACjB,MAAIsF,EAAGM,CAAI,IAAI/E,IACXwD,KAAM,KAAMxD,IAAKyE,EAAGM,CAAI,MAAM,IAE9B,EAAE5F;AAAA,IACV;AACA,WAAOA,KAAK,KAAKqE,GAAI,EAAErE,GAAG;AACtB,UAAI6F,IAAOZ,EAAGjF,CAAC,EAAE;AACjB,MAAIsF,EAAGO,CAAI,KAAKhF,MACZ,EAAEyE,EAAGO,CAAI,GACT,EAAExB;AAAA,IAEV;AACA,IAAAkB,IAAM1E;AAAA,EACV;AACA,SAAO,CAAC,IAAIvB,EAAGgG,CAAE,GAAGC,CAAG;AAC3B,GAEIC,KAAK,SAAUrB,GAAGpD,GAAGiB,GAAG;AACxB,SAAOmC,EAAE,KAAK,KACR,KAAK,IAAIqB,GAAGrB,EAAE,GAAGpD,GAAGiB,IAAI,CAAC,GAAGwD,GAAGrB,EAAE,GAAGpD,GAAGiB,IAAI,CAAC,CAAC,IAC5CjB,EAAEoD,EAAE,CAAC,IAAInC;AACpB,GAEI8D,KAAK,SAAU5B,GAAG;AAGlB,WAFIpD,IAAIoD,EAAE,QAEHpD,KAAK,CAACoD,EAAE,EAAEpD,CAAC;AACd;AAKJ,WAJIiF,IAAK,IAAIxG,EAAI,EAAEuB,CAAC,GAEhBkF,IAAM,GAAGC,IAAM/B,EAAE,CAAC,GAAGgC,IAAM,GAC3BC,IAAI,SAAU9E,GAAG;AAAE,IAAA0E,EAAGC,GAAK,IAAI3E;AAAA,EAAG,GAC7BrB,IAAI,GAAGA,KAAKc,GAAG,EAAEd;AACtB,QAAIkE,EAAElE,CAAC,KAAKiG,KAAOjG,KAAKc;AACpB,QAAEoF;AAAA,SACD;AACD,UAAI,CAACD,KAAOC,IAAM,GAAG;AACjB,eAAOA,IAAM,KAAKA,KAAO;AACrB,UAAAC,EAAE,KAAK;AACX,QAAID,IAAM,MACNC,EAAED,IAAM,KAAOA,IAAM,MAAO,IAAK,QAAUA,IAAM,KAAM,IAAK,KAAK,GACjEA,IAAM;AAAA,MAEd,WACSA,IAAM,GAAG;AAEd,aADAC,EAAEF,CAAG,GAAG,EAAEC,GACHA,IAAM,GAAGA,KAAO;AACnB,UAAAC,EAAE,IAAI;AACV,QAAID,IAAM,MACNC,EAAID,IAAM,KAAM,IAAK,IAAI,GAAGA,IAAM;AAAA,MAC1C;AACA,aAAOA;AACH,QAAAC,EAAEF,CAAG;AACT,MAAAC,IAAM,GACND,IAAM/B,EAAElE,CAAC;AAAA,IACb;AAEJ,SAAO,CAAC+F,EAAG,SAAS,GAAGC,CAAG,GAAGlF,CAAC;AAClC,GAEIsF,IAAO,SAAUC,GAAIN,GAAI;AAEzB,WADIhF,IAAI,GACCf,IAAI,GAAGA,IAAI+F,EAAG,QAAQ,EAAE/F;AAC7B,IAAAe,KAAKsF,EAAGrG,CAAC,IAAI+F,EAAG/F,CAAC;AACrB,SAAOe;AACX,GAGIuF,KAAQ,SAAUC,GAAKrD,GAAKV,GAAK;AAEjC,MAAI1B,IAAI0B,EAAI,QACRN,IAAIE,GAAKc,IAAM,CAAC;AACpB,EAAAqD,EAAIrE,CAAC,IAAIpB,IAAI,KACbyF,EAAIrE,IAAI,CAAC,IAAIpB,MAAM,GACnByF,EAAIrE,IAAI,CAAC,IAAIqE,EAAIrE,CAAC,IAAI,KACtBqE,EAAIrE,IAAI,CAAC,IAAIqE,EAAIrE,IAAI,CAAC,IAAI;AAC1B,WAAS,IAAI,GAAG,IAAIpB,GAAG,EAAE;AACrB,IAAAyF,EAAIrE,IAAI,IAAI,CAAC,IAAIM,EAAI,CAAC;AAC1B,UAAQN,IAAI,IAAIpB,KAAK;AACzB,GAEI0F,KAAO,SAAUhE,GAAK+D,GAAKtD,GAAOwD,GAAMC,GAAIC,GAAI9G,GAAI+G,GAAIC,GAAI9D,GAAId,GAAG;AACnE,EAAA6C,EAAMyB,GAAKtE,KAAKgB,CAAK,GACrB,EAAEyD,EAAG,GAAG;AAMR,WALIvG,IAAK6E,GAAM0B,GAAI,EAAE,GAAGI,IAAM3G,EAAG,CAAC,GAAG4G,IAAM5G,EAAG,CAAC,GAC3CG,IAAK0E,GAAM2B,GAAI,EAAE,GAAGK,IAAM1G,EAAG,CAAC,GAAG2G,IAAM3G,EAAG,CAAC,GAC3C4G,IAAKpB,GAAGgB,CAAG,GAAGK,IAAOD,EAAG,CAAC,GAAGE,IAAMF,EAAG,CAAC,GACtCG,IAAKvB,GAAGkB,CAAG,GAAGM,IAAOD,EAAG,CAAC,GAAGE,IAAMF,EAAG,CAAC,GACtCG,IAAS,IAAIjI,EAAI,EAAE,GACdS,IAAI,GAAGA,IAAImH,EAAK,QAAQ,EAAEnH;AAC/B,IAAAwH,EAAOL,EAAKnH,CAAC,IAAI,EAAE;AACvB,WAASA,IAAI,GAAGA,IAAIsH,EAAK,QAAQ,EAAEtH;AAC/B,IAAAwH,EAAOF,EAAKtH,CAAC,IAAI,EAAE;AAGvB,WAFIyH,IAAKzC,GAAMwC,GAAQ,CAAC,GAAGE,IAAMD,EAAG,CAAC,GAAGE,IAAOF,EAAG,CAAC,GAC/CG,IAAO,IACJA,IAAO,KAAK,CAACF,EAAI/H,GAAKiI,IAAO,CAAC,CAAC,GAAG,EAAEA;AACvC;AACJ,MAAIC,IAAQ9E,IAAK,KAAM,GACnB+E,IAAQ1B,EAAKM,GAAInF,CAAG,IAAI6E,EAAKO,GAAInF,EAAG,IAAI3B,GACxCkI,IAAQ3B,EAAKM,GAAII,CAAG,IAAIV,EAAKO,GAAIK,CAAG,IAAInH,IAAK,KAAK,IAAI+H,IAAOxB,EAAKoB,GAAQE,CAAG,KAAK,IAAIF,EAAO,EAAE,IAAI,IAAIA,EAAO,EAAE,IAAI,IAAIA,EAAO,EAAE;AACrI,MAAIK,KAAQC,KAASD,KAAQE;AACzB,WAAOzB,GAAMC,GAAKtE,GAAGO,EAAI,SAASqE,GAAIA,IAAK9D,CAAE,CAAC;AAClD,MAAIK,GAAI4E,GAAI3E,GAAI4E;AAEhB,MADAnD,EAAMyB,GAAKtE,GAAG,KAAK8F,IAAQD,EAAM,GAAG7F,KAAK,GACrC8F,IAAQD,GAAO;AACf,IAAA1E,IAAKzC,EAAKmG,GAAKC,GAAK,CAAC,GAAGiB,IAAKlB,GAAKzD,IAAK1C,EAAKqG,GAAKC,GAAK,CAAC,GAAGgB,IAAKjB;AAC/D,QAAIkB,IAAMvH,EAAK+G,GAAKC,GAAM,CAAC;AAC3B,IAAA7C,EAAMyB,GAAKtE,GAAGmF,IAAM,GAAG,GACvBtC,EAAMyB,GAAKtE,IAAI,GAAGsF,IAAM,CAAC,GACzBzC,EAAMyB,GAAKtE,IAAI,IAAI2F,IAAO,CAAC,GAC3B3F,KAAK;AACL,aAASjC,IAAI,GAAGA,IAAI4H,GAAM,EAAE5H;AACxB,MAAA8E,EAAMyB,GAAKtE,IAAI,IAAIjC,GAAG0H,EAAI/H,GAAKK,CAAC,CAAC,CAAC;AACtC,IAAAiC,KAAK,IAAI2F;AAET,aADIO,IAAO,CAAChB,GAAMG,CAAI,GACbc,IAAK,GAAGA,IAAK,GAAG,EAAEA;AAEvB,eADIC,IAAOF,EAAKC,CAAE,GACTpI,IAAI,GAAGA,IAAIqI,EAAK,QAAQ,EAAErI,GAAG;AAClC,YAAIsI,IAAMD,EAAKrI,CAAC,IAAI;AACpB,QAAA8E,EAAMyB,GAAKtE,GAAGiG,EAAII,CAAG,CAAC,GAAGrG,KAAKyF,EAAIY,CAAG,GACjCA,IAAM,OACNxD,EAAMyB,GAAKtE,GAAIoG,EAAKrI,CAAC,MAAM,IAAK,GAAG,GAAGiC,KAAKoG,EAAKrI,CAAC,MAAM;AAAA,MAC/D;AAAA,EAER;AAEI,IAAAoD,IAAK3B,IAAKuG,IAAKzG,GAAK8B,IAAK1B,IAAKsG,IAAKzG;AAEvC,WAASxB,IAAI,GAAGA,IAAI4G,GAAI,EAAE5G;AACtB,QAAIyG,EAAKzG,CAAC,IAAI,KAAK;AACf,UAAIsI,IAAO7B,EAAKzG,CAAC,MAAM,KAAM;AAC7B,MAAA+E,EAAQwB,GAAKtE,GAAGmB,EAAGkF,IAAM,GAAG,CAAC,GAAGrG,KAAK+F,EAAGM,IAAM,GAAG,GAC7CA,IAAM,MACNxD,EAAMyB,GAAKtE,GAAIwE,EAAKzG,CAAC,MAAM,KAAM,EAAE,GAAGiC,KAAKxC,GAAK6I,CAAG;AACvD,UAAIC,IAAM9B,EAAKzG,CAAC,IAAI;AACpB,MAAA+E,EAAQwB,GAAKtE,GAAGoB,EAAGkF,CAAG,CAAC,GAAGtG,KAAKgG,EAAGM,CAAG,GACjCA,IAAM,MACNxD,EAAQwB,GAAKtE,GAAIwE,EAAKzG,CAAC,MAAM,IAAK,IAAI,GAAGiC,KAAKvC,GAAK6I,CAAG;AAAA,IAC9D;AAEI,MAAAxD,EAAQwB,GAAKtE,GAAGmB,EAAGqD,EAAKzG,CAAC,CAAC,CAAC,GAAGiC,KAAK+F,EAAGvB,EAAKzG,CAAC,CAAC;AAGrD,SAAA+E,EAAQwB,GAAKtE,GAAGmB,EAAG,GAAG,CAAC,GAChBnB,IAAI+F,EAAG,GAAG;AACrB,GAEIQ,KAAoB,oBAAIhJ,GAAI,CAAC,OAAO,QAAQ,QAAQ,QAAQ,QAAQ,SAAS,SAAS,SAAS,OAAO,CAAC,GAIvGiJ,KAAO,SAAUjG,GAAKkG,GAAKC,GAAMC,GAAKC,GAAMC,GAAK;AACjD,MAAIhI,IAAI0B,EAAI,QACRN,IAAI,IAAI5C,EAAGsJ,IAAM9H,IAAI,KAAK,IAAI,KAAK,MAAMA,IAAI,GAAI,KAAK+H,CAAI,GAE1D1C,IAAIjE,EAAE,SAAS0G,GAAK1G,EAAE,SAAS2G,CAAI,GACnC3F,IAAM;AACV,MAAI,CAACwF,KAAO5H,IAAI;AACZ,aAASd,IAAI,GAAGA,KAAKc,GAAGd,KAAK,OAAO;AAEhC,UAAIsC,IAAItC,IAAI;AACZ,MAAIsC,IAAIxB,IAEJoC,IAAMoD,GAAMH,GAAGjD,GAAKV,EAAI,SAASxC,GAAGsC,CAAC,CAAC,KAItC6D,EAAEnG,CAAC,IAAI8I,GACP5F,IAAMoD,GAAMH,GAAGjD,GAAKV,EAAI,SAASxC,GAAGc,CAAC,CAAC;AAAA,IAE9C;AAAA,OAEC;AAeD,aAdIiI,IAAMP,GAAIE,IAAM,CAAC,GACjBvE,IAAI4E,MAAQ,IAAI7E,IAAI6E,IAAM,MAC1BC,KAAS,KAAKL,KAAQ,GAEtBM,IAAO,IAAI1J,EAAI,KAAK,GAAG2J,IAAO,IAAI3J,EAAIyJ,IAAQ,CAAC,GAC/CG,IAAQ,KAAK,KAAKR,IAAO,CAAC,GAAGS,IAAQ,IAAID,GACzCE,IAAM,SAAUrJ,IAAG;AAAE,cAAQwC,EAAIxC,EAAC,IAAKwC,EAAIxC,KAAI,CAAC,KAAKmJ,IAAU3G,EAAIxC,KAAI,CAAC,KAAKoJ,KAAUJ;AAAA,IAAO,GAG9FvC,IAAO,IAAIjH,GAAI,IAAK,GAEpBkH,IAAK,IAAInH,EAAI,GAAG,GAAGoH,IAAK,IAAIpH,EAAI,EAAE,GAElC+J,IAAO,GAAGzJ,IAAK,GAAGG,IAAI,GAAG4G,IAAK,GAAG2C,IAAK,GAAG1C,IAAK,GAC3C7G,IAAIc,GAAG,EAAEd,GAAG;AAEf,UAAIwJ,IAAKH,EAAIrJ,CAAC,GAEVyJ,IAAOzJ,IAAI,OAEX0J,IAAQR,EAAKM,CAAE;AAKnB,UAJAP,EAAKQ,CAAI,IAAIC,GACbR,EAAKM,CAAE,IAAIC,GAGPF,KAAMvJ,GAAG;AAET,YAAI2J,IAAM7I,IAAId;AACd,aAAKsJ,IAAO,OAAQ1C,IAAK,UAAU+C,IAAM,KAAK;AAC1C,UAAAzG,IAAMsD,GAAKhE,GAAK2D,GAAG,GAAGM,GAAMC,GAAIC,GAAI9G,GAAI+G,GAAIC,GAAI7G,IAAI6G,GAAI3D,CAAG,GAC3D0D,IAAK0C,IAAOzJ,IAAK,GAAGgH,IAAK7G;AACzB,mBAASE,IAAI,GAAGA,IAAI,KAAK,EAAEA;AACvB,YAAAwG,EAAGxG,CAAC,IAAI;AACZ,mBAASA,IAAI,GAAGA,IAAI,IAAI,EAAEA;AACtB,YAAAyG,EAAGzG,CAAC,IAAI;AAAA,QAChB;AAEA,YAAIa,IAAI,GAAGiB,IAAI,GAAG4H,IAAO1F,GAAG2F,IAAOJ,IAAOC,IAAS;AACnD,YAAIC,IAAM,KAAKH,KAAMH,EAAIrJ,IAAI6J,CAAG;AAM5B,mBALIC,IAAO,KAAK,IAAI3F,GAAGwF,CAAG,IAAI,GAC1BI,IAAO,KAAK,IAAI,OAAO/J,CAAC,GAGxBgK,IAAK,KAAK,IAAI,KAAKL,CAAG,GACnBE,KAAOE,KAAQ,EAAEH,KAAQH,KAAQC,KAAO;AAC3C,gBAAIlH,EAAIxC,IAAIe,CAAC,KAAKyB,EAAIxC,IAAIe,IAAI8I,CAAG,GAAG;AAEhC,uBADII,IAAK,GACFA,IAAKD,KAAMxH,EAAIxC,IAAIiK,CAAE,KAAKzH,EAAIxC,IAAIiK,IAAKJ,CAAG,GAAG,EAAEI;AAClD;AACJ,kBAAIA,IAAKlJ,GAAG;AAGR,oBAFAA,IAAIkJ,GAAIjI,IAAI6H,GAERI,IAAKH;AACL;AAMJ,yBAFII,KAAM,KAAK,IAAIL,GAAKI,IAAK,CAAC,GAC1BE,IAAK,GACAjK,IAAI,GAAGA,IAAIgK,IAAK,EAAEhK,GAAG;AAC1B,sBAAIkK,IAAMpK,IAAI6J,IAAM3J,IAAI,QAAS,OAC7BmK,KAAMpB,EAAKmB,CAAE,GACbxJ,KAAMwJ,IAAKC,KAAM,QAAS;AAC9B,kBAAIzJ,KAAKuJ,MACLA,IAAKvJ,IAAI8I,IAAQU;AAAA,gBACzB;AAAA,cACJ;AAAA,YACJ;AAEA,YAAAX,IAAOC,GAAOA,IAAQT,EAAKQ,CAAI,GAC/BI,KAAQJ,IAAOC,IAAQ,QAAS;AAAA,UACpC;AAGJ,YAAI1H,GAAG;AAGH,UAAAyE,EAAKG,GAAI,IAAI,YAAavG,GAAMU,CAAC,KAAK,KAAMP,GAAMwB,CAAC;AACnD,cAAIsI,KAAMjK,GAAMU,CAAC,IAAI,IAAIwJ,KAAM/J,GAAMwB,CAAC,IAAI;AAC1C,UAAAnC,KAAMJ,GAAK6K,EAAG,IAAI5K,GAAK6K,EAAG,GAC1B,EAAE7D,EAAG,MAAM4D,EAAG,GACd,EAAE3D,EAAG4D,EAAG,GACRhB,IAAKvJ,IAAIe,GACT,EAAEuI;AAAA,QACN;AAEI,UAAA7C,EAAKG,GAAI,IAAIpE,EAAIxC,CAAC,GAClB,EAAE0G,EAAGlE,EAAIxC,CAAC,CAAC;AAAA,MAEnB;AAAA,IACJ;AACA,IAAAkD,IAAMsD,GAAKhE,GAAK2D,GAAG2C,GAAKrC,GAAMC,GAAIC,GAAI9G,GAAI+G,GAAIC,GAAI7G,IAAI6G,GAAI3D,CAAG;AAAA,EAIjE;AACA,SAAOb,GAAIH,GAAG,GAAG0G,IAAMxG,GAAKc,CAAG,IAAI2F,CAAI;AAC3C,GA2BI2B,KAAQ,WAAY;AACpB,MAAI1I,IAAI,GAAG/B,IAAI;AACf,SAAO;AAAA,IACH,GAAG,SAAUiC,GAAG;AAIZ,eAFI,IAAIF,GAAGR,IAAIvB,GACXgB,IAAIiB,EAAE,QACDhC,IAAI,GAAGA,KAAKe,KAAI;AAErB,iBADIuB,IAAI,KAAK,IAAItC,IAAI,MAAMe,CAAC,GACrBf,IAAIsC,GAAG,EAAEtC;AACZ,eAAKgC,EAAEhC,CAAC,GAAGsB,KAAK;AACpB,aAAK,OAAOA,KAAK;AAAA,MACrB;AACA,MAAAQ,IAAI,GAAG/B,IAAIuB;AAAA,IACf;AAAA,IACA,GAAG,WAAY;AAAE,cAASQ,MAAM,KAAM,MAAM/B,IAAI,QAAQ,IAAKA,MAAM,OAAQ+B,IAAI,QAAQ,MAAM;AAAA,IAAG;AAAA,EACxG;AACA,GAGI2I,KAAO,SAAUjI,GAAKuG,GAAKH,GAAKC,GAAMnG,GAAI;AAC1C,SAAO+F,GAAKjG,GAAKuG,EAAI,SAAS,OAAO,IAAIA,EAAI,OAAOA,EAAI,OAAO,OAAO,KAAK,KAAK,KAAK,IAAI,GAAG,KAAK,IAAI,IAAI,KAAK,IAAIvG,EAAI,MAAM,CAAC,CAAC,IAAI,GAAG,IAAK,KAAKuG,EAAI,KAAMH,GAAKC,GAAM,EAAG;AAC3K,GA8HI6B,KAAS,SAAU1I,GAAGjC,GAAG,GAAG;AAC5B,SAAO,GAAG,EAAEA;AACR,IAAAiC,EAAEjC,CAAC,IAAI,GAAG,OAAO;AACzB,GAkCI4K,KAAM,SAAUzG,GAAGhC,GAAG;AACtB,MAAI0I,IAAK1I,EAAE,OAAO9B,IAAKwK,KAAM,IAAI,IAAIA,IAAK,IAAI,IAAIA,KAAM,IAAI,IAAI;AAChE,EAAA1G,EAAE,CAAC,IAAI,KAAKA,EAAE,CAAC,IAAK9D,KAAM,KAAMA,IAAM,KAAK,IAAIA,IAAM;AACzD,GAEIyK,KAAM,SAAU7I,GAAG;AACnB,OAAKA,EAAE,CAAC,IAAI,OAAO,KAAMA,EAAE,CAAC,MAAM,IAAK,MAAOA,EAAE,CAAC,KAAK,IAAIA,EAAE,CAAC,KAAK;AAC9D,UAAM;AACV,MAAIA,EAAE,CAAC,IAAI;AACP,UAAM;AACd;AA+WO,SAAS8I,GAASC,GAAMC,GAAM;AACjC,EAAIA,MAAS,WAAUA,IAAO,CAAA;AAC9B,MAAIlJ,IAAI0I,GAAK;AACb,EAAA1I,EAAE,EAAEiJ,CAAI;AACR,MAAI/I,IAAIyI,GAAKM,GAAMC,GAAM,GAAG,CAAC;AAC7B,SAAOL,GAAI3I,GAAGgJ,CAAI,GAAGN,GAAO1I,GAAGA,EAAE,SAAS,GAAGF,EAAE,EAAC,CAAE,GAAGE;AACzD;AA4EO,SAASiJ,GAAWF,GAAMxE,GAAK;AAClC,SAAOhE,IAAOsI,GAAIE,CAAI,GAAGA,EAAK,SAAS,GAAG,EAAE,IAAIxE,CAAG;AACvD;","x_google_ignoreList":[0]}
+{"version":3,"file":"browser.js","sources":["../../../../node_modules/fflate/esm/browser.js"],"sourcesContent":["// DEFLATE is a complex format; to read this code, you should probably check the RFC first:\n// https://tools.ietf.org/html/rfc1951\n// You may also wish to take a look at the guide I made about this program:\n// https://gist.github.com/101arrowz/253f31eb5abc3d9275ab943003ffecad\n// Some of the following code is similar to that of UZIP.js:\n// https://github.com/photopea/UZIP.js\n// However, the vast majority of the codebase has diverged from UZIP.js to increase performance and reduce bundle size.\n// Sometimes 0 will appear where -1 would be more appropriate. This is because using a uint\n// is better for memory in most engines (I *think*).\nvar ch2 = {};\nvar wk = (function (c, id, msg, transfer, cb) {\n    var w = new Worker(ch2[id] || (ch2[id] = URL.createObjectURL(new Blob([\n        c + ';addEventListener(\"error\",function(e){e=e.error;postMessage({$e$:[e.message,e.code,e.stack]})})'\n    ], { type: 'text/javascript' }))));\n    w.onmessage = function (e) {\n        var d = e.data, ed = d.$e$;\n        if (ed) {\n            var err = new Error(ed[0]);\n            err['code'] = ed[1];\n            err.stack = ed[2];\n            cb(err, null);\n        }\n        else\n            cb(null, d);\n    };\n    w.postMessage(msg, transfer);\n    return w;\n});\n\n// aliases for shorter compressed code (most minifers don't do this)\nvar u8 = Uint8Array, u16 = Uint16Array, i32 = Int32Array;\n// fixed length extra bits\nvar fleb = new u8([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, /* unused */ 0, 0, /* impossible */ 0]);\n// fixed distance extra bits\nvar fdeb = new u8([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, /* unused */ 0, 0]);\n// code length index map\nvar clim = new u8([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]);\n// get base, reverse index map from extra bits\nvar freb = function (eb, start) {\n    var b = new u16(31);\n    for (var i = 0; i < 31; ++i) {\n        b[i] = start += 1 << eb[i - 1];\n    }\n    // numbers here are at max 18 bits\n    var r = new i32(b[30]);\n    for (var i = 1; i < 30; ++i) {\n        for (var j = b[i]; j < b[i + 1]; ++j) {\n            r[j] = ((j - b[i]) << 5) | i;\n        }\n    }\n    return { b: b, r: r };\n};\nvar _a = freb(fleb, 2), fl = _a.b, revfl = _a.r;\n// we can ignore the fact that the other numbers are wrong; they never happen anyway\nfl[28] = 258, revfl[258] = 28;\nvar _b = freb(fdeb, 0), fd = _b.b, revfd = _b.r;\n// map of value to reverse (assuming 16 bits)\nvar rev = new u16(32768);\nfor (var i = 0; i < 32768; ++i) {\n    // reverse table algorithm from SO\n    var x = ((i & 0xAAAA) >> 1) | ((i & 0x5555) << 1);\n    x = ((x & 0xCCCC) >> 2) | ((x & 0x3333) << 2);\n    x = ((x & 0xF0F0) >> 4) | ((x & 0x0F0F) << 4);\n    rev[i] = (((x & 0xFF00) >> 8) | ((x & 0x00FF) << 8)) >> 1;\n}\n// create huffman tree from u8 \"map\": index -> code length for code index\n// mb (max bits) must be at most 15\n// TODO: optimize/split up?\nvar hMap = (function (cd, mb, r) {\n    var s = cd.length;\n    // index\n    var i = 0;\n    // u16 \"map\": index -> # of codes with bit length = index\n    var l = new u16(mb);\n    // length of cd must be 288 (total # of codes)\n    for (; i < s; ++i) {\n        if (cd[i])\n            ++l[cd[i] - 1];\n    }\n    // u16 \"map\": index -> minimum code for bit length = index\n    var le = new u16(mb);\n    for (i = 1; i < mb; ++i) {\n        le[i] = (le[i - 1] + l[i - 1]) << 1;\n    }\n    var co;\n    if (r) {\n        // u16 \"map\": index -> number of actual bits, symbol for code\n        co = new u16(1 << mb);\n        // bits to remove for reverser\n        var rvb = 15 - mb;\n        for (i = 0; i < s; ++i) {\n            // ignore 0 lengths\n            if (cd[i]) {\n                // num encoding both symbol and bits read\n                var sv = (i << 4) | cd[i];\n                // free bits\n                var r_1 = mb - cd[i];\n                // start value\n                var v = le[cd[i] - 1]++ << r_1;\n                // m is end value\n                for (var m = v | ((1 << r_1) - 1); v <= m; ++v) {\n                    // every 16 bit value starting with the code yields the same result\n                    co[rev[v] >> rvb] = sv;\n                }\n            }\n        }\n    }\n    else {\n        co = new u16(s);\n        for (i = 0; i < s; ++i) {\n            if (cd[i]) {\n                co[i] = rev[le[cd[i] - 1]++] >> (15 - cd[i]);\n            }\n        }\n    }\n    return co;\n});\n// fixed length tree\nvar flt = new u8(288);\nfor (var i = 0; i < 144; ++i)\n    flt[i] = 8;\nfor (var i = 144; i < 256; ++i)\n    flt[i] = 9;\nfor (var i = 256; i < 280; ++i)\n    flt[i] = 7;\nfor (var i = 280; i < 288; ++i)\n    flt[i] = 8;\n// fixed distance tree\nvar fdt = new u8(32);\nfor (var i = 0; i < 32; ++i)\n    fdt[i] = 5;\n// fixed length map\nvar flm = /*#__PURE__*/ hMap(flt, 9, 0), flrm = /*#__PURE__*/ hMap(flt, 9, 1);\n// fixed distance map\nvar fdm = /*#__PURE__*/ hMap(fdt, 5, 0), fdrm = /*#__PURE__*/ hMap(fdt, 5, 1);\n// find max of array\nvar max = function (a) {\n    var m = a[0];\n    for (var i = 1; i < a.length; ++i) {\n        if (a[i] > m)\n            m = a[i];\n    }\n    return m;\n};\n// read d, starting at bit p and mask with m\nvar bits = function (d, p, m) {\n    var o = (p / 8) | 0;\n    return ((d[o] | (d[o + 1] << 8)) >> (p & 7)) & m;\n};\n// read d, starting at bit p continuing for at least 16 bits\nvar bits16 = function (d, p) {\n    var o = (p / 8) | 0;\n    return ((d[o] | (d[o + 1] << 8) | (d[o + 2] << 16)) >> (p & 7));\n};\n// get end of byte\nvar shft = function (p) { return ((p + 7) / 8) | 0; };\n// typed array slice - allows garbage collector to free original reference,\n// while being more compatible than .slice\nvar slc = function (v, s, e) {\n    if (s == null || s < 0)\n        s = 0;\n    if (e == null || e > v.length)\n        e = v.length;\n    // can't use .constructor in case user-supplied\n    return new u8(v.subarray(s, e));\n};\n/**\n * Codes for errors generated within this library\n */\nexport var FlateErrorCode = {\n    UnexpectedEOF: 0,\n    InvalidBlockType: 1,\n    InvalidLengthLiteral: 2,\n    InvalidDistance: 3,\n    StreamFinished: 4,\n    NoStreamHandler: 5,\n    InvalidHeader: 6,\n    NoCallback: 7,\n    InvalidUTF8: 8,\n    ExtraFieldTooLong: 9,\n    InvalidDate: 10,\n    FilenameTooLong: 11,\n    StreamFinishing: 12,\n    InvalidZipData: 13,\n    UnknownCompressionMethod: 14\n};\n// error codes\nvar ec = [\n    'unexpected EOF',\n    'invalid block type',\n    'invalid length/literal',\n    'invalid distance',\n    'stream finished',\n    'no stream handler',\n    ,\n    'no callback',\n    'invalid UTF-8 data',\n    'extra field too long',\n    'date not in range 1980-2099',\n    'filename too long',\n    'stream finishing',\n    'invalid zip data'\n    // determined by unknown compression method\n];\n;\nvar err = function (ind, msg, nt) {\n    var e = new Error(msg || ec[ind]);\n    e.code = ind;\n    if (Error.captureStackTrace)\n        Error.captureStackTrace(e, err);\n    if (!nt)\n        throw e;\n    return e;\n};\n// expands raw DEFLATE data\nvar inflt = function (dat, st, buf, dict) {\n    // source length       dict length\n    var sl = dat.length, dl = dict ? dict.length : 0;\n    if (!sl || st.f && !st.l)\n        return buf || new u8(0);\n    var noBuf = !buf;\n    // have to estimate size\n    var resize = noBuf || st.i != 2;\n    // no state\n    var noSt = st.i;\n    // Assumes roughly 33% compression ratio average\n    if (noBuf)\n        buf = new u8(sl * 3);\n    // ensure buffer can fit at least l elements\n    var cbuf = function (l) {\n        var bl = buf.length;\n        // need to increase size to fit\n        if (l > bl) {\n            // Double or set to necessary, whichever is greater\n            var nbuf = new u8(Math.max(bl * 2, l));\n            nbuf.set(buf);\n            buf = nbuf;\n        }\n    };\n    //  last chunk         bitpos           bytes\n    var final = st.f || 0, pos = st.p || 0, bt = st.b || 0, lm = st.l, dm = st.d, lbt = st.m, dbt = st.n;\n    // total bits\n    var tbts = sl * 8;\n    do {\n        if (!lm) {\n            // BFINAL - this is only 1 when last chunk is next\n            final = bits(dat, pos, 1);\n            // type: 0 = no compression, 1 = fixed huffman, 2 = dynamic huffman\n            var type = bits(dat, pos + 1, 3);\n            pos += 3;\n            if (!type) {\n                // go to end of byte boundary\n                var s = shft(pos) + 4, l = dat[s - 4] | (dat[s - 3] << 8), t = s + l;\n                if (t > sl) {\n                    if (noSt)\n                        err(0);\n                    break;\n                }\n                // ensure size\n                if (resize)\n                    cbuf(bt + l);\n                // Copy over uncompressed data\n                buf.set(dat.subarray(s, t), bt);\n                // Get new bitpos, update byte count\n                st.b = bt += l, st.p = pos = t * 8, st.f = final;\n                continue;\n            }\n            else if (type == 1)\n                lm = flrm, dm = fdrm, lbt = 9, dbt = 5;\n            else if (type == 2) {\n                //  literal                            lengths\n                var hLit = bits(dat, pos, 31) + 257, hcLen = bits(dat, pos + 10, 15) + 4;\n                var tl = hLit + bits(dat, pos + 5, 31) + 1;\n                pos += 14;\n                // length+distance tree\n                var ldt = new u8(tl);\n                // code length tree\n                var clt = new u8(19);\n                for (var i = 0; i < hcLen; ++i) {\n                    // use index map to get real code\n                    clt[clim[i]] = bits(dat, pos + i * 3, 7);\n                }\n                pos += hcLen * 3;\n                // code lengths bits\n                var clb = max(clt), clbmsk = (1 << clb) - 1;\n                // code lengths map\n                var clm = hMap(clt, clb, 1);\n                for (var i = 0; i < tl;) {\n                    var r = clm[bits(dat, pos, clbmsk)];\n                    // bits read\n                    pos += r & 15;\n                    // symbol\n                    var s = r >> 4;\n                    // code length to copy\n                    if (s < 16) {\n                        ldt[i++] = s;\n                    }\n                    else {\n                        //  copy   count\n                        var c = 0, n = 0;\n                        if (s == 16)\n                            n = 3 + bits(dat, pos, 3), pos += 2, c = ldt[i - 1];\n                        else if (s == 17)\n                            n = 3 + bits(dat, pos, 7), pos += 3;\n                        else if (s == 18)\n                            n = 11 + bits(dat, pos, 127), pos += 7;\n                        while (n--)\n                            ldt[i++] = c;\n                    }\n                }\n                //    length tree                 distance tree\n                var lt = ldt.subarray(0, hLit), dt = ldt.subarray(hLit);\n                // max length bits\n                lbt = max(lt);\n                // max dist bits\n                dbt = max(dt);\n                lm = hMap(lt, lbt, 1);\n                dm = hMap(dt, dbt, 1);\n            }\n            else\n                err(1);\n            if (pos > tbts) {\n                if (noSt)\n                    err(0);\n                break;\n            }\n        }\n        // Make sure the buffer can hold this + the largest possible addition\n        // Maximum chunk size (practically, theoretically infinite) is 2^17\n        if (resize)\n            cbuf(bt + 131072);\n        var lms = (1 << lbt) - 1, dms = (1 << dbt) - 1;\n        var lpos = pos;\n        for (;; lpos = pos) {\n            // bits read, code\n            var c = lm[bits16(dat, pos) & lms], sym = c >> 4;\n            pos += c & 15;\n            if (pos > tbts) {\n                if (noSt)\n                    err(0);\n                break;\n            }\n            if (!c)\n                err(2);\n            if (sym < 256)\n                buf[bt++] = sym;\n            else if (sym == 256) {\n                lpos = pos, lm = null;\n                break;\n            }\n            else {\n                var add = sym - 254;\n                // no extra bits needed if less\n                if (sym > 264) {\n                    // index\n                    var i = sym - 257, b = fleb[i];\n                    add = bits(dat, pos, (1 << b) - 1) + fl[i];\n                    pos += b;\n                }\n                // dist\n                var d = dm[bits16(dat, pos) & dms], dsym = d >> 4;\n                if (!d)\n                    err(3);\n                pos += d & 15;\n                var dt = fd[dsym];\n                if (dsym > 3) {\n                    var b = fdeb[dsym];\n                    dt += bits16(dat, pos) & (1 << b) - 1, pos += b;\n                }\n                if (pos > tbts) {\n                    if (noSt)\n                        err(0);\n                    break;\n                }\n                if (resize)\n                    cbuf(bt + 131072);\n                var end = bt + add;\n                if (bt < dt) {\n                    var shift = dl - dt, dend = Math.min(dt, end);\n                    if (shift + bt < 0)\n                        err(3);\n                    for (; bt < dend; ++bt)\n                        buf[bt] = dict[shift + bt];\n                }\n                for (; bt < end; ++bt)\n                    buf[bt] = buf[bt - dt];\n            }\n        }\n        st.l = lm, st.p = lpos, st.b = bt, st.f = final;\n        if (lm)\n            final = 1, st.m = lbt, st.d = dm, st.n = dbt;\n    } while (!final);\n    // don't reallocate for streams or user buffers\n    return bt != buf.length && noBuf ? slc(buf, 0, bt) : buf.subarray(0, bt);\n};\n// starting at p, write the minimum number of bits that can hold v to d\nvar wbits = function (d, p, v) {\n    v <<= p & 7;\n    var o = (p / 8) | 0;\n    d[o] |= v;\n    d[o + 1] |= v >> 8;\n};\n// starting at p, write the minimum number of bits (>8) that can hold v to d\nvar wbits16 = function (d, p, v) {\n    v <<= p & 7;\n    var o = (p / 8) | 0;\n    d[o] |= v;\n    d[o + 1] |= v >> 8;\n    d[o + 2] |= v >> 16;\n};\n// creates code lengths from a frequency table\nvar hTree = function (d, mb) {\n    // Need extra info to make a tree\n    var t = [];\n    for (var i = 0; i < d.length; ++i) {\n        if (d[i])\n            t.push({ s: i, f: d[i] });\n    }\n    var s = t.length;\n    var t2 = t.slice();\n    if (!s)\n        return { t: et, l: 0 };\n    if (s == 1) {\n        var v = new u8(t[0].s + 1);\n        v[t[0].s] = 1;\n        return { t: v, l: 1 };\n    }\n    t.sort(function (a, b) { return a.f - b.f; });\n    // after i2 reaches last ind, will be stopped\n    // freq must be greater than largest possible number of symbols\n    t.push({ s: -1, f: 25001 });\n    var l = t[0], r = t[1], i0 = 0, i1 = 1, i2 = 2;\n    t[0] = { s: -1, f: l.f + r.f, l: l, r: r };\n    // efficient algorithm from UZIP.js\n    // i0 is lookbehind, i2 is lookahead - after processing two low-freq\n    // symbols that combined have high freq, will start processing i2 (high-freq,\n    // non-composite) symbols instead\n    // see https://reddit.com/r/photopea/comments/ikekht/uzipjs_questions/\n    while (i1 != s - 1) {\n        l = t[t[i0].f < t[i2].f ? i0++ : i2++];\n        r = t[i0 != i1 && t[i0].f < t[i2].f ? i0++ : i2++];\n        t[i1++] = { s: -1, f: l.f + r.f, l: l, r: r };\n    }\n    var maxSym = t2[0].s;\n    for (var i = 1; i < s; ++i) {\n        if (t2[i].s > maxSym)\n            maxSym = t2[i].s;\n    }\n    // code lengths\n    var tr = new u16(maxSym + 1);\n    // max bits in tree\n    var mbt = ln(t[i1 - 1], tr, 0);\n    if (mbt > mb) {\n        // more algorithms from UZIP.js\n        // TODO: find out how this code works (debt)\n        //  ind    debt\n        var i = 0, dt = 0;\n        //    left            cost\n        var lft = mbt - mb, cst = 1 << lft;\n        t2.sort(function (a, b) { return tr[b.s] - tr[a.s] || a.f - b.f; });\n        for (; i < s; ++i) {\n            var i2_1 = t2[i].s;\n            if (tr[i2_1] > mb) {\n                dt += cst - (1 << (mbt - tr[i2_1]));\n                tr[i2_1] = mb;\n            }\n            else\n                break;\n        }\n        dt >>= lft;\n        while (dt > 0) {\n            var i2_2 = t2[i].s;\n            if (tr[i2_2] < mb)\n                dt -= 1 << (mb - tr[i2_2]++ - 1);\n            else\n                ++i;\n        }\n        for (; i >= 0 && dt; --i) {\n            var i2_3 = t2[i].s;\n            if (tr[i2_3] == mb) {\n                --tr[i2_3];\n                ++dt;\n            }\n        }\n        mbt = mb;\n    }\n    return { t: new u8(tr), l: mbt };\n};\n// get the max length and assign length codes\nvar ln = function (n, l, d) {\n    return n.s == -1\n        ? Math.max(ln(n.l, l, d + 1), ln(n.r, l, d + 1))\n        : (l[n.s] = d);\n};\n// length codes generation\nvar lc = function (c) {\n    var s = c.length;\n    // Note that the semicolon was intentional\n    while (s && !c[--s])\n        ;\n    var cl = new u16(++s);\n    //  ind      num         streak\n    var cli = 0, cln = c[0], cls = 1;\n    var w = function (v) { cl[cli++] = v; };\n    for (var i = 1; i <= s; ++i) {\n        if (c[i] == cln && i != s)\n            ++cls;\n        else {\n            if (!cln && cls > 2) {\n                for (; cls > 138; cls -= 138)\n                    w(32754);\n                if (cls > 2) {\n                    w(cls > 10 ? ((cls - 11) << 5) | 28690 : ((cls - 3) << 5) | 12305);\n                    cls = 0;\n                }\n            }\n            else if (cls > 3) {\n                w(cln), --cls;\n                for (; cls > 6; cls -= 6)\n                    w(8304);\n                if (cls > 2)\n                    w(((cls - 3) << 5) | 8208), cls = 0;\n            }\n            while (cls--)\n                w(cln);\n            cls = 1;\n            cln = c[i];\n        }\n    }\n    return { c: cl.subarray(0, cli), n: s };\n};\n// calculate the length of output from tree, code lengths\nvar clen = function (cf, cl) {\n    var l = 0;\n    for (var i = 0; i < cl.length; ++i)\n        l += cf[i] * cl[i];\n    return l;\n};\n// writes a fixed block\n// returns the new bit pos\nvar wfblk = function (out, pos, dat) {\n    // no need to write 00 as type: TypedArray defaults to 0\n    var s = dat.length;\n    var o = shft(pos + 2);\n    out[o] = s & 255;\n    out[o + 1] = s >> 8;\n    out[o + 2] = out[o] ^ 255;\n    out[o + 3] = out[o + 1] ^ 255;\n    for (var i = 0; i < s; ++i)\n        out[o + i + 4] = dat[i];\n    return (o + 4 + s) * 8;\n};\n// writes a block\nvar wblk = function (dat, out, final, syms, lf, df, eb, li, bs, bl, p) {\n    wbits(out, p++, final);\n    ++lf[256];\n    var _a = hTree(lf, 15), dlt = _a.t, mlb = _a.l;\n    var _b = hTree(df, 15), ddt = _b.t, mdb = _b.l;\n    var _c = lc(dlt), lclt = _c.c, nlc = _c.n;\n    var _d = lc(ddt), lcdt = _d.c, ndc = _d.n;\n    var lcfreq = new u16(19);\n    for (var i = 0; i < lclt.length; ++i)\n        ++lcfreq[lclt[i] & 31];\n    for (var i = 0; i < lcdt.length; ++i)\n        ++lcfreq[lcdt[i] & 31];\n    var _e = hTree(lcfreq, 7), lct = _e.t, mlcb = _e.l;\n    var nlcc = 19;\n    for (; nlcc > 4 && !lct[clim[nlcc - 1]]; --nlcc)\n        ;\n    var flen = (bl + 5) << 3;\n    var ftlen = clen(lf, flt) + clen(df, fdt) + eb;\n    var dtlen = clen(lf, dlt) + clen(df, ddt) + eb + 14 + 3 * nlcc + clen(lcfreq, lct) + 2 * lcfreq[16] + 3 * lcfreq[17] + 7 * lcfreq[18];\n    if (bs >= 0 && flen <= ftlen && flen <= dtlen)\n        return wfblk(out, p, dat.subarray(bs, bs + bl));\n    var lm, ll, dm, dl;\n    wbits(out, p, 1 + (dtlen < ftlen)), p += 2;\n    if (dtlen < ftlen) {\n        lm = hMap(dlt, mlb, 0), ll = dlt, dm = hMap(ddt, mdb, 0), dl = ddt;\n        var llm = hMap(lct, mlcb, 0);\n        wbits(out, p, nlc - 257);\n        wbits(out, p + 5, ndc - 1);\n        wbits(out, p + 10, nlcc - 4);\n        p += 14;\n        for (var i = 0; i < nlcc; ++i)\n            wbits(out, p + 3 * i, lct[clim[i]]);\n        p += 3 * nlcc;\n        var lcts = [lclt, lcdt];\n        for (var it = 0; it < 2; ++it) {\n            var clct = lcts[it];\n            for (var i = 0; i < clct.length; ++i) {\n                var len = clct[i] & 31;\n                wbits(out, p, llm[len]), p += lct[len];\n                if (len > 15)\n                    wbits(out, p, (clct[i] >> 5) & 127), p += clct[i] >> 12;\n            }\n        }\n    }\n    else {\n        lm = flm, ll = flt, dm = fdm, dl = fdt;\n    }\n    for (var i = 0; i < li; ++i) {\n        var sym = syms[i];\n        if (sym > 255) {\n            var len = (sym >> 18) & 31;\n            wbits16(out, p, lm[len + 257]), p += ll[len + 257];\n            if (len > 7)\n                wbits(out, p, (sym >> 23) & 31), p += fleb[len];\n            var dst = sym & 31;\n            wbits16(out, p, dm[dst]), p += dl[dst];\n            if (dst > 3)\n                wbits16(out, p, (sym >> 5) & 8191), p += fdeb[dst];\n        }\n        else {\n            wbits16(out, p, lm[sym]), p += ll[sym];\n        }\n    }\n    wbits16(out, p, lm[256]);\n    return p + ll[256];\n};\n// deflate options (nice << 13) | chain\nvar deo = /*#__PURE__*/ new i32([65540, 131080, 131088, 131104, 262176, 1048704, 1048832, 2114560, 2117632]);\n// empty\nvar et = /*#__PURE__*/ new u8(0);\n// compresses data into a raw DEFLATE buffer\nvar dflt = function (dat, lvl, plvl, pre, post, st) {\n    var s = st.z || dat.length;\n    var o = new u8(pre + s + 5 * (1 + Math.ceil(s / 7000)) + post);\n    // writing to this writes to the output buffer\n    var w = o.subarray(pre, o.length - post);\n    var lst = st.l;\n    var pos = (st.r || 0) & 7;\n    if (lvl) {\n        if (pos)\n            w[0] = st.r >> 3;\n        var opt = deo[lvl - 1];\n        var n = opt >> 13, c = opt & 8191;\n        var msk_1 = (1 << plvl) - 1;\n        //    prev 2-byte val map    curr 2-byte val map\n        var prev = st.p || new u16(32768), head = st.h || new u16(msk_1 + 1);\n        var bs1_1 = Math.ceil(plvl / 3), bs2_1 = 2 * bs1_1;\n        var hsh = function (i) { return (dat[i] ^ (dat[i + 1] << bs1_1) ^ (dat[i + 2] << bs2_1)) & msk_1; };\n        // 24576 is an arbitrary number of maximum symbols per block\n        // 424 buffer for last block\n        var syms = new i32(25000);\n        // length/literal freq   distance freq\n        var lf = new u16(288), df = new u16(32);\n        //  l/lcnt  exbits  index          l/lind  waitdx          blkpos\n        var lc_1 = 0, eb = 0, i = st.i || 0, li = 0, wi = st.w || 0, bs = 0;\n        for (; i + 2 < s; ++i) {\n            // hash value\n            var hv = hsh(i);\n            // index mod 32768    previous index mod\n            var imod = i & 32767, pimod = head[hv];\n            prev[imod] = pimod;\n            head[hv] = imod;\n            // We always should modify head and prev, but only add symbols if\n            // this data is not yet processed (\"wait\" for wait index)\n            if (wi <= i) {\n                // bytes remaining\n                var rem = s - i;\n                if ((lc_1 > 7000 || li > 24576) && (rem > 423 || !lst)) {\n                    pos = wblk(dat, w, 0, syms, lf, df, eb, li, bs, i - bs, pos);\n                    li = lc_1 = eb = 0, bs = i;\n                    for (var j = 0; j < 286; ++j)\n                        lf[j] = 0;\n                    for (var j = 0; j < 30; ++j)\n                        df[j] = 0;\n                }\n                //  len    dist   chain\n                var l = 2, d = 0, ch_1 = c, dif = imod - pimod & 32767;\n                if (rem > 2 && hv == hsh(i - dif)) {\n                    var maxn = Math.min(n, rem) - 1;\n                    var maxd = Math.min(32767, i);\n                    // max possible length\n                    // not capped at dif because decompressors implement \"rolling\" index population\n                    var ml = Math.min(258, rem);\n                    while (dif <= maxd && --ch_1 && imod != pimod) {\n                        if (dat[i + l] == dat[i + l - dif]) {\n                            var nl = 0;\n                            for (; nl < ml && dat[i + nl] == dat[i + nl - dif]; ++nl)\n                                ;\n                            if (nl > l) {\n                                l = nl, d = dif;\n                                // break out early when we reach \"nice\" (we are satisfied enough)\n                                if (nl > maxn)\n                                    break;\n                                // now, find the rarest 2-byte sequence within this\n                                // length of literals and search for that instead.\n                                // Much faster than just using the start\n                                var mmd = Math.min(dif, nl - 2);\n                                var md = 0;\n                                for (var j = 0; j < mmd; ++j) {\n                                    var ti = i - dif + j & 32767;\n                                    var pti = prev[ti];\n                                    var cd = ti - pti & 32767;\n                                    if (cd > md)\n                                        md = cd, pimod = ti;\n                                }\n                            }\n                        }\n                        // check the previous match\n                        imod = pimod, pimod = prev[imod];\n                        dif += imod - pimod & 32767;\n                    }\n                }\n                // d will be nonzero only when a match was found\n                if (d) {\n                    // store both dist and len data in one int32\n                    // Make sure this is recognized as a len/dist with 28th bit (2^28)\n                    syms[li++] = 268435456 | (revfl[l] << 18) | revfd[d];\n                    var lin = revfl[l] & 31, din = revfd[d] & 31;\n                    eb += fleb[lin] + fdeb[din];\n                    ++lf[257 + lin];\n                    ++df[din];\n                    wi = i + l;\n                    ++lc_1;\n                }\n                else {\n                    syms[li++] = dat[i];\n                    ++lf[dat[i]];\n                }\n            }\n        }\n        for (i = Math.max(i, wi); i < s; ++i) {\n            syms[li++] = dat[i];\n            ++lf[dat[i]];\n        }\n        pos = wblk(dat, w, lst, syms, lf, df, eb, li, bs, i - bs, pos);\n        if (!lst) {\n            st.r = (pos & 7) | w[(pos / 8) | 0] << 3;\n            // shft(pos) now 1 less if pos & 7 != 0\n            pos -= 7;\n            st.h = head, st.p = prev, st.i = i, st.w = wi;\n        }\n    }\n    else {\n        for (var i = st.w || 0; i < s + lst; i += 65535) {\n            // end\n            var e = i + 65535;\n            if (e >= s) {\n                // write final block\n                w[(pos / 8) | 0] = lst;\n                e = s;\n            }\n            pos = wfblk(w, pos + 1, dat.subarray(i, e));\n        }\n        st.i = s;\n    }\n    return slc(o, 0, pre + shft(pos) + post);\n};\n// CRC32 table\nvar crct = /*#__PURE__*/ (function () {\n    var t = new Int32Array(256);\n    for (var i = 0; i < 256; ++i) {\n        var c = i, k = 9;\n        while (--k)\n            c = ((c & 1) && -306674912) ^ (c >>> 1);\n        t[i] = c;\n    }\n    return t;\n})();\n// CRC32\nvar crc = function () {\n    var c = -1;\n    return {\n        p: function (d) {\n            // closures have awful performance\n            var cr = c;\n            for (var i = 0; i < d.length; ++i)\n                cr = crct[(cr & 255) ^ d[i]] ^ (cr >>> 8);\n            c = cr;\n        },\n        d: function () { return ~c; }\n    };\n};\n// Adler32\nvar adler = function () {\n    var a = 1, b = 0;\n    return {\n        p: function (d) {\n            // closures have awful performance\n            var n = a, m = b;\n            var l = d.length | 0;\n            for (var i = 0; i != l;) {\n                var e = Math.min(i + 2655, l);\n                for (; i < e; ++i)\n                    m += n += d[i];\n                n = (n & 65535) + 15 * (n >> 16), m = (m & 65535) + 15 * (m >> 16);\n            }\n            a = n, b = m;\n        },\n        d: function () {\n            a %= 65521, b %= 65521;\n            return (a & 255) << 24 | (a & 0xFF00) << 8 | (b & 255) << 8 | (b >> 8);\n        }\n    };\n};\n;\n// deflate with opts\nvar dopt = function (dat, opt, pre, post, st) {\n    if (!st) {\n        st = { l: 1 };\n        if (opt.dictionary) {\n            var dict = opt.dictionary.subarray(-32768);\n            var newDat = new u8(dict.length + dat.length);\n            newDat.set(dict);\n            newDat.set(dat, dict.length);\n            dat = newDat;\n            st.w = dict.length;\n        }\n    }\n    return dflt(dat, opt.level == null ? 6 : opt.level, opt.mem == null ? (st.l ? Math.ceil(Math.max(8, Math.min(13, Math.log(dat.length))) * 1.5) : 20) : (12 + opt.mem), pre, post, st);\n};\n// Walmart object spread\nvar mrg = function (a, b) {\n    var o = {};\n    for (var k in a)\n        o[k] = a[k];\n    for (var k in b)\n        o[k] = b[k];\n    return o;\n};\n// worker clone\n// This is possibly the craziest part of the entire codebase, despite how simple it may seem.\n// The only parameter to this function is a closure that returns an array of variables outside of the function scope.\n// We're going to try to figure out the variable names used in the closure as strings because that is crucial for workerization.\n// We will return an object mapping of true variable name to value (basically, the current scope as a JS object).\n// The reason we can't just use the original variable names is minifiers mangling the toplevel scope.\n// This took me three weeks to figure out how to do.\nvar wcln = function (fn, fnStr, td) {\n    var dt = fn();\n    var st = fn.toString();\n    var ks = st.slice(st.indexOf('[') + 1, st.lastIndexOf(']')).replace(/\\s+/g, '').split(',');\n    for (var i = 0; i < dt.length; ++i) {\n        var v = dt[i], k = ks[i];\n        if (typeof v == 'function') {\n            fnStr += ';' + k + '=';\n            var st_1 = v.toString();\n            if (v.prototype) {\n                // for global objects\n                if (st_1.indexOf('[native code]') != -1) {\n                    var spInd = st_1.indexOf(' ', 8) + 1;\n                    fnStr += st_1.slice(spInd, st_1.indexOf('(', spInd));\n                }\n                else {\n                    fnStr += st_1;\n                    for (var t in v.prototype)\n                        fnStr += ';' + k + '.prototype.' + t + '=' + v.prototype[t].toString();\n                }\n            }\n            else\n                fnStr += st_1;\n        }\n        else\n            td[k] = v;\n    }\n    return fnStr;\n};\nvar ch = [];\n// clone bufs\nvar cbfs = function (v) {\n    var tl = [];\n    for (var k in v) {\n        if (v[k].buffer) {\n            tl.push((v[k] = new v[k].constructor(v[k])).buffer);\n        }\n    }\n    return tl;\n};\n// use a worker to execute code\nvar wrkr = function (fns, init, id, cb) {\n    if (!ch[id]) {\n        var fnStr = '', td_1 = {}, m = fns.length - 1;\n        for (var i = 0; i < m; ++i)\n            fnStr = wcln(fns[i], fnStr, td_1);\n        ch[id] = { c: wcln(fns[m], fnStr, td_1), e: td_1 };\n    }\n    var td = mrg({}, ch[id].e);\n    return wk(ch[id].c + ';onmessage=function(e){for(var k in e.data)self[k]=e.data[k];onmessage=' + init.toString() + '}', id, td, cbfs(td), cb);\n};\n// base async inflate fn\nvar bInflt = function () { return [u8, u16, i32, fleb, fdeb, clim, fl, fd, flrm, fdrm, rev, ec, hMap, max, bits, bits16, shft, slc, err, inflt, inflateSync, pbf, gopt]; };\nvar bDflt = function () { return [u8, u16, i32, fleb, fdeb, clim, revfl, revfd, flm, flt, fdm, fdt, rev, deo, et, hMap, wbits, wbits16, hTree, ln, lc, clen, wfblk, wblk, shft, slc, dflt, dopt, deflateSync, pbf]; };\n// gzip extra\nvar gze = function () { return [gzh, gzhl, wbytes, crc, crct]; };\n// gunzip extra\nvar guze = function () { return [gzs, gzl]; };\n// zlib extra\nvar zle = function () { return [zlh, wbytes, adler]; };\n// unzlib extra\nvar zule = function () { return [zls]; };\n// post buf\nvar pbf = function (msg) { return postMessage(msg, [msg.buffer]); };\n// get opts\nvar gopt = function (o) { return o && {\n    out: o.size && new u8(o.size),\n    dictionary: o.dictionary\n}; };\n// async helper\nvar cbify = function (dat, opts, fns, init, id, cb) {\n    var w = wrkr(fns, init, id, function (err, dat) {\n        w.terminate();\n        cb(err, dat);\n    });\n    w.postMessage([dat, opts], opts.consume ? [dat.buffer] : []);\n    return function () { w.terminate(); };\n};\n// auto stream\nvar astrm = function (strm) {\n    strm.ondata = function (dat, final) { return postMessage([dat, final], [dat.buffer]); };\n    return function (ev) {\n        if (ev.data.length) {\n            strm.push(ev.data[0], ev.data[1]);\n            postMessage([ev.data[0].length]);\n        }\n        else\n            strm.flush();\n    };\n};\n// async stream attach\nvar astrmify = function (fns, strm, opts, init, id, flush, ext) {\n    var t;\n    var w = wrkr(fns, init, id, function (err, dat) {\n        if (err)\n            w.terminate(), strm.ondata.call(strm, err);\n        else if (!Array.isArray(dat))\n            ext(dat);\n        else if (dat.length == 1) {\n            strm.queuedSize -= dat[0];\n            if (strm.ondrain)\n                strm.ondrain(dat[0]);\n        }\n        else {\n            if (dat[1])\n                w.terminate();\n            strm.ondata.call(strm, err, dat[0], dat[1]);\n        }\n    });\n    w.postMessage(opts);\n    strm.queuedSize = 0;\n    strm.push = function (d, f) {\n        if (!strm.ondata)\n            err(5);\n        if (t)\n            strm.ondata(err(4, 0, 1), null, !!f);\n        strm.queuedSize += d.length;\n        w.postMessage([d, t = f], [d.buffer]);\n    };\n    strm.terminate = function () { w.terminate(); };\n    if (flush) {\n        strm.flush = function () { w.postMessage([]); };\n    }\n};\n// read 2 bytes\nvar b2 = function (d, b) { return d[b] | (d[b + 1] << 8); };\n// read 4 bytes\nvar b4 = function (d, b) { return (d[b] | (d[b + 1] << 8) | (d[b + 2] << 16) | (d[b + 3] << 24)) >>> 0; };\nvar b8 = function (d, b) { return b4(d, b) + (b4(d, b + 4) * 4294967296); };\n// write bytes\nvar wbytes = function (d, b, v) {\n    for (; v; ++b)\n        d[b] = v, v >>>= 8;\n};\n// gzip header\nvar gzh = function (c, o) {\n    var fn = o.filename;\n    c[0] = 31, c[1] = 139, c[2] = 8, c[8] = o.level < 2 ? 4 : o.level == 9 ? 2 : 0, c[9] = 3; // assume Unix\n    if (o.mtime != 0)\n        wbytes(c, 4, Math.floor(new Date(o.mtime || Date.now()) / 1000));\n    if (fn) {\n        c[3] = 8;\n        for (var i = 0; i <= fn.length; ++i)\n            c[i + 10] = fn.charCodeAt(i);\n    }\n};\n// gzip footer: -8 to -4 = CRC, -4 to -0 is length\n// gzip start\nvar gzs = function (d) {\n    if (d[0] != 31 || d[1] != 139 || d[2] != 8)\n        err(6, 'invalid gzip data');\n    var flg = d[3];\n    var st = 10;\n    if (flg & 4)\n        st += (d[10] | d[11] << 8) + 2;\n    for (var zs = (flg >> 3 & 1) + (flg >> 4 & 1); zs > 0; zs -= !d[st++])\n        ;\n    return st + (flg & 2);\n};\n// gzip length\nvar gzl = function (d) {\n    var l = d.length;\n    return (d[l - 4] | d[l - 3] << 8 | d[l - 2] << 16 | d[l - 1] << 24) >>> 0;\n};\n// gzip header length\nvar gzhl = function (o) { return 10 + (o.filename ? o.filename.length + 1 : 0); };\n// zlib header\nvar zlh = function (c, o) {\n    var lv = o.level, fl = lv == 0 ? 0 : lv < 6 ? 1 : lv == 9 ? 3 : 2;\n    c[0] = 120, c[1] = (fl << 6) | (o.dictionary && 32);\n    c[1] |= 31 - ((c[0] << 8) | c[1]) % 31;\n    if (o.dictionary) {\n        var h = adler();\n        h.p(o.dictionary);\n        wbytes(c, 2, h.d());\n    }\n};\n// zlib start\nvar zls = function (d, dict) {\n    if ((d[0] & 15) != 8 || (d[0] >> 4) > 7 || ((d[0] << 8 | d[1]) % 31))\n        err(6, 'invalid zlib data');\n    if ((d[1] >> 5 & 1) == +!dict)\n        err(6, 'invalid zlib data: ' + (d[1] & 32 ? 'need' : 'unexpected') + ' dictionary');\n    return (d[1] >> 3 & 4) + 2;\n};\nfunction StrmOpt(opts, cb) {\n    if (typeof opts == 'function')\n        cb = opts, opts = {};\n    this.ondata = cb;\n    return opts;\n}\n/**\n * Streaming DEFLATE compression\n */\nvar Deflate = /*#__PURE__*/ (function () {\n    function Deflate(opts, cb) {\n        if (typeof opts == 'function')\n            cb = opts, opts = {};\n        this.ondata = cb;\n        this.o = opts || {};\n        this.s = { l: 0, i: 32768, w: 32768, z: 32768 };\n        // Buffer length must always be 0 mod 32768 for index calculations to be correct when modifying head and prev\n        // 98304 = 32768 (lookback) + 65536 (common chunk size)\n        this.b = new u8(98304);\n        if (this.o.dictionary) {\n            var dict = this.o.dictionary.subarray(-32768);\n            this.b.set(dict, 32768 - dict.length);\n            this.s.i = 32768 - dict.length;\n        }\n    }\n    Deflate.prototype.p = function (c, f) {\n        this.ondata(dopt(c, this.o, 0, 0, this.s), f);\n    };\n    /**\n     * Pushes a chunk to be deflated\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Deflate.prototype.push = function (chunk, final) {\n        if (!this.ondata)\n            err(5);\n        if (this.s.l)\n            err(4);\n        var endLen = chunk.length + this.s.z;\n        if (endLen > this.b.length) {\n            if (endLen > 2 * this.b.length - 32768) {\n                var newBuf = new u8(endLen & -32768);\n                newBuf.set(this.b.subarray(0, this.s.z));\n                this.b = newBuf;\n            }\n            var split = this.b.length - this.s.z;\n            this.b.set(chunk.subarray(0, split), this.s.z);\n            this.s.z = this.b.length;\n            this.p(this.b, false);\n            this.b.set(this.b.subarray(-32768));\n            this.b.set(chunk.subarray(split), 32768);\n            this.s.z = chunk.length - split + 32768;\n            this.s.i = 32766, this.s.w = 32768;\n        }\n        else {\n            this.b.set(chunk, this.s.z);\n            this.s.z += chunk.length;\n        }\n        this.s.l = final & 1;\n        if (this.s.z > this.s.w + 8191 || final) {\n            this.p(this.b, final || false);\n            this.s.w = this.s.i, this.s.i -= 2;\n        }\n    };\n    /**\n     * Flushes buffered uncompressed data. Useful to immediately retrieve the\n     * deflated output for small inputs.\n     */\n    Deflate.prototype.flush = function () {\n        if (!this.ondata)\n            err(5);\n        if (this.s.l)\n            err(4);\n        this.p(this.b, false);\n        this.s.w = this.s.i, this.s.i -= 2;\n    };\n    return Deflate;\n}());\nexport { Deflate };\n/**\n * Asynchronous streaming DEFLATE compression\n */\nvar AsyncDeflate = /*#__PURE__*/ (function () {\n    function AsyncDeflate(opts, cb) {\n        astrmify([\n            bDflt,\n            function () { return [astrm, Deflate]; }\n        ], this, StrmOpt.call(this, opts, cb), function (ev) {\n            var strm = new Deflate(ev.data);\n            onmessage = astrm(strm);\n        }, 6, 1);\n    }\n    return AsyncDeflate;\n}());\nexport { AsyncDeflate };\nexport function deflate(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return cbify(data, opts, [\n        bDflt,\n    ], function (ev) { return pbf(deflateSync(ev.data[0], ev.data[1])); }, 0, cb);\n}\n/**\n * Compresses data with DEFLATE without any wrapper\n * @param data The data to compress\n * @param opts The compression options\n * @returns The deflated version of the data\n */\nexport function deflateSync(data, opts) {\n    return dopt(data, opts || {}, 0, 0);\n}\n/**\n * Streaming DEFLATE decompression\n */\nvar Inflate = /*#__PURE__*/ (function () {\n    function Inflate(opts, cb) {\n        // no StrmOpt here to avoid adding to workerizer\n        if (typeof opts == 'function')\n            cb = opts, opts = {};\n        this.ondata = cb;\n        var dict = opts && opts.dictionary && opts.dictionary.subarray(-32768);\n        this.s = { i: 0, b: dict ? dict.length : 0 };\n        this.o = new u8(32768);\n        this.p = new u8(0);\n        if (dict)\n            this.o.set(dict);\n    }\n    Inflate.prototype.e = function (c) {\n        if (!this.ondata)\n            err(5);\n        if (this.d)\n            err(4);\n        if (!this.p.length)\n            this.p = c;\n        else if (c.length) {\n            var n = new u8(this.p.length + c.length);\n            n.set(this.p), n.set(c, this.p.length), this.p = n;\n        }\n    };\n    Inflate.prototype.c = function (final) {\n        this.s.i = +(this.d = final || false);\n        var bts = this.s.b;\n        var dt = inflt(this.p, this.s, this.o);\n        this.ondata(slc(dt, bts, this.s.b), this.d);\n        this.o = slc(dt, this.s.b - 32768), this.s.b = this.o.length;\n        this.p = slc(this.p, (this.s.p / 8) | 0), this.s.p &= 7;\n    };\n    /**\n     * Pushes a chunk to be inflated\n     * @param chunk The chunk to push\n     * @param final Whether this is the final chunk\n     */\n    Inflate.prototype.push = function (chunk, final) {\n        this.e(chunk), this.c(final);\n    };\n    return Inflate;\n}());\nexport { Inflate };\n/**\n * Asynchronous streaming DEFLATE decompression\n */\nvar AsyncInflate = /*#__PURE__*/ (function () {\n    function AsyncInflate(opts, cb) {\n        astrmify([\n            bInflt,\n            function () { return [astrm, Inflate]; }\n        ], this, StrmOpt.call(this, opts, cb), function (ev) {\n            var strm = new Inflate(ev.data);\n            onmessage = astrm(strm);\n        }, 7, 0);\n    }\n    return AsyncInflate;\n}());\nexport { AsyncInflate };\nexport function inflate(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return cbify(data, opts, [\n        bInflt\n    ], function (ev) { return pbf(inflateSync(ev.data[0], gopt(ev.data[1]))); }, 1, cb);\n}\n/**\n * Expands DEFLATE data with no wrapper\n * @param data The data to decompress\n * @param opts The decompression options\n * @returns The decompressed version of the data\n */\nexport function inflateSync(data, opts) {\n    return inflt(data, { i: 2 }, opts && opts.out, opts && opts.dictionary);\n}\n// before you yell at me for not just using extends, my reason is that TS inheritance is hard to workerize.\n/**\n * Streaming GZIP compression\n */\nvar Gzip = /*#__PURE__*/ (function () {\n    function Gzip(opts, cb) {\n        this.c = crc();\n        this.l = 0;\n        this.v = 1;\n        Deflate.call(this, opts, cb);\n    }\n    /**\n     * Pushes a chunk to be GZIPped\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Gzip.prototype.push = function (chunk, final) {\n        this.c.p(chunk);\n        this.l += chunk.length;\n        Deflate.prototype.push.call(this, chunk, final);\n    };\n    Gzip.prototype.p = function (c, f) {\n        var raw = dopt(c, this.o, this.v && gzhl(this.o), f && 8, this.s);\n        if (this.v)\n            gzh(raw, this.o), this.v = 0;\n        if (f)\n            wbytes(raw, raw.length - 8, this.c.d()), wbytes(raw, raw.length - 4, this.l);\n        this.ondata(raw, f);\n    };\n    /**\n     * Flushes buffered uncompressed data. Useful to immediately retrieve the\n     * GZIPped output for small inputs.\n     */\n    Gzip.prototype.flush = function () {\n        Deflate.prototype.flush.call(this);\n    };\n    return Gzip;\n}());\nexport { Gzip };\n/**\n * Asynchronous streaming GZIP compression\n */\nvar AsyncGzip = /*#__PURE__*/ (function () {\n    function AsyncGzip(opts, cb) {\n        astrmify([\n            bDflt,\n            gze,\n            function () { return [astrm, Deflate, Gzip]; }\n        ], this, StrmOpt.call(this, opts, cb), function (ev) {\n            var strm = new Gzip(ev.data);\n            onmessage = astrm(strm);\n        }, 8, 1);\n    }\n    return AsyncGzip;\n}());\nexport { AsyncGzip };\nexport function gzip(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return cbify(data, opts, [\n        bDflt,\n        gze,\n        function () { return [gzipSync]; }\n    ], function (ev) { return pbf(gzipSync(ev.data[0], ev.data[1])); }, 2, cb);\n}\n/**\n * Compresses data with GZIP\n * @param data The data to compress\n * @param opts The compression options\n * @returns The gzipped version of the data\n */\nexport function gzipSync(data, opts) {\n    if (!opts)\n        opts = {};\n    var c = crc(), l = data.length;\n    c.p(data);\n    var d = dopt(data, opts, gzhl(opts), 8), s = d.length;\n    return gzh(d, opts), wbytes(d, s - 8, c.d()), wbytes(d, s - 4, l), d;\n}\n/**\n * Streaming single or multi-member GZIP decompression\n */\nvar Gunzip = /*#__PURE__*/ (function () {\n    function Gunzip(opts, cb) {\n        this.v = 1;\n        this.r = 0;\n        Inflate.call(this, opts, cb);\n    }\n    /**\n     * Pushes a chunk to be GUNZIPped\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Gunzip.prototype.push = function (chunk, final) {\n        Inflate.prototype.e.call(this, chunk);\n        this.r += chunk.length;\n        if (this.v) {\n            var p = this.p.subarray(this.v - 1);\n            var s = p.length > 3 ? gzs(p) : 4;\n            if (s > p.length) {\n                if (!final)\n                    return;\n            }\n            else if (this.v > 1 && this.onmember) {\n                this.onmember(this.r - p.length);\n            }\n            this.p = p.subarray(s), this.v = 0;\n        }\n        // necessary to prevent TS from using the closure value\n        // This allows for workerization to function correctly\n        Inflate.prototype.c.call(this, final);\n        // process concatenated GZIP\n        if (this.s.f && !this.s.l && !final) {\n            this.v = shft(this.s.p) + 9;\n            this.s = { i: 0 };\n            this.o = new u8(0);\n            this.push(new u8(0), final);\n        }\n    };\n    return Gunzip;\n}());\nexport { Gunzip };\n/**\n * Asynchronous streaming single or multi-member GZIP decompression\n */\nvar AsyncGunzip = /*#__PURE__*/ (function () {\n    function AsyncGunzip(opts, cb) {\n        var _this = this;\n        astrmify([\n            bInflt,\n            guze,\n            function () { return [astrm, Inflate, Gunzip]; }\n        ], this, StrmOpt.call(this, opts, cb), function (ev) {\n            var strm = new Gunzip(ev.data);\n            strm.onmember = function (offset) { return postMessage(offset); };\n            onmessage = astrm(strm);\n        }, 9, 0, function (offset) { return _this.onmember && _this.onmember(offset); });\n    }\n    return AsyncGunzip;\n}());\nexport { AsyncGunzip };\nexport function gunzip(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return cbify(data, opts, [\n        bInflt,\n        guze,\n        function () { return [gunzipSync]; }\n    ], function (ev) { return pbf(gunzipSync(ev.data[0], ev.data[1])); }, 3, cb);\n}\n/**\n * Expands GZIP data\n * @param data The data to decompress\n * @param opts The decompression options\n * @returns The decompressed version of the data\n */\nexport function gunzipSync(data, opts) {\n    var st = gzs(data);\n    if (st + 8 > data.length)\n        err(6, 'invalid gzip data');\n    return inflt(data.subarray(st, -8), { i: 2 }, opts && opts.out || new u8(gzl(data)), opts && opts.dictionary);\n}\n/**\n * Streaming Zlib compression\n */\nvar Zlib = /*#__PURE__*/ (function () {\n    function Zlib(opts, cb) {\n        this.c = adler();\n        this.v = 1;\n        Deflate.call(this, opts, cb);\n    }\n    /**\n     * Pushes a chunk to be zlibbed\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Zlib.prototype.push = function (chunk, final) {\n        this.c.p(chunk);\n        Deflate.prototype.push.call(this, chunk, final);\n    };\n    Zlib.prototype.p = function (c, f) {\n        var raw = dopt(c, this.o, this.v && (this.o.dictionary ? 6 : 2), f && 4, this.s);\n        if (this.v)\n            zlh(raw, this.o), this.v = 0;\n        if (f)\n            wbytes(raw, raw.length - 4, this.c.d());\n        this.ondata(raw, f);\n    };\n    /**\n     * Flushes buffered uncompressed data. Useful to immediately retrieve the\n     * zlibbed output for small inputs.\n     */\n    Zlib.prototype.flush = function () {\n        Deflate.prototype.flush.call(this);\n    };\n    return Zlib;\n}());\nexport { Zlib };\n/**\n * Asynchronous streaming Zlib compression\n */\nvar AsyncZlib = /*#__PURE__*/ (function () {\n    function AsyncZlib(opts, cb) {\n        astrmify([\n            bDflt,\n            zle,\n            function () { return [astrm, Deflate, Zlib]; }\n        ], this, StrmOpt.call(this, opts, cb), function (ev) {\n            var strm = new Zlib(ev.data);\n            onmessage = astrm(strm);\n        }, 10, 1);\n    }\n    return AsyncZlib;\n}());\nexport { AsyncZlib };\nexport function zlib(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return cbify(data, opts, [\n        bDflt,\n        zle,\n        function () { return [zlibSync]; }\n    ], function (ev) { return pbf(zlibSync(ev.data[0], ev.data[1])); }, 4, cb);\n}\n/**\n * Compress data with Zlib\n * @param data The data to compress\n * @param opts The compression options\n * @returns The zlib-compressed version of the data\n */\nexport function zlibSync(data, opts) {\n    if (!opts)\n        opts = {};\n    var a = adler();\n    a.p(data);\n    var d = dopt(data, opts, opts.dictionary ? 6 : 2, 4);\n    return zlh(d, opts), wbytes(d, d.length - 4, a.d()), d;\n}\n/**\n * Streaming Zlib decompression\n */\nvar Unzlib = /*#__PURE__*/ (function () {\n    function Unzlib(opts, cb) {\n        Inflate.call(this, opts, cb);\n        this.v = opts && opts.dictionary ? 2 : 1;\n    }\n    /**\n     * Pushes a chunk to be unzlibbed\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Unzlib.prototype.push = function (chunk, final) {\n        Inflate.prototype.e.call(this, chunk);\n        if (this.v) {\n            if (this.p.length < 6 && !final)\n                return;\n            this.p = this.p.subarray(zls(this.p, this.v - 1)), this.v = 0;\n        }\n        if (final) {\n            if (this.p.length < 4)\n                err(6, 'invalid zlib data');\n            this.p = this.p.subarray(0, -4);\n        }\n        // necessary to prevent TS from using the closure value\n        // This allows for workerization to function correctly\n        Inflate.prototype.c.call(this, final);\n    };\n    return Unzlib;\n}());\nexport { Unzlib };\n/**\n * Asynchronous streaming Zlib decompression\n */\nvar AsyncUnzlib = /*#__PURE__*/ (function () {\n    function AsyncUnzlib(opts, cb) {\n        astrmify([\n            bInflt,\n            zule,\n            function () { return [astrm, Inflate, Unzlib]; }\n        ], this, StrmOpt.call(this, opts, cb), function (ev) {\n            var strm = new Unzlib(ev.data);\n            onmessage = astrm(strm);\n        }, 11, 0);\n    }\n    return AsyncUnzlib;\n}());\nexport { AsyncUnzlib };\nexport function unzlib(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return cbify(data, opts, [\n        bInflt,\n        zule,\n        function () { return [unzlibSync]; }\n    ], function (ev) { return pbf(unzlibSync(ev.data[0], gopt(ev.data[1]))); }, 5, cb);\n}\n/**\n * Expands Zlib data\n * @param data The data to decompress\n * @param opts The decompression options\n * @returns The decompressed version of the data\n */\nexport function unzlibSync(data, opts) {\n    return inflt(data.subarray(zls(data, opts && opts.dictionary), -4), { i: 2 }, opts && opts.out, opts && opts.dictionary);\n}\n// Default algorithm for compression (used because having a known output size allows faster decompression)\nexport { gzip as compress, AsyncGzip as AsyncCompress };\nexport { gzipSync as compressSync, Gzip as Compress };\n/**\n * Streaming GZIP, Zlib, or raw DEFLATE decompression\n */\nvar Decompress = /*#__PURE__*/ (function () {\n    function Decompress(opts, cb) {\n        this.o = StrmOpt.call(this, opts, cb) || {};\n        this.G = Gunzip;\n        this.I = Inflate;\n        this.Z = Unzlib;\n    }\n    // init substream\n    // overriden by AsyncDecompress\n    Decompress.prototype.i = function () {\n        var _this = this;\n        this.s.ondata = function (dat, final) {\n            _this.ondata(dat, final);\n        };\n    };\n    /**\n     * Pushes a chunk to be decompressed\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Decompress.prototype.push = function (chunk, final) {\n        if (!this.ondata)\n            err(5);\n        if (!this.s) {\n            if (this.p && this.p.length) {\n                var n = new u8(this.p.length + chunk.length);\n                n.set(this.p), n.set(chunk, this.p.length);\n            }\n            else\n                this.p = chunk;\n            if (this.p.length > 2) {\n                this.s = (this.p[0] == 31 && this.p[1] == 139 && this.p[2] == 8)\n                    ? new this.G(this.o)\n                    : ((this.p[0] & 15) != 8 || (this.p[0] >> 4) > 7 || ((this.p[0] << 8 | this.p[1]) % 31))\n                        ? new this.I(this.o)\n                        : new this.Z(this.o);\n                this.i();\n                this.s.push(this.p, final);\n                this.p = null;\n            }\n        }\n        else\n            this.s.push(chunk, final);\n    };\n    return Decompress;\n}());\nexport { Decompress };\n/**\n * Asynchronous streaming GZIP, Zlib, or raw DEFLATE decompression\n */\nvar AsyncDecompress = /*#__PURE__*/ (function () {\n    function AsyncDecompress(opts, cb) {\n        Decompress.call(this, opts, cb);\n        this.queuedSize = 0;\n        this.G = AsyncGunzip;\n        this.I = AsyncInflate;\n        this.Z = AsyncUnzlib;\n    }\n    AsyncDecompress.prototype.i = function () {\n        var _this = this;\n        this.s.ondata = function (err, dat, final) {\n            _this.ondata(err, dat, final);\n        };\n        this.s.ondrain = function (size) {\n            _this.queuedSize -= size;\n            if (_this.ondrain)\n                _this.ondrain(size);\n        };\n    };\n    /**\n     * Pushes a chunk to be decompressed\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    AsyncDecompress.prototype.push = function (chunk, final) {\n        this.queuedSize += chunk.length;\n        Decompress.prototype.push.call(this, chunk, final);\n    };\n    return AsyncDecompress;\n}());\nexport { AsyncDecompress };\nexport function decompress(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return (data[0] == 31 && data[1] == 139 && data[2] == 8)\n        ? gunzip(data, opts, cb)\n        : ((data[0] & 15) != 8 || (data[0] >> 4) > 7 || ((data[0] << 8 | data[1]) % 31))\n            ? inflate(data, opts, cb)\n            : unzlib(data, opts, cb);\n}\n/**\n * Expands compressed GZIP, Zlib, or raw DEFLATE data, automatically detecting the format\n * @param data The data to decompress\n * @param opts The decompression options\n * @returns The decompressed version of the data\n */\nexport function decompressSync(data, opts) {\n    return (data[0] == 31 && data[1] == 139 && data[2] == 8)\n        ? gunzipSync(data, opts)\n        : ((data[0] & 15) != 8 || (data[0] >> 4) > 7 || ((data[0] << 8 | data[1]) % 31))\n            ? inflateSync(data, opts)\n            : unzlibSync(data, opts);\n}\n// flatten a directory structure\nvar fltn = function (d, p, t, o) {\n    for (var k in d) {\n        var val = d[k], n = p + k, op = o;\n        if (Array.isArray(val))\n            op = mrg(o, val[1]), val = val[0];\n        if (val instanceof u8)\n            t[n] = [val, op];\n        else {\n            t[n += '/'] = [new u8(0), op];\n            fltn(val, n, t, o);\n        }\n    }\n};\n// text encoder\nvar te = typeof TextEncoder != 'undefined' && /*#__PURE__*/ new TextEncoder();\n// text decoder\nvar td = typeof TextDecoder != 'undefined' && /*#__PURE__*/ new TextDecoder();\n// text decoder stream\nvar tds = 0;\ntry {\n    td.decode(et, { stream: true });\n    tds = 1;\n}\ncatch (e) { }\n// decode UTF8\nvar dutf8 = function (d) {\n    for (var r = '', i = 0;;) {\n        var c = d[i++];\n        var eb = (c > 127) + (c > 223) + (c > 239);\n        if (i + eb > d.length)\n            return { s: r, r: slc(d, i - 1) };\n        if (!eb)\n            r += String.fromCharCode(c);\n        else if (eb == 3) {\n            c = ((c & 15) << 18 | (d[i++] & 63) << 12 | (d[i++] & 63) << 6 | (d[i++] & 63)) - 65536,\n                r += String.fromCharCode(55296 | (c >> 10), 56320 | (c & 1023));\n        }\n        else if (eb & 1)\n            r += String.fromCharCode((c & 31) << 6 | (d[i++] & 63));\n        else\n            r += String.fromCharCode((c & 15) << 12 | (d[i++] & 63) << 6 | (d[i++] & 63));\n    }\n};\n/**\n * Streaming UTF-8 decoding\n */\nvar DecodeUTF8 = /*#__PURE__*/ (function () {\n    /**\n     * Creates a UTF-8 decoding stream\n     * @param cb The callback to call whenever data is decoded\n     */\n    function DecodeUTF8(cb) {\n        this.ondata = cb;\n        if (tds)\n            this.t = new TextDecoder();\n        else\n            this.p = et;\n    }\n    /**\n     * Pushes a chunk to be decoded from UTF-8 binary\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    DecodeUTF8.prototype.push = function (chunk, final) {\n        if (!this.ondata)\n            err(5);\n        final = !!final;\n        if (this.t) {\n            this.ondata(this.t.decode(chunk, { stream: true }), final);\n            if (final) {\n                if (this.t.decode().length)\n                    err(8);\n                this.t = null;\n            }\n            return;\n        }\n        if (!this.p)\n            err(4);\n        var dat = new u8(this.p.length + chunk.length);\n        dat.set(this.p);\n        dat.set(chunk, this.p.length);\n        var _a = dutf8(dat), s = _a.s, r = _a.r;\n        if (final) {\n            if (r.length)\n                err(8);\n            this.p = null;\n        }\n        else\n            this.p = r;\n        this.ondata(s, final);\n    };\n    return DecodeUTF8;\n}());\nexport { DecodeUTF8 };\n/**\n * Streaming UTF-8 encoding\n */\nvar EncodeUTF8 = /*#__PURE__*/ (function () {\n    /**\n     * Creates a UTF-8 decoding stream\n     * @param cb The callback to call whenever data is encoded\n     */\n    function EncodeUTF8(cb) {\n        this.ondata = cb;\n    }\n    /**\n     * Pushes a chunk to be encoded to UTF-8\n     * @param chunk The string data to push\n     * @param final Whether this is the last chunk\n     */\n    EncodeUTF8.prototype.push = function (chunk, final) {\n        if (!this.ondata)\n            err(5);\n        if (this.d)\n            err(4);\n        this.ondata(strToU8(chunk), this.d = final || false);\n    };\n    return EncodeUTF8;\n}());\nexport { EncodeUTF8 };\n/**\n * Converts a string into a Uint8Array for use with compression/decompression methods\n * @param str The string to encode\n * @param latin1 Whether or not to interpret the data as Latin-1. This should\n *               not need to be true unless decoding a binary string.\n * @returns The string encoded in UTF-8/Latin-1 binary\n */\nexport function strToU8(str, latin1) {\n    if (latin1) {\n        var ar_1 = new u8(str.length);\n        for (var i = 0; i < str.length; ++i)\n            ar_1[i] = str.charCodeAt(i);\n        return ar_1;\n    }\n    if (te)\n        return te.encode(str);\n    var l = str.length;\n    var ar = new u8(str.length + (str.length >> 1));\n    var ai = 0;\n    var w = function (v) { ar[ai++] = v; };\n    for (var i = 0; i < l; ++i) {\n        if (ai + 5 > ar.length) {\n            var n = new u8(ai + 8 + ((l - i) << 1));\n            n.set(ar);\n            ar = n;\n        }\n        var c = str.charCodeAt(i);\n        if (c < 128 || latin1)\n            w(c);\n        else if (c < 2048)\n            w(192 | (c >> 6)), w(128 | (c & 63));\n        else if (c > 55295 && c < 57344)\n            c = 65536 + (c & 1023 << 10) | (str.charCodeAt(++i) & 1023),\n                w(240 | (c >> 18)), w(128 | ((c >> 12) & 63)), w(128 | ((c >> 6) & 63)), w(128 | (c & 63));\n        else\n            w(224 | (c >> 12)), w(128 | ((c >> 6) & 63)), w(128 | (c & 63));\n    }\n    return slc(ar, 0, ai);\n}\n/**\n * Converts a Uint8Array to a string\n * @param dat The data to decode to string\n * @param latin1 Whether or not to interpret the data as Latin-1. This should\n *               not need to be true unless encoding to binary string.\n * @returns The original UTF-8/Latin-1 string\n */\nexport function strFromU8(dat, latin1) {\n    if (latin1) {\n        var r = '';\n        for (var i = 0; i < dat.length; i += 16384)\n            r += String.fromCharCode.apply(null, dat.subarray(i, i + 16384));\n        return r;\n    }\n    else if (td) {\n        return td.decode(dat);\n    }\n    else {\n        var _a = dutf8(dat), s = _a.s, r = _a.r;\n        if (r.length)\n            err(8);\n        return s;\n    }\n}\n;\n// deflate bit flag\nvar dbf = function (l) { return l == 1 ? 3 : l < 6 ? 2 : l == 9 ? 1 : 0; };\n// skip local zip header\nvar slzh = function (d, b) { return b + 30 + b2(d, b + 26) + b2(d, b + 28); };\n// read zip header\nvar zh = function (d, b, z) {\n    var fnl = b2(d, b + 28), fn = strFromU8(d.subarray(b + 46, b + 46 + fnl), !(b2(d, b + 8) & 2048)), es = b + 46 + fnl, bs = b4(d, b + 20);\n    var _a = z && bs == 4294967295 ? z64e(d, es) : [bs, b4(d, b + 24), b4(d, b + 42)], sc = _a[0], su = _a[1], off = _a[2];\n    return [b2(d, b + 10), sc, su, fn, es + b2(d, b + 30) + b2(d, b + 32), off];\n};\n// read zip64 extra field\nvar z64e = function (d, b) {\n    for (; b2(d, b) != 1; b += 4 + b2(d, b + 2))\n        ;\n    return [b8(d, b + 12), b8(d, b + 4), b8(d, b + 20)];\n};\n// extra field length\nvar exfl = function (ex) {\n    var le = 0;\n    if (ex) {\n        for (var k in ex) {\n            var l = ex[k].length;\n            if (l > 65535)\n                err(9);\n            le += l + 4;\n        }\n    }\n    return le;\n};\n// write zip header\nvar wzh = function (d, b, f, fn, u, c, ce, co) {\n    var fl = fn.length, ex = f.extra, col = co && co.length;\n    var exl = exfl(ex);\n    wbytes(d, b, ce != null ? 0x2014B50 : 0x4034B50), b += 4;\n    if (ce != null)\n        d[b++] = 20, d[b++] = f.os;\n    d[b] = 20, b += 2; // spec compliance? what's that?\n    d[b++] = (f.flag << 1) | (c < 0 && 8), d[b++] = u && 8;\n    d[b++] = f.compression & 255, d[b++] = f.compression >> 8;\n    var dt = new Date(f.mtime == null ? Date.now() : f.mtime), y = dt.getFullYear() - 1980;\n    if (y < 0 || y > 119)\n        err(10);\n    wbytes(d, b, (y << 25) | ((dt.getMonth() + 1) << 21) | (dt.getDate() << 16) | (dt.getHours() << 11) | (dt.getMinutes() << 5) | (dt.getSeconds() >> 1)), b += 4;\n    if (c != -1) {\n        wbytes(d, b, f.crc);\n        wbytes(d, b + 4, c < 0 ? -c - 2 : c);\n        wbytes(d, b + 8, f.size);\n    }\n    wbytes(d, b + 12, fl);\n    wbytes(d, b + 14, exl), b += 16;\n    if (ce != null) {\n        wbytes(d, b, col);\n        wbytes(d, b + 6, f.attrs);\n        wbytes(d, b + 10, ce), b += 14;\n    }\n    d.set(fn, b);\n    b += fl;\n    if (exl) {\n        for (var k in ex) {\n            var exf = ex[k], l = exf.length;\n            wbytes(d, b, +k);\n            wbytes(d, b + 2, l);\n            d.set(exf, b + 4), b += 4 + l;\n        }\n    }\n    if (col)\n        d.set(co, b), b += col;\n    return b;\n};\n// write zip footer (end of central directory)\nvar wzf = function (o, b, c, d, e) {\n    wbytes(o, b, 0x6054B50); // skip disk\n    wbytes(o, b + 8, c);\n    wbytes(o, b + 10, c);\n    wbytes(o, b + 12, d);\n    wbytes(o, b + 16, e);\n};\n/**\n * A pass-through stream to keep data uncompressed in a ZIP archive.\n */\nvar ZipPassThrough = /*#__PURE__*/ (function () {\n    /**\n     * Creates a pass-through stream that can be added to ZIP archives\n     * @param filename The filename to associate with this data stream\n     */\n    function ZipPassThrough(filename) {\n        this.filename = filename;\n        this.c = crc();\n        this.size = 0;\n        this.compression = 0;\n    }\n    /**\n     * Processes a chunk and pushes to the output stream. You can override this\n     * method in a subclass for custom behavior, but by default this passes\n     * the data through. You must call this.ondata(err, chunk, final) at some\n     * point in this method.\n     * @param chunk The chunk to process\n     * @param final Whether this is the last chunk\n     */\n    ZipPassThrough.prototype.process = function (chunk, final) {\n        this.ondata(null, chunk, final);\n    };\n    /**\n     * Pushes a chunk to be added. If you are subclassing this with a custom\n     * compression algorithm, note that you must push data from the source\n     * file only, pre-compression.\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    ZipPassThrough.prototype.push = function (chunk, final) {\n        if (!this.ondata)\n            err(5);\n        this.c.p(chunk);\n        this.size += chunk.length;\n        if (final)\n            this.crc = this.c.d();\n        this.process(chunk, final || false);\n    };\n    return ZipPassThrough;\n}());\nexport { ZipPassThrough };\n// I don't extend because TypeScript extension adds 1kB of runtime bloat\n/**\n * Streaming DEFLATE compression for ZIP archives. Prefer using AsyncZipDeflate\n * for better performance\n */\nvar ZipDeflate = /*#__PURE__*/ (function () {\n    /**\n     * Creates a DEFLATE stream that can be added to ZIP archives\n     * @param filename The filename to associate with this data stream\n     * @param opts The compression options\n     */\n    function ZipDeflate(filename, opts) {\n        var _this = this;\n        if (!opts)\n            opts = {};\n        ZipPassThrough.call(this, filename);\n        this.d = new Deflate(opts, function (dat, final) {\n            _this.ondata(null, dat, final);\n        });\n        this.compression = 8;\n        this.flag = dbf(opts.level);\n    }\n    ZipDeflate.prototype.process = function (chunk, final) {\n        try {\n            this.d.push(chunk, final);\n        }\n        catch (e) {\n            this.ondata(e, null, final);\n        }\n    };\n    /**\n     * Pushes a chunk to be deflated\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    ZipDeflate.prototype.push = function (chunk, final) {\n        ZipPassThrough.prototype.push.call(this, chunk, final);\n    };\n    return ZipDeflate;\n}());\nexport { ZipDeflate };\n/**\n * Asynchronous streaming DEFLATE compression for ZIP archives\n */\nvar AsyncZipDeflate = /*#__PURE__*/ (function () {\n    /**\n     * Creates an asynchronous DEFLATE stream that can be added to ZIP archives\n     * @param filename The filename to associate with this data stream\n     * @param opts The compression options\n     */\n    function AsyncZipDeflate(filename, opts) {\n        var _this = this;\n        if (!opts)\n            opts = {};\n        ZipPassThrough.call(this, filename);\n        this.d = new AsyncDeflate(opts, function (err, dat, final) {\n            _this.ondata(err, dat, final);\n        });\n        this.compression = 8;\n        this.flag = dbf(opts.level);\n        this.terminate = this.d.terminate;\n    }\n    AsyncZipDeflate.prototype.process = function (chunk, final) {\n        this.d.push(chunk, final);\n    };\n    /**\n     * Pushes a chunk to be deflated\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    AsyncZipDeflate.prototype.push = function (chunk, final) {\n        ZipPassThrough.prototype.push.call(this, chunk, final);\n    };\n    return AsyncZipDeflate;\n}());\nexport { AsyncZipDeflate };\n// TODO: Better tree shaking\n/**\n * A zippable archive to which files can incrementally be added\n */\nvar Zip = /*#__PURE__*/ (function () {\n    /**\n     * Creates an empty ZIP archive to which files can be added\n     * @param cb The callback to call whenever data for the generated ZIP archive\n     *           is available\n     */\n    function Zip(cb) {\n        this.ondata = cb;\n        this.u = [];\n        this.d = 1;\n    }\n    /**\n     * Adds a file to the ZIP archive\n     * @param file The file stream to add\n     */\n    Zip.prototype.add = function (file) {\n        var _this = this;\n        if (!this.ondata)\n            err(5);\n        // finishing or finished\n        if (this.d & 2)\n            this.ondata(err(4 + (this.d & 1) * 8, 0, 1), null, false);\n        else {\n            var f = strToU8(file.filename), fl_1 = f.length;\n            var com = file.comment, o = com && strToU8(com);\n            var u = fl_1 != file.filename.length || (o && (com.length != o.length));\n            var hl_1 = fl_1 + exfl(file.extra) + 30;\n            if (fl_1 > 65535)\n                this.ondata(err(11, 0, 1), null, false);\n            var header = new u8(hl_1);\n            wzh(header, 0, file, f, u, -1);\n            var chks_1 = [header];\n            var pAll_1 = function () {\n                for (var _i = 0, chks_2 = chks_1; _i < chks_2.length; _i++) {\n                    var chk = chks_2[_i];\n                    _this.ondata(null, chk, false);\n                }\n                chks_1 = [];\n            };\n            var tr_1 = this.d;\n            this.d = 0;\n            var ind_1 = this.u.length;\n            var uf_1 = mrg(file, {\n                f: f,\n                u: u,\n                o: o,\n                t: function () {\n                    if (file.terminate)\n                        file.terminate();\n                },\n                r: function () {\n                    pAll_1();\n                    if (tr_1) {\n                        var nxt = _this.u[ind_1 + 1];\n                        if (nxt)\n                            nxt.r();\n                        else\n                            _this.d = 1;\n                    }\n                    tr_1 = 1;\n                }\n            });\n            var cl_1 = 0;\n            file.ondata = function (err, dat, final) {\n                if (err) {\n                    _this.ondata(err, dat, final);\n                    _this.terminate();\n                }\n                else {\n                    cl_1 += dat.length;\n                    chks_1.push(dat);\n                    if (final) {\n                        var dd = new u8(16);\n                        wbytes(dd, 0, 0x8074B50);\n                        wbytes(dd, 4, file.crc);\n                        wbytes(dd, 8, cl_1);\n                        wbytes(dd, 12, file.size);\n                        chks_1.push(dd);\n                        uf_1.c = cl_1, uf_1.b = hl_1 + cl_1 + 16, uf_1.crc = file.crc, uf_1.size = file.size;\n                        if (tr_1)\n                            uf_1.r();\n                        tr_1 = 1;\n                    }\n                    else if (tr_1)\n                        pAll_1();\n                }\n            };\n            this.u.push(uf_1);\n        }\n    };\n    /**\n     * Ends the process of adding files and prepares to emit the final chunks.\n     * This *must* be called after adding all desired files for the resulting\n     * ZIP file to work properly.\n     */\n    Zip.prototype.end = function () {\n        var _this = this;\n        if (this.d & 2) {\n            this.ondata(err(4 + (this.d & 1) * 8, 0, 1), null, true);\n            return;\n        }\n        if (this.d)\n            this.e();\n        else\n            this.u.push({\n                r: function () {\n                    if (!(_this.d & 1))\n                        return;\n                    _this.u.splice(-1, 1);\n                    _this.e();\n                },\n                t: function () { }\n            });\n        this.d = 3;\n    };\n    Zip.prototype.e = function () {\n        var bt = 0, l = 0, tl = 0;\n        for (var _i = 0, _a = this.u; _i < _a.length; _i++) {\n            var f = _a[_i];\n            tl += 46 + f.f.length + exfl(f.extra) + (f.o ? f.o.length : 0);\n        }\n        var out = new u8(tl + 22);\n        for (var _b = 0, _c = this.u; _b < _c.length; _b++) {\n            var f = _c[_b];\n            wzh(out, bt, f, f.f, f.u, -f.c - 2, l, f.o);\n            bt += 46 + f.f.length + exfl(f.extra) + (f.o ? f.o.length : 0), l += f.b;\n        }\n        wzf(out, bt, this.u.length, tl, l);\n        this.ondata(null, out, true);\n        this.d = 2;\n    };\n    /**\n     * A method to terminate any internal workers used by the stream. Subsequent\n     * calls to add() will fail.\n     */\n    Zip.prototype.terminate = function () {\n        for (var _i = 0, _a = this.u; _i < _a.length; _i++) {\n            var f = _a[_i];\n            f.t();\n        }\n        this.d = 2;\n    };\n    return Zip;\n}());\nexport { Zip };\nexport function zip(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    var r = {};\n    fltn(data, '', r, opts);\n    var k = Object.keys(r);\n    var lft = k.length, o = 0, tot = 0;\n    var slft = lft, files = new Array(lft);\n    var term = [];\n    var tAll = function () {\n        for (var i = 0; i < term.length; ++i)\n            term[i]();\n    };\n    var cbd = function (a, b) {\n        mt(function () { cb(a, b); });\n    };\n    mt(function () { cbd = cb; });\n    var cbf = function () {\n        var out = new u8(tot + 22), oe = o, cdl = tot - o;\n        tot = 0;\n        for (var i = 0; i < slft; ++i) {\n            var f = files[i];\n            try {\n                var l = f.c.length;\n                wzh(out, tot, f, f.f, f.u, l);\n                var badd = 30 + f.f.length + exfl(f.extra);\n                var loc = tot + badd;\n                out.set(f.c, loc);\n                wzh(out, o, f, f.f, f.u, l, tot, f.m), o += 16 + badd + (f.m ? f.m.length : 0), tot = loc + l;\n            }\n            catch (e) {\n                return cbd(e, null);\n            }\n        }\n        wzf(out, o, files.length, cdl, oe);\n        cbd(null, out);\n    };\n    if (!lft)\n        cbf();\n    var _loop_1 = function (i) {\n        var fn = k[i];\n        var _a = r[fn], file = _a[0], p = _a[1];\n        var c = crc(), size = file.length;\n        c.p(file);\n        var f = strToU8(fn), s = f.length;\n        var com = p.comment, m = com && strToU8(com), ms = m && m.length;\n        var exl = exfl(p.extra);\n        var compression = p.level == 0 ? 0 : 8;\n        var cbl = function (e, d) {\n            if (e) {\n                tAll();\n                cbd(e, null);\n            }\n            else {\n                var l = d.length;\n                files[i] = mrg(p, {\n                    size: size,\n                    crc: c.d(),\n                    c: d,\n                    f: f,\n                    m: m,\n                    u: s != fn.length || (m && (com.length != ms)),\n                    compression: compression\n                });\n                o += 30 + s + exl + l;\n                tot += 76 + 2 * (s + exl) + (ms || 0) + l;\n                if (!--lft)\n                    cbf();\n            }\n        };\n        if (s > 65535)\n            cbl(err(11, 0, 1), null);\n        if (!compression)\n            cbl(null, file);\n        else if (size < 160000) {\n            try {\n                cbl(null, deflateSync(file, p));\n            }\n            catch (e) {\n                cbl(e, null);\n            }\n        }\n        else\n            term.push(deflate(file, p, cbl));\n    };\n    // Cannot use lft because it can decrease\n    for (var i = 0; i < slft; ++i) {\n        _loop_1(i);\n    }\n    return tAll;\n}\n/**\n * Synchronously creates a ZIP file. Prefer using `zip` for better performance\n * with more than one file.\n * @param data The directory structure for the ZIP archive\n * @param opts The main options, merged with per-file options\n * @returns The generated ZIP archive\n */\nexport function zipSync(data, opts) {\n    if (!opts)\n        opts = {};\n    var r = {};\n    var files = [];\n    fltn(data, '', r, opts);\n    var o = 0;\n    var tot = 0;\n    for (var fn in r) {\n        var _a = r[fn], file = _a[0], p = _a[1];\n        var compression = p.level == 0 ? 0 : 8;\n        var f = strToU8(fn), s = f.length;\n        var com = p.comment, m = com && strToU8(com), ms = m && m.length;\n        var exl = exfl(p.extra);\n        if (s > 65535)\n            err(11);\n        var d = compression ? deflateSync(file, p) : file, l = d.length;\n        var c = crc();\n        c.p(file);\n        files.push(mrg(p, {\n            size: file.length,\n            crc: c.d(),\n            c: d,\n            f: f,\n            m: m,\n            u: s != fn.length || (m && (com.length != ms)),\n            o: o,\n            compression: compression\n        }));\n        o += 30 + s + exl + l;\n        tot += 76 + 2 * (s + exl) + (ms || 0) + l;\n    }\n    var out = new u8(tot + 22), oe = o, cdl = tot - o;\n    for (var i = 0; i < files.length; ++i) {\n        var f = files[i];\n        wzh(out, f.o, f, f.f, f.u, f.c.length);\n        var badd = 30 + f.f.length + exfl(f.extra);\n        out.set(f.c, f.o + badd);\n        wzh(out, o, f, f.f, f.u, f.c.length, f.o, f.m), o += 16 + badd + (f.m ? f.m.length : 0);\n    }\n    wzf(out, o, files.length, cdl, oe);\n    return out;\n}\n/**\n * Streaming pass-through decompression for ZIP archives\n */\nvar UnzipPassThrough = /*#__PURE__*/ (function () {\n    function UnzipPassThrough() {\n    }\n    UnzipPassThrough.prototype.push = function (data, final) {\n        this.ondata(null, data, final);\n    };\n    UnzipPassThrough.compression = 0;\n    return UnzipPassThrough;\n}());\nexport { UnzipPassThrough };\n/**\n * Streaming DEFLATE decompression for ZIP archives. Prefer AsyncZipInflate for\n * better performance.\n */\nvar UnzipInflate = /*#__PURE__*/ (function () {\n    /**\n     * Creates a DEFLATE decompression that can be used in ZIP archives\n     */\n    function UnzipInflate() {\n        var _this = this;\n        this.i = new Inflate(function (dat, final) {\n            _this.ondata(null, dat, final);\n        });\n    }\n    UnzipInflate.prototype.push = function (data, final) {\n        try {\n            this.i.push(data, final);\n        }\n        catch (e) {\n            this.ondata(e, null, final);\n        }\n    };\n    UnzipInflate.compression = 8;\n    return UnzipInflate;\n}());\nexport { UnzipInflate };\n/**\n * Asynchronous streaming DEFLATE decompression for ZIP archives\n */\nvar AsyncUnzipInflate = /*#__PURE__*/ (function () {\n    /**\n     * Creates a DEFLATE decompression that can be used in ZIP archives\n     */\n    function AsyncUnzipInflate(_, sz) {\n        var _this = this;\n        if (sz < 320000) {\n            this.i = new Inflate(function (dat, final) {\n                _this.ondata(null, dat, final);\n            });\n        }\n        else {\n            this.i = new AsyncInflate(function (err, dat, final) {\n                _this.ondata(err, dat, final);\n            });\n            this.terminate = this.i.terminate;\n        }\n    }\n    AsyncUnzipInflate.prototype.push = function (data, final) {\n        if (this.i.terminate)\n            data = slc(data, 0);\n        this.i.push(data, final);\n    };\n    AsyncUnzipInflate.compression = 8;\n    return AsyncUnzipInflate;\n}());\nexport { AsyncUnzipInflate };\n/**\n * A ZIP archive decompression stream that emits files as they are discovered\n */\nvar Unzip = /*#__PURE__*/ (function () {\n    /**\n     * Creates a ZIP decompression stream\n     * @param cb The callback to call whenever a file in the ZIP archive is found\n     */\n    function Unzip(cb) {\n        this.onfile = cb;\n        this.k = [];\n        this.o = {\n            0: UnzipPassThrough\n        };\n        this.p = et;\n    }\n    /**\n     * Pushes a chunk to be unzipped\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Unzip.prototype.push = function (chunk, final) {\n        var _this = this;\n        if (!this.onfile)\n            err(5);\n        if (!this.p)\n            err(4);\n        if (this.c > 0) {\n            var len = Math.min(this.c, chunk.length);\n            var toAdd = chunk.subarray(0, len);\n            this.c -= len;\n            if (this.d)\n                this.d.push(toAdd, !this.c);\n            else\n                this.k[0].push(toAdd);\n            chunk = chunk.subarray(len);\n            if (chunk.length)\n                return this.push(chunk, final);\n        }\n        else {\n            var f = 0, i = 0, is = void 0, buf = void 0;\n            if (!this.p.length)\n                buf = chunk;\n            else if (!chunk.length)\n                buf = this.p;\n            else {\n                buf = new u8(this.p.length + chunk.length);\n                buf.set(this.p), buf.set(chunk, this.p.length);\n            }\n            var l = buf.length, oc = this.c, add = oc && this.d;\n            var _loop_2 = function () {\n                var _a;\n                var sig = b4(buf, i);\n                if (sig == 0x4034B50) {\n                    f = 1, is = i;\n                    this_1.d = null;\n                    this_1.c = 0;\n                    var bf = b2(buf, i + 6), cmp_1 = b2(buf, i + 8), u = bf & 2048, dd = bf & 8, fnl = b2(buf, i + 26), es = b2(buf, i + 28);\n                    if (l > i + 30 + fnl + es) {\n                        var chks_3 = [];\n                        this_1.k.unshift(chks_3);\n                        f = 2;\n                        var sc_1 = b4(buf, i + 18), su_1 = b4(buf, i + 22);\n                        var fn_1 = strFromU8(buf.subarray(i + 30, i += 30 + fnl), !u);\n                        if (sc_1 == 4294967295) {\n                            _a = dd ? [-2] : z64e(buf, i), sc_1 = _a[0], su_1 = _a[1];\n                        }\n                        else if (dd)\n                            sc_1 = -1;\n                        i += es;\n                        this_1.c = sc_1;\n                        var d_1;\n                        var file_1 = {\n                            name: fn_1,\n                            compression: cmp_1,\n                            start: function () {\n                                if (!file_1.ondata)\n                                    err(5);\n                                if (!sc_1)\n                                    file_1.ondata(null, et, true);\n                                else {\n                                    var ctr = _this.o[cmp_1];\n                                    if (!ctr)\n                                        file_1.ondata(err(14, 'unknown compression type ' + cmp_1, 1), null, false);\n                                    d_1 = sc_1 < 0 ? new ctr(fn_1) : new ctr(fn_1, sc_1, su_1);\n                                    d_1.ondata = function (err, dat, final) { file_1.ondata(err, dat, final); };\n                                    for (var _i = 0, chks_4 = chks_3; _i < chks_4.length; _i++) {\n                                        var dat = chks_4[_i];\n                                        d_1.push(dat, false);\n                                    }\n                                    if (_this.k[0] == chks_3 && _this.c)\n                                        _this.d = d_1;\n                                    else\n                                        d_1.push(et, true);\n                                }\n                            },\n                            terminate: function () {\n                                if (d_1 && d_1.terminate)\n                                    d_1.terminate();\n                            }\n                        };\n                        if (sc_1 >= 0)\n                            file_1.size = sc_1, file_1.originalSize = su_1;\n                        this_1.onfile(file_1);\n                    }\n                    return \"break\";\n                }\n                else if (oc) {\n                    if (sig == 0x8074B50) {\n                        is = i += 12 + (oc == -2 && 8), f = 3, this_1.c = 0;\n                        return \"break\";\n                    }\n                    else if (sig == 0x2014B50) {\n                        is = i -= 4, f = 3, this_1.c = 0;\n                        return \"break\";\n                    }\n                }\n            };\n            var this_1 = this;\n            for (; i < l - 4; ++i) {\n                var state_1 = _loop_2();\n                if (state_1 === \"break\")\n                    break;\n            }\n            this.p = et;\n            if (oc < 0) {\n                var dat = f ? buf.subarray(0, is - 12 - (oc == -2 && 8) - (b4(buf, is - 16) == 0x8074B50 && 4)) : buf.subarray(0, i);\n                if (add)\n                    add.push(dat, !!f);\n                else\n                    this.k[+(f == 2)].push(dat);\n            }\n            if (f & 2)\n                return this.push(buf.subarray(i), final);\n            this.p = buf.subarray(i);\n        }\n        if (final) {\n            if (this.c)\n                err(13);\n            this.p = null;\n        }\n    };\n    /**\n     * Registers a decoder with the stream, allowing for files compressed with\n     * the compression type provided to be expanded correctly\n     * @param decoder The decoder constructor\n     */\n    Unzip.prototype.register = function (decoder) {\n        this.o[decoder.compression] = decoder;\n    };\n    return Unzip;\n}());\nexport { Unzip };\nvar mt = typeof queueMicrotask == 'function' ? queueMicrotask : typeof setTimeout == 'function' ? setTimeout : function (fn) { fn(); };\nexport function unzip(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    var term = [];\n    var tAll = function () {\n        for (var i = 0; i < term.length; ++i)\n            term[i]();\n    };\n    var files = {};\n    var cbd = function (a, b) {\n        mt(function () { cb(a, b); });\n    };\n    mt(function () { cbd = cb; });\n    var e = data.length - 22;\n    for (; b4(data, e) != 0x6054B50; --e) {\n        if (!e || data.length - e > 65558) {\n            cbd(err(13, 0, 1), null);\n            return tAll;\n        }\n    }\n    ;\n    var lft = b2(data, e + 8);\n    if (lft) {\n        var c = lft;\n        var o = b4(data, e + 16);\n        var z = o == 4294967295 || c == 65535;\n        if (z) {\n            var ze = b4(data, e - 12);\n            z = b4(data, ze) == 0x6064B50;\n            if (z) {\n                c = lft = b4(data, ze + 32);\n                o = b4(data, ze + 48);\n            }\n        }\n        var fltr = opts && opts.filter;\n        var _loop_3 = function (i) {\n            var _a = zh(data, o, z), c_1 = _a[0], sc = _a[1], su = _a[2], fn = _a[3], no = _a[4], off = _a[5], b = slzh(data, off);\n            o = no;\n            var cbl = function (e, d) {\n                if (e) {\n                    tAll();\n                    cbd(e, null);\n                }\n                else {\n                    if (d)\n                        files[fn] = d;\n                    if (!--lft)\n                        cbd(null, files);\n                }\n            };\n            if (!fltr || fltr({\n                name: fn,\n                size: sc,\n                originalSize: su,\n                compression: c_1\n            })) {\n                if (!c_1)\n                    cbl(null, slc(data, b, b + sc));\n                else if (c_1 == 8) {\n                    var infl = data.subarray(b, b + sc);\n                    // Synchronously decompress under 512KB, or barely-compressed data\n                    if (su < 524288 || sc > 0.8 * su) {\n                        try {\n                            cbl(null, inflateSync(infl, { out: new u8(su) }));\n                        }\n                        catch (e) {\n                            cbl(e, null);\n                        }\n                    }\n                    else\n                        term.push(inflate(infl, { size: su }, cbl));\n                }\n                else\n                    cbl(err(14, 'unknown compression type ' + c_1, 1), null);\n            }\n            else\n                cbl(null, null);\n        };\n        for (var i = 0; i < c; ++i) {\n            _loop_3(i);\n        }\n    }\n    else\n        cbd(null, {});\n    return tAll;\n}\n/**\n * Synchronously decompresses a ZIP archive. Prefer using `unzip` for better\n * performance with more than one file.\n * @param data The raw compressed ZIP file\n * @param opts The ZIP extraction options\n * @returns The decompressed files\n */\nexport function unzipSync(data, opts) {\n    var files = {};\n    var e = data.length - 22;\n    for (; b4(data, e) != 0x6054B50; --e) {\n        if (!e || data.length - e > 65558)\n            err(13);\n    }\n    ;\n    var c = b2(data, e + 8);\n    if (!c)\n        return {};\n    var o = b4(data, e + 16);\n    var z = o == 4294967295 || c == 65535;\n    if (z) {\n        var ze = b4(data, e - 12);\n        z = b4(data, ze) == 0x6064B50;\n        if (z) {\n            c = b4(data, ze + 32);\n            o = b4(data, ze + 48);\n        }\n    }\n    var fltr = opts && opts.filter;\n    for (var i = 0; i < c; ++i) {\n        var _a = zh(data, o, z), c_2 = _a[0], sc = _a[1], su = _a[2], fn = _a[3], no = _a[4], off = _a[5], b = slzh(data, off);\n        o = no;\n        if (!fltr || fltr({\n            name: fn,\n            size: sc,\n            originalSize: su,\n            compression: c_2\n        })) {\n            if (!c_2)\n                files[fn] = slc(data, b, b + sc);\n            else if (c_2 == 8)\n                files[fn] = inflateSync(data.subarray(b, b + sc), { out: new u8(su) });\n            else\n                err(14, 'unknown compression type ' + c_2);\n        }\n    }\n    return files;\n}\n"],"names":["u8","u16","i32","fleb","fdeb","clim","freb","eb","start","b","i","r","j","_a","fl","revfl","_b","fd","revfd","rev","x","hMap","cd","mb","s","le","co","rvb","sv","r_1","v","m","flt","fdt","flm","flrm","fdm","fdrm","max","a","bits","d","p","o","bits16","shft","slc","e","ec","err","ind","msg","nt","inflt","dat","st","buf","dict","sl","dl","noBuf","resize","cbuf","l","bl","nbuf","final","pos","bt","lm","dm","lbt","dbt","tbts","type","hLit","hcLen","tl","ldt","clt","clb","clbmsk","clm","c","n","lt","dt","t","lms","dms","lpos","sym","add","dsym","end","shift","dend","wbits","wbits16","hTree","t2","et","i0","i1","i2","maxSym","tr","mbt","ln","lft","cst","i2_1","i2_2","i2_3","lc","cl","cli","cln","cls","w","clen","cf","wfblk","out","wblk","syms","lf","df","li","bs","dlt","mlb","ddt","mdb","_c","lclt","nlc","_d","lcdt","ndc","lcfreq","_e","lct","mlcb","nlcc","flen","ftlen","dtlen","ll","llm","lcts","it","clct","len","dst","deo","dflt","lvl","plvl","pre","post","lst","opt","msk_1","prev","head","bs1_1","bs2_1","hsh","lc_1","wi","hv","imod","pimod","rem","ch_1","dif","maxn","maxd","ml","nl","mmd","md","ti","pti","lin","din","adler","dopt","newDat","wbytes","zlh","lv","h","zls","zlibSync","data","opts","unzlibSync","td","tds"],"mappings":"AA8BA,IAAIA,IAAK,YAAYC,IAAM,aAAaC,KAAM,YAE1CC,KAAO,IAAIH,EAAG;AAAA,EAAC;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA;AAAA,EAAgB;AAAA,EAAG;AAAA;AAAA,EAAoB;AAAC,CAAC,GAE5II,KAAO,IAAIJ,EAAG;AAAA,EAAC;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA;AAAA,EAAiB;AAAA,EAAG;AAAC,CAAC,GAEnIK,KAAO,IAAIL,EAAG,CAAC,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,EAAE,CAAC,GAEhFM,KAAO,SAAUC,GAAIC,GAAO;AAE5B,WADIC,IAAI,IAAIR,EAAI,EAAE,GACTS,IAAI,GAAGA,IAAI,IAAI,EAAEA;AACtB,IAAAD,EAAEC,CAAC,IAAIF,KAAS,KAAKD,EAAGG,IAAI,CAAC;AAIjC,WADIC,IAAI,IAAIT,GAAIO,EAAE,EAAE,CAAC,GACZC,IAAI,GAAGA,IAAI,IAAI,EAAEA;AACtB,aAASE,IAAIH,EAAEC,CAAC,GAAGE,IAAIH,EAAEC,IAAI,CAAC,GAAG,EAAEE;AAC/B,MAAAD,EAAEC,CAAC,IAAMA,IAAIH,EAAEC,CAAC,KAAM,IAAKA;AAGnC,SAAO,EAAE,GAAGD,GAAG,GAAGE,EAAC;AACvB,GACIE,KAAKP,GAAKH,IAAM,CAAC,GAAGW,KAAKD,GAAG,GAAGE,KAAQF,GAAG;AAE9CC,GAAG,EAAE,IAAI,KAAKC,GAAM,GAAG,IAAI;AAC3B,IAAIC,KAAKV,GAAKF,IAAM,CAAC,GAAGa,KAAKD,GAAG,GAAGE,KAAQF,GAAG,GAE1CG,KAAM,IAAIlB,EAAI,KAAK;AACvB,SAASS,IAAI,GAAGA,IAAI,OAAO,EAAEA,GAAG;AAE5B,MAAIU,KAAMV,IAAI,UAAW,KAAOA,IAAI,UAAW;AAC/C,EAAAU,KAAMA,IAAI,UAAW,KAAOA,IAAI,UAAW,GAC3CA,KAAMA,IAAI,UAAW,KAAOA,IAAI,SAAW,GAC3CD,GAAIT,CAAC,MAAOU,IAAI,UAAW,KAAOA,IAAI,QAAW,MAAO;AAC5D;AAIA,IAAIC,KAAQ,SAAUC,GAAIC,GAAIZ,GAAG;AAO7B,WANIa,IAAIF,EAAG,QAEPZ,IAAI,GAEJ,IAAI,IAAIT,EAAIsB,CAAE,GAEXb,IAAIc,GAAG,EAAEd;AACZ,IAAIY,EAAGZ,CAAC,KACJ,EAAE,EAAEY,EAAGZ,CAAC,IAAI,CAAC;AAGrB,MAAIe,IAAK,IAAIxB,EAAIsB,CAAE;AACnB,OAAKb,IAAI,GAAGA,IAAIa,GAAI,EAAEb;AAClB,IAAAe,EAAGf,CAAC,IAAKe,EAAGf,IAAI,CAAC,IAAI,EAAEA,IAAI,CAAC,KAAM;AAEtC,MAAIgB;AACJ,MAAIf,GAAG;AAEH,IAAAe,IAAK,IAAIzB,EAAI,KAAKsB,CAAE;AAEpB,QAAII,IAAM,KAAKJ;AACf,SAAKb,IAAI,GAAGA,IAAIc,GAAG,EAAEd;AAEjB,UAAIY,EAAGZ,CAAC;AAQJ,iBANIkB,IAAMlB,KAAK,IAAKY,EAAGZ,CAAC,GAEpBmB,IAAMN,IAAKD,EAAGZ,CAAC,GAEfoB,IAAIL,EAAGH,EAAGZ,CAAC,IAAI,CAAC,OAAOmB,GAElBE,IAAID,KAAM,KAAKD,KAAO,GAAIC,KAAKC,GAAG,EAAED;AAEzC,UAAAJ,EAAGP,GAAIW,CAAC,KAAKH,CAAG,IAAIC;AAAA,EAIpC;AAGI,SADAF,IAAK,IAAIzB,EAAIuB,CAAC,GACTd,IAAI,GAAGA,IAAIc,GAAG,EAAEd;AACjB,MAAIY,EAAGZ,CAAC,MACJgB,EAAGhB,CAAC,IAAIS,GAAIM,EAAGH,EAAGZ,CAAC,IAAI,CAAC,GAAG,KAAM,KAAKY,EAAGZ,CAAC;AAItD,SAAOgB;AACX,IAEIM,IAAM,IAAIhC,EAAG,GAAG;AACpB,SAASU,IAAI,GAAGA,IAAI,KAAK,EAAEA;AACvB,EAAAsB,EAAItB,CAAC,IAAI;AACb,SAASA,IAAI,KAAKA,IAAI,KAAK,EAAEA;AACzB,EAAAsB,EAAItB,CAAC,IAAI;AACb,SAASA,IAAI,KAAKA,IAAI,KAAK,EAAEA;AACzB,EAAAsB,EAAItB,CAAC,IAAI;AACb,SAASA,IAAI,KAAKA,IAAI,KAAK,EAAEA;AACzB,EAAAsB,EAAItB,CAAC,IAAI;AAEb,IAAIuB,KAAM,IAAIjC,EAAG,EAAE;AACnB,SAASU,IAAI,GAAGA,IAAI,IAAI,EAAEA;AACtB,EAAAuB,GAAIvB,CAAC,IAAI;AAEb,IAAIwB,KAAoB,gBAAAb,EAAKW,GAAK,GAAG,CAAC,GAAGG,KAAqB,gBAAAd,EAAKW,GAAK,GAAG,CAAC,GAExEI,KAAoB,gBAAAf,EAAKY,IAAK,GAAG,CAAC,GAAGI,KAAqB,gBAAAhB,EAAKY,IAAK,GAAG,CAAC,GAExEK,KAAM,SAAUC,GAAG;AAEnB,WADIR,IAAIQ,EAAE,CAAC,GACF7B,IAAI,GAAGA,IAAI6B,EAAE,QAAQ,EAAE7B;AAC5B,IAAI6B,EAAE7B,CAAC,IAAIqB,MACPA,IAAIQ,EAAE7B,CAAC;AAEf,SAAOqB;AACX,GAEIS,IAAO,SAAUC,GAAGC,GAAGX,GAAG;AAC1B,MAAIY,IAAKD,IAAI,IAAK;AAClB,UAASD,EAAEE,CAAC,IAAKF,EAAEE,IAAI,CAAC,KAAK,OAAQD,IAAI,KAAMX;AACnD,GAEIa,KAAS,SAAUH,GAAGC,GAAG;AACzB,MAAIC,IAAKD,IAAI,IAAK;AAClB,UAASD,EAAEE,CAAC,IAAKF,EAAEE,IAAI,CAAC,KAAK,IAAMF,EAAEE,IAAI,CAAC,KAAK,QAASD,IAAI;AAChE,GAEIG,KAAO,SAAUH,GAAG;AAAE,UAASA,IAAI,KAAK,IAAK;AAAG,GAGhDI,KAAM,SAAUhB,GAAGN,GAAGuB,GAAG;AAGzB,UAAIA,KAAK,QAAQA,IAAIjB,EAAE,YACnBiB,IAAIjB,EAAE,SAEH,IAAI9B,EAAG8B,EAAE,SAASN,GAAGuB,CAAC,CAAC;AAClC,GAsBIC,KAAK;AAAA,EACL;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACJ;AAAA,EACI;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AAEJ,GAEIC,IAAM,SAAUC,GAAKC,GAAKC,GAAI;AAC9B,MAAI,IAAI,IAAI,MAAMD,KAAOH,GAAGE,CAAG,CAAC;AAIhC,MAHA,EAAE,OAAOA,GACL,MAAM,qBACN,MAAM,kBAAkB,GAAGD,CAAG,GAC9B,CAACG;AACD,UAAM;AACV,SAAO;AACX,GAEIC,KAAQ,SAAUC,GAAKC,GAAIC,GAAKC,GAAM;AAEtC,MAAIC,IAAKJ,EAAI,QAAQK,IAA0B;AAC/C,MAAI,CAACD,KAAMH,EAAG,KAAK,CAACA,EAAG;AACnB,WAAOC,KAAO,IAAIxD,EAAG,CAAC;AAC1B,MAAI4D,IAAQ,CAACJ,GAETK,IAASD,KAASL,EAAG,KAAK;AAI9B,EAAIK,MACAJ,IAAM,IAAIxD,EAAG0D,IAAK,CAAC;AAEvB,MAAII,IAAO,SAAUC,IAAG;AACpB,QAAIC,KAAKR,EAAI;AAEb,QAAIO,KAAIC,IAAI;AAER,UAAIC,KAAO,IAAIjE,EAAG,KAAK,IAAIgE,KAAK,GAAGD,EAAC,CAAC;AACrC,MAAAE,GAAK,IAAIT,CAAG,GACZA,IAAMS;AAAA,IACV;AAAA,EACJ,GAEIC,IAAQX,EAAG,KAAK,GAAGY,IAAMZ,EAAG,KAAK,GAAGa,IAAKb,EAAG,KAAK,GAAGc,IAAKd,EAAG,GAAGe,IAAKf,EAAG,GAAGgB,IAAMhB,EAAG,GAAGiB,IAAMjB,EAAG,GAE/FkB,IAAOf,IAAK;AAChB,KAAG;AACC,QAAI,CAACW,GAAI;AAEL,MAAAH,IAAQ1B,EAAKc,GAAKa,GAAK,CAAC;AAExB,UAAIO,IAAOlC,EAAKc,GAAKa,IAAM,GAAG,CAAC;AAE/B,UADAA,KAAO,GACFO;AAiBA,YAAIA,KAAQ;AACb,UAAAL,IAAKlC,IAAMmC,IAAKjC,IAAMkC,IAAM,GAAGC,IAAM;AAAA,iBAChCE,KAAQ,GAAG;AAEhB,cAAIC,IAAOnC,EAAKc,GAAKa,GAAK,EAAE,IAAI,KAAKS,IAAQpC,EAAKc,GAAKa,IAAM,IAAI,EAAE,IAAI,GACnEU,IAAKF,IAAOnC,EAAKc,GAAKa,IAAM,GAAG,EAAE,IAAI;AACzC,UAAAA,KAAO;AAKP,mBAHIW,IAAM,IAAI9E,EAAG6E,CAAE,GAEfE,IAAM,IAAI/E,EAAG,EAAE,GACVU,IAAI,GAAGA,IAAIkE,GAAO,EAAElE;AAEzB,YAAAqE,EAAI1E,GAAKK,CAAC,CAAC,IAAI8B,EAAKc,GAAKa,IAAMzD,IAAI,GAAG,CAAC;AAE3C,UAAAyD,KAAOS,IAAQ;AAKf,mBAHII,IAAM1C,GAAIyC,CAAG,GAAGE,KAAU,KAAKD,KAAO,GAEtCE,IAAM7D,EAAK0D,GAAKC,GAAK,CAAC,GACjBtE,IAAI,GAAGA,IAAImE,KAAK;AACrB,gBAAIlE,IAAIuE,EAAI1C,EAAKc,GAAKa,GAAKc,CAAM,CAAC;AAElC,YAAAd,KAAOxD,IAAI;AAEX,gBAAIa,IAAIb,KAAK;AAEb,gBAAIa,IAAI;AACJ,cAAAsD,EAAIpE,GAAG,IAAIc;AAAA,iBAEV;AAED,kBAAI2D,IAAI,GAAGC,IAAI;AAOf,mBANI5D,KAAK,MACL4D,IAAI,IAAI5C,EAAKc,GAAKa,GAAK,CAAC,GAAGA,KAAO,GAAGgB,IAAIL,EAAIpE,IAAI,CAAC,KAC7Cc,KAAK,MACV4D,IAAI,IAAI5C,EAAKc,GAAKa,GAAK,CAAC,GAAGA,KAAO,KAC7B3C,KAAK,OACV4D,IAAI,KAAK5C,EAAKc,GAAKa,GAAK,GAAG,GAAGA,KAAO,IAClCiB;AACH,gBAAAN,EAAIpE,GAAG,IAAIyE;AAAA,YACnB;AAAA,UACJ;AAEA,cAAIE,IAAKP,EAAI,SAAS,GAAGH,CAAI,GAAGW,IAAKR,EAAI,SAASH,CAAI;AAEtD,UAAAJ,IAAMjC,GAAI+C,CAAE,GAEZb,IAAMlC,GAAIgD,CAAE,GACZjB,IAAKhD,EAAKgE,GAAId,GAAK,CAAC,GACpBD,IAAKjD,EAAKiE,GAAId,GAAK,CAAC;AAAA,QACxB;AAEI,UAAAvB,EAAI,CAAC;AAAA,WAtEE;AAEP,YAAIzB,IAAIqB,GAAKsB,CAAG,IAAI,GAAGJ,IAAIT,EAAI9B,IAAI,CAAC,IAAK8B,EAAI9B,IAAI,CAAC,KAAK,GAAI+D,IAAI/D,IAAIuC;AACnE,YAAIwB,IAAI7B,GAAI;AAEJ,UAAAT,EAAI,CAAC;AACT;AAAA,QACJ;AAEA,QAAIY,KACAC,EAAKM,IAAKL,CAAC,GAEfP,EAAI,IAAIF,EAAI,SAAS9B,GAAG+D,CAAC,GAAGnB,CAAE,GAE9Bb,EAAG,IAAIa,KAAML,GAAGR,EAAG,IAAIY,IAAMoB,IAAI,GAAGhC,EAAG,IAAIW;AAC3C;AAAA,MACJ;AAuDA,UAAIC,IAAMM,GAAM;AAER,QAAAxB,EAAI,CAAC;AACT;AAAA,MACJ;AAAA,IACJ;AAGA,IAAIY,KACAC,EAAKM,IAAK,MAAM;AAGpB,aAFIoB,KAAO,KAAKjB,KAAO,GAAGkB,KAAO,KAAKjB,KAAO,GACzCkB,IAAOvB,KACHuB,IAAOvB,GAAK;AAEhB,UAAIgB,IAAId,EAAGzB,GAAOU,GAAKa,CAAG,IAAIqB,CAAG,GAAGG,IAAMR,KAAK;AAE/C,UADAhB,KAAOgB,IAAI,IACPhB,IAAMM,GAAM;AAER,QAAAxB,EAAI,CAAC;AACT;AAAA,MACJ;AAGA,UAFKkC,KACDlC,EAAI,CAAC,GACL0C,IAAM;AACN,QAAAnC,EAAIY,GAAI,IAAIuB;AAAA,eACPA,KAAO,KAAK;AACjB,QAAAD,IAAOvB,GAAKE,IAAK;AACjB;AAAA,MACJ,OACK;AACD,YAAIuB,IAAMD,IAAM;AAEhB,YAAIA,IAAM,KAAK;AAEX,cAAIjF,IAAIiF,IAAM,KAAKlF,IAAIN,GAAKO,CAAC;AAC7B,UAAAkF,IAAMpD,EAAKc,GAAKa,IAAM,KAAK1D,KAAK,CAAC,IAAIK,GAAGJ,CAAC,GACzCyD,KAAO1D;AAAA,QACX;AAEA,YAAIgC,IAAI6B,EAAG1B,GAAOU,GAAKa,CAAG,IAAIsB,CAAG,GAAGI,IAAOpD,KAAK;AAChD,QAAKA,KACDQ,EAAI,CAAC,GACTkB,KAAO1B,IAAI;AACX,YAAI6C,IAAKrE,GAAG4E,CAAI;AAChB,YAAIA,IAAO,GAAG;AACV,cAAIpF,IAAIL,GAAKyF,CAAI;AACjB,UAAAP,KAAM1C,GAAOU,GAAKa,CAAG,KAAK,KAAK1D,KAAK,GAAG0D,KAAO1D;AAAA,QAClD;AACA,YAAI0D,IAAMM,GAAM;AAER,UAAAxB,EAAI,CAAC;AACT;AAAA,QACJ;AACA,QAAIY,KACAC,EAAKM,IAAK,MAAM;AACpB,YAAI0B,IAAM1B,IAAKwB;AACf,YAAIxB,IAAKkB,GAAI;AACT,cAAIS,IAAQpC,IAAK2B,GAAIU,KAAO,KAAK,IAAIV,GAAIQ,CAAG;AAG5C,eAFIC,IAAQ3B,IAAK,KACbnB,EAAI,CAAC,GACFmB,IAAK4B,IAAM,EAAE5B;AAChB,YAAAZ,EAAIY,CAAE,IAAIX,EAAKsC,IAAQ3B,CAAE;AAAA,QACjC;AACA,eAAOA,IAAK0B,GAAK,EAAE1B;AACf,UAAAZ,EAAIY,CAAE,IAAIZ,EAAIY,IAAKkB,CAAE;AAAA,MAC7B;AAAA,IACJ;AACA,IAAA/B,EAAG,IAAIc,GAAId,EAAG,IAAImC,GAAMnC,EAAG,IAAIa,GAAIb,EAAG,IAAIW,GACtCG,MACAH,IAAQ,GAAGX,EAAG,IAAIgB,GAAKhB,EAAG,IAAIe,GAAIf,EAAG,IAAIiB;AAAA,EACjD,SAAS,CAACN;AAEV,SAAOE,KAAMZ,EAAI,UAAUI,IAAQd,GAAIU,GAAK,GAAGY,CAAE,IAAIZ,EAAI,SAAS,GAAGY,CAAE;AAC3E,GAEI6B,IAAQ,SAAUxD,GAAGC,GAAGZ,GAAG;AAC3B,EAAAA,MAAMY,IAAI;AACV,MAAIC,IAAKD,IAAI,IAAK;AAClB,EAAAD,EAAEE,CAAC,KAAKb,GACRW,EAAEE,IAAI,CAAC,KAAKb,KAAK;AACrB,GAEIoE,KAAU,SAAUzD,GAAGC,GAAGZ,GAAG;AAC7B,EAAAA,MAAMY,IAAI;AACV,MAAIC,IAAKD,IAAI,IAAK;AAClB,EAAAD,EAAEE,CAAC,KAAKb,GACRW,EAAEE,IAAI,CAAC,KAAKb,KAAK,GACjBW,EAAEE,IAAI,CAAC,KAAKb,KAAK;AACrB,GAEIqE,KAAQ,SAAU1D,GAAGlB,GAAI;AAGzB,WADIgE,IAAI,CAAA,GACC7E,IAAI,GAAGA,IAAI+B,EAAE,QAAQ,EAAE/B;AAC5B,IAAI+B,EAAE/B,CAAC,KACH6E,EAAE,KAAK,EAAE,GAAG7E,GAAG,GAAG+B,EAAE/B,CAAC,GAAG;AAEhC,MAAIc,IAAI+D,EAAE,QACNa,IAAKb,EAAE,MAAK;AAChB,MAAI,CAAC/D;AACD,WAAO,EAAE,GAAG6E,IAAI,GAAG,EAAC;AACxB,MAAI7E,KAAK,GAAG;AACR,QAAIM,IAAI,IAAI9B,EAAGuF,EAAE,CAAC,EAAE,IAAI,CAAC;AACzB,WAAAzD,EAAEyD,EAAE,CAAC,EAAE,CAAC,IAAI,GACL,EAAE,GAAGzD,GAAG,GAAG,EAAC;AAAA,EACvB;AACA,EAAAyD,EAAE,KAAK,SAAUhD,GAAG9B,GAAG;AAAE,WAAO8B,EAAE,IAAI9B,EAAE;AAAA,EAAG,CAAC,GAG5C8E,EAAE,KAAK,EAAE,GAAG,IAAI,GAAG,OAAO;AAC1B,MAAIxB,IAAIwB,EAAE,CAAC,GAAG5E,IAAI4E,EAAE,CAAC,GAAGe,IAAK,GAAGC,IAAK,GAAGC,IAAK;AAO7C,OANAjB,EAAE,CAAC,IAAI,EAAE,GAAG,IAAI,GAAGxB,EAAE,IAAIpD,EAAE,GAAG,GAAGoD,GAAG,GAAGpD,EAAC,GAMjC4F,KAAM/E,IAAI;AACb,IAAAuC,IAAIwB,EAAEA,EAAEe,CAAE,EAAE,IAAIf,EAAEiB,CAAE,EAAE,IAAIF,MAAOE,GAAI,GACrC7F,IAAI4E,EAAEe,KAAMC,KAAMhB,EAAEe,CAAE,EAAE,IAAIf,EAAEiB,CAAE,EAAE,IAAIF,MAAOE,GAAI,GACjDjB,EAAEgB,GAAI,IAAI,EAAE,GAAG,IAAI,GAAGxC,EAAE,IAAIpD,EAAE,GAAG,GAAGoD,GAAG,GAAGpD,EAAC;AAG/C,WADI8F,IAASL,EAAG,CAAC,EAAE,GACV1F,IAAI,GAAGA,IAAIc,GAAG,EAAEd;AACrB,IAAI0F,EAAG1F,CAAC,EAAE,IAAI+F,MACVA,IAASL,EAAG1F,CAAC,EAAE;AAGvB,MAAIgG,IAAK,IAAIzG,EAAIwG,IAAS,CAAC,GAEvBE,IAAMC,GAAGrB,EAAEgB,IAAK,CAAC,GAAGG,GAAI,CAAC;AAC7B,MAAIC,IAAMpF,GAAI;AAIV,QAAIb,IAAI,GAAG4E,IAAK,GAEZuB,IAAMF,IAAMpF,GAAIuF,IAAM,KAAKD;AAE/B,SADAT,EAAG,KAAK,SAAU7D,GAAG9B,GAAG;AAAE,aAAOiG,EAAGjG,EAAE,CAAC,IAAIiG,EAAGnE,EAAE,CAAC,KAAKA,EAAE,IAAI9B,EAAE;AAAA,IAAG,CAAC,GAC3DC,IAAIc,GAAG,EAAEd,GAAG;AACf,UAAIqG,IAAOX,EAAG1F,CAAC,EAAE;AACjB,UAAIgG,EAAGK,CAAI,IAAIxF;AACX,QAAA+D,KAAMwB,KAAO,KAAMH,IAAMD,EAAGK,CAAI,IAChCL,EAAGK,CAAI,IAAIxF;AAAA;AAGX;AAAA,IACR;AAEA,SADA+D,MAAOuB,GACAvB,IAAK,KAAG;AACX,UAAI0B,IAAOZ,EAAG1F,CAAC,EAAE;AACjB,MAAIgG,EAAGM,CAAI,IAAIzF,IACX+D,KAAM,KAAM/D,IAAKmF,EAAGM,CAAI,MAAM,IAE9B,EAAEtG;AAAA,IACV;AACA,WAAOA,KAAK,KAAK4E,GAAI,EAAE5E,GAAG;AACtB,UAAIuG,IAAOb,EAAG1F,CAAC,EAAE;AACjB,MAAIgG,EAAGO,CAAI,KAAK1F,MACZ,EAAEmF,EAAGO,CAAI,GACT,EAAE3B;AAAA,IAEV;AACA,IAAAqB,IAAMpF;AAAA,EACV;AACA,SAAO,EAAE,GAAG,IAAIvB,EAAG0G,CAAE,GAAG,GAAGC,EAAG;AAClC,GAEIC,KAAK,SAAUxB,GAAGrB,GAAGtB,GAAG;AACxB,SAAO2C,EAAE,KAAK,KACR,KAAK,IAAIwB,GAAGxB,EAAE,GAAGrB,GAAGtB,IAAI,CAAC,GAAGmE,GAAGxB,EAAE,GAAGrB,GAAGtB,IAAI,CAAC,CAAC,IAC5CsB,EAAEqB,EAAE,CAAC,IAAI3C;AACpB,GAEIyE,KAAK,SAAU/B,GAAG;AAGlB,WAFI3D,IAAI2D,EAAE,QAEH3D,KAAK,CAAC2D,EAAE,EAAE3D,CAAC;AACd;AAKJ,WAJI2F,IAAK,IAAIlH,EAAI,EAAEuB,CAAC,GAEhB4F,IAAM,GAAGC,IAAMlC,EAAE,CAAC,GAAGmC,IAAM,GAC3BC,IAAI,SAAUzF,GAAG;AAAE,IAAAqF,EAAGC,GAAK,IAAItF;AAAA,EAAG,GAC7BpB,IAAI,GAAGA,KAAKc,GAAG,EAAEd;AACtB,QAAIyE,EAAEzE,CAAC,KAAK2G,KAAO3G,KAAKc;AACpB,QAAE8F;AAAA,SACD;AACD,UAAI,CAACD,KAAOC,IAAM,GAAG;AACjB,eAAOA,IAAM,KAAKA,KAAO;AACrB,UAAAC,EAAE,KAAK;AACX,QAAID,IAAM,MACNC,EAAED,IAAM,KAAOA,IAAM,MAAO,IAAK,QAAUA,IAAM,KAAM,IAAK,KAAK,GACjEA,IAAM;AAAA,MAEd,WACSA,IAAM,GAAG;AAEd,aADAC,EAAEF,CAAG,GAAG,EAAEC,GACHA,IAAM,GAAGA,KAAO;AACnB,UAAAC,EAAE,IAAI;AACV,QAAID,IAAM,MACNC,EAAID,IAAM,KAAM,IAAK,IAAI,GAAGA,IAAM;AAAA,MAC1C;AACA,aAAOA;AACH,QAAAC,EAAEF,CAAG;AACT,MAAAC,IAAM,GACND,IAAMlC,EAAEzE,CAAC;AAAA,IACb;AAEJ,SAAO,EAAE,GAAGyG,EAAG,SAAS,GAAGC,CAAG,GAAG,GAAG5F,EAAC;AACzC,GAEIgG,KAAO,SAAUC,GAAIN,GAAI;AAEzB,WADIpD,IAAI,GACCrD,IAAI,GAAGA,IAAIyG,EAAG,QAAQ,EAAEzG;AAC7B,IAAAqD,KAAK0D,EAAG/G,CAAC,IAAIyG,EAAGzG,CAAC;AACrB,SAAOqD;AACX,GAGI2D,KAAQ,SAAUC,GAAKxD,GAAKb,GAAK;AAEjC,MAAI9B,IAAI8B,EAAI,QACRX,IAAIE,GAAKsB,IAAM,CAAC;AACpB,EAAAwD,EAAIhF,CAAC,IAAInB,IAAI,KACbmG,EAAIhF,IAAI,CAAC,IAAInB,KAAK,GAClBmG,EAAIhF,IAAI,CAAC,IAAIgF,EAAIhF,CAAC,IAAI,KACtBgF,EAAIhF,IAAI,CAAC,IAAIgF,EAAIhF,IAAI,CAAC,IAAI;AAC1B,WAASjC,IAAI,GAAGA,IAAIc,GAAG,EAAEd;AACrB,IAAAiH,EAAIhF,IAAIjC,IAAI,CAAC,IAAI4C,EAAI5C,CAAC;AAC1B,UAAQiC,IAAI,IAAInB,KAAK;AACzB,GAEIoG,KAAO,SAAUtE,GAAKqE,GAAKzD,GAAO2D,GAAMC,GAAIC,GAAIxH,GAAIyH,GAAIC,GAAIjE,GAAItB,GAAG;AACnE,EAAAuD,EAAM0B,GAAKjF,KAAKwB,CAAK,GACrB,EAAE4D,EAAG,GAAG;AAMR,WALIjH,IAAKsF,GAAM2B,GAAI,EAAE,GAAGI,IAAMrH,EAAG,GAAGsH,IAAMtH,EAAG,GACzCG,IAAKmF,GAAM4B,GAAI,EAAE,GAAGK,IAAMpH,EAAG,GAAGqH,IAAMrH,EAAG,GACzCsH,IAAKpB,GAAGgB,CAAG,GAAGK,IAAOD,EAAG,GAAGE,IAAMF,EAAG,GACpCG,IAAKvB,GAAGkB,CAAG,GAAGM,IAAOD,EAAG,GAAGE,IAAMF,EAAG,GACpCG,IAAS,IAAI3I,EAAI,EAAE,GACdS,IAAI,GAAGA,IAAI6H,EAAK,QAAQ,EAAE7H;AAC/B,MAAEkI,EAAOL,EAAK7H,CAAC,IAAI,EAAE;AACzB,WAASA,IAAI,GAAGA,IAAIgI,EAAK,QAAQ,EAAEhI;AAC/B,MAAEkI,EAAOF,EAAKhI,CAAC,IAAI,EAAE;AAGzB,WAFImI,IAAK1C,GAAMyC,GAAQ,CAAC,GAAGE,IAAMD,EAAG,GAAGE,IAAOF,EAAG,GAC7CG,IAAO,IACJA,IAAO,KAAK,CAACF,EAAIzI,GAAK2I,IAAO,CAAC,CAAC,GAAG,EAAEA;AACvC;AACJ,MAAIC,IAAQjF,IAAK,KAAM,GACnBkF,IAAQ1B,GAAKM,GAAI9F,CAAG,IAAIwF,GAAKO,GAAI9F,EAAG,IAAI1B,GACxC4I,IAAQ3B,GAAKM,GAAII,CAAG,IAAIV,GAAKO,GAAIK,CAAG,IAAI7H,IAAK,KAAK,IAAIyI,IAAOxB,GAAKoB,GAAQE,CAAG,IAAI,IAAIF,EAAO,EAAE,IAAI,IAAIA,EAAO,EAAE,IAAI,IAAIA,EAAO,EAAE;AACpI,MAAIX,KAAM,KAAKgB,KAAQC,KAASD,KAAQE;AACpC,WAAOzB,GAAMC,GAAKjF,GAAGY,EAAI,SAAS2E,GAAIA,IAAKjE,CAAE,CAAC;AAClD,MAAIK,GAAI+E,GAAI9E,GAAIX;AAEhB,MADAsC,EAAM0B,GAAKjF,GAAG,KAAKyG,IAAQD,EAAM,GAAGxG,KAAK,GACrCyG,IAAQD,GAAO;AACf,IAAA7E,IAAKhD,EAAK6G,GAAKC,GAAK,CAAC,GAAGiB,IAAKlB,GAAK5D,IAAKjD,EAAK+G,GAAKC,GAAK,CAAC,GAAG1E,IAAKyE;AAC/D,QAAIiB,IAAMhI,EAAKyH,GAAKC,GAAM,CAAC;AAC3B,IAAA9C,EAAM0B,GAAKjF,GAAG8F,IAAM,GAAG,GACvBvC,EAAM0B,GAAKjF,IAAI,GAAGiG,IAAM,CAAC,GACzB1C,EAAM0B,GAAKjF,IAAI,IAAIsG,IAAO,CAAC,GAC3BtG,KAAK;AACL,aAAShC,IAAI,GAAGA,IAAIsI,GAAM,EAAEtI;AACxB,MAAAuF,EAAM0B,GAAKjF,IAAI,IAAIhC,GAAGoI,EAAIzI,GAAKK,CAAC,CAAC,CAAC;AACtC,IAAAgC,KAAK,IAAIsG;AAET,aADIM,IAAO,CAACf,GAAMG,CAAI,GACba,IAAK,GAAGA,IAAK,GAAG,EAAEA;AAEvB,eADIC,IAAOF,EAAKC,CAAE,GACT7I,IAAI,GAAGA,IAAI8I,EAAK,QAAQ,EAAE9I,GAAG;AAClC,YAAI+I,IAAMD,EAAK9I,CAAC,IAAI;AACpB,QAAAuF,EAAM0B,GAAKjF,GAAG2G,EAAII,CAAG,CAAC,GAAG/G,KAAKoG,EAAIW,CAAG,GACjCA,IAAM,OACNxD,EAAM0B,GAAKjF,GAAI8G,EAAK9I,CAAC,KAAK,IAAK,GAAG,GAAGgC,KAAK8G,EAAK9I,CAAC,KAAK;AAAA,MAC7D;AAAA,EAER;AAEI,IAAA2D,IAAKnC,IAAKkH,IAAKpH,GAAKsC,IAAKlC,IAAKuB,IAAK1B;AAEvC,WAASvB,IAAI,GAAGA,IAAIsH,GAAI,EAAEtH,GAAG;AACzB,QAAIiF,IAAMkC,EAAKnH,CAAC;AAChB,QAAIiF,IAAM,KAAK;AACX,UAAI8D,IAAO9D,KAAO,KAAM;AACxB,MAAAO,GAAQyB,GAAKjF,GAAG2B,EAAGoF,IAAM,GAAG,CAAC,GAAG/G,KAAK0G,EAAGK,IAAM,GAAG,GAC7CA,IAAM,MACNxD,EAAM0B,GAAKjF,GAAIiD,KAAO,KAAM,EAAE,GAAGjD,KAAKvC,GAAKsJ,CAAG;AAClD,UAAIC,IAAM/D,IAAM;AAChB,MAAAO,GAAQyB,GAAKjF,GAAG4B,EAAGoF,CAAG,CAAC,GAAGhH,KAAKiB,EAAG+F,CAAG,GACjCA,IAAM,MACNxD,GAAQyB,GAAKjF,GAAIiD,KAAO,IAAK,IAAI,GAAGjD,KAAKtC,GAAKsJ,CAAG;AAAA,IACzD;AAEI,MAAAxD,GAAQyB,GAAKjF,GAAG2B,EAAGsB,CAAG,CAAC,GAAGjD,KAAK0G,EAAGzD,CAAG;AAAA,EAE7C;AACA,SAAAO,GAAQyB,GAAKjF,GAAG2B,EAAG,GAAG,CAAC,GAChB3B,IAAI0G,EAAG,GAAG;AACrB,GAEIO,KAAoB,oBAAIzJ,GAAI,CAAC,OAAO,QAAQ,QAAQ,QAAQ,QAAQ,SAAS,SAAS,SAAS,OAAO,CAAC,GAEvGmG,KAAmB,oBAAIrG,EAAG,CAAC,GAE3B4J,KAAO,SAAUtG,GAAKuG,GAAKC,GAAMC,GAAKC,GAAMzG,GAAI;AAChD,MAAI/B,IAAI+B,EAAG,KAAKD,EAAI,QAChBX,IAAI,IAAI3C,EAAG+J,IAAMvI,IAAI,KAAK,IAAI,KAAK,KAAKA,IAAI,GAAI,KAAKwI,CAAI,GAEzDzC,IAAI5E,EAAE,SAASoH,GAAKpH,EAAE,SAASqH,CAAI,GACnCC,IAAM1G,EAAG,GACTY,KAAOZ,EAAG,KAAK,KAAK;AACxB,MAAIsG,GAAK;AACL,IAAI1F,MACAoD,EAAE,CAAC,IAAIhE,EAAG,KAAK;AAenB,aAdI2G,IAAMP,GAAIE,IAAM,CAAC,GACjBzE,IAAI8E,KAAO,IAAI/E,IAAI+E,IAAM,MACzBC,KAAS,KAAKL,KAAQ,GAEtBM,IAAO7G,EAAG,KAAK,IAAItD,EAAI,KAAK,GAAGoK,IAAO9G,EAAG,KAAK,IAAItD,EAAIkK,IAAQ,CAAC,GAC/DG,IAAQ,KAAK,KAAKR,IAAO,CAAC,GAAGS,IAAQ,IAAID,GACzCE,IAAM,SAAU9J,IAAG;AAAE,cAAQ4C,EAAI5C,EAAC,IAAK4C,EAAI5C,KAAI,CAAC,KAAK4J,IAAUhH,EAAI5C,KAAI,CAAC,KAAK6J,KAAUJ;AAAA,IAAO,GAG9FtC,IAAO,IAAI3H,GAAI,IAAK,GAEpB4H,IAAK,IAAI7H,EAAI,GAAG,GAAG8H,IAAK,IAAI9H,EAAI,EAAE,GAElCwK,IAAO,GAAGlK,IAAK,GAAGG,IAAI6C,EAAG,KAAK,GAAGyE,IAAK,GAAG0C,IAAKnH,EAAG,KAAK,GAAG0E,IAAK,GAC3DvH,IAAI,IAAIc,GAAG,EAAEd,GAAG;AAEnB,UAAIiK,IAAKH,EAAI9J,CAAC,GAEVkK,IAAOlK,IAAI,OAAOmK,IAAQR,EAAKM,CAAE;AAKrC,UAJAP,EAAKQ,CAAI,IAAIC,GACbR,EAAKM,CAAE,IAAIC,GAGPF,KAAMhK,GAAG;AAET,YAAIoK,IAAMtJ,IAAId;AACd,aAAK+J,IAAO,OAAQzC,IAAK,WAAW8C,IAAM,OAAO,CAACb,IAAM;AACpD,UAAA9F,IAAMyD,GAAKtE,GAAKiE,GAAG,GAAGM,GAAMC,GAAIC,GAAIxH,GAAIyH,GAAIC,GAAIvH,IAAIuH,GAAI9D,CAAG,GAC3D6D,IAAKyC,IAAOlK,IAAK,GAAG0H,IAAKvH;AACzB,mBAASE,IAAI,GAAGA,IAAI,KAAK,EAAEA;AACvB,YAAAkH,EAAGlH,CAAC,IAAI;AACZ,mBAASA,IAAI,GAAGA,IAAI,IAAI,EAAEA;AACtB,YAAAmH,EAAGnH,CAAC,IAAI;AAAA,QAChB;AAEA,YAAImD,IAAI,GAAGtB,IAAI,GAAGsI,IAAO5F,GAAG6F,IAAMJ,IAAOC,IAAQ;AACjD,YAAIC,IAAM,KAAKH,KAAMH,EAAI9J,IAAIsK,CAAG;AAM5B,mBALIC,IAAO,KAAK,IAAI7F,GAAG0F,CAAG,IAAI,GAC1BI,IAAO,KAAK,IAAI,OAAOxK,CAAC,GAGxByK,IAAK,KAAK,IAAI,KAAKL,CAAG,GACnBE,KAAOE,KAAQ,EAAEH,KAAQH,KAAQC,KAAO;AAC3C,gBAAIvH,EAAI5C,IAAIqD,CAAC,KAAKT,EAAI5C,IAAIqD,IAAIiH,CAAG,GAAG;AAEhC,uBADII,IAAK,GACFA,IAAKD,KAAM7H,EAAI5C,IAAI0K,CAAE,KAAK9H,EAAI5C,IAAI0K,IAAKJ,CAAG,GAAG,EAAEI;AAClD;AACJ,kBAAIA,IAAKrH,GAAG;AAGR,oBAFAA,IAAIqH,GAAI3I,IAAIuI,GAERI,IAAKH;AACL;AAMJ,yBAFII,IAAM,KAAK,IAAIL,GAAKI,IAAK,CAAC,GAC1BE,IAAK,GACA1K,IAAI,GAAGA,IAAIyK,GAAK,EAAEzK,GAAG;AAC1B,sBAAI2K,IAAK7K,IAAIsK,IAAMpK,IAAI,OACnB4K,KAAMpB,EAAKmB,CAAE,GACbjK,KAAKiK,IAAKC,KAAM;AACpB,kBAAIlK,KAAKgK,MACLA,IAAKhK,IAAIuJ,IAAQU;AAAA,gBACzB;AAAA,cACJ;AAAA,YACJ;AAEA,YAAAX,IAAOC,GAAOA,IAAQT,EAAKQ,CAAI,GAC/BI,KAAOJ,IAAOC,IAAQ;AAAA,UAC1B;AAGJ,YAAIpI,GAAG;AAGH,UAAAoF,EAAKG,GAAI,IAAI,YAAajH,GAAMgD,CAAC,KAAK,KAAM7C,GAAMuB,CAAC;AACnD,cAAIgJ,KAAM1K,GAAMgD,CAAC,IAAI,IAAI2H,KAAMxK,GAAMuB,CAAC,IAAI;AAC1C,UAAAlC,KAAMJ,GAAKsL,EAAG,IAAIrL,GAAKsL,EAAG,GAC1B,EAAE5D,EAAG,MAAM2D,EAAG,GACd,EAAE1D,EAAG2D,EAAG,GACRhB,IAAKhK,IAAIqD,GACT,EAAE0G;AAAA,QACN;AAEI,UAAA5C,EAAKG,GAAI,IAAI1E,EAAI5C,CAAC,GAClB,EAAEoH,EAAGxE,EAAI5C,CAAC,CAAC;AAAA,MAEnB;AAAA,IACJ;AACA,SAAKA,IAAI,KAAK,IAAIA,GAAGgK,CAAE,GAAGhK,IAAIc,GAAG,EAAEd;AAC/B,MAAAmH,EAAKG,GAAI,IAAI1E,EAAI5C,CAAC,GAClB,EAAEoH,EAAGxE,EAAI5C,CAAC,CAAC;AAEf,IAAAyD,IAAMyD,GAAKtE,GAAKiE,GAAG0C,GAAKpC,GAAMC,GAAIC,GAAIxH,GAAIyH,GAAIC,GAAIvH,IAAIuH,GAAI9D,CAAG,GACxD8F,MACD1G,EAAG,IAAKY,IAAM,IAAKoD,EAAGpD,IAAM,IAAK,CAAC,KAAK,GAEvCA,KAAO,GACPZ,EAAG,IAAI8G,GAAM9G,EAAG,IAAI6G,GAAM7G,EAAG,IAAI7C,GAAG6C,EAAG,IAAImH;AAAA,EAEnD,OACK;AACD,aAAShK,IAAI6C,EAAG,KAAK,GAAG7C,IAAIc,IAAIyI,GAAKvJ,KAAK,OAAO;AAE7C,UAAIqC,KAAIrC,IAAI;AACZ,MAAIqC,MAAKvB,MAEL+F,EAAGpD,IAAM,IAAK,CAAC,IAAI8F,GACnBlH,KAAIvB,IAER2C,IAAMuD,GAAMH,GAAGpD,IAAM,GAAGb,EAAI,SAAS5C,GAAGqC,EAAC,CAAC;AAAA,IAC9C;AACA,IAAAQ,EAAG,IAAI/B;AAAA,EACX;AACA,SAAOsB,GAAIH,GAAG,GAAGoH,IAAMlH,GAAKsB,CAAG,IAAI6F,CAAI;AAC3C,GA2BI2B,KAAQ,WAAY;AACpB,MAAIpJ,IAAI,GAAG9B,IAAI;AACf,SAAO;AAAA,IACH,GAAG,SAAUgC,GAAG;AAIZ,eAFI2C,IAAI7C,GAAGR,IAAItB,GACX,IAAIgC,EAAE,SAAS,GACV,IAAI,GAAG,KAAK,KAAI;AAErB,iBADIM,IAAI,KAAK,IAAI,IAAI,MAAM,CAAC,GACrB,IAAIA,GAAG,EAAE;AACZ,UAAAhB,KAAKqD,KAAK3C,EAAE,CAAC;AACjB,QAAA2C,KAAKA,IAAI,SAAS,MAAMA,KAAK,KAAKrD,KAAKA,IAAI,SAAS,MAAMA,KAAK;AAAA,MACnE;AACA,MAAAQ,IAAI6C,GAAG3E,IAAIsB;AAAA,IACf;AAAA,IACA,GAAG,WAAY;AACX,aAAAQ,KAAK,OAAO9B,KAAK,QACT8B,IAAI,QAAQ,MAAMA,IAAI,UAAW,KAAK9B,IAAI,QAAQ,IAAKA,KAAK;AAAA,IACxE;AAAA,EACR;AACA,GAGImL,KAAO,SAAUtI,GAAK4G,GAAKH,GAAKC,GAAMzG,GAAI;AAC1C,MAAI,CAACA,MACDA,IAAK,EAAE,GAAG,EAAC,GACP2G,EAAI,aAAY;AAChB,QAAIzG,IAAOyG,EAAI,WAAW,SAAS,MAAM,GACrC2B,IAAS,IAAI7L,EAAGyD,EAAK,SAASH,EAAI,MAAM;AAC5C,IAAAuI,EAAO,IAAIpI,CAAI,GACfoI,EAAO,IAAIvI,GAAKG,EAAK,MAAM,GAC3BH,IAAMuI,GACNtI,EAAG,IAAIE,EAAK;AAAA,EAChB;AAEJ,SAAOmG,GAAKtG,GAAK4G,EAAI,SAAS,OAAO,IAAIA,EAAI,OAAOA,EAAI,OAAO,OAAQ3G,EAAG,IAAI,KAAK,KAAK,KAAK,IAAI,GAAG,KAAK,IAAI,IAAI,KAAK,IAAID,EAAI,MAAM,CAAC,CAAC,IAAI,GAAG,IAAI,KAAO,KAAK4G,EAAI,KAAMH,GAAKC,GAAMzG,CAAE;AACxL,GAmJIuI,KAAS,SAAUrJ,GAAGhC,GAAGqB,GAAG;AAC5B,SAAOA,GAAG,EAAErB;AACR,IAAAgC,EAAEhC,CAAC,IAAIqB,GAAGA,OAAO;AACzB,GAkCIiK,KAAM,SAAU5G,GAAGxC,GAAG;AACtB,MAAIqJ,IAAKrJ,EAAE,OAAO7B,IAAKkL,KAAM,IAAI,IAAIA,IAAK,IAAI,IAAIA,KAAM,IAAI,IAAI;AAGhE,MAFA7G,EAAE,CAAC,IAAI,KAAKA,EAAE,CAAC,IAAKrE,KAAM,KAAM6B,EAAE,cAAc,KAChDwC,EAAE,CAAC,KAAK,MAAOA,EAAE,CAAC,KAAK,IAAKA,EAAE,CAAC,KAAK,IAChCxC,EAAE,YAAY;AACd,QAAIsJ,IAAIN,GAAK;AACb,IAAAM,EAAE,EAAEtJ,EAAE,UAAU,GAChBmJ,GAAO3G,GAAG,GAAG8G,EAAE,EAAC,CAAE;AAAA,EACtB;AACJ,GAEIC,KAAM,SAAUzJ,GAAGgB,GAAM;AACzB,WAAKhB,EAAE,CAAC,IAAI,OAAO,KAAMA,EAAE,CAAC,KAAK,IAAK,MAAOA,EAAE,CAAC,KAAK,IAAIA,EAAE,CAAC,KAAK,OAC7DQ,EAAI,GAAG,mBAAmB,IACzBR,EAAE,CAAC,KAAK,IAAI,MAAM,KACnBQ,EAAI,GAAG,yBAAyBR,EAAE,CAAC,IAAI,KAAK,SAAS,gBAAgB,aAAa,IAC9EA,EAAE,CAAC,KAAK,IAAI,KAAK;AAC7B;AA+aO,SAAS0J,GAASC,GAAMC,GAAM;AACjC,EAAKA,MACDA,IAAO,CAAA;AACX,MAAI9J,IAAIoJ,GAAK;AACb,EAAApJ,EAAE,EAAE6J,CAAI;AACR,MAAI3J,IAAImJ,GAAKQ,GAAMC,GAAMA,EAAK,aAAa,IAAI,GAAG,CAAC;AACnD,SAAON,GAAItJ,GAAG4J,CAAI,GAAGP,GAAOrJ,GAAGA,EAAE,SAAS,GAAGF,EAAE,EAAC,CAAE,GAAGE;AACzD;AAmEO,SAAS6J,GAAWF,GAAMC,GAAM;AACnC,SAAOhJ,GAAM+I,EAAK,SAASF,GAAIE,CAA6B,GAAG,EAAE,GAAG,EAAE,GAAG,KAAKC,GAAkBA,CAAuB;AAC3H;AAiIA,IAAIE,KAAK,OAAO,cAAe,OAA6B,oBAAI,YAAW,GAEvEC,KAAM;AACV,IAAI;AACA,EAAAD,GAAG,OAAOlG,IAAI,EAAE,QAAQ,GAAI,CAAE,GAC9BmG,KAAM;AACV,QACU;AAAE;","x_google_ignoreList":[0]}