read-excel-file 9.0.5 → 9.0.7

package/bundle/read-excel-file.min.js.map

@@ -1 +1 @@
-{"version":3,"file":"read-excel-file.min.js","sources":["../modules/xml/xmlBrowser.js","../node_modules/fflate/esm/browser.js","../modules/zip/unzipFromArrayBuffer.js","../modules/export/convertValuesFromUint8ArraysToStrings.js","../modules/export/filterZipArchiveEntry.js","../modules/export/unpackXlsxFileBrowser.js","../modules/xml/dom.js","../modules/xml/xlsx.js","../modules/xlsx/parseSpreadsheetInfo.js","../modules/xlsx/parseFilePaths.js","../modules/xlsx/parseStyles.js","../modules/xlsx/parseExcelDate.js","../modules/xlsx/isDateFormat.js","../modules/xlsx/isDateFormatStyle.js","../modules/xlsx/parseCellValue.js","../modules/xlsx/parseCellCoordinates.js","../modules/xlsx/parseCell.js","../modules/xlsx/parseCells.js","../modules/xlsx/parseSheetDimensions.js","../modules/xlsx/dropEmptyRows.js","../modules/xlsx/dropEmptyColumns.js","../modules/xlsx/convertCellsToData2dArray.js","../modules/xlsx/parseSheet.js","../modules/xlsx/reconstructSheetDimensionsFromSheetCells.js","../modules/xlsx/parseSpreadsheetContents.js","../modules/xlsx/parseSharedStrings.js","../modules/export/readXlsxFileBrowser.js"],"sourcesContent":["export default {\n  createDocument: function createDocument(content) {\n    // if (!content) {\n    // \tthrow new Error('No *.xml content')\n    // }\n    // A weird bug: it won't parse XML unless it's trimmed.\n    // https://github.com/catamphetamine/read-excel-file/issues/21\n    return new DOMParser().parseFromString(content.trim(), 'text/xml');\n  }\n};\n//# sourceMappingURL=xmlBrowser.js.map","// 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","// `fflate` readme is too complicated:\n// https://github.com/101arrowz/fflate/issues/251\n// I just used whatever approach seemed to work.\n//\n// It was a choice between \"syncrhonous\" (blocking) unzip via `unzipSync()`\n// and \"asynchronous\" (non-blocking) unzip via `unzip()`.\n//\n// In the readme they say that using \"asynchronous\" API  will cause the compression or decompression\n// run in a separate thread by using Web (or Node) Workers, so it won't block the main thread.\n// Yet, they also say that there is an initial overhead to using workers of about 50ms for each\n// asynchronous function. For small (under about 50kB) payloads, they say that the \"asynchronous\" API\n// will be much slower compared to the \"synchronous\" one. However, when compressing larger files\n// or multiple files at once, the \"synchronous\" API causes the main thread to hang for too long,\n// and the \"asynchronous\" API is an order of magnitude better.\n//\nimport { unzip } from 'fflate';\n\n/**\r\n * Reads `*.zip` file contents. Ignores anything besides `.xml` or `.xml.rels` files.\r\n * @param  {ArrayBuffer} input\r\n * @return {Promise<Record<string,Uint8Array>>} Resolves to an object holding `*.zip` file entries.\r\n */\nexport default function unzipFromArrayBuffer(input, options) {\n  return unzipFromArrayBufferUsingFunction(input, options, unzipAsync, true);\n}\n\n/**\r\n * Reads `*.zip` file contents. Ignores anything besides `.xml` or `.xml.rels` files.\r\n * @param  {ArrayBuffer} input\r\n * @param  {(ArrayBuffer) => Record<string, Uint8Array> | Promise<Record<string, Uint8Array>>} unzip\r\n * @param  {boolean} isAsync — Should be `true` when `unzip()` returns a `Promise`, `false` otherwise.\r\n * @return {Promise<Record<string,Uint8Array>>|Record<string,Uint8Array>} Resolves to an object holding `*.zip` file entries.\r\n */\nexport function unzipFromArrayBufferUsingFunction(input) {\n  var _ref = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {},\n    _filter = _ref.filter;\n  var unzip = arguments.length > 2 ? arguments[2] : undefined;\n  var isAsync = arguments.length > 3 ? arguments[3] : undefined;\n  // Read the `.zip` archive.\n  // `result` is either `object` or `Promise<object>`\n  return unzip(new Uint8Array(input), {\n    // Ignore certain types of files.\n    filter: function filter(file) {\n      if (_filter) {\n        return _filter({\n          path: file.name\n        });\n      }\n      return true;\n    }\n  });\n}\nfunction unzipAsync(archive) {\n  return new Promise(function (resolve, reject) {\n    // `unzip()` will resort to \"synchronous\" decompression in two edge cases:\n    // * When the archive size is less than `512KB`.\n    // * When the data is barely compressed, i.e. the compression ratio is less than 20% reduction in size.\n    unzip(archive, function (error, files) {\n      if (error) {\n        reject(error);\n      } else {\n        resolve(files);\n      }\n    });\n  });\n}\n//# sourceMappingURL=unzipFromArrayBuffer.js.map","import { strFromU8 } from 'fflate';\n\n/**\r\n * @param {Record<string,Uint8Array} entries\r\n * @returns {Record<string,string>}\r\n */\nexport default function convertValuesFromUint8ArraysToStrings(entries) {\n  var convertedEntries = {};\n  for (var _i = 0, _Object$keys = Object.keys(entries); _i < _Object$keys.length; _i++) {\n    var key = _Object$keys[_i];\n    convertedEntries[key] = strFromU8(entries[key]);\n  }\n  return convertedEntries;\n}\n//# sourceMappingURL=convertValuesFromUint8ArraysToStrings.js.map","// An `.xlsx` `.zip` archive could contain all kinds of files,\n// such as `.bin` printer settings or `.png` images, etc.\n//\n// Because `read-excel-file` doesn't support returning any of those types of data,\n// there's no need to read those files from the `.xlsx` `.zip` archive,\n// optimizing the unpacking process a little bit.\n//\nexport default function filterZipArchiveEntry(_ref) {\n  var path = _ref.path;\n  return path.endsWith('.xml') || path.endsWith('.xml.rels');\n}\n//# sourceMappingURL=filterZipArchiveEntry.js.map","// Uses an \"async\" function of the unzipper function\n// just because it feels more correct to use it over the \"sync\" one\n// because it isn't supposed to ever freeze the \"main thread\" (GUI).\n//\n// import unzipFromArrayBufferSync from '../zip/unzipFromArrayBufferSync.js'\nimport unzipFromArrayBuffer from '../zip/unzipFromArrayBuffer.js';\nimport convertValuesFromUint8ArraysToStrings from './convertValuesFromUint8ArraysToStrings.js';\nimport filterZipArchiveEntry from './filterZipArchiveEntry.js';\n\n/**\r\n * Unpacks `*.xlsx` file contents.\r\n * An `.xlsx` file is really just a `.zip` archive with `.xml` files inside.\r\n * @param  {(File|Blob|ArrayBuffer)} input\r\n * @return {Promise<Record<string,string>} Resolves to an object holding `*.xlsx` file entries.\r\n */\nexport default function unpackXlsxFile(input) {\n  if (input instanceof File || input instanceof Blob) {\n    return input.arrayBuffer().then(getResultFromArrayBuffer);\n  }\n  return Promise.resolve(input).then(getResultFromArrayBuffer);\n}\nfunction getResultFromArrayBuffer(arrayBuffer) {\n  return unzipFromArrayBuffer(arrayBuffer, {\n    filter: filterZipArchiveEntry\n  }).then(convertValuesFromUint8ArraysToStrings);\n}\n\n// function getResultFromArrayBufferSync(arrayBuffer) {\n//  const result = unzipFromArrayBufferSync(arrayBuffer, { filter: filterZipArchiveEntry })\n// \treturn convertValuesFromUint8ArraysToStrings(result)\n// }\n//# sourceMappingURL=unpackXlsxFileBrowser.js.map","export function findChild(node, tagName) {\n  var i = 0;\n  while (i < node.childNodes.length) {\n    var childNode = node.childNodes[i];\n    // `nodeType: 1` means \"Element\".\n    // https://www.w3schools.com/xml/prop_element_nodetype.asp\n    if (childNode.nodeType === 1 && getTagName(childNode) === tagName) {\n      return childNode;\n    }\n    i++;\n  }\n}\nexport function findChildren(node, tagName) {\n  var results = [];\n  var i = 0;\n  while (i < node.childNodes.length) {\n    var childNode = node.childNodes[i];\n    // `nodeType: 1` means \"Element\".\n    // https://www.w3schools.com/xml/prop_element_nodetype.asp\n    if (childNode.nodeType === 1 && getTagName(childNode) === tagName) {\n      results.push(childNode);\n    }\n    i++;\n  }\n  return results;\n}\nexport function forEach(node, tagName, func) {\n  // if (typeof tagName === 'function') {\n  // \tfunc = tagName\n  // \ttagName = undefined\n  // }\n  var i = 0;\n  while (i < node.childNodes.length) {\n    var childNode = node.childNodes[i];\n    if (tagName) {\n      // `nodeType: 1` means \"Element\".\n      // https://www.w3schools.com/xml/prop_element_nodetype.asp\n      if (childNode.nodeType === 1 && getTagName(childNode) === tagName) {\n        func(childNode, i);\n      }\n    } else {\n      func(childNode, i);\n    }\n    i++;\n  }\n}\nexport function map(node, tagName, func) {\n  var results = [];\n  forEach(node, tagName, function (node, i) {\n    results.push(func(node, i));\n  });\n  return results;\n}\nvar NAMESPACE_REG_EXP = /.+\\:/;\nexport function getTagName(element) {\n  // For some weird reason, if an element is declared as,\n  // for example, `<x:sheets/>`, then its `.tagName` will be\n  // \"x:sheets\" instead of just \"sheets\".\n  // https://gitlab.com/catamphetamine/read-excel-file/-/issues/25\n  // Its not clear how to tell it to ignore any namespaces\n  // when getting `.tagName`, so just replacing anything\n  // before a colon, if any.\n  return element.tagName.replace(NAMESPACE_REG_EXP, '');\n}\nexport function isElement(node) {\n  // `nodeType: 1` means \"Element\".\n  // https://www.w3schools.com/xml/prop_element_nodetype.asp\n  return node.nodeType === 1;\n}\nexport function getFirstElementChild(element) {\n  var i = 0;\n  while (i < element.childNodes.length) {\n    if (isElement(element.childNodes[i])) {\n      return element.childNodes[i];\n    }\n    i++;\n  }\n}\n\n// This function is only used for occasional debug messages.\nexport function getOuterXml(node) {\n  // `nodeType: 1` means \"Element\".\n  // https://www.w3schools.com/xml/prop_element_nodetype.asp\n  if (node.nodeType !== 1) {\n    return node.textContent;\n  }\n  var xml = '<' + getTagName(node);\n  var j = 0;\n  while (j < node.attributes.length) {\n    xml += ' ' + node.attributes[j].name + '=' + '\"' + node.attributes[j].value + '\"';\n    j++;\n  }\n  xml += '>';\n  var i = 0;\n  while (i < node.childNodes.length) {\n    xml += getOuterXml(node.childNodes[i]);\n    i++;\n  }\n  xml += '</' + getTagName(node) + '>';\n  return xml;\n}\n//# sourceMappingURL=dom.js.map","import { findChild, findChildren, forEach, map, getFirstElementChild, getTagName } from './dom.js';\n\n// Returns an array of cells,\n// each element being an XML DOM element representing a cell.\nexport function getCellElements(document) {\n  var worksheet = document.documentElement;\n  var sheetData = findChild(worksheet, 'sheetData');\n  var cells = [];\n  forEach(sheetData, 'row', function (row) {\n    forEach(row, 'c', function (cell) {\n      cells.push(cell);\n    });\n  });\n  return cells;\n}\nexport function getMergedCellCoordinates(document) {\n  var worksheet = document.documentElement;\n  var mergedCells = findChild(worksheet, 'mergeCells');\n  var mergedCellsInfo = [];\n  if (mergedCells) {\n    forEach(mergedCells, 'mergeCell', function (mergedCell) {\n      mergedCellsInfo.push(mergedCell.getAttribute('ref'));\n    });\n  }\n  return mergedCellsInfo;\n}\nexport function getCellValueElement(document, element) {\n  return findChild(element, 'v');\n}\nexport function getCellInlineStringValue(document, element) {\n  // It seems as if in some weirdly-output \"*.xlsx\" files\n  // there're non-element nodes of some weird nature.\n  // https://gitlab.com/catamphetamine/read-excel-file/-/issues/109\n  // This code filters out such weird non-element nodes.\n  var firstElementChild = getFirstElementChild(element);\n  if (firstElementChild && getTagName(firstElementChild) === 'is') {\n    var firstElementChildFirstElementChild = getFirstElementChild(firstElementChild);\n    if (firstElementChildFirstElementChild && getTagName(firstElementChildFirstElementChild) === 't') {\n      return firstElementChildFirstElementChild.textContent;\n    }\n  }\n}\nexport function getDimensions(document) {\n  var worksheet = document.documentElement;\n  var dimensions = findChild(worksheet, 'dimension');\n  if (dimensions) {\n    return dimensions.getAttribute('ref');\n  }\n}\nexport function getBaseStyles(document) {\n  var styleSheet = document.documentElement;\n  var cellStyleXfs = findChild(styleSheet, 'cellStyleXfs');\n  if (cellStyleXfs) {\n    return findChildren(cellStyleXfs, 'xf');\n  }\n  return [];\n}\nexport function getCellStyles(document) {\n  var styleSheet = document.documentElement;\n  var cellXfs = findChild(styleSheet, 'cellXfs');\n  if (!cellXfs) {\n    return [];\n  }\n  return findChildren(cellXfs, 'xf');\n}\nexport function getNumberFormats(document) {\n  var styleSheet = document.documentElement;\n  var numberFormats = [];\n  var numFmts = findChild(styleSheet, 'numFmts');\n  if (numFmts) {\n    return findChildren(numFmts, 'numFmt');\n  }\n  return [];\n}\nexport function getSharedStrings(document) {\n  // An `<si/>` element can contain a `<t/>` (simplest case) or a set of `<r/>` (\"rich formatting\") elements having `<t/>`.\n  // https://docs.microsoft.com/en-us/dotnet/api/documentformat.openxml.spreadsheet.sharedstringitem?redirectedfrom=MSDN&view=openxml-2.8.1\n  // http://www.datypic.com/sc/ooxml/e-ssml_si-1.html\n\n  var sst = document.documentElement;\n  return map(sst, 'si', function (string) {\n    var t = findChild(string, 't');\n    if (t) {\n      return t.textContent;\n    }\n    var value = '';\n    forEach(string, 'r', function (r) {\n      value += findChild(r, 't').textContent;\n    });\n    return value;\n  });\n}\nexport function getWorkbookProperties(document) {\n  var workbook = document.documentElement;\n  return findChild(workbook, 'workbookPr');\n}\nexport function getRelationships(document) {\n  var relationships = document.documentElement;\n  return findChildren(relationships, 'Relationship');\n}\nexport function getSheets(document) {\n  var workbook = document.documentElement;\n  var sheets = findChild(workbook, 'sheets');\n  return findChildren(sheets, 'sheet');\n}\n//# sourceMappingURL=xlsx.js.map","function _createForOfIteratorHelperLoose(o, allowArrayLike) { var it = typeof Symbol !== \"undefined\" && o[Symbol.iterator] || o[\"@@iterator\"]; if (it) return (it = it.call(o)).next.bind(it); if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === \"number\") { if (it) o = it; var i = 0; return function () { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }; } throw new TypeError(\"Invalid attempt to iterate non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\"); }\nfunction _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === \"string\") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === \"Object\" && o.constructor) n = o.constructor.name; if (n === \"Map\" || n === \"Set\") return Array.from(o); if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }\nfunction _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i]; return arr2; }\nimport { getWorkbookProperties, getSheets } from '../xml/xlsx.js';\n\n// I guess `xl/workbook.xml` file should always be present inside the *.xlsx archive.\nexport default function parseSpreadsheetInfo(content, xml) {\n  var book = xml.createDocument(content);\n\n  // Read `<workbookPr/>` element to detect whether dates are 1900-based or 1904-based.\n  // https://support.microsoft.com/en-gb/help/214330/differences-between-the-1900-and-the-1904-date-system-in-excel\n  // http://webapp.docx4java.org/OnlineDemo/ecma376/SpreadsheetML/workbookPr.html\n  var workbookProperties = getWorkbookProperties(book);\n  var epoch1904 = Boolean(workbookProperties) && workbookProperties.getAttribute('date1904') === '1';\n\n  // Example of `<sheets/>` element:\n  //\n  // <sheets>\n  //   <sheet\n  //     xmlns:ns=\"http://schemas.openxmlformats.org/officeDocument/2006/relationships\"\n  //     name=\"Sheet1\"\n  //     sheetId=\"1\"\n  //     ns:id=\"rId3\"/>\n  // </sheets>\n\n  var sheets = [];\n  for (var _iterator = _createForOfIteratorHelperLoose(getSheets(book)), _step; !(_step = _iterator()).done;) {\n    var sheet = _step.value;\n    if (sheet.getAttribute('name')) {\n      sheets.push({\n        id: sheet.getAttribute('sheetId'),\n        name: sheet.getAttribute('name'),\n        relationId: sheet.getAttribute('r:id')\n      });\n    }\n  }\n  return {\n    epoch1904: epoch1904,\n    sheets: sheets\n  };\n}\n//# sourceMappingURL=parseSpreadsheetInfo.js.map","import { getRelationships } from '../xml/xlsx.js';\n\n/**\r\n * Returns sheet file paths.\r\n * Seems that the correct place to look for the `sheetId` -> `filename` mapping\r\n * is `xl/_rels/workbook.xml.rels` file.\r\n * https://github.com/tidyverse/readxl/issues/104\r\n * @param  {string} content — `xl/_rels/workbook.xml.rels` file contents.\r\n * @param  {object} xml\r\n * @return {object}\r\n */\nexport default function parseFilePaths(content, xml) {\n  // Example:\n  // <Relationships xmlns=\"http://schemas.openxmlformats.org/package/2006/relationships\">\n  //   ...\n  //   <Relationship\n  //     Id=\"rId3\"\n  //     Type=\"http://schemas.openxmlformats.org/officeDocument/2006/relationships/worksheet\"\n  //     Target=\"worksheets/sheet1.xml\"/>\n  // </Relationships>\n  var document = xml.createDocument(content);\n  var filePaths = {\n    sheets: {},\n    sharedStrings: undefined,\n    styles: undefined\n  };\n  var addFilePathInfo = function addFilePathInfo(relationship) {\n    var filePath = relationship.getAttribute('Target');\n    var fileType = relationship.getAttribute('Type');\n    switch (fileType) {\n      case 'http://schemas.openxmlformats.org/officeDocument/2006/relationships/styles':\n        filePaths.styles = getFilePath(filePath);\n        break;\n      case 'http://schemas.openxmlformats.org/officeDocument/2006/relationships/sharedStrings':\n        filePaths.sharedStrings = getFilePath(filePath);\n        break;\n      case 'http://schemas.openxmlformats.org/officeDocument/2006/relationships/worksheet':\n        filePaths.sheets[relationship.getAttribute('Id')] = getFilePath(filePath);\n        break;\n    }\n  };\n  getRelationships(document).forEach(addFilePathInfo);\n\n  // Seems like \"sharedStrings.xml\" is not required to exist.\n  // For example, when the spreadsheet doesn't contain any strings.\n  // https://github.com/catamphetamine/read-excel-file/issues/85\n  // if (!filePaths.sharedStrings) {\n  //   throw new Error('\"sharedStrings.xml\" file not found in the *.xlsx file')\n  // }\n\n  return filePaths;\n}\nfunction getFilePath(path) {\n  // Normally, `path` is a relative path inside the ZIP archive,\n  // like \"worksheets/sheet1.xml\", or \"sharedStrings.xml\", or \"styles.xml\".\n  // There has been one weird case when file path was an absolute path,\n  // like \"/xl/worksheets/sheet1.xml\" (specifically for sheets):\n  // https://github.com/catamphetamine/read-excel-file/pull/95\n  // Other libraries (like `xlsx`) and software (like Google Docs)\n  // seem to support such absolute file paths, so this library does too.\n  if (path[0] === '/') {\n    return path.slice('/'.length);\n  }\n  // // Seems like a path could also be a URL.\n  // // http://officeopenxml.com/anatomyofOOXML-xlsx.php\n  // if (/^[a-z]+\\:\\/\\//.test(path)) {\n  //   return path\n  // }\n  return 'xl/' + path;\n}\n//# sourceMappingURL=parseFilePaths.js.map","function _typeof(o) { \"@babel/helpers - typeof\"; return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (o) { return typeof o; } : function (o) { return o && \"function\" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? \"symbol\" : typeof o; }, _typeof(o); }\nfunction ownKeys(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }\nfunction _objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }\nfunction _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\nfunction _toPropertyKey(arg) { var key = _toPrimitive(arg, \"string\"); return _typeof(key) === \"symbol\" ? key : String(key); }\nfunction _toPrimitive(input, hint) { if (_typeof(input) !== \"object\" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || \"default\"); if (_typeof(res) !== \"object\") return res; throw new TypeError(\"@@toPrimitive must return a primitive value.\"); } return (hint === \"string\" ? String : Number)(input); }\nimport { getBaseStyles, getCellStyles, getNumberFormats } from '../xml/xlsx.js';\n\n// http://officeopenxml.com/SSstyles.php\n// Returns an array of cell styles.\n// A cell style index is its ID.\nexport default function parseStyles(content, xml) {\n  if (!content) {\n    return {};\n  }\n\n  // https://social.msdn.microsoft.com/Forums/sqlserver/en-US/708978af-b598-45c4-a598-d3518a5a09f0/howwhen-is-cellstylexfs-vs-cellxfs-applied-to-a-cell?forum=os_binaryfile\n  // https://www.office-forums.com/threads/cellxfs-cellstylexfs.2163519/\n  var doc = xml.createDocument(content);\n  var baseStyles = getBaseStyles(doc).map(parseCellStyle);\n  var numberFormats = getNumberFormats(doc).map(parseNumberFormatStyle).reduce(function (formats, format) {\n    // Format ID is a numeric index.\n    // There're some standard \"built-in\" formats (in Excel) up to about `100`.\n    formats[format.id] = format;\n    return formats;\n  }, []);\n  var getCellStyle = function getCellStyle(xf) {\n    if (xf.hasAttribute('xfId')) {\n      return _objectSpread(_objectSpread({}, baseStyles[xf.xfId]), parseCellStyle(xf, numberFormats));\n    }\n    return parseCellStyle(xf, numberFormats);\n  };\n  return getCellStyles(doc).map(getCellStyle);\n}\nfunction parseNumberFormatStyle(numFmt) {\n  return {\n    id: numFmt.getAttribute('numFmtId'),\n    template: numFmt.getAttribute('formatCode')\n  };\n}\n\n// http://www.datypic.com/sc/ooxml/e-ssml_xf-2.html\nfunction parseCellStyle(xf, numFmts) {\n  var style = {};\n  if (xf.hasAttribute('numFmtId')) {\n    var numberFormatId = xf.getAttribute('numFmtId');\n    // Built-in number formats don't have a `<numFmt/>` element in `styles.xml`.\n    // https://hexdocs.pm/xlsxir/number_styles.html\n    if (numFmts[numberFormatId]) {\n      style.numberFormat = numFmts[numberFormatId];\n    } else {\n      style.numberFormat = {\n        id: numberFormatId\n      };\n    }\n  }\n  return style;\n}\n//# sourceMappingURL=parseStyles.js.map","// Parses an Excel Date (represented by a \"serial\" floating-point number)\n// into a javascript `Date` in UTC+0 timezone (with time is set to 00:00).\n//\n// https://www.pcworld.com/article/3063622/software/mastering-excel-date-time-serial-numbers-networkdays-datevalue-and-more.html\n// \"If you need to calculate dates in your spreadsheets,\n//  Excel uses its own unique system, which it calls Serial Numbers\".\n//\nexport default function parseExcelDate(excelSerialDate, options) {\n  // Windows operating system uses floating-point numbers to represent dates,\n  // where the number represents the count of days elapsed since January 0th, 1900.\n  //\n  // This also means that there're 2 aspects associated with this choice:\n  //\n  // * January 1st, 1900, 00:00 is represented by `1` rather than `0`, which looks a bit weird.\n  // * 1900 is a special year because it's a \"one in a 100 years\" occasion when it's not a leap year.\n  //\n  // To work around those two aspects, Mac OS chose another baseline — January 1st, 1900.\n  // Although, that only postponed the second issue because 2100 is going to be the next \"speciaL\" year\n  // which is not going to be a \"leap\" one.\n  //\n  // Older versions of Excel on Mac OS used year 1904 as the default baseline for numeric dates.\n  // Since 2011, Microsoft Excel on Mac OS uses year 1900 as the default baseline for cross-platform consistency.\n  // https://support.microsoft.com/en-us/office/date-systems-in-excel-e7fe7167-48a9-4b96-bb53-5612a800b487\n  //\n  // So the 1904 baseline is now deprecated, although still available to be configured manually.\n  // So it still might be encountered in Excel files created on MacOS.\n  // In that case, the Excel file contains a special flag — `<workbook><workbookPr date1904=\"1\"/>...` —\n  // that tells the application which baseline is being used for numeric date timestamps.\n  //\n  if (options && options.epoch1904) {\n    // Convert the numeric date timestamp from 1904 baseline to 1900 baseline.\n    excelSerialDate += (1904 - 1900) * DAYS_IN_YEAR + JANUARY_0TH_1900_DAY + ERRONEOUS_FEBRUARY_29_1990_DAY;\n  }\n  var daysBeforeUnixEpoch = JANUARY_0TH_1900_DAY + ERRONEOUS_FEBRUARY_29_1990_DAY + (1970 - 1900) * DAYS_IN_YEAR + NUMBER_OF_LEAP_YEARS_BETWEEN_1900_AND_1970;\n  return new Date(Math.floor((excelSerialDate - daysBeforeUnixEpoch) * DAY));\n}\n\n// \"Excel serial date\" is just a (fractional) count of days passed since `00/01/1900`.\n//\n// In contrast, \"Unix timestamps\" use `01/01/1970` as the baseline for numeric dates.\n//\n// In order to convert one into another, it should calculate the count of days elapsed\n// since `00/01/1900` (Excel epoch) till `01/01/1970` (Unix epoch), or the count of days\n// between year `1900` and year `1970`, plus one day.\n//\n// It also should account for the number of \"leap years\" between year `1900` and year `1970`,\n// which is 17 of them. https://kalender-365.de/leap-years.php\n//\n// \"One year has the length of 365 days, 5 hours, 48 minutes and 45 seconds.\n//  These are 365.2421875 days. This is hard to calculate with, so for practical reasons\n//  a normal year has been given 365 days and a leap year 366 days. In leap years,\n//  February 29th is added as leap day, which doesn't exist in a normal year.\n//  A leap year is every 4 years, but not every 100 years, then again every 400 years.\n//  So the year 1900 wasn't a leap year, but 2000 was\".\n//\n// And also, Excel has a historical bug when it incorrectly assumes year `1900` to be a leap year,\n// and, as a result, all Excel serial dates starting from March 1st, 1900 lag 1 day behind\n// and require an additional 1 day to be added to them in order to be converted to a proper timestamp.\n//\n// https://learn.microsoft.com/en-us/answers/questions/5249322/why-does-microsoft-excel-considers-29-02-1900-to-b?forum=msoffice-all&referrer=answers#:~:text=This%20made%20it%20easier%20for,other%20programs%20that%20use%20dates.\n//\n// \"When Lotus 1-2-3 was first released, the program assumed that the year 1900 was a leap year,\n//  even though it actually was not a leap year. This made it easier for the program to handle\n//  leap years and caused no harm to almost all date calculations in Lotus 1-2-3.\n//\n//  When Microsoft Multiplan and Microsoft Excel were released, they also assumed that 1900\n//  was a leap year. This assumption allowed Microsoft Multiplan and Microsoft Excel to use\n//  the same serial date system used by Lotus 1-2-3 and provide greater compatibility with Lotus 1-2-3.\n//  Treating 1900 as a leap year also made it easier for users to move worksheets from one program\n//  to the other\".\n//\n// So the historical bug is basically that Excel thinks that February 29th, 1900 existed\n// while in reality it didn't. That's why it's actually 1 day off for any date after that one.\n//\nvar NUMBER_OF_LEAP_YEARS_BETWEEN_1900_AND_1970 = 17;\nvar JANUARY_0TH_1900_DAY = 1;\nvar ERRONEOUS_FEBRUARY_29_1990_DAY = 1;\n\n// An approximate count of seconds in a day is:\n// 24 hours * 60 minutes in an hour * 60 seconds in a minute\n//\n// It is approximate because a minute could be longer than 60 seconds, due to \"leap seconds\".\n//\n// Still, javascript `Date`, and UNIX time in general, intentionally\n// drop the concept of \"leap seconds\" in order to make things simpler.\n// So this approximation is valid and doesn't result in any bugs.\n// https://stackoverflow.com/questions/53019726/where-are-the-leap-seconds-in-javascript\n//\n// \"The JavaScript Date object specifically adheres to the concept of Unix Time\n//  (albeit with higher precision). This is part of the POSIX specification,\n//  and thus is sometimes called \"POSIX Time\". It does not count leap seconds,\n//  but rather assumes every day had exactly 86,400 seconds. You can read about\n//  this in section 20.3.1.1 of the current ECMAScript specification, which states:\n//\n//  \"Time is measured in ECMAScript in milliseconds since 01 January, 1970 UTC.\n//   In time values leap seconds are ignored. It is assumed that there are exactly\n//   86,400,000 milliseconds per day.\"\n//\n// The reason is that the unpredictable nature of leap seconds makes them very\n// difficult to work with in APIs. One can't generally pass timestamps around\n// that need leap seconds tables to be interpreted correctly, and expect that\n// one system will interpret them the same as another. For example, a timestamp\n// `1483228826` that accounts for \"leap seconds\" should've been interpreted as\n// \"2017-01-01T00:00:00Z\", but if the receiver doesn't account for \"leap seconds\",\n// they would interpret it as \"2017-01-01T00:00:26Z\" (e.g. POSIX-based systems like Linux),\n// So \"leap seconds\" aren't really portable.\n// Even on systems that have full frequently-updated \"leap second\" tables,\n// there's no telling what adjustments those tables will contain in the future\n// (i.e. beyond the 6-month IERS announcement period) because \"leap seconds\" can't be\n// determined by a fixed mathematical formula or something like that. Instead,\n// scientists introduce them as needed based on the observed Earth's rotation around the sun.\n//\n// \"Because the Earth's rotational speed varies in response to climatic and geological events,\n//  UTC leap seconds are irregularly spaced and not precisely predictable. The decision to insert\n// a leap second is made by the International Earth Rotation and Reference Systems Service (IERS),\n// typically about six months in advance, to ensure that the difference between UTC and UT1\n// does not exceed ±0.9 seconds.\"\n//\n// One example is year `1900` which is \"every fourth year\" but it still is not a \"leap year\".\n//\n// To reiterate: to support leap seconds in a programming language, the implementation\n// must go out of its way to do so, and must make tradeoffs that are not always acceptable.\n// Though there are exceptions, the general position is to not support them - not because\n// of any subversion or active countermeasures, but because supporting them properly is much,\n// much harder.\n//\n// https://en.wikipedia.org/wiki/Unix_time#Leap_seconds\n// https://en.wikipedia.org/wiki/Leap_year\n// https://en.wikipedia.org/wiki/Leap_second\n//\nvar DAY = 24 * 60 * 60 * 1000;\nvar DAYS_IN_YEAR = 365;\n//# sourceMappingURL=parseExcelDate.js.map","function _createForOfIteratorHelperLoose(o, allowArrayLike) { var it = typeof Symbol !== \"undefined\" && o[Symbol.iterator] || o[\"@@iterator\"]; if (it) return (it = it.call(o)).next.bind(it); if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === \"number\") { if (it) o = it; var i = 0; return function () { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }; } throw new TypeError(\"Invalid attempt to iterate non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\"); }\nfunction _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === \"string\") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === \"Object\" && o.constructor) n = o.constructor.name; if (n === \"Map\" || n === \"Set\") return Array.from(o); if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }\nfunction _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i]; return arr2; }\n// On some date formats, there's a \"[$-...]\" prefix that locks the locale\n// to be a specific one when formatting a date using this format.\n//\n// https://stackoverflow.com/questions/4730152/what-indicates-an-office-open-xml-cell-contains-a-date-time-value\n//\n// Format examples:\n//\n// * \"[$-404]e/m/d\"\n// * \"[$-414]mmmm\\ yyyy;@\"\n// * \"[$-ru-RU]dd.mm.yyyy;@\"\n// * \"[$-x-sysdate]dddd, mmmm dd, yyyy\"\n//\nvar DATE_FORMAT_SPECIFIC_LOCALE_PREFIX = /^\\[\\$-[^\\]]+\\]/;\n\n// On some date formats, there's a \";@\" suffix.\n// It instructs the spreadsheet editor application to display any non-numeric\n// value as is instead of hiding it or something like that.\n//\n// For example, if one inputs \"Some text\" instead of a date in such cell,\n// it will still show \"Some text\" instead of an empty cell, even though\n// the value is strictly-speaking invalid.\n//\n// Specifically, \";\" means \"anything before this applies only to a numeric value,\n// while anything after it applies to a text value\". And a follow-up \"@\" means\n// \"for a text value, just output it as is\".\n//\n// It's not really clear why would anyone add such a feature to a format.\n// Perhaps it feels more \"user-friendly\" towards a non-\"tech-savvy\" user\n// of a spreadsheet editor application.\n//\n// Format examples:\n//\n// * \"m/d/yyyy;@\"\n// * \"[$-414]mmmm\\ yyyy;@\"\n//\nvar DATE_FORMAT_ALLOW_ANY_OTHER_TEXT_SUFFIX = /;@$/;\nvar CACHE = {};\nexport default function isDateFormatCached(template) {\n  if (template in CACHE) {\n    return CACHE[template];\n  }\n  var result = isDateFormat(template);\n  CACHE[template] = result;\n  return result;\n}\nfunction isDateFormat(template) {\n  // Date format tokens could be in upper case or in lower case.\n  // There seems to be no single standard.\n  // So the template is lowercased first.\n  template = template.toLowerCase();\n\n  // On some date formats, there's an \"[$-...]\" prefix.\n  // It forces a specific locale to be used when formatting a date.\n  template = template.replace(DATE_FORMAT_SPECIFIC_LOCALE_PREFIX, '');\n\n  // On some date formats, there's an \";@\" suffix.\n  // It's not clear why would anyone need it in a date format template.\n  // Still, because it occurs there, it should be stripped.\n  template = template.replace(DATE_FORMAT_ALLOW_ANY_OTHER_TEXT_SUFFIX, '');\n\n  // Extract all alphabetic parts from what's left from the template string.\n  // Example: \"mm/dd/yyyy\" → [\"mm\", \"dd\", \"yyyy\"]\n  var tokens = template.split(/\\W+/);\n\n  // If no alphabetic parts are present in what's left from the template string\n  // then it could be any kind of template such as a generic numeric template\n  // such as \"$#,##0.00\" currency template or \"0.0%\" percentage template.\n  if (tokens.length < 0) {\n    return false;\n  }\n  for (var _iterator = _createForOfIteratorHelperLoose(tokens), _step; !(_step = _iterator()).done;) {\n    var token = _step.value;\n    // If a non-date-format-specific alphabetic substring is found,\n    // this might not necessarily be a date format.\n    if (DATE_TEMPLATE_TOKENS.indexOf(token) < 0) {\n      return false;\n    }\n  }\n  return true;\n}\n\n// These tokens could be in upper case or in lower case.\n// There seems to be no single standard, so using lower case.\nvar DATE_TEMPLATE_TOKENS = [\n// Seconds (min two digits). Example: \"05\".\n'ss',\n// Minutes (min two digits). Example: \"05\". Could also be \"Months\". Weird.\n'mm',\n// Hours. Example: \"1\".\n'h',\n// Hours (min two digits). Example: \"01\".\n'hh',\n// \"AM\" part of \"AM/PM\". Lowercased just in case.\n'am',\n// \"PM\" part of \"AM/PM\". Lowercased just in case.\n'pm',\n// Day. Example: \"1\"\n'd',\n// Day (min two digits). Example: \"01\"\n'dd',\n// Month (numeric). Example: \"1\".\n'm',\n// Month (numeric, min two digits). Example: \"01\". Could also be \"Minutes\". Weird.\n'mm',\n// Month (shortened month name). Example: \"Jan\".\n'mmm',\n// Month (full month name). Example: \"January\".\n'mmmm',\n// Two-digit year. Example: \"20\".\n'yy',\n// Full year. Example: \"2020\".\n'yyyy',\n// I don't have any idea what \"e\" means.\n// It's used in \"built-in\" XLSX formats:\n// * 27 '[$-404]e/m/d';\n// * 36 '[$-404]e/m/d';\n// * 50 '[$-404]e/m/d';\n// * 57 '[$-404]e/m/d';\n'e'];\n//# sourceMappingURL=isDateFormat.js.map","// XLSX does have \"d\" type for dates, but it's not commonly used.\n// Instead, it prefers using \"n\" type for storing dates as timestamps.\n//\n// Whether a numeric value is a number or a date timestamp, it sometimes could be\n// detected by looking at the value \"format\" and seeing if it's a date-specific one.\n\nimport isDateFormat from './isDateFormat.js';\nexport default function isDateFormatStyle(styleId, styles, options) {\n  if (styleId) {\n    var style = styles[styleId];\n    if (!style) {\n      throw new Error(\"Cell style not found: \".concat(styleId));\n    }\n    if (!style.numberFormat) {\n      return false;\n    }\n    if (\n    // Whether it's a \"number format\" that's conventionally used for storing date timestamps.\n    BUILT_IN_DATE_FORMAT_IDS.indexOf(Number(style.numberFormat.id)) >= 0 ||\n    // Whether it's a \"number format\" that uses a \"formatting template\"\n    // that the developer is certain is a date formatting template.\n    options.dateFormat && style.numberFormat.template === options.dateFormat ||\n    // Whether the \"smart formatting template\" feature is not disabled\n    // and it has detected that it's a date formatting template by looking at it.\n    options.smartDateParser !== false && style.numberFormat.template && isDateFormat(style.numberFormat.template)) {\n      return true;\n    }\n  }\n}\n\n// Built-in formats have ID < 164.\n// Some of those formats are intended to use when displaying dates.\n//\n// Depending on the \"locale\" used by the spreadsheet viewing application,\n// different built-in format IDs might correspond to different templates.\n// https://learn.microsoft.com/en-us/dotnet/api/documentformat.openxml.spreadsheet.numberingformat?view=openxml-2.8.1\n//\n// Here's a list of \"locale\"-independent built-in format IDs that're known to represent dates.\n//\nvar LOCALE_INDEPENDENT_BUILT_IN_DATE_FORMAT_IDS = [14,\n// mm-dd-yy\n15,\n// d-mmm-yy\n16,\n// d-mmm\n17,\n// mmm-yy\n18,\n// h:mm AM/PM\n19,\n// h:mm:ss AM/PM\n20,\n// h:mm\n21,\n// h:mm:ss\n22,\n// m/d/yy h:mm\n45,\n// mm:ss\n46,\n// [h]:mm:ss\n47 // mmss.0\n];\n\n// \"zh-tw\" OR \"zh-cn\" locales.\n// Language glyphs (aka \"hieroglyphs\") are not replaced with their respective unicode values here.\nvar MAINLAND_CHINESE_OR_TAIWANESE_LOCALE_BUILT_IN_DATE_FORMAT_IDS = [27,\n// [$-404]e/m/d OR yyyy\"年\"m\"月\"\n28,\n// [$-404]e\"年\"m\"月\"d\"日\" OR m\"月\"d\"日\"\n29,\n// [$-404]e\"年\"m\"月\"d\"日\" OR m\"月\"d\"日\"\n30,\n// m/d/yy OR m-d-yy\n31,\n// yyyy\"年\"m\"月\"d\"日\" OR yyyy\"年\"m\"月\"d\"日\"\n32,\n// hh\"時\"mm\"分\" OR h\"时\"mm\"分\"\n33,\n// hh\"時\"mm\"分\"ss\"秒\" OR h\"时\"mm\"分\"ss\"秒\"\n34,\n// 上午/下午hh\"時\"mm\"分\" OR 上午/下午h\"时\"mm\"分\"\n35,\n// 上午/下午hh\"時\"mm\"分\"ss\"秒\" OR 上午/下午h\"时\"mm\"分\"ss\"秒\"\n36,\n// [$-404]e/m/d OR yyyy\"年\"m\"月\"\n50,\n// [$-404]e/m/d OR yyyy\"年\"m\"月\"\n51,\n// [$-404]e\"年\"m\"月\"d\"日\" OR m\"月\"d\"日\"\n52,\n// 上午/下午hh\"時\"mm\"分\" OR yyyy\"年\"m\"月\"\n53,\n// 上午/下午hh\"時\"mm\"分\"ss\"秒\" OR m\"月\"d\"日\"\n54,\n// [$-404]e\"年\"m\"月\"d\"日\" OR m\"月\"d\"日\"\n55,\n// 上午/下午hh\"時\"mm\"分\" OR 上午/下午h\"时\"mm\"分\"\n56,\n// 上午/下午hh\"時\"mm\"分\"ss\"秒\" OR 上午/下午h\"时\"mm\"分\"ss\"秒\"\n57,\n// [$-404]e/m/d OR yyyy\"年\"m\"月\"\n58 // [$-404]e\"年\"m\"月\"d\"日\" OR m\"月\"d\"日\"\n];\n\n// \"ja-jp\" OR \"ko-kr\" locales.\n// Language glyphs (aka \"hieroglyphs\") are not replaced with their respective unicode values here.\nvar JAPANESE_OR_KOREAN_LOCALE_BUILT_IN_DATE_FORMAT_IDS = [27,\n// [$-411]ge.m.d OR yyyy\"年\" mm\"月\" dd\"日\"\n28,\n// [$-411]ggge\"年\"m\"月\"d\"日\" OR mm-dd\n29,\n// [$-411]ggge\"年\"m\"月\"d\"日\" OR mm-dd\n30,\n// m/d/yy OR mm-dd-yy\n31,\n// yyyy\"年\"m\"月\"d\"日\" OR yyyy\"년\" mm\"월\" dd\"일\"\n32,\n// h\"時\"mm\"分\" OR h\"시\" mm\"분\"\n33,\n// h\"時\"mm\"分\"ss\"秒\" OR h\"시\" mm\"분\" ss\"초\"\n34,\n// yyyy\"年\"m\"月\" OR yyyy-mm-dd\n35,\n// m\"月\"d\"日\" OR yyyy-mm-dd\n36,\n// [$-411]ge.m.d OR yyyy\"年\" mm\"月\" dd\"日\"\n50,\n// [$-411]ge.m.d OR yyyy\"年\" mm\"月\" dd\"日\"\n51,\n// [$-411]ggge\"年\"m\"月\"d\"日\" OR mm-dd\n52,\n// yyyy\"年\"m\"月\" OR yyyy-mm-dd\n53,\n// m\"月\"d\"日\" OR yyyy-mm-dd\n54,\n// [$-411]ggge\"年\"m\"月\"d\"日\" OR mm-dd\n55,\n// yyyy\"年\"m\"月\" OR yyyy-mm-dd\n56,\n// m\"月\"d\"日\" OR yyyy-mm-dd\n57,\n// [$-411]ge.m.d OR yyyy\"年\" mm\"月\" dd\"日\"\n58 // [$-411]ggge\"年\"m\"月\"d\"日\" OR mm-dd\n];\n\n// \"th-th\" locale.\n// Language glyphs (aka \"hieroglyphs\") are not replaced with their respective unicode values here.\nvar THAI_LOCALE_BUILT_IN_DATE_FORMAT_IDS = [71,\n// ว/ด/ปปปป\n72,\n// ว-ดดด-ปป\n73,\n// ว-ดดด\n74,\n// ดดด-ปป\n75,\n// ช:นน\n76,\n// ช:นน:ทท\n77,\n// ว/ด/ปปปป ช:นน\n78,\n// นน:ทท\n79,\n// [ช]:นน:ทท\n80,\n// นน:ทท.0\n81 // d/m/bb\n];\n\n// Start with language-agnostic date format IDs.\nvar BUILT_IN_DATE_FORMAT_IDS = LOCALE_INDEPENDENT_BUILT_IN_DATE_FORMAT_IDS.concat(\n// Add Mainland Chinese or Taiwanese date format IDs that haven't already been added.\nMAINLAND_CHINESE_OR_TAIWANESE_LOCALE_BUILT_IN_DATE_FORMAT_IDS).concat(\n// Add Japanese or Korean date format IDs that haven't already been added.\nJAPANESE_OR_KOREAN_LOCALE_BUILT_IN_DATE_FORMAT_IDS.filter(function (numberFormatId) {\n  return MAINLAND_CHINESE_OR_TAIWANESE_LOCALE_BUILT_IN_DATE_FORMAT_IDS.indexOf(numberFormatId) < 0;\n})).concat(\n// Add Thai date format IDs that haven't already been added.\nTHAI_LOCALE_BUILT_IN_DATE_FORMAT_IDS.filter(function (numberFormatId) {\n  return MAINLAND_CHINESE_OR_TAIWANESE_LOCALE_BUILT_IN_DATE_FORMAT_IDS.indexOf(numberFormatId) < 0;\n}).filter(function (numberFormatId) {\n  return JAPANESE_OR_KOREAN_LOCALE_BUILT_IN_DATE_FORMAT_IDS.indexOf(numberFormatId) < 0;\n}));\n//# sourceMappingURL=isDateFormatStyle.js.map","import parseExcelDate from './parseExcelDate.js';\nimport isDateFormatStyle from './isDateFormatStyle.js';\n\n// Parses a string `value` of a cell.\nexport default function parseCellValue(value, type, _ref) {\n  var getInlineStringValue = _ref.getInlineStringValue,\n    getInlineStringXml = _ref.getInlineStringXml,\n    getStyleId = _ref.getStyleId,\n    styles = _ref.styles,\n    sharedStrings = _ref.sharedStrings,\n    epoch1904 = _ref.epoch1904,\n    options = _ref.options;\n  if (!type) {\n    // Default cell type is \"n\" (numeric).\n    // http://www.datypic.com/sc/ooxml/t-ssml_CT_Cell.html\n    type = 'n';\n  }\n\n  // Available Excel cell types:\n  // https://github.com/SheetJS/sheetjs/blob/19620da30be2a7d7b9801938a0b9b1fd3c4c4b00/docbits/52_datatype.md\n  //\n  // Some other document (seems to be old):\n  // http://webapp.docx4java.org/OnlineDemo/ecma376/SpreadsheetML/ST_CellType.html\n  //\n  switch (type) {\n    // XLSX tends to store all strings as \"shared\" (indexed) ones\n    // using \"s\" cell type (for saving on strage space).\n    // \"str\" cell type is then generally only used for storing\n    // formula-pre-calculated cell values.\n    case 'str':\n      value = parseString(value, options);\n      break;\n\n    // Sometimes, XLSX stores strings as \"inline\" strings rather than \"shared\" (indexed) ones.\n    // Perhaps the specification doesn't force it to use one or another.\n    // Example: `<sheetData><row r=\"1\"><c r=\"A1\" s=\"1\" t=\"inlineStr\"><is><t>Test 123</t></is></c></row></sheetData>`.\n    case 'inlineStr':\n      value = getInlineStringValue();\n      if (value === undefined) {\n        throw new Error(\"Unsupported \\\"inline string\\\" cell value structure: \".concat(getInlineStringXml()));\n      }\n      value = parseString(value, options);\n      break;\n\n    // XLSX tends to store string values as \"shared\" (indexed) ones.\n    // \"Shared\" strings is a way for an Excel editor to reduce\n    // the file size by storing \"commonly used\" strings in a dictionary\n    // and then referring to such strings by their index in that dictionary.\n    // Example: `<sheetData><row r=\"1\"><c r=\"A1\" s=\"1\" t=\"s\"><v>0</v></c></row></sheetData>`.\n    case 's':\n      // If a cell has no value then there's no `<c/>` element for it.\n      // If a `<c/>` element exists then it's not empty.\n      // The `<v/>`alue is a key in the \"shared strings\" dictionary of the\n      // XLSX file, so look it up in the `sharedStrings` dictionary by the numeric key.\n      var sharedStringIndex = Number(value);\n      if (isNaN(sharedStringIndex)) {\n        throw new Error(\"Invalid \\\"shared\\\" string index: \".concat(value));\n      }\n      if (sharedStringIndex >= sharedStrings.length) {\n        throw new Error(\"An out-of-bounds \\\"shared\\\" string index: \".concat(value));\n      }\n      value = sharedStrings[sharedStringIndex];\n      value = parseString(value, options);\n      break;\n\n    // Boolean (TRUE/FALSE) values are stored as either \"1\" or \"0\"\n    // in cells of type \"b\".\n    case 'b':\n      if (value === '1') {\n        value = true;\n      } else if (value === '0') {\n        value = false;\n      } else {\n        throw new Error(\"Unsupported \\\"boolean\\\" cell value: \".concat(value));\n      }\n      break;\n\n    // XLSX specification seems to support cells of type \"z\":\n    // blank \"stub\" cells that should be ignored by data processing utilities.\n    case 'z':\n      value = undefined;\n      break;\n\n    // XLSX specification also defines cells of type \"e\" containing a numeric \"error\" code.\n    // It's not clear what that means though.\n    // They also wrote: \"and `w` property stores its common name\".\n    // It's unclear what they meant by that.\n    case 'e':\n      value = decodeError(value);\n      break;\n\n    // XLSX supports date cells of type \"d\", though seems like it (almost?) never\n    // uses it for storing dates, preferring \"n\" numeric timestamp cells instead.\n    // The value of a \"d\" cell is supposedly a string in \"ISO 8601\" format.\n    // I haven't seen an XLSX file having such cells.\n    // Example: `<sheetData><row r=\"1\"><c r=\"A1\" s=\"1\" t=\"d\"><v>2021-06-10T00:47:45.700Z</v></c></row></sheetData>`.\n    case 'd':\n      if (value === undefined) {\n        break;\n      }\n      var parsedDate = new Date(value);\n      if (isNaN(parsedDate.valueOf())) {\n        throw new Error(\"Unsupported \\\"date\\\" cell value: \".concat(value));\n      }\n      value = parsedDate;\n      break;\n\n    // Numeric cells have type \"n\".\n    case 'n':\n      if (value === undefined) {\n        break;\n      }\n      // XLSX does have \"d\" type for dates, but it's not commonly used.\n      // Instead, it prefers using \"n\" type for storing dates as timestamps.\n      var styleId = getStyleId();\n      if (styleId && isDateFormatStyle(styleId, styles, options)) {\n        // Parse the number from string.\n        value = parseNumberDefault(value);\n        // Parse the number as a date timestamp.\n        value = parseExcelDate(value, {\n          epoch1904: epoch1904\n        });\n      } else {\n        // Parse the number from string.\n        // Supports custom parsing function to work around javascript number encoding precision issues.\n        // https://gitlab.com/catamphetamine/read-excel-file/-/issues/85\n        var parseNumber = options.parseNumber || parseNumberDefault;\n        value = parseNumber(value);\n      }\n      break;\n    default:\n      throw new TypeError(\"Cell type not supported: \".concat(type));\n  }\n\n  // Convert empty values to `null`.\n  if (value === undefined) {\n    value = null;\n  }\n  return value;\n}\n\n// Decodes numeric error code to a string code.\n// https://github.com/SheetJS/sheetjs/blob/19620da30be2a7d7b9801938a0b9b1fd3c4c4b00/docbits/52_datatype.md\nfunction decodeError(errorCode) {\n  // While the error values are determined by the application,\n  // the following are some example error values that could be used:\n  switch (errorCode) {\n    case 0x00:\n      return '#NULL!';\n    case 0x07:\n      return '#DIV/0!';\n    case 0x0F:\n      return '#VALUE!';\n    case 0x17:\n      return '#REF!';\n    case 0x1D:\n      return '#NAME?';\n    case 0x24:\n      return '#NUM!';\n    case 0x2A:\n      return '#N/A';\n    case 0x2B:\n      return '#GETTING_DATA';\n    default:\n      // Such error code doesn't exist. I made it up.\n      return \"#ERROR_\".concat(errorCode);\n  }\n}\nfunction parseString(value, options) {\n  // In some weird cases, a developer might want to disable\n  // the automatic trimming of all strings.\n  // For example, leading spaces might express a tree-like hierarchy.\n  // https://github.com/catamphetamine/read-excel-file/pull/106#issuecomment-1136062917\n  if (options.trim !== false) {\n    value = value.trim();\n  }\n  if (value === '') {\n    value = undefined;\n  }\n  return value;\n}\n\n// Parses a number from string.\n// Throws an error if the number couldn't be parsed.\n// When parsing floating-point number, is affected by\n// the javascript number encoding precision issues:\n// https://www.youtube.com/watch?v=2gIxbTn7GSc\n// https://www.avioconsulting.com/blog/overcoming-javascript-numeric-precision-issues\nfunction parseNumberDefault(stringifiedNumber) {\n  var parsedNumber = Number(stringifiedNumber);\n  if (isNaN(parsedNumber)) {\n    throw new Error(\"Invalid \\\"numeric\\\" cell value: \".concat(stringifiedNumber));\n  }\n  return parsedNumber;\n}\n//# sourceMappingURL=parseCellValue.js.map","function _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _unsupportedIterableToArray(arr, i) || _nonIterableRest(); }\nfunction _nonIterableRest() { throw new TypeError(\"Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\"); }\nfunction _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === \"string\") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === \"Object\" && o.constructor) n = o.constructor.name; if (n === \"Map\" || n === \"Set\") return Array.from(o); if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }\nfunction _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i]; return arr2; }\nfunction _iterableToArrayLimit(r, l) { var t = null == r ? null : \"undefined\" != typeof Symbol && r[Symbol.iterator] || r[\"@@iterator\"]; if (null != t) { var e, n, i, u, a = [], f = !0, o = !1; try { if (i = (t = t.call(r)).next, 0 === l) { if (Object(t) !== t) return; f = !1; } else for (; !(f = (e = i.call(t)).done) && (a.push(e.value), a.length !== l); f = !0); } catch (r) { o = !0, n = r; } finally { try { if (!f && null != t[\"return\"] && (u = t[\"return\"](), Object(u) !== u)) return; } finally { if (o) throw n; } } return a; } }\nfunction _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }\nexport default function parseCellCoordinates(coordinatesString) {\n  // Coordinate examples: \"AA2091\", \"R988\", \"B1\".\n  var _coordinatesString$sp = coordinatesString.split(/(\\d+)/),\n    _coordinatesString$sp2 = _slicedToArray(_coordinatesString$sp, 2),\n    column = _coordinatesString$sp2[0],\n    row = _coordinatesString$sp2[1];\n  return [\n  // Row.\n  Number(row),\n  // Column.\n  // It's not clear why would `column` ever be non-trimmed,\n  // but if it was added here then perhaps it could hypothetically happen, or smth.\n  getColumnNumberFromColumnLetters(column.trim())];\n}\n\n// Maps \"A1\"-like coordinates to `{ row, column }` numeric coordinates.\nvar LETTERS = [\"\", \"A\", \"B\", \"C\", \"D\", \"E\", \"F\", \"G\", \"H\", \"I\", \"J\", \"K\", \"L\", \"M\", \"N\", \"O\", \"P\", \"Q\", \"R\", \"S\", \"T\", \"U\", \"V\", \"W\", \"X\", \"Y\", \"Z\"];\n\n// Converts a letter coordinate to a digit coordinate.\n// Examples: \"A\" -> 1, \"B\" -> 2, \"Z\" -> 26, \"AA\" -> 27, etc.\nfunction getColumnNumberFromColumnLetters(columnLetters) {\n  // `for ... of ...` would require Babel polyfill for iterating a string.\n  var n = 0;\n  var i = 0;\n  while (i < columnLetters.length) {\n    n *= 26;\n    n += LETTERS.indexOf(columnLetters[i]);\n    i++;\n  }\n  return n;\n}\n//# sourceMappingURL=parseCellCoordinates.js.map","import parseCellValue from './parseCellValue.js';\nimport parseCellCoordinates from './parseCellCoordinates.js';\nimport { getCellValueElement, getCellInlineStringValue } from '../xml/xlsx.js';\nimport { getOuterXml } from '../xml/dom.js';\n\n// Example of a `<c/>`ell element:\n//\n// <c>\n//    <f>string</f> — formula.\n//    <v>string</v> — formula pre-computed value.\n//    <is>\n//       <t>string</t> — an `inlineStr` string (rather than a \"common string\" from a dictionary).\n//       <r>\n//          <rPr>\n//            ...\n//          </rPr>\n//          <t>string</t>\n//       </r>\n//       <rPh sb=\"1\" eb=\"1\">\n//          <t>string</t>\n//       </rPh>\n//       <phoneticPr fontId=\"1\"/>\n//    </is>\n//    <extLst>\n//       <ext>\n//          <!--any element-->\n//       </ext>\n//    </extLst>\n// </c>\n//\nexport default function parseCell(element, sheetDocument, sharedStrings, styles, epoch1904, options) {\n  var coordinates = parseCellCoordinates(element.getAttribute('r'));\n  var valueElement = getCellValueElement(sheetDocument, element);\n\n  // When the value element doesn't exist, it would be returned as `undefined`\n  // when using `xpath` and as `null` when using `DOMParser`.\n  // So here it uses `value && ...` syntax instead of `if (value !== undefined) { ... }`\n  // for compatibility with both `xpath` and `DOMParser`.\n  var value = valueElement && valueElement.textContent;\n  var type = element.getAttribute('t');\n  return {\n    row: coordinates[0],\n    column: coordinates[1],\n    value: parseCellValue(value, type, {\n      getInlineStringValue: function getInlineStringValue() {\n        return getCellInlineStringValue(sheetDocument, element);\n      },\n      getInlineStringXml: function getInlineStringXml() {\n        return getOuterXml(element);\n      },\n      getStyleId: function getStyleId() {\n        return element.getAttribute('s');\n      },\n      styles: styles,\n      sharedStrings: sharedStrings,\n      epoch1904: epoch1904,\n      options: options\n    })\n  };\n}\n//# sourceMappingURL=parseCell.js.map","import { getCellElements } from '../xml/xlsx.js';\nimport parseCell from './parseCell.js';\nexport default function parseCells(sheetDocument, sharedStrings, styles, epoch1904, options) {\n  var cells = getCellElements(sheetDocument);\n  if (cells.length === 0) {\n    return [];\n  }\n\n  // It seems like the idea of parsing \"merged cells\" was abandoned without being finished.\n  // Here, it seems to just get to the stage of parsing merged cell coordinates.\n  // Perhaps it's because it's not clear how would the package return merged cell results.\n  // I.e. should it just duplicate the value in each one of the merged cells?\n  // Or should it keep the existing behavior of only returning the value of the top-most left-most cell\n  // and then return `null` for the other ones?\n  // Perhaps the latter (existing) approach was found to be the most sensible.\n  //\n  // const mergedCells = getMergedCellCoordinates(sheetDocument)\n  // for (const mergedCell of mergedCells) {\n  //   const [from, to] = mergedCell.split(':').map(parseCellCoordinates)\n  //   console.log('Merged Cell.', 'From:', from, 'To:', to)\n  // }\n\n  return cells.map(function (element) {\n    return parseCell(element, sheetDocument, sharedStrings, styles, epoch1904, options);\n  });\n}\n//# sourceMappingURL=parseCells.js.map","function _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _unsupportedIterableToArray(arr, i) || _nonIterableRest(); }\nfunction _nonIterableRest() { throw new TypeError(\"Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\"); }\nfunction _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === \"string\") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === \"Object\" && o.constructor) n = o.constructor.name; if (n === \"Map\" || n === \"Set\") return Array.from(o); if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }\nfunction _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i]; return arr2; }\nfunction _iterableToArrayLimit(r, l) { var t = null == r ? null : \"undefined\" != typeof Symbol && r[Symbol.iterator] || r[\"@@iterator\"]; if (null != t) { var e, n, i, u, a = [], f = !0, o = !1; try { if (i = (t = t.call(r)).next, 0 === l) { if (Object(t) !== t) return; f = !1; } else for (; !(f = (e = i.call(t)).done) && (a.push(e.value), a.length !== l); f = !0); } catch (r) { o = !0, n = r; } finally { try { if (!f && null != t[\"return\"] && (u = t[\"return\"](), Object(u) !== u)) return; } finally { if (o) throw n; } } return a; } }\nfunction _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }\nimport parseCellCoordinates from './parseCellCoordinates.js';\nimport { getDimensions } from '../xml/xlsx.js';\n\n// `dimensions` defines the spreadsheet area containing all non-empty cells.\n// https://docs.microsoft.com/en-us/dotnet/api/documentformat.openxml.spreadsheet.sheetdimension?view=openxml-2.8.1\nexport default function parseSheetDimensions(sheetDocument) {\n  var dimensions = getDimensions(sheetDocument);\n  if (dimensions) {\n    dimensions = dimensions.split(':').map(parseCellCoordinates).map(function (_ref) {\n      var _ref2 = _slicedToArray(_ref, 2),\n        row = _ref2[0],\n        column = _ref2[1];\n      return {\n        row: row,\n        column: column\n      };\n    });\n    // Sometimes there can be just a single cell as a spreadsheet's \"dimensions\".\n    // For example, the default \"dimensions\" in Apache POI library is \"A1\",\n    // meaning that only the first cell in the spreadsheet is used.\n    //\n    // A quote from Apache POI library:\n    // \"Single cell ranges are formatted like single cell references (e.g. 'A1' instead of 'A1:A1').\"\n    //\n    if (dimensions.length === 1) {\n      dimensions = [dimensions[0], dimensions[0]];\n    }\n    return dimensions;\n  }\n}\n//# sourceMappingURL=parseSheetDimensions.js.map","function _createForOfIteratorHelperLoose(o, allowArrayLike) { var it = typeof Symbol !== \"undefined\" && o[Symbol.iterator] || o[\"@@iterator\"]; if (it) return (it = it.call(o)).next.bind(it); if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === \"number\") { if (it) o = it; var i = 0; return function () { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }; } throw new TypeError(\"Invalid attempt to iterate non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\"); }\nfunction _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === \"string\") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === \"Object\" && o.constructor) n = o.constructor.name; if (n === \"Map\" || n === \"Set\") return Array.from(o); if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }\nfunction _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i]; return arr2; }\nexport default function dropEmptyRows(data) {\n  var _ref = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {},\n    rowIndexSourceMap = _ref.rowIndexSourceMap,\n    _ref$accessor = _ref.accessor,\n    accessor = _ref$accessor === void 0 ? function (_) {\n      return _;\n    } : _ref$accessor,\n    onlyTrimAtTheEnd = _ref.onlyTrimAtTheEnd;\n  // Drop empty rows.\n  var i = data.length - 1;\n  while (i >= 0) {\n    // Check if the row is empty.\n    var empty = true;\n    for (var _iterator = _createForOfIteratorHelperLoose(data[i]), _step; !(_step = _iterator()).done;) {\n      var cell = _step.value;\n      if (accessor(cell) !== null) {\n        empty = false;\n        break;\n      }\n    }\n    // Remove the empty row.\n    if (empty) {\n      data.splice(i, 1);\n      if (rowIndexSourceMap) {\n        rowIndexSourceMap.splice(i, 1);\n      }\n    } else if (onlyTrimAtTheEnd) {\n      break;\n    }\n    i--;\n  }\n  return data;\n}\n//# sourceMappingURL=dropEmptyRows.js.map","function _createForOfIteratorHelperLoose(o, allowArrayLike) { var it = typeof Symbol !== \"undefined\" && o[Symbol.iterator] || o[\"@@iterator\"]; if (it) return (it = it.call(o)).next.bind(it); if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === \"number\") { if (it) o = it; var i = 0; return function () { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }; } throw new TypeError(\"Invalid attempt to iterate non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\"); }\nfunction _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === \"string\") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === \"Object\" && o.constructor) n = o.constructor.name; if (n === \"Map\" || n === \"Set\") return Array.from(o); if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }\nfunction _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i]; return arr2; }\nexport default function dropEmptyColumns(data) {\n  var _ref = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {},\n    _ref$accessor = _ref.accessor,\n    accessor = _ref$accessor === void 0 ? function (_) {\n      return _;\n    } : _ref$accessor,\n    onlyTrimAtTheEnd = _ref.onlyTrimAtTheEnd;\n  var i = data[0].length - 1;\n  while (i >= 0) {\n    var empty = true;\n    for (var _iterator = _createForOfIteratorHelperLoose(data), _step; !(_step = _iterator()).done;) {\n      var row = _step.value;\n      if (accessor(row[i]) !== null) {\n        empty = false;\n        break;\n      }\n    }\n    if (empty) {\n      var j = 0;\n      while (j < data.length) {\n        data[j].splice(i, 1);\n        j++;\n      }\n    } else if (onlyTrimAtTheEnd) {\n      break;\n    }\n    i--;\n  }\n  return data;\n}\n//# sourceMappingURL=dropEmptyColumns.js.map","function _createForOfIteratorHelperLoose(o, allowArrayLike) { var it = typeof Symbol !== \"undefined\" && o[Symbol.iterator] || o[\"@@iterator\"]; if (it) return (it = it.call(o)).next.bind(it); if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === \"number\") { if (it) o = it; var i = 0; return function () { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }; } throw new TypeError(\"Invalid attempt to iterate non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\"); }\nfunction _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _unsupportedIterableToArray(arr, i) || _nonIterableRest(); }\nfunction _nonIterableRest() { throw new TypeError(\"Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\"); }\nfunction _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === \"string\") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === \"Object\" && o.constructor) n = o.constructor.name; if (n === \"Map\" || n === \"Set\") return Array.from(o); if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }\nfunction _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i]; return arr2; }\nfunction _iterableToArrayLimit(r, l) { var t = null == r ? null : \"undefined\" != typeof Symbol && r[Symbol.iterator] || r[\"@@iterator\"]; if (null != t) { var e, n, i, u, a = [], f = !0, o = !1; try { if (i = (t = t.call(r)).next, 0 === l) { if (Object(t) !== t) return; f = !1; } else for (; !(f = (e = i.call(t)).done) && (a.push(e.value), a.length !== l); f = !0); } catch (r) { o = !0, n = r; } finally { try { if (!f && null != t[\"return\"] && (u = t[\"return\"](), Object(u) !== u)) return; } finally { if (o) throw n; } } return a; } }\nfunction _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }\nimport dropEmptyRows from './dropEmptyRows.js';\nimport dropEmptyColumns from './dropEmptyColumns.js';\nexport default function convertCellsToData2dArray(cells, dimensions) {\n  // If the sheet is empty.\n  if (cells.length === 0) {\n    return [];\n  }\n  var _dimensions = _slicedToArray(dimensions, 2),\n    leftTop = _dimensions[0],\n    rightBottom = _dimensions[1];\n\n  // Don't discard empty rows or columns at the start of the spreadsheet,\n  // even when the `*.xlsx` file itself tells that the content starts at an offset.\n  // https://github.com/catamphetamine/read-excel-file/issues/102\n  // const colsCount = (rightBottom.column - leftTop.column) + 1\n  // const rowsCount = (rightBottom.row - leftTop.row) + 1\n\n  var colsCount = rightBottom.column;\n  var rowsCount = rightBottom.row;\n\n  // Initialize spreadsheet data structure.\n  var data = new Array(rowsCount);\n  var i = 0;\n  while (i < rowsCount) {\n    data[i] = new Array(colsCount);\n    var j = 0;\n    while (j < colsCount) {\n      data[i][j] = null;\n      j++;\n    }\n    i++;\n  }\n\n  // Fill in spreadsheet `data`.\n  // (this code implies that `cells` aren't necessarily sorted by row and column:\n  //  maybe that's not correct, this piece code was initially copy-pasted\n  //  from some other library that used `XPath`)\n  for (var _iterator = _createForOfIteratorHelperLoose(cells), _step; !(_step = _iterator()).done;) {\n    var cell = _step.value;\n    // Don't discard empty rows or columns at the start of the spreadsheet,\n    // even when the `*.xlsx` file itself tells that the content starts at an offset.\n    // https://github.com/catamphetamine/read-excel-file/issues/102\n    // const rowIndex = cell.row - leftTop.row\n    // const columnIndex = cell.column - leftTop.column\n    var rowIndex = cell.row - 1;\n    var columnIndex = cell.column - 1;\n    // Ignore the data in the cell if it's outside of the spreadsheet's \"dimensions\".\n    if (columnIndex < colsCount && rowIndex < rowsCount) {\n      data[rowIndex][columnIndex] = cell.value;\n    }\n  }\n\n  // // Fill in the row map, if the row map was passed.\n  // if (options.rowIndexSourceMap) {\n  //   let i = 0\n  //   while (i < data.length) {\n  //     options.rowIndexSourceMap[i] = i\n  //     i++\n  //   }\n  // }\n\n  // Drop (discard) empty columns at the right side.\n  // Drop (discard) empty rows at the bottom.\n  data = dropEmptyRows(dropEmptyColumns(data, {\n    onlyTrimAtTheEnd: true\n  }), {\n    onlyTrimAtTheEnd: true\n  } // { onlyTrimAtTheEnd: true, rowIndexSourceMap: options.rowIndexSourceMap }\n  );\n\n  return data;\n}\n//# sourceMappingURL=convertCellsToData2dArray.js.map","import parseCells from './parseCells.js';\nimport parseSheetDimensions from './parseSheetDimensions.js';\nimport reconstructSheetDimensionsFromSheetCells from './reconstructSheetDimensionsFromSheetCells.js';\nimport convertSheetToData2dArray from './convertCellsToData2dArray.js';\nexport default function parseSheet(content, xml, sharedStrings, styles, epoch1904, options) {\n  var sheetDocument = xml.createDocument(content);\n  var cells = parseCells(sheetDocument, sharedStrings, styles, epoch1904, options);\n\n  // `dimensions` defines the spreadsheet area enclosing all non-empty cells.\n  // https://docs.microsoft.com/en-us/dotnet/api/documentformat.openxml.spreadsheet.sheetdimension?view=openxml-2.8.1\n  var dimensions = parseSheetDimensions(sheetDocument) || reconstructSheetDimensionsFromSheetCells(cells);\n  return convertSheetToData2dArray(cells, dimensions);\n}\n//# sourceMappingURL=parseSheet.js.map","export default function reconstructSheetDimensionsFromSheetCells(cells) {\n  var comparator = function comparator(a, b) {\n    return a - b;\n  };\n  var allRows = cells.map(function (cell) {\n    return cell.row;\n  }).sort(comparator);\n  var allCols = cells.map(function (cell) {\n    return cell.column;\n  }).sort(comparator);\n  var minRow = allRows[0];\n  var maxRow = allRows[allRows.length - 1];\n  var minCol = allCols[0];\n  var maxCol = allCols[allCols.length - 1];\n  return [{\n    row: minRow,\n    column: minCol\n  }, {\n    row: maxRow,\n    column: maxCol\n  }];\n}\n//# sourceMappingURL=reconstructSheetDimensionsFromSheetCells.js.map","function _createForOfIteratorHelperLoose(o, allowArrayLike) { var it = typeof Symbol !== \"undefined\" && o[Symbol.iterator] || o[\"@@iterator\"]; if (it) return (it = it.call(o)).next.bind(it); if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === \"number\") { if (it) o = it; var i = 0; return function () { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }; } throw new TypeError(\"Invalid attempt to iterate non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\"); }\nfunction _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === \"string\") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === \"Object\" && o.constructor) n = o.constructor.name; if (n === \"Map\" || n === \"Set\") return Array.from(o); if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }\nfunction _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i]; return arr2; }\nimport parseSpreadsheetInfo from './parseSpreadsheetInfo.js';\nimport parseFilePaths from './parseFilePaths.js';\nimport parseStyles from './parseStyles.js';\nimport parseSharedStrings from './parseSharedStrings.js';\nimport parseSheet from './parseSheet.js';\n\n// For an introduction in reading `.xlsx` files see \"The minimum viable XLSX reader\":\n// https://www.brendanlong.com/the-minimum-viable-xlsx-reader.html\n\n/**\r\n * Reads data from an `.xlsx` file.\r\n * @param  {Record<string,string>} contents - A map of `.xml` files inside the `.xlsx` file (which itself is just a zipped directory).\r\n * @param  {object} xml — An object having a single property — `createDocument(string)` function.\r\n * @param  {object} [options]\r\n * @return {ReadFileResult}\r\n */\nexport default function parseSpreadsheetContents(contents, xml) {\n  var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n  var getFileContent = function getFileContent(filePath) {\n    if (!contents[filePath]) {\n      throw new Error(\"\\\"\".concat(filePath, \"\\\" file not found inside the *.xlsx file zip archive\"));\n    }\n    return contents[filePath];\n  };\n\n  // Read the paths to certain files inside the `.xlsx` file, which is itself just a `.zip` archive.\n  // These paths aren't standardized between different spreadsheet editors.\n  // https://github.com/tidyverse/readxl/issues/104\n  var filePaths = parseFilePaths(getFileContent('xl/_rels/workbook.xml.rels'), xml);\n\n  // The usual file path for \"shared strings\" is \"xl/sharedStrings.xml\".\n  var sharedStrings = filePaths.sharedStrings ? parseSharedStrings(getFileContent(filePaths.sharedStrings), xml) : [];\n\n  // The usual file path for \"styles\" is \"xl/styles.xml\".\n  var styles = filePaths.styles ? parseStyles(getFileContent(filePaths.styles), xml) : {};\n  var _parseSpreadsheetInfo = parseSpreadsheetInfo(getFileContent('xl/workbook.xml'), xml),\n    sheets = _parseSpreadsheetInfo.sheets,\n    epoch1904 = _parseSpreadsheetInfo.epoch1904;\n  var sheetIdsToRead = options.sheets && options.sheets.map(function (sheet) {\n    return getSheetId(sheet, sheets);\n  });\n\n  // Parse sheets data.\n\n  var sheetsData = [];\n  for (var _i = 0, _Object$keys = Object.keys(filePaths.sheets); _i < _Object$keys.length; _i++) {\n    var sheetId = _Object$keys[_i];\n    if (sheetIdsToRead && !sheetIdsToRead.includes(sheetId)) {\n      continue;\n    }\n    sheetsData.push({\n      sheet: getSheetNameById(sheetId, sheets),\n      data: parseSheet(getFileContent(filePaths.sheets[sheetId]), xml, sharedStrings, styles, epoch1904, options)\n    });\n  }\n\n  // Return spreadsheet data.\n  return sheetsData;\n}\nfunction getSheetId(sheet, sheets) {\n  if (typeof sheet === 'string') {\n    for (var _iterator = _createForOfIteratorHelperLoose(sheets), _step; !(_step = _iterator()).done;) {\n      var _sheet = _step.value;\n      if (_sheet.name === sheet) {\n        return _sheet.relationId;\n      }\n    }\n    throw new Error(\"Sheet \\\"\".concat(sheet, \"\\\" not found. Available sheets: \").concat(sheets.map(function (_ref) {\n      var name = _ref.name;\n      return \"\\\"\".concat(name, \"\\\"\");\n    }).join(', ')));\n  } else {\n    if (sheet <= sheets.length) {\n      return sheets[sheet - 1].relationId;\n    }\n    throw new Error(\"Sheet number out of bounds: \".concat(sheet, \". Available sheets count: \").concat(sheets.length));\n  }\n}\nfunction getSheetNameById(sheetId, sheets) {\n  for (var _iterator2 = _createForOfIteratorHelperLoose(sheets), _step2; !(_step2 = _iterator2()).done;) {\n    var sheet = _step2.value;\n    if (sheet.relationId === sheetId) {\n      return sheet.name;\n    }\n  }\n  throw new Error(\"Sheet ID not found: \".concat(sheetId));\n}\n//# sourceMappingURL=parseSpreadsheetContents.js.map","import { getSharedStrings } from '../xml/xlsx.js';\nexport default function parseSharedStrings(content, xml) {\n  if (!content) {\n    return [];\n  }\n  return getSharedStrings(xml.createDocument(content));\n}\n//# sourceMappingURL=parseSharedStrings.js.map","import xml from '../xml/xmlBrowser.js';\nimport unpackXlsxFile from './unpackXlsxFileBrowser.js';\nimport parseSpreadsheetContents from '../xlsx/parseSpreadsheetContents.js';\n\n/**\r\n * Reads an `.xlsx` file.\r\n * @param  {(File|Blob|ArrayBuffer)} input\r\n * @param  {object} [options]\r\n * @return {Promise<ReadFileResult>}\r\n */\nexport default function readXlsxFile(input, options) {\n  return unpackXlsxFile(input).then(function (contents) {\n    return parseSpreadsheetContents(contents, xml, options);\n  });\n}\n//# sourceMappingURL=readXlsxFileBrowser.js.map"],"names":["xml","createDocument","content","DOMParser","parseFromString","trim","ch2","u8","Uint8Array","u16","Uint16Array","i32","Int32Array","fleb","fdeb","clim","freb","eb","start","b","i","r","j","_a","fl","revfl","fd","rev","x","hMap","cd","mb","s","length","l","co","le","rvb","sv","r_1","v","m","flt","fdt","flrm","fdrm","max","a","bits","d","p","o","bits16","shft","slc","e","subarray","ec","err","ind","msg","nt","Error","code","captureStackTrace","inflt","dat","st","buf","dict","sl","dl","f","noBuf","resize","noSt","cbuf","bl","nbuf","Math","set","final","pos","bt","lm","dm","lbt","dbt","n","tbts","type","t","hLit","hcLen","tl","ldt","clt","clb","clbmsk","clm","c","lt","dt","lms","dms","lpos","sym","add","dsym","end","shift","dend","min","et","wcln","fn","fnStr","td","toString","ks","slice","indexOf","lastIndexOf","replace","split","k","st_1","prototype","spInd","ch","wrkr","fns","init","id","cb","td_1","mrg","transfer","w","Worker","URL","createObjectURL","Blob","onmessage","data","ed","$e$","stack","postMessage","wk","buffer","push","constructor","cbfs","bInflt","inflateSync","pbf","gopt","out","size","dictionary","cbify","opts","terminate","consume","b2","b4","b8","TextDecoder","decode","stream","dutf8","String","fromCharCode","strFromU8","latin1","apply","slzh","zh","z","fnl","es","bs","z64e","sc","su","off","mt","queueMicrotask","setTimeout","unzip","term","tAll","files","cbd","lft","ze","fltr","filter","_loop_3","c_1","no","cbl","name","originalSize","compression","infl","ev","inflate","unzipFromArrayBuffer","input","options","_ref","arguments","undefined","_filter","file","path","unzipFromArrayBufferUsingFunction","unzipAsync","archive","Promise","resolve","reject","error","convertValuesFromUint8ArraysToStrings","entries","convertedEntries","_i","_Object$keys","Object","keys","key","filterZipArchiveEntry","endsWith","getResultFromArrayBuffer","arrayBuffer","then","findChild","node","tagName","childNodes","childNode","nodeType","getTagName","findChildren","results","forEach","func","NAMESPACE_REG_EXP","element","getFirstElementChild","getOuterXml","textContent","attributes","value","getSharedStrings","document","sst","documentElement","string","_createForOfIteratorHelperLoose","allowArrayLike","it","Symbol","iterator","call","next","bind","Array","isArray","minLen","_arrayLikeToArray","from","test","_unsupportedIterableToArray","done","TypeError","arr","len","arr2","parseSpreadsheetInfo","_step","book","workbookProperties","epoch1904","Boolean","getAttribute","sheets","_iterator","getSheets","sheet","relationId","parseFilePaths","filePaths","sharedStrings","styles","getRelationships","relationship","filePath","getFilePath","_typeof","ownKeys","getOwnPropertySymbols","getOwnPropertyDescriptor","enumerable","_objectSpread","_defineProperty","getOwnPropertyDescriptors","defineProperties","defineProperty","obj","arg","hint","prim","toPrimitive","res","Number","_toPrimitive","_toPropertyKey","configurable","writable","parseStyles","cellStyleXfs","doc","baseStyles","map","parseCellStyle","numberFormats","numFmts","getNumberFormats","parseNumberFormatStyle","reduce","formats","format","cellXfs","getCellStyles","xf","hasAttribute","xfId","numFmt","template","style","numberFormatId","numberFormat","NUMBER_OF_LEAP_YEARS_BETWEEN_1900_AND_1970","JANUARY_0TH_1900_DAY","ERRONEOUS_FEBRUARY_29_1990_DAY","DAY","DAYS_IN_YEAR","DATE_FORMAT_SPECIFIC_LOCALE_PREFIX","DATE_FORMAT_ALLOW_ANY_OTHER_TEXT_SUFFIX","CACHE","isDateFormatCached","result","toLowerCase","tokens","token","DATE_TEMPLATE_TOKENS","isDateFormat","MAINLAND_CHINESE_OR_TAIWANESE_LOCALE_BUILT_IN_DATE_FORMAT_IDS","JAPANESE_OR_KOREAN_LOCALE_BUILT_IN_DATE_FORMAT_IDS","BUILT_IN_DATE_FORMAT_IDS","concat","parseCellValue","getInlineStringValue","getInlineStringXml","getStyleId","parseString","sharedStringIndex","isNaN","errorCode","decodeError","parsedDate","Date","valueOf","styleId","dateFormat","smartDateParser","isDateFormatStyle","excelSerialDate","daysBeforeUnixEpoch","floor","parseExcelDate","parseNumberDefault","parseNumber","stringifiedNumber","parsedNumber","_slicedToArray","_arrayWithHoles","u","_iterableToArrayLimit","_nonIterableRest","parseCellCoordinates","coordinatesString","_coordinatesString$sp2","column","row","getColumnNumberFromColumnLetters","LETTERS","columnLetters","parseCell","sheetDocument","coordinates","valueElement","getCellValueElement","firstElementChild","firstElementChildFirstElementChild","getCellInlineStringValue","parseCells","cells","sheetData","cell","getCellElements","parseSheetDimensions","dimensions","getDimensions","_ref2","convertCellsToData2dArray","_dimensions","rightBottom","colsCount","rowsCount","rowIndex","columnIndex","rowIndexSourceMap","_ref$accessor","accessor","_","onlyTrimAtTheEnd","empty","splice","dropEmptyRows","dropEmptyColumns","parseSheet","comparator","allRows","sort","allCols","minRow","maxRow","reconstructSheetDimensionsFromSheetCells","convertSheetToData2dArray","parseSpreadsheetContents","contents","getFileContent","parseSharedStrings","_parseSpreadsheetInfo","sheetIdsToRead","_sheet","join","getSheetId","sheetsData","sheetId","includes","getSheetNameById","_step2","_iterator2","File","unpackXlsxFile"],"mappings":"6OAAe,IAAAA,EAAA,CACbC,eAAgB,SAAwBC,GAMtC,OAAO,IAAIC,WAAYC,gBAAgBF,EAAQG,OAAQ,WACxD,GCCCC,EAAM,CAAA,EAqBNC,EAAKC,WAAYC,EAAMC,YAAaC,EAAMC,WAE1CC,EAAO,IAAIN,EAAG,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAgB,EAAG,EAAoB,IAE1IO,EAAO,IAAIP,EAAG,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAiB,EAAG,IAEjIQ,EAAO,IAAIR,EAAG,CAAC,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,KAE7ES,EAAO,SAAUC,EAAIC,GAErB,IADA,IAAIC,EAAI,IAAIV,EAAI,IACPW,EAAI,EAAGA,EAAI,KAAMA,EACtBD,EAAEC,GAAKF,GAAS,GAAKD,EAAGG,EAAI,GAGhC,IAAIC,EAAI,IAAIV,EAAIQ,EAAE,KAClB,IAASC,EAAI,EAAGA,EAAI,KAAMA,EACtB,IAAK,IAAIE,EAAIH,EAAEC,GAAIE,EAAIH,EAAEC,EAAI,KAAME,EAC/BD,EAAEC,GAAOA,EAAIH,EAAEC,IAAO,EAAKA,EAGnC,MAAO,CAAED,EAAGA,EAAGE,EAAGA,EACtB,EACIE,EAAKP,EAAKH,EAAM,GAAIW,EAAKD,EAAGJ,EAAGM,EAAQF,EAAGF,EAE9CG,EAAG,IAAM,IAAKC,EAAM,KAAO,GAI3B,IAHG,IAAqBC,EAAfV,EAAKF,EAAM,GAAYK,EAE5BQ,EAAM,IAAIlB,EAAI,OACTW,EAAI,EAAGA,EAAI,QAASA,EAAG,CAE5B,IAAIQ,GAAU,MAAJR,IAAe,GAAW,MAAJA,IAAe,EAE/CQ,GAAU,OADVA,GAAU,MAAJA,IAAe,GAAW,MAAJA,IAAe,KACtB,GAAW,KAAJA,IAAe,EAC3CD,EAAIP,KAAY,MAAJQ,IAAe,GAAW,IAAJA,IAAe,IAAO,CAC5D,CAIA,IAAIC,WAAkBC,EAAIC,EAAIV,GAO1B,IANA,IAAIW,EAAIF,EAAGG,OAEPb,EAAI,EAEJc,EAAI,IAAIzB,EAAIsB,GAETX,EAAIY,IAAKZ,EACRU,EAAGV,MACDc,EAAEJ,EAAGV,GAAK,GAGpB,IAIIe,EAJAC,EAAK,IAAI3B,EAAIsB,GACjB,IAAKX,EAAI,EAAGA,EAAIW,IAAMX,EAClBgB,EAAGhB,GAAMgB,EAAGhB,EAAI,GAAKc,EAAEd,EAAI,IAAO,EAGtC,GAAIC,EAAG,CAEHc,EAAK,IAAI1B,EAAI,GAAKsB,GAElB,IAAIM,EAAM,GAAKN,EACf,IAAKX,EAAI,EAAGA,EAAIY,IAAKZ,EAEjB,GAAIU,EAAGV,GAQH,IANA,IAAIkB,EAAMlB,GAAK,EAAKU,EAAGV,GAEnBmB,EAAMR,EAAKD,EAAGV,GAEdoB,EAAIJ,EAAGN,EAAGV,GAAK,MAAQmB,EAElBE,EAAID,GAAM,GAAKD,GAAO,EAAIC,GAAKC,IAAKD,EAEzCL,EAAGR,EAAIa,IAAMH,GAAOC,CAInC,MAGG,IADAH,EAAK,IAAI1B,EAAIuB,GACRZ,EAAI,EAAGA,EAAIY,IAAKZ,EACbU,EAAGV,KACHe,EAAGf,GAAKO,EAAIS,EAAGN,EAAGV,GAAK,OAAU,GAAKU,EAAGV,IAIrD,OAAOe,CACV,EAEGO,EAAM,IAAInC,EAAG,KACjB,IAASa,EAAI,EAAGA,EAAI,MAAOA,EACvBsB,EAAItB,GAAK,EACb,IAASA,EAAI,IAAKA,EAAI,MAAOA,EACzBsB,EAAItB,GAAK,EACb,IAASA,EAAI,IAAKA,EAAI,MAAOA,EACzBsB,EAAItB,GAAK,EACb,IAASA,EAAI,IAAKA,EAAI,MAAOA,EACzBsB,EAAItB,GAAK,EAEb,IAAIuB,EAAM,IAAIpC,EAAG,IACjB,IAASa,EAAI,EAAGA,EAAI,KAAMA,EACtBuB,EAAIvB,GAAK,EAE4B,IAAAwB,EAAqBf,EAAKa,EAAK,EAAG,GAElCG,EAAqBhB,EAAKc,EAAK,EAAG,GAEvEG,EAAM,SAAUC,GAEhB,IADA,IAAIN,EAAIM,EAAE,GACD3B,EAAI,EAAGA,EAAI2B,EAAEd,SAAUb,EACxB2B,EAAE3B,GAAKqB,IACPA,EAAIM,EAAE3B,IAEd,OAAOqB,CACX,EAEIO,EAAO,SAAUC,EAAGC,EAAGT,GACvB,IAAIU,EAAKD,EAAI,EAAK,EAClB,OAASD,EAAEE,GAAMF,EAAEE,EAAI,IAAM,KAAY,EAAJD,GAAUT,CACnD,EAEIW,EAAS,SAAUH,EAAGC,GACtB,IAAIC,EAAKD,EAAI,EAAK,EAClB,OAASD,EAAEE,GAAMF,EAAEE,EAAI,IAAM,EAAMF,EAAEE,EAAI,IAAM,MAAa,EAAJD,EAC5D,EAEIG,EAAO,SAAUH,GAAK,OAASA,EAAI,GAAK,EAAK,GAG7CI,EAAM,SAAUd,EAAGR,EAAGuB,GAMtB,OALS,MAALvB,GAAaA,EAAI,KACjBA,EAAI,IACC,MAALuB,GAAaA,EAAIf,EAAEP,UACnBsB,EAAIf,EAAEP,QAEH,IAAI1B,EAAGiC,EAAEgB,SAASxB,EAAGuB,GAChC,EAsBIE,EAAK,CACL,iBACA,qBACA,yBACA,mBACA,kBACA,oBACJ,CACI,cACA,qBACA,uBACA,8BACA,oBACA,mBACA,oBAIAC,EAAM,SAAUC,EAAKC,EAAKC,GAC1B,IAAIN,EAAI,IAAIO,MAAMF,GAAOH,EAAGE,IAI5B,GAHAJ,EAAEQ,KAAOJ,EACLG,MAAME,mBACNF,MAAME,kBAAkBT,EAAGG,IAC1BG,EACD,MAAMN,EACV,OAAOA,CACX,EAEIU,EAAQ,SAAUC,EAAKC,EAAIC,EAAKC,GAEhC,IAAIC,EAAKJ,EAAIjC,OAAQsC,EAAKF,EAAOA,EAAKpC,OAAS,EAC/C,IAAKqC,GAAMH,EAAGK,IAAML,EAAGjC,EACnB,OAAOkC,GAAO,IAAI7D,EAAG,GACzB,IAAIkE,GAASL,EAETM,EAASD,GAAiB,GAARN,EAAG/C,EAErBuD,EAAOR,EAAG/C,EAEVqD,IACAL,EAAM,IAAI7D,EAAQ,EAAL+D,IAEjB,IAAIM,EAAO,SAAU1C,GACjB,IAAI2C,EAAKT,EAAInC,OAEb,GAAIC,EAAI2C,EAAI,CAER,IAAIC,EAAO,IAAIvE,EAAGwE,KAAKjC,IAAS,EAAL+B,EAAQ3C,IACnC4C,EAAKE,IAAIZ,GACTA,EAAMU,CACT,CACT,EAEQG,EAAQd,EAAGK,GAAK,EAAGU,EAAMf,EAAGjB,GAAK,EAAGiC,EAAKhB,EAAGhD,GAAK,EAAGiE,EAAKjB,EAAGjC,EAAGmD,EAAKlB,EAAGlB,EAAGqC,EAAMnB,EAAG1B,EAAG8C,EAAMpB,EAAGqB,EAE/FC,EAAY,EAALnB,EACX,EAAG,CACC,IAAKc,EAAI,CAELH,EAAQjC,EAAKkB,EAAKgB,EAAK,GAEvB,IAAIQ,EAAO1C,EAAKkB,EAAKgB,EAAM,EAAG,GAE9B,GADAA,GAAO,GACFQ,EAAM,CAEP,IAAuBxD,EAAIgC,GAAvBlC,EAAIqB,EAAK6B,GAAO,GAAe,GAAMhB,EAAIlC,EAAI,IAAM,EAAI2D,EAAI3D,EAAIE,EACnE,GAAIyD,EAAIrB,EAAI,CACJK,GACAjB,EAAI,GACR,KACH,CAEGgB,GACAE,EAAKO,EAAKjD,GAEdkC,EAAIY,IAAId,EAAIV,SAASxB,EAAG2D,GAAIR,GAE5BhB,EAAGhD,EAAIgE,GAAMjD,EAAGiC,EAAGjB,EAAIgC,EAAU,EAAJS,EAAOxB,EAAGK,EAAIS,EAC3C,QACH,CACI,GAAY,GAARS,EACLN,EAAKxC,EAAMyC,EAAKxC,EAAMyC,EAAM,EAAGC,EAAM,OACpC,GAAY,GAARG,EAAW,CAEhB,IAAIE,EAAO5C,EAAKkB,EAAKgB,EAAK,IAAM,IAAKW,EAAQ7C,EAAKkB,EAAKgB,EAAM,GAAI,IAAM,EACnEY,EAAKF,EAAO5C,EAAKkB,EAAKgB,EAAM,EAAG,IAAM,EACzCA,GAAO,GAKP,IAHA,IAAIa,EAAM,IAAIxF,EAAGuF,GAEbE,EAAM,IAAIzF,EAAG,IACRa,EAAI,EAAGA,EAAIyE,IAASzE,EAEzB4E,EAAIjF,EAAKK,IAAM4B,EAAKkB,EAAKgB,EAAU,EAAJ9D,EAAO,GAE1C8D,GAAe,EAARW,EAEP,IAAII,EAAMnD,EAAIkD,GAAME,GAAU,GAAKD,GAAO,EAEtCE,EAAMtE,EAAKmE,EAAKC,EAAK,GACzB,IAAS7E,EAAI,EAAGA,EAAI0E,GAAK,CACrB,IAII9D,EAJAX,EAAI8E,EAAInD,EAAKkB,EAAKgB,EAAKgB,IAM3B,GAJAhB,GAAW,GAAJ7D,GAEHW,EAAIX,GAAK,GAEL,GACJ0E,EAAI3E,KAAOY,MAEV,CAED,IAAIoE,EAAI,EAAGZ,EAAI,EAOf,IANS,IAALxD,GACAwD,EAAI,EAAIxC,EAAKkB,EAAKgB,EAAK,GAAIA,GAAO,EAAGkB,EAAIL,EAAI3E,EAAI,IACvC,IAALY,GACLwD,EAAI,EAAIxC,EAAKkB,EAAKgB,EAAK,GAAIA,GAAO,GACxB,IAALlD,IACLwD,EAAI,GAAKxC,EAAKkB,EAAKgB,EAAK,KAAMA,GAAO,GAClCM,KACHO,EAAI3E,KAAOgF,CAClB,CACJ,CAED,IAAIC,EAAKN,EAAIvC,SAAS,EAAGoC,GAAOU,EAAKP,EAAIvC,SAASoC,GAElDN,EAAMxC,EAAIuD,GAEVd,EAAMzC,EAAIwD,GACVlB,EAAKvD,EAAKwE,EAAIf,EAAK,GACnBD,EAAKxD,EAAKyE,EAAIf,EAAK,EACtB,MAEG7B,EAAI,GACR,GAAIwB,EAAMO,EAAM,CACRd,GACAjB,EAAI,GACR,KACH,CACJ,CAGGgB,GACAE,EAAKO,EAAK,QAGd,IAFA,IAAIoB,GAAO,GAAKjB,GAAO,EAAGkB,GAAO,GAAKjB,GAAO,EACzCkB,EAAOvB,GACHuB,EAAOvB,EAAK,CAEhB,IAAoCwB,IAAhCN,EAAIhB,EAAGhC,EAAOc,EAAKgB,GAAOqB,KAAiB,EAE/C,IADArB,GAAW,GAAJkB,GACGX,EAAM,CACRd,GACAjB,EAAI,GACR,KACH,CAGD,GAFK0C,GACD1C,EAAI,GACJgD,GAAM,IACNtC,EAAIe,KAAQuB,OACX,IAAW,KAAPA,GAAY,CACjBD,EAAOvB,EAAKE,EAAK,KACjB,KACH,CAEG,IAAIuB,GAAMD,GAAM,IAEhB,GAAIA,GAAM,IAAK,CAEX,IAAmBvF,GAAIN,EAAnBO,EAAIsF,GAAM,KACdC,GAAM3D,EAAKkB,EAAKgB,GAAM,GAAK/D,IAAK,GAAKK,EAAGJ,GACxC8D,GAAO/D,EACV,CAED,IAAI8B,GAAIoC,EAAGjC,EAAOc,EAAKgB,GAAOsB,GAAMI,GAAO3D,IAAK,EAC3CA,IACDS,EAAI,GACRwB,GAAW,GAAJjC,GACHqD,EAAK5E,EAAGkF,IACZ,GAAIA,GAAO,EAAG,CACNzF,GAAIL,EAAK8F,IACbN,GAAMlD,EAAOc,EAAKgB,IAAQ,GAAK/D,IAAK,EAAG+D,GAAO/D,EACjD,CACD,GAAI+D,EAAMO,EAAM,CACRd,GACAjB,EAAI,GACR,KACH,CACGgB,GACAE,EAAKO,EAAK,QACd,IAAI0B,GAAM1B,EAAKwB,GACf,GAAIxB,EAAKmB,EAAI,CACT,IAAIQ,GAAQvC,EAAK+B,EAAIS,GAAOhC,KAAKiC,IAAIV,EAAIO,IAGzC,IAFIC,GAAQ3B,EAAK,GACbzB,EAAI,GACDyB,EAAK4B,KAAQ5B,EAChBf,EAAIe,GAAMd,EAAKyC,GAAQ3B,EAC9B,CACD,KAAOA,EAAK0B,KAAO1B,EACff,EAAIe,GAAMf,EAAIe,EAAKmB,EAC1B,CACJ,CACDnC,EAAGjC,EAAIkD,EAAIjB,EAAGjB,EAAIuD,EAAMtC,EAAGhD,EAAIgE,EAAIhB,EAAGK,EAAIS,EACtCG,IACAH,EAAQ,EAAGd,EAAG1B,EAAI6C,EAAKnB,EAAGlB,EAAIoC,EAAIlB,EAAGqB,EAAID,EAChD,QAASN,GAEV,OAAOE,GAAMf,EAAInC,QAAUwC,EAAQnB,EAAIc,EAAK,EAAGe,GAAMf,EAAIZ,SAAS,EAAG2B,EACzE,EAoOI8B,EAAmB,IAAI1G,EAAG,GA+M1B2G,EAAO,SAAUC,EAAIC,EAAOC,GAI5B,IAHA,IAAIf,EAAKa,IACLhD,EAAKgD,EAAGG,WACRC,EAAKpD,EAAGqD,MAAMrD,EAAGsD,QAAQ,KAAO,EAAGtD,EAAGuD,YAAY,MAAMC,QAAQ,OAAQ,IAAIC,MAAM,KAC7ExG,EAAI,EAAGA,EAAIkF,EAAGrE,SAAUb,EAAG,CAChC,IAAIoB,EAAI8D,EAAGlF,GAAIyG,EAAIN,EAAGnG,GACtB,GAAgB,mBAALoB,EAAiB,CACxB4E,GAAS,IAAMS,EAAI,IACnB,IAAIC,EAAOtF,EAAE8E,WACb,GAAI9E,EAAEuF,UAEF,IAAsC,GAAlCD,EAAKL,QAAQ,iBAAwB,CACrC,IAAIO,EAAQF,EAAKL,QAAQ,IAAK,GAAK,EACnCL,GAASU,EAAKN,MAAMQ,EAAOF,EAAKL,QAAQ,IAAKO,GAChD,MAGG,IAAK,IAAIrC,KADTyB,GAASU,EACKtF,EAAEuF,UACZX,GAAS,IAAMS,EAAI,cAAgBlC,EAAI,IAAMnD,EAAEuF,UAAUpC,GAAG2B,gBAIpEF,GAASU,CAChB,MAEGT,EAAGQ,GAAKrF,CACf,CACD,OAAO4E,CACX,EACIa,EAAK,GAYLC,EAAO,SAAUC,EAAKC,EAAMC,EAAIC,GAChC,IAAKL,EAAGI,GAAK,CAET,IADA,IAAIjB,EAAQ,GAAImB,EAAO,CAAA,EAAI9F,EAAI0F,EAAIlG,OAAS,EACnCb,EAAI,EAAGA,EAAIqB,IAAKrB,EACrBgG,EAAQF,EAAKiB,EAAI/G,GAAIgG,EAAOmB,GAChCN,EAAGI,GAAM,CAAEjC,EAAGc,EAAKiB,EAAI1F,GAAI2E,EAAOmB,GAAOhF,EAAGgF,EAC/C,CACD,IAAIlB,EA/DE,SAAUtE,EAAG5B,GACnB,IAAIgC,EAAI,CAAA,EACR,IAAK,IAAI0E,KAAK9E,EACVI,EAAE0E,GAAK9E,EAAE8E,GACb,IAAK,IAAIA,KAAK1G,EACVgC,EAAE0E,GAAK1G,EAAE0G,GACb,OAAO1E,CACX,CAwDaqF,CAAI,CAAE,EAAEP,EAAGI,GAAI9E,GACxB,OAp2BE,SAAc6C,EAAGiC,EAAIzE,EAAK6E,EAAUH,GACtC,IAAII,EAAI,IAAIC,OAAOrI,EAAI+H,KAAQ/H,EAAI+H,GAAMO,IAAIC,gBAAgB,IAAIC,KAAK,CAClE1C,EAAI,mGACL,CAAEV,KAAM,uBAaX,OAZAgD,EAAEK,UAAY,SAAUxF,GACpB,IAAIN,EAAIM,EAAEyF,KAAMC,EAAKhG,EAAEiG,IACvB,GAAID,EAAI,CACJ,IAAIvF,EAAM,IAAII,MAAMmF,EAAG,IACvBvF,EAAU,KAAIuF,EAAG,GACjBvF,EAAIyF,MAAQF,EAAG,GACfX,EAAG5E,EAAK,KACX,MAEG4E,EAAG,KAAMrF,EACrB,EACIyF,EAAEU,YAAYxF,EAAK6E,GACZC,CACV,CAm1BUW,CAAGpB,EAAGI,GAAIjC,EAAI,0EAA4EgC,EAAKd,WAAa,IAAKe,EAAIhB,EAlBrH,SAAU7E,GACjB,IAAIsD,EAAK,GACT,IAAK,IAAI+B,KAAKrF,EACNA,EAAEqF,GAAGyB,QACLxD,EAAGyD,MAAM/G,EAAEqF,GAAK,IAAIrF,EAAEqF,GAAG2B,YAAYhH,EAAEqF,KAAKyB,QAGpD,OAAOxD,CACX,CAUoI2D,CAAKpC,GAAKiB,EAC9I,EAEIoB,EAAS,WAAc,MAAO,CAACnJ,EAAIE,EAAKE,EAAKE,EAAMC,EAAMC,EAAMS,EAAIE,EAAIkB,EAAMC,EAAMlB,EAAK8B,EAAI5B,EAAMiB,EAAKE,EAAMI,EAAQC,EAAMC,EAAKI,EAAKO,EAAO0F,EAAaC,EAAKC,EAAM,EAWpKD,EAAM,SAAUhG,GAAO,OAAOwF,YAAYxF,EAAK,CAACA,EAAI0F,UAEpDO,EAAO,SAAU1G,GAAK,OAAOA,GAAK,CAClC2G,IAAK3G,EAAE4G,MAAQ,IAAIxJ,EAAG4C,EAAE4G,MACxBC,WAAY7G,EAAE6G,aAGdC,EAAQ,SAAU/F,EAAKgG,EAAM/B,EAAKC,EAAMC,EAAIC,GAC5C,IAAII,EAAIR,EAAKC,EAAKC,EAAMC,GAAI,SAAU3E,EAAKQ,GACvCwE,EAAEyB,YACF7B,EAAG5E,EAAKQ,EAChB,IAEI,OADAwE,EAAEU,YAAY,CAAClF,EAAKgG,GAAOA,EAAKE,QAAU,CAAClG,EAAIoF,QAAU,IAClD,WAAcZ,EAAEyB,WAAY,CACvC,EAgDIE,EAAK,SAAUpH,EAAG9B,GAAK,OAAO8B,EAAE9B,GAAM8B,EAAE9B,EAAI,IAAM,CAAG,EAErDmJ,EAAK,SAAUrH,EAAG9B,GAAK,OAAQ8B,EAAE9B,GAAM8B,EAAE9B,EAAI,IAAM,EAAM8B,EAAE9B,EAAI,IAAM,GAAO8B,EAAE9B,EAAI,IAAM,MAAS,CAAE,EACnGoJ,EAAK,SAAUtH,EAAG9B,GAAK,OAAOmJ,EAAGrH,EAAG9B,GAAqB,WAAfmJ,EAAGrH,EAAG9B,EAAI,IAwPjD,SAASwI,EAAYX,EAAMkB,GAC9B,OAAOjG,EAAM+E,EAAM,CAAE5H,EAAG,GAAK8I,GAAQA,EAAKJ,IAAKI,GAAQA,EAAKF,WAChE,CA0bA,IAAI3C,EAA2B,oBAAfmD,aAA4C,IAAIA,YAGhE,IACInD,EAAGoD,OAAOxD,EAAI,CAAEyD,QAAQ,IAClB,CACV,CACA,MAAOnH,GAAM,CAEb,IAAIoH,EAAQ,SAAU1H,GAClB,IAAK,IAAI5B,EAAI,GAAID,EAAI,IAAK,CACtB,IAAIgF,EAAInD,EAAE7B,KACNH,GAAMmF,EAAI,MAAQA,EAAI,MAAQA,EAAI,KACtC,GAAIhF,EAAIH,EAAKgC,EAAEhB,OACX,MAAO,CAAED,EAAGX,EAAGA,EAAGiC,EAAIL,EAAG7B,EAAI,IAC5BH,EAEU,GAANA,GACLmF,IAAU,GAAJA,IAAW,IAAe,GAATnD,EAAE7B,OAAc,IAAe,GAAT6B,EAAE7B,OAAc,EAAc,GAAT6B,EAAE7B,MAAc,MAC9EC,GAAKuJ,OAAOC,aAAa,MAASzE,GAAK,GAAK,MAAa,KAAJA,IAGzD/E,GADU,EAALJ,EACA2J,OAAOC,cAAkB,GAAJzE,IAAW,EAAc,GAATnD,EAAE7B,MAEvCwJ,OAAOC,cAAkB,GAAJzE,IAAW,IAAe,GAATnD,EAAE7B,OAAc,EAAc,GAAT6B,EAAE7B,MARlEC,GAAKuJ,OAAOC,aAAazE,EAShC,CACL,EA4HO,SAAS0E,EAAU5G,EAAK6G,GAC3B,GAAIA,EAAQ,CAER,IADA,IAAI1J,EAAI,GACCD,EAAI,EAAGA,EAAI8C,EAAIjC,OAAQb,GAAK,MACjCC,GAAKuJ,OAAOC,aAAaG,MAAM,KAAM9G,EAAIV,SAASpC,EAAGA,EAAI,QAC7D,OAAOC,CACV,CACI,GAAIgG,EACL,OAAOA,EAAGoD,OAAOvG,GAGjB,IAAI3C,EAAKoJ,EAAMzG,GAAMlC,EAAIT,EAAGS,EAG5B,OAH+BX,EAAIE,EAAGF,GAChCY,QACFyB,EAAI,GACD1B,CAEf,CAKA,IAAIiJ,EAAO,SAAUhI,EAAG9B,GAAK,OAAOA,EAAI,GAAKkJ,EAAGpH,EAAG9B,EAAI,IAAMkJ,EAAGpH,EAAG9B,EAAI,KAEnE+J,EAAK,SAAUjI,EAAG9B,EAAGgK,GACrB,IAAIC,EAAMf,EAAGpH,EAAG9B,EAAI,IAAKgG,EAAK2D,EAAU7H,EAAEO,SAASrC,EAAI,GAAIA,EAAI,GAAKiK,KAAuB,KAAff,EAAGpH,EAAG9B,EAAI,KAAakK,EAAKlK,EAAI,GAAKiK,EAAKE,EAAKhB,EAAGrH,EAAG9B,EAAI,IACjII,EAAK4J,GAAW,YAANG,EAAmBC,EAAKtI,EAAGoI,GAAM,CAACC,EAAIhB,EAAGrH,EAAG9B,EAAI,IAAKmJ,EAAGrH,EAAG9B,EAAI,KAAMqK,EAAKjK,EAAG,GAAIkK,EAAKlK,EAAG,GAAImK,EAAMnK,EAAG,GACpH,MAAO,CAAC8I,EAAGpH,EAAG9B,EAAI,IAAKqK,EAAIC,EAAItE,EAAIkE,EAAKhB,EAAGpH,EAAG9B,EAAI,IAAMkJ,EAAGpH,EAAG9B,EAAI,IAAKuK,EAC3E,EAEIH,EAAO,SAAUtI,EAAG9B,GACpB,KAAmB,GAAZkJ,EAAGpH,EAAG9B,GAASA,GAAK,EAAIkJ,EAAGpH,EAAG9B,EAAI,IAEzC,MAAO,CAACoJ,EAAGtH,EAAG9B,EAAI,IAAKoJ,EAAGtH,EAAG9B,EAAI,GAAIoJ,EAAGtH,EAAG9B,EAAI,IACnD,EAwrBIwK,EAA8B,mBAAlBC,eAA+BA,eAAsC,mBAAdC,WAA2BA,WAAa,SAAU1E,GAAMA,GAAK,EAC7H,SAAS2E,EAAM9C,EAAMkB,EAAM5B,GACzBA,IACDA,EAAK4B,EAAMA,EAAO,IACL,mBAAN5B,GACP5E,EAAI,GACR,IAAIqI,EAAO,GACPC,EAAO,WACP,IAAK,IAAI5K,EAAI,EAAGA,EAAI2K,EAAK9J,SAAUb,EAC/B2K,EAAK3K,IACjB,EACQ6K,EAAQ,CAAA,EACRC,EAAM,SAAUnJ,EAAG5B,GACnBwK,GAAG,WAAcrD,EAAGvF,EAAG5B,EAAG,GAClC,EACIwK,GAAG,WAAcO,EAAM5D,CAAK,IAE5B,IADA,IAAI/E,EAAIyF,EAAK/G,OAAS,GACA,WAAfqI,EAAGtB,EAAMzF,KAAmBA,EAC/B,IAAKA,GAAKyF,EAAK/G,OAASsB,EAAI,MAExB,OADA2I,EAAIxI,EAAI,GAAI,EAAG,GAAI,MACZsI,EAIf,IAAIG,EAAM9B,EAAGrB,EAAMzF,EAAI,GACvB,GAAI4I,EAAK,CACL,IAAI/F,EAAI+F,EACJhJ,EAAImH,EAAGtB,EAAMzF,EAAI,IACjB4H,EAAS,YAALhI,GAAwB,OAALiD,EAC3B,GAAI+E,EAAG,CACH,IAAIiB,EAAK9B,EAAGtB,EAAMzF,EAAI,KACtB4H,EAAoB,WAAhBb,EAAGtB,EAAMoD,MAEThG,EAAI+F,EAAM7B,EAAGtB,EAAMoD,EAAK,IACxBjJ,EAAImH,EAAGtB,EAAMoD,EAAK,IAEzB,CA6CD,IA5CA,IAAIC,EAAOnC,GAAQA,EAAKoC,OACpBC,EAAU,SAAUnL,GACpB,IAAIG,EAAK2J,EAAGlC,EAAM7F,EAAGgI,GAAIqB,EAAMjL,EAAG,GAAIiK,EAAKjK,EAAG,GAAIkK,EAAKlK,EAAG,GAAI4F,EAAK5F,EAAG,GAAIkL,EAAKlL,EAAG,GAAImK,EAAMnK,EAAG,GAAIJ,EAAI8J,EAAKjC,EAAM0C,GAClHvI,EAAIsJ,EACJ,IAAIC,EAAM,SAAUnJ,EAAGN,GACfM,GACAyI,IACAE,EAAI3I,EAAG,QAGHN,IACAgJ,EAAM9E,GAAMlE,KACTkJ,GACHD,EAAI,KAAMD,GAElC,EACY,IAAKI,GAAQA,EAAK,CACdM,KAAMxF,EACN4C,KAAMyB,EACNoB,aAAcnB,EACdoB,YAAaL,IAEb,GAAKA,EAEA,GAAW,GAAPA,EAAU,CACf,IAAIM,EAAO9D,EAAKxF,SAASrC,EAAGA,EAAIqK,GAEhC,GAAIC,EAAK,QAAUD,EAAK,GAAMC,EAC1B,IACIiB,EAAI,KAAM/C,EAAYmD,EAAM,CAAEhD,IAAK,IAAIvJ,EAAGkL,KAC7C,CACD,MAAOlI,GACHmJ,EAAInJ,EAAG,KACV,MAGDwI,EAAKxC,KAn4CtB,SAAiBP,EAAMkB,EAAM5B,GAKhC,OAJKA,IACDA,EAAK4B,EAAMA,EAAO,IACL,mBAAN5B,GACP5E,EAAI,GACDuG,EAAMjB,EAAMkB,EAAM,CACrBR,IACD,SAAUqD,GAAM,OAAOnD,EAAID,EAAYoD,EAAG/D,KAAK,GAAIa,EAAKkD,EAAG/D,KAAK,QAAU,EAAGV,EACpF,CA23CkC0E,CAAQF,EAAM,CAAE/C,KAAM0B,GAAMiB,GAC7C,MAEGA,EAAIhJ,EAAI,GAAI,4BAA8B8I,EAAK,GAAI,WAhBnDE,EAAI,KAAMpJ,EAAI0F,EAAM7H,EAAGA,EAAIqK,SAmB/BkB,EAAI,KAAM,KAC1B,EACiBtL,EAAI,EAAGA,EAAIgF,IAAKhF,EACrBmL,GAEP,MAEGL,EAAI,KAAM,CAAA,GACd,OAAOF,CACX,CCliFe,SAASiB,EAAqBC,EAAOC,GAClD,OAUK,SAA2CD,GAChD,IAAIE,EAAOC,UAAUpL,OAAS,QAAsBqL,IAAjBD,UAAU,GAAmBA,UAAU,GAAK,CAAE,EAC/EE,EAAUH,EAAKd,OACbR,EAAQuB,UAAUpL,OAAS,EAAIoL,UAAU,QAAKC,EAIlD,OAAOxB,EAAM,IAAItL,WAAW0M,GAAQ,CAElCZ,OAAQ,SAAgBkB,GACtB,OAAID,GACKA,EAAQ,CACbE,KAAMD,EAAKb,MAIhB,GAEL,CA5BSe,CAAkCR,EAAOC,EAASQ,GAAY,EACvE,CA4BA,SAASA,EAAWC,GAClB,OAAO,IAAIC,SAAQ,SAAUC,EAASC,GAIpCjC,EAAM8B,GAAS,SAAUI,EAAO/B,GAC1B+B,EACFD,EAAOC,GAEPF,EAAQ7B,EAEhB,GACA,GACA,CC3De,SAASgC,EAAsCC,GAE5D,IADA,IAAIC,EAAmB,CAAA,EACdC,EAAK,EAAGC,EAAeC,OAAOC,KAAKL,GAAUE,EAAKC,EAAapM,OAAQmM,IAAM,CACpF,IAAII,EAAMH,EAAaD,GACvBD,EAAiBK,GAAO1D,EAAUoD,EAAQM,GAC3C,CACD,OAAOL,CACT,CCNe,SAASM,EAAsBrB,GAC5C,IAAIK,EAAOL,EAAKK,KAChB,OAAOA,EAAKiB,SAAS,SAAWjB,EAAKiB,SAAS,YAChD,CCWA,SAASC,EAAyBC,GAChC,OAAO3B,EAAqB2B,EAAa,CACvCtC,OAAQmC,IACPI,KAAKZ,EACV,CCzBO,SAASa,GAAUC,EAAMC,GAE9B,IADA,IAAI5N,EAAI,EACDA,EAAI2N,EAAKE,WAAWhN,QAAQ,CACjC,IAAIiN,EAAYH,EAAKE,WAAW7N,GAGhC,GAA2B,IAAvB8N,EAAUC,UAAkBC,GAAWF,KAAeF,EACxD,OAAOE,EAET9N,GACD,CACH,CACO,SAASiO,GAAaN,EAAMC,GAGjC,IAFA,IAAIM,EAAU,GACVlO,EAAI,EACDA,EAAI2N,EAAKE,WAAWhN,QAAQ,CACjC,IAAIiN,EAAYH,EAAKE,WAAW7N,GAGL,IAAvB8N,EAAUC,UAAkBC,GAAWF,KAAeF,GACxDM,EAAQ/F,KAAK2F,GAEf9N,GACD,CACD,OAAOkO,CACT,CACO,SAASC,GAAQR,EAAMC,EAASQ,GAMrC,IADA,IAAIpO,EAAI,EACDA,EAAI2N,EAAKE,WAAWhN,QAAQ,CACjC,IAAIiN,EAAYH,EAAKE,WAAW7N,GAC5B4N,EAGyB,IAAvBE,EAAUC,UAAkBC,GAAWF,KAAeF,GACxDQ,EAAKN,EAAW9N,GAGlBoO,EAAKN,EAAW9N,GAElBA,GACD,CACH,CAQA,IAAIqO,GAAoB,OACjB,SAASL,GAAWM,GAQzB,OAAOA,EAAQV,QAAQrH,QAAQ8H,GAAmB,GACpD,CAMO,SAASE,GAAqBD,GAEnC,IADA,IAAItO,EAAI,EACDA,EAAIsO,EAAQT,WAAWhN,QAAQ,CACpC,GALuB,IAKTyN,EAAQT,WAAW7N,GALvB+N,SAMR,OAAOO,EAAQT,WAAW7N,GAE5BA,GACD,CACH,CAGO,SAASwO,GAAYb,GAG1B,GAAsB,IAAlBA,EAAKI,SACP,OAAOJ,EAAKc,YAId,IAFA,IAAI7P,EAAM,IAAMoP,GAAWL,GACvBzN,EAAI,EACDA,EAAIyN,EAAKe,WAAW7N,QACzBjC,GAAO,IAAM+O,EAAKe,WAAWxO,GAAGqL,KAAzB,KAA4CoC,EAAKe,WAAWxO,GAAGyO,MAAQ,IAC9EzO,IAEFtB,GAAO,IAEP,IADA,IAAIoB,EAAI,EACDA,EAAI2N,EAAKE,WAAWhN,QACzBjC,GAAO4P,GAAYb,EAAKE,WAAW7N,IACnCA,IAGF,OADApB,GAAO,KAAOoP,GAAWL,GAAQ,GAEnC,CC1BO,SAASiB,GAAiBC,GAK/B,IDjCiCT,EAC7BF,ECgCAY,EAAMD,EAASE,gBACnB,ODlCiCX,ECkCX,SAAUY,GAC9B,IAAIzK,EAAImJ,GAAUsB,EAAQ,KAC1B,GAAIzK,EACF,OAAOA,EAAEkK,YAEX,IAAIE,EAAQ,GAIZ,OAHAR,GAAQa,EAAQ,KAAK,SAAU/O,GAC7B0O,GAASjB,GAAUzN,EAAG,KAAKwO,WACjC,IACWE,CACX,ED3CMT,EAAU,GACdC,GCgCWW,EAAK,MDhCO,SAAUnB,EAAM3N,GACrCkO,EAAQ/F,KAAKiG,EAAKT,EAAM3N,GAC5B,IACSkO,CCwCT,CC3FA,SAASe,GAAgClN,EAAGmN,GAAkB,IAAIC,EAAuB,oBAAXC,QAA0BrN,EAAEqN,OAAOC,WAAatN,EAAE,cAAe,GAAIoN,EAAI,OAAQA,EAAKA,EAAGG,KAAKvN,IAAIwN,KAAKC,KAAKL,GAAK,GAAIM,MAAMC,QAAQ3N,KAAOoN,EACxN,SAAqCpN,EAAG4N,GAAU,IAAK5N,EAAG,OAAQ,GAAiB,iBAANA,EAAgB,OAAO6N,GAAkB7N,EAAG4N,GAAS,IAAIvL,EAAI8I,OAAOvG,UAAUT,SAASoJ,KAAKvN,GAAGqE,MAAM,GAAI,GAAc,WAANhC,GAAkBrC,EAAEqG,cAAahE,EAAIrC,EAAEqG,YAAYmD,MAAM,GAAU,QAANnH,GAAqB,QAANA,EAAa,OAAOqL,MAAMI,KAAK9N,GAAI,GAAU,cAANqC,GAAqB,2CAA2C0L,KAAK1L,GAAI,OAAOwL,GAAkB7N,EAAG4N,EAAU,CADnMI,CAA4BhO,KAAOmN,GAAkBnN,GAAyB,iBAAbA,EAAElB,OAAqB,CAAMsO,IAAIpN,EAAIoN,GAAI,IAAInP,EAAI,EAAG,OAAO,WAAc,OAAIA,GAAK+B,EAAElB,OAAe,CAAEmP,MAAM,GAAe,CAAEA,MAAM,EAAOrB,MAAO5M,EAAE/B,KAAO,CAAK,CAAC,MAAM,IAAIiQ,UAAU,wIAA2I,CAE5lB,SAASL,GAAkBM,EAAKC,IAAkB,MAAPA,GAAeA,EAAMD,EAAIrP,UAAQsP,EAAMD,EAAIrP,QAAQ,IAAK,IAAIb,EAAI,EAAGoQ,EAAO,IAAIX,MAAMU,GAAMnQ,EAAImQ,EAAKnQ,IAAKoQ,EAAKpQ,GAAKkQ,EAAIlQ,GAAI,OAAOoQ,CAAO,CAIpK,SAASC,GAAqBvR,EAASF,GAoBpD,IAnBA,IAmBuE0R,EAnBnEC,EAAO3R,EAAIC,eAAeC,GAK1B0R,EDkFG9C,GClFwC6C,EDiFvBxB,gBACG,cCjFvB0B,EAAYC,QAAQF,IAAuE,MAAhDA,EAAmBG,aAAa,YAY3EC,EAAS,GACJC,EAAY5B,GD0EhB,SAAmBJ,GAGxB,OAAOZ,GADMP,GADEmB,EAASE,gBACS,UACL,QAC9B,CC9EuD+B,CAAUP,MAAiBD,EAAQO,KAAab,MAAO,CAC1G,IAAIe,EAAQT,EAAM3B,MACdoC,EAAMJ,aAAa,SACrBC,EAAOzI,KAAK,CACVlB,GAAI8J,EAAMJ,aAAa,WACvBpF,KAAMwF,EAAMJ,aAAa,QACzBK,WAAYD,EAAMJ,aAAa,SAGpC,CACD,MAAO,CACLF,UAAWA,EACXG,OAAQA,EAEZ,CC7Be,SAASK,GAAenS,EAASF,GAS9C,IAAIiQ,EAAWjQ,EAAIC,eAAeC,GAC9BoS,EAAY,CACdN,OAAQ,CAAE,EACVO,mBAAejF,EACfkF,YAAQlF,GA0BV,OF8CK,SAA0B2C,GAE/B,OAAOZ,GADaY,EAASE,gBACM,eACrC,CE1DEsC,CAAiBxC,GAAUV,SAfL,SAAyBmD,GAC7C,IAAIC,EAAWD,EAAaX,aAAa,UAEzC,OADeW,EAAaX,aAAa,SAEvC,IAAK,6EACHO,EAAUE,OAASI,GAAYD,GAC/B,MACF,IAAK,oFACHL,EAAUC,cAAgBK,GAAYD,GACtC,MACF,IAAK,gFACHL,EAAUN,OAAOU,EAAaX,aAAa,OAASa,GAAYD,GAGxE,IAUSL,CACT,CACA,SAASM,GAAYnF,GAQnB,MAAgB,MAAZA,EAAK,GACAA,EAAKjG,MAAM,GAOb,MAAQiG,CACjB,CCrEA,SAASoF,GAAQ1P,GAAgC,OAAO0P,GAAU,mBAAqBrC,QAAU,iBAAmBA,OAAOC,SAAW,SAAUtN,GAAK,cAAcA,GAAO,SAAUA,GAAK,OAAOA,GAAK,mBAAqBqN,QAAUrN,EAAEqG,cAAgBgH,QAAUrN,IAAMqN,OAAOzI,UAAY,gBAAkB5E,CAAE,EAAI0P,GAAQ1P,EAAK,CAC9T,SAAS2P,GAAQvP,EAAGlC,GAAK,IAAIsE,EAAI2I,OAAOC,KAAKhL,GAAI,GAAI+K,OAAOyE,sBAAuB,CAAE,IAAI5P,EAAImL,OAAOyE,sBAAsBxP,GAAIlC,IAAM8B,EAAIA,EAAEmJ,QAAO,SAAUjL,GAAK,OAAOiN,OAAO0E,yBAAyBzP,EAAGlC,GAAG4R,UAAW,KAAMtN,EAAE4D,KAAKyB,MAAMrF,EAAGxC,EAAG,CAAG,OAAOwC,CAAI,CAC/P,SAASuN,GAAc3P,GAAK,IAAK,IAAIlC,EAAI,EAAGA,EAAIgM,UAAUpL,OAAQZ,IAAK,CAAE,IAAIsE,EAAI,MAAQ0H,UAAUhM,GAAKgM,UAAUhM,GAAK,CAAE,EAAEA,EAAI,EAAIyR,GAAQxE,OAAO3I,IAAI,GAAI4J,SAAQ,SAAUlO,GAAK8R,GAAgB5P,EAAGlC,EAAGsE,EAAEtE,GAAM,IAAIiN,OAAO8E,0BAA4B9E,OAAO+E,iBAAiB9P,EAAG+K,OAAO8E,0BAA0BzN,IAAMmN,GAAQxE,OAAO3I,IAAI4J,SAAQ,SAAUlO,GAAKiN,OAAOgF,eAAe/P,EAAGlC,EAAGiN,OAAO0E,yBAAyBrN,EAAGtE,GAAI,GAAM,CAAC,OAAOkC,CAAI,CACvb,SAAS4P,GAAgBI,EAAK/E,EAAKuB,GAA4L,OAAnLvB,EAC5C,SAAwBgF,GAAO,IAAIhF,EACnC,SAAsBtB,EAAOuG,GAAQ,GAAuB,WAAnBZ,GAAQ3F,IAAiC,OAAVA,EAAgB,OAAOA,EAAO,IAAIwG,EAAOxG,EAAMsD,OAAOmD,aAAc,QAAarG,IAAToG,EAAoB,CAAE,IAAIE,EAAMF,EAAKhD,KAAKxD,EAAOuG,GAAQ,WAAY,GAAqB,WAAjBZ,GAAQe,GAAmB,OAAOA,EAAK,MAAM,IAAIvC,UAAU,+CAAkD,CAAC,OAAiB,WAAToC,EAAoB7I,OAASiJ,QAAQ3G,EAAS,CADpV4G,CAAaN,EAAK,UAAW,MAAwB,WAAjBX,GAAQrE,GAAoBA,EAAM5D,OAAO4D,EAAO,CAD3EuF,CAAevF,MAAiB+E,EAAOjF,OAAOgF,eAAeC,EAAK/E,EAAK,CAAEuB,MAAOA,EAAOkD,YAAY,EAAMe,cAAc,EAAMC,UAAU,IAAkBV,EAAI/E,GAAOuB,EAAgBwD,CAAM,CAQ7N,SAASW,GAAYhU,EAASF,GAC3C,IAAKE,EACH,MAAO,GAKT,IH+B4B+P,EAExBkE,EGjCAC,EAAMpU,EAAIC,eAAeC,GACzBmU,GH8BwBpE,EG9BGmE,EHgC3BD,EAAerF,GADFmB,EAASE,gBACe,gBACrCgE,EACK9E,GAAa8E,EAAc,MAE7B,IGpC6BG,IAAIC,IACpCC,EH6CC,SAA0BvE,GAC/B,IAEIwE,EAAU3F,GAFGmB,EAASE,gBAEU,WACpC,OAAIsE,EACKpF,GAAaoF,EAAS,UAExB,EACT,CGrDsBC,CAAiBN,GAAKE,IAAIK,IAAwBC,QAAO,SAAUC,EAASC,GAI9F,OADAD,EAAQC,EAAOzM,IAAMyM,EACdD,CACR,GAAE,IAOH,OHyBK,SAAuB5E,GAC5B,IACI8E,EAAUjG,GADGmB,EAASE,gBACU,WACpC,OAAK4E,EAGE1F,GAAa0F,EAAS,MAFpB,EAGX,CGhCSC,CAAcZ,GAAKE,KANP,SAAsBW,GACvC,OAAIA,EAAGC,aAAa,QACXhC,GAAcA,GAAc,CAAE,EAAEmB,EAAWY,EAAGE,OAAQZ,GAAeU,EAAIT,IAE3ED,GAAeU,EAAIT,EAC9B,GAEA,CACA,SAASG,GAAuBS,GAC9B,MAAO,CACL/M,GAAI+M,EAAOrD,aAAa,YACxBsD,SAAUD,EAAOrD,aAAa,cAElC,CAGA,SAASwC,GAAeU,EAAIR,GAC1B,IAAIa,EAAQ,CAAA,EACZ,GAAIL,EAAGC,aAAa,YAAa,CAC/B,IAAIK,EAAiBN,EAAGlD,aAAa,YAGjC0C,EAAQc,GACVD,EAAME,aAAef,EAAQc,GAE7BD,EAAME,aAAe,CACnBnN,GAAIkN,EAGT,CACD,OAAOD,CACT,CCiBA,IAAIG,GAA6C,GAC7CC,GAAuB,EACvBC,GAAiC,EAsDjCC,GAAM,MACNC,GAAe,ICnInB,SAASxF,GAAgClN,EAAGmN,GAAkB,IAAIC,EAAuB,oBAAXC,QAA0BrN,EAAEqN,OAAOC,WAAatN,EAAE,cAAe,GAAIoN,EAAI,OAAQA,EAAKA,EAAGG,KAAKvN,IAAIwN,KAAKC,KAAKL,GAAK,GAAIM,MAAMC,QAAQ3N,KAAOoN,EACxN,SAAqCpN,EAAG4N,GAAU,IAAK5N,EAAG,OAAQ,GAAiB,iBAANA,EAAgB,OAAO6N,GAAkB7N,EAAG4N,GAAS,IAAIvL,EAAI8I,OAAOvG,UAAUT,SAASoJ,KAAKvN,GAAGqE,MAAM,GAAI,GAAc,WAANhC,GAAkBrC,EAAEqG,cAAahE,EAAIrC,EAAEqG,YAAYmD,MAAM,GAAU,QAANnH,GAAqB,QAANA,EAAa,OAAOqL,MAAMI,KAAK9N,GAAI,GAAU,cAANqC,GAAqB,2CAA2C0L,KAAK1L,GAAI,OAAOwL,GAAkB7N,EAAG4N,EAAU,CADnMI,CAA4BhO,KAAOmN,GAAkBnN,GAAyB,iBAAbA,EAAElB,OAAqB,CAAMsO,IAAIpN,EAAIoN,GAAI,IAAInP,EAAI,EAAG,OAAO,WAAc,OAAIA,GAAK+B,EAAElB,OAAe,CAAEmP,MAAM,GAAe,CAAEA,MAAM,EAAOrB,MAAO5M,EAAE/B,KAAO,CAAK,CAAC,MAAM,IAAIiQ,UAAU,wIAA2I,CAE5lB,SAASL,GAAkBM,EAAKC,IAAkB,MAAPA,GAAeA,EAAMD,EAAIrP,UAAQsP,EAAMD,EAAIrP,QAAQ,IAAK,IAAIb,EAAI,EAAGoQ,EAAO,IAAIX,MAAMU,GAAMnQ,EAAImQ,EAAKnQ,IAAKoQ,EAAKpQ,GAAKkQ,EAAIlQ,GAAI,OAAOoQ,CAAO,CAanL,IAAIsE,GAAqC,iBAuBrCC,GAA0C,MAC1CC,GAAQ,CAAA,EACG,SAASC,GAAmBZ,GACzC,GAAIA,KAAYW,GACd,OAAOA,GAAMX,GAEf,IAAIa,EAIN,SAAsBb,GAIpBA,EAAWA,EAASc,cAIpBd,EAAWA,EAAS1N,QAAQmO,GAAoC,IAKhET,EAAWA,EAAS1N,QAAQoO,GAAyC,IAIrE,IAAIK,EAASf,EAASzN,MAAM,OAK5B,GAAIwO,EAAOnU,OAAS,EAClB,OAAO,EAET,IAAK,IAAyDyP,EAArDO,EAAY5B,GAAgC+F,KAAkB1E,EAAQO,KAAab,MAAO,CACjG,IAAIiF,EAAQ3E,EAAM3B,MAGlB,GAAIuG,GAAqB7O,QAAQ4O,GAAS,EACxC,OAAO,CAEV,CACD,OAAO,CACT,CAtCeE,CAAalB,GAE1B,OADAW,GAAMX,GAAYa,EACXA,CACT,CAuCA,IAAII,GAAuB,CAE3B,KAEA,KAEA,IAEA,KAEA,KAEA,KAEA,IAEA,KAEA,IAEA,KAEA,MAEA,OAEA,KAEA,OAOA,KClFA,IA2BIE,GAAgE,CAAC,GAErE,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,IAKIC,GAAqD,CAAC,GAE1D,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,IA6BIC,GArI8C,CAAC,GAEnD,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,IA+G2EC,OAE3EH,IAA+DG,OAE/DF,GAAmDnK,QAAO,SAAUiJ,GAClE,OAAOiB,GAA8D/O,QAAQ8N,GAAkB,CACjG,KAAIoB,OA9BuC,CAAC,GAE5C,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,IAYqCrK,QAAO,SAAUiJ,GACpD,OAAOiB,GAA8D/O,QAAQ8N,GAAkB,CACjG,IAAGjJ,QAAO,SAAUiJ,GAClB,OAAOkB,GAAmDhP,QAAQ8N,GAAkB,CACtF,KCpLe,SAASqB,GAAe7G,EAAOrK,EAAM0H,GAClD,IAAIyJ,EAAuBzJ,EAAKyJ,qBAC9BC,EAAqB1J,EAAK0J,mBAC1BC,EAAa3J,EAAK2J,WAClBvE,EAASpF,EAAKoF,OACdD,EAAgBnF,EAAKmF,cACrBV,EAAYzE,EAAKyE,UACjB1E,EAAUC,EAAKD,QAajB,OAZKzH,IAGHA,EAAO,KASDA,GAKN,IAAK,MACHqK,EAAQiH,GAAYjH,EAAO5C,GAC3B,MAKF,IAAK,YAEH,QAAcG,KADdyC,EAAQ8G,KAEN,MAAM,IAAI/S,MAAM,qDAAuD6S,OAAOG,MAEhF/G,EAAQiH,GAAYjH,EAAO5C,GAC3B,MAOF,IAAK,IAKH,IAAI8J,EAAoBpD,OAAO9D,GAC/B,GAAImH,MAAMD,GACR,MAAM,IAAInT,MAAM,kCAAoC6S,OAAO5G,IAE7D,GAAIkH,GAAqB1E,EAActQ,OACrC,MAAM,IAAI6B,MAAM,2CAA6C6S,OAAO5G,IAGtEA,EAAQiH,GADRjH,EAAQwC,EAAc0E,GACK9J,GAC3B,MAIF,IAAK,IACH,GAAc,MAAV4C,EACFA,GAAQ,MACH,IAAc,MAAVA,EAGT,MAAM,IAAIjM,MAAM,qCAAuC6S,OAAO5G,IAF9DA,GAAQ,CAGT,CACD,MAIF,IAAK,IACHA,OAAQzC,EACR,MAMF,IAAK,IACHyC,EAuDN,SAAqBoH,GAGnB,OAAQA,GACN,KAAK,EACH,MAAO,SACT,KAAK,EACH,MAAO,UACT,KAAK,GACH,MAAO,UACT,KAAK,GACH,MAAO,QACT,KAAK,GACH,MAAO,SACT,KAAK,GACH,MAAO,QACT,KAAK,GACH,MAAO,OACT,KAAK,GACH,MAAO,gBACT,QAEE,MAAO,UAAUR,OAAOQ,GAE9B,CA/EcC,CAAYrH,GACpB,MAOF,IAAK,IACH,QAAczC,IAAVyC,EACF,MAEF,IAAIsH,EAAa,IAAIC,KAAKvH,GAC1B,GAAImH,MAAMG,EAAWE,WACnB,MAAM,IAAIzT,MAAM,kCAAoC6S,OAAO5G,IAE7DA,EAAQsH,EACR,MAGF,IAAK,IACH,QAAc/J,IAAVyC,EACF,MAIF,IAAIyH,EAAUT,IACd,GAAIS,GD5GK,SAA2BA,EAAShF,EAAQrF,GACzD,GAAIqK,EAAS,CACX,IAAIlC,EAAQ9C,EAAOgF,GACnB,IAAKlC,EACH,MAAM,IAAIxR,MAAM,yBAAyB6S,OAAOa,IAElD,IAAKlC,EAAME,aACT,OAAO,EAET,GAEAkB,GAAyBjP,QAAQoM,OAAOyB,EAAME,aAAanN,MAAQ,GAGnE8E,EAAQsK,YAAcnC,EAAME,aAAaH,WAAalI,EAAQsK,aAGlC,IAA5BtK,EAAQuK,iBAA6BpC,EAAME,aAAaH,UAAYkB,GAAajB,EAAME,aAAaH,UAClG,OAAO,CAEV,CACH,CCuFqBsC,CAAkBH,EAAShF,EAAQrF,GAIhD4C,EHhHO,SAAwB6H,EAAiBzK,GAsBlDA,GAAWA,EAAQ0E,YAErB+F,GAAmB,EAAgB/B,GAAeH,GAAuBC,IAE3E,IAAIkC,EAAsBnC,GAAuBC,GAAiC,GAAgBE,GAAeJ,GACjH,OAAO,IAAI6B,KAAKvS,KAAK+S,OAAOF,EAAkBC,GAAuBjC,IACvE,CGoFgBmC,CAFRhI,EAAQiI,GAAmBjI,GAEG,CAC5B8B,UAAWA,SAOb9B,GADkB5C,EAAQ8K,aAAeD,IACrBjI,GAEtB,MACF,QACE,MAAM,IAAIsB,UAAU,4BAA4BsF,OAAOjR,IAO3D,YAHc4H,IAAVyC,IACFA,EAAQ,MAEHA,CACT,CA6BA,SAASiH,GAAYjH,EAAO5C,GAW1B,OANqB,IAAjBA,EAAQ9M,OACV0P,EAAQA,EAAM1P,QAEF,KAAV0P,IACFA,OAAQzC,GAEHyC,CACT,CAQA,SAASiI,GAAmBE,GAC1B,IAAIC,EAAetE,OAAOqE,GAC1B,GAAIhB,MAAMiB,GACR,MAAM,IAAIrU,MAAM,iCAAmC6S,OAAOuB,IAE5D,OAAOC,CACT,CClMA,SAASC,GAAe9G,EAAKlQ,GAAK,OAKlC,SAAyBkQ,GAAO,GAAIT,MAAMC,QAAQQ,GAAM,OAAOA,CAAM,CAL5B+G,CAAgB/G,IAIzD,SAA+BjQ,EAAGa,GAAK,IAAIyD,EAAI,MAAQtE,EAAI,KAAO,oBAAsBmP,QAAUnP,EAAEmP,OAAOC,WAAapP,EAAE,cAAe,GAAI,MAAQsE,EAAG,CAAE,IAAIpC,EAAGiC,EAAGpE,EAAGkX,EAAGvV,EAAI,GAAIyB,GAAI,EAAIrB,GAAI,EAAI,IAAM,GAAI/B,GAAKuE,EAAIA,EAAE+K,KAAKrP,IAAIsP,KAAM,IAAMzO,EAAG,CAAE,GAAIoM,OAAO3I,KAAOA,EAAG,OAAQnB,GAAI,CAAK,MAAM,OAASA,GAAKjB,EAAInC,EAAEsP,KAAK/K,IAAIyL,QAAUrO,EAAEwG,KAAKhG,EAAEwM,OAAQhN,EAAEd,SAAWC,GAAIsC,GAAI,IAAO,MAAOnD,GAAK8B,GAAI,EAAIqC,EAAInE,CAAE,SAAa,IAAM,IAAKmD,GAAK,MAAQmB,EAAU,SAAM2S,EAAI3S,EAAU,SAAK2I,OAAOgK,KAAOA,GAAI,MAAS,CAAA,QAAW,GAAInV,EAAG,MAAMqC,CAAI,CAAA,CAAG,OAAOzC,CAAE,CAAI,CAJzdwV,CAAsBjH,EAAKlQ,IAE5F,SAAqC+B,EAAG4N,GAAU,IAAK5N,EAAG,OAAQ,GAAiB,iBAANA,EAAgB,OAAO6N,GAAkB7N,EAAG4N,GAAS,IAAIvL,EAAI8I,OAAOvG,UAAUT,SAASoJ,KAAKvN,GAAGqE,MAAM,GAAI,GAAc,WAANhC,GAAkBrC,EAAEqG,cAAahE,EAAIrC,EAAEqG,YAAYmD,MAAM,GAAU,QAANnH,GAAqB,QAANA,EAAa,OAAOqL,MAAMI,KAAK9N,GAAI,GAAU,cAANqC,GAAqB,2CAA2C0L,KAAK1L,GAAI,OAAOwL,GAAkB7N,EAAG4N,EAAU,CAF9TI,CAA4BG,EAAKlQ,IACnI,WAA8B,MAAM,IAAIiQ,UAAU,4IAA+I,CADxDmH,EAAqB,CAG9J,SAASxH,GAAkBM,EAAKC,IAAkB,MAAPA,GAAeA,EAAMD,EAAIrP,UAAQsP,EAAMD,EAAIrP,QAAQ,IAAK,IAAIb,EAAI,EAAGoQ,EAAO,IAAIX,MAAMU,GAAMnQ,EAAImQ,EAAKnQ,IAAKoQ,EAAKpQ,GAAKkQ,EAAIlQ,GAAI,OAAOoQ,CAAO,CAGpK,SAASiH,GAAqBC,GAE3C,IACEC,EAAyBP,GADCM,EAAkB9Q,MAAM,SACa,GAC/DgR,EAASD,EAAuB,GAChCE,EAAMF,EAAuB,GAC/B,MAAO,CAEP9E,OAAOgF,GAIPC,GAAiCF,EAAOvY,QAC1C,CAGA,IAAI0Y,GAAU,CAAC,GAAI,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,KAIhJ,SAASD,GAAiCE,GAIxC,IAFA,IAAIxT,EAAI,EACJpE,EAAI,EACDA,EAAI4X,EAAc/W,QACvBuD,GAAK,GACLA,GAAKuT,GAAQtR,QAAQuR,EAAc5X,IACnCA,IAEF,OAAOoE,CACT,CCNe,SAASyT,GAAUvJ,EAASwJ,EAAe3G,EAAeC,EAAQX,EAAW1E,GAC1F,IAAIgM,EAAcV,GAAqB/I,EAAQqC,aAAa,MACxDqH,ETNC,SAA6BnJ,EAAUP,GAC5C,OAAOZ,GAAUY,EAAS,IAC5B,CSIqB2J,CAAoBH,EAAexJ,GAMlDK,EAAQqJ,GAAgBA,EAAavJ,YACrCnK,EAAOgK,EAAQqC,aAAa,KAChC,MAAO,CACL8G,IAAKM,EAAY,GACjBP,OAAQO,EAAY,GACpBpJ,MAAO6G,GAAe7G,EAAOrK,EAAM,CACjCmR,qBAAsB,WACpB,OThBD,SAAkC5G,EAAUP,GAKjD,IAAI4J,EAAoB3J,GAAqBD,GAC7C,GAAI4J,GAAuD,OAAlClK,GAAWkK,GAA6B,CAC/D,IAAIC,EAAqC5J,GAAqB2J,GAC9D,GAAIC,GAAyF,MAAnDnK,GAAWmK,GACnD,OAAOA,EAAmC1J,WAE7C,CACH,CSIe2J,CAAyBN,EAAexJ,EAChD,EACDoH,mBAAoB,WAClB,OAAOlH,GAAYF,EACpB,EACDqH,WAAY,WACV,OAAOrH,EAAQqC,aAAa,IAC7B,EACDS,OAAQA,EACRD,cAAeA,EACfV,UAAWA,EACX1E,QAASA,IAGf,CCzDe,SAASsM,GAAWP,EAAe3G,EAAeC,EAAQX,EAAW1E,GAClF,IAAIuM,EVCC,SAAyBzJ,GAC9B,IACI0J,EAAY7K,GADAmB,EAASE,gBACY,aACjCuJ,EAAQ,GAMZ,OALAnK,GAAQoK,EAAW,OAAO,SAAUd,GAClCtJ,GAAQsJ,EAAK,KAAK,SAAUe,GAC1BF,EAAMnQ,KAAKqQ,EACjB,GACA,IACSF,CACT,CUXcG,CAAgBX,GAC5B,OAAqB,IAAjBQ,EAAMzX,OACD,GAiBFyX,EAAMpF,KAAI,SAAU5E,GACzB,OAAOuJ,GAAUvJ,EAASwJ,EAAe3G,EAAeC,EAAQX,EAAW1E,EAC/E,GACA,CCzBA,SAASiL,GAAe9G,EAAKlQ,GAAK,OAKlC,SAAyBkQ,GAAO,GAAIT,MAAMC,QAAQQ,GAAM,OAAOA,CAAM,CAL5B+G,CAAgB/G,IAIzD,SAA+BjQ,EAAGa,GAAK,IAAIyD,EAAI,MAAQtE,EAAI,KAAO,oBAAsBmP,QAAUnP,EAAEmP,OAAOC,WAAapP,EAAE,cAAe,GAAI,MAAQsE,EAAG,CAAE,IAAIpC,EAAGiC,EAAGpE,EAAGkX,EAAGvV,EAAI,GAAIyB,GAAI,EAAIrB,GAAI,EAAI,IAAM,GAAI/B,GAAKuE,EAAIA,EAAE+K,KAAKrP,IAAIsP,KAAM,IAAMzO,EAAG,CAAE,GAAIoM,OAAO3I,KAAOA,EAAG,OAAQnB,GAAI,CAAK,MAAM,OAASA,GAAKjB,EAAInC,EAAEsP,KAAK/K,IAAIyL,QAAUrO,EAAEwG,KAAKhG,EAAEwM,OAAQhN,EAAEd,SAAWC,GAAIsC,GAAI,IAAO,MAAOnD,GAAK8B,GAAI,EAAIqC,EAAInE,CAAE,SAAa,IAAM,IAAKmD,GAAK,MAAQmB,EAAU,SAAM2S,EAAI3S,EAAU,SAAK2I,OAAOgK,KAAOA,GAAI,MAAS,CAAA,QAAW,GAAInV,EAAG,MAAMqC,CAAI,CAAA,CAAG,OAAOzC,CAAE,CAAI,CAJzdwV,CAAsBjH,EAAKlQ,IAE5F,SAAqC+B,EAAG4N,GAAU,IAAK5N,EAAG,OAAQ,GAAiB,iBAANA,EAAgB,OAAO6N,GAAkB7N,EAAG4N,GAAS,IAAIvL,EAAI8I,OAAOvG,UAAUT,SAASoJ,KAAKvN,GAAGqE,MAAM,GAAI,GAAc,WAANhC,GAAkBrC,EAAEqG,cAAahE,EAAIrC,EAAEqG,YAAYmD,MAAM,GAAU,QAANnH,GAAqB,QAANA,EAAa,OAAOqL,MAAMI,KAAK9N,GAAI,GAAU,cAANqC,GAAqB,2CAA2C0L,KAAK1L,GAAI,OAAOwL,GAAkB7N,EAAG4N,EAAU,CAF9TI,CAA4BG,EAAKlQ,IACnI,WAA8B,MAAM,IAAIiQ,UAAU,4IAA+I,CADxDmH,EAAqB,CAG9J,SAASxH,GAAkBM,EAAKC,IAAkB,MAAPA,GAAeA,EAAMD,EAAIrP,UAAQsP,EAAMD,EAAIrP,QAAQ,IAAK,IAAIb,EAAI,EAAGoQ,EAAO,IAAIX,MAAMU,GAAMnQ,EAAImQ,EAAKnQ,IAAKoQ,EAAKpQ,GAAKkQ,EAAIlQ,GAAI,OAAOoQ,CAAO,CAQpK,SAASsI,GAAqBZ,GAC3C,IAAIa,EX8BC,SAAuB9J,GAC5B,IACI8J,EAAajL,GADDmB,EAASE,gBACa,aACtC,GAAI4J,EACF,OAAOA,EAAWhI,aAAa,MAEnC,CWpCmBiI,CAAcd,GAC/B,GAAIa,EAoBF,OAH0B,KAhB1BA,EAAaA,EAAWnS,MAAM,KAAK0M,IAAImE,IAAsBnE,KAAI,SAAUlH,GACzE,IAAI6M,EAAQ7B,GAAehL,EAAM,GAGjC,MAAO,CACLyL,IAHMoB,EAAM,GAIZrB,OAHSqB,EAAM,GAKvB,KAQmBhY,SACb8X,EAAa,CAACA,EAAW,GAAIA,EAAW,KAEnCA,CAEX,CCnCA,SAAS1J,GAAgClN,EAAGmN,GAAkB,IAAIC,EAAuB,oBAAXC,QAA0BrN,EAAEqN,OAAOC,WAAatN,EAAE,cAAe,GAAIoN,EAAI,OAAQA,EAAKA,EAAGG,KAAKvN,IAAIwN,KAAKC,KAAKL,GAAK,GAAIM,MAAMC,QAAQ3N,KAAOoN,EACxN,SAAqCpN,EAAG4N,GAAU,IAAK5N,EAAG,OAAQ,GAAiB,iBAANA,EAAgB,OAAO6N,GAAkB7N,EAAG4N,GAAS,IAAIvL,EAAI8I,OAAOvG,UAAUT,SAASoJ,KAAKvN,GAAGqE,MAAM,GAAI,GAAc,WAANhC,GAAkBrC,EAAEqG,cAAahE,EAAIrC,EAAEqG,YAAYmD,MAAM,GAAU,QAANnH,GAAqB,QAANA,EAAa,OAAOqL,MAAMI,KAAK9N,GAAI,GAAU,cAANqC,GAAqB,2CAA2C0L,KAAK1L,GAAI,OAAOwL,GAAkB7N,EAAG4N,EAAU,CADnMI,CAA4BhO,KAAOmN,GAAkBnN,GAAyB,iBAAbA,EAAElB,OAAqB,CAAMsO,IAAIpN,EAAIoN,GAAI,IAAInP,EAAI,EAAG,OAAO,WAAc,OAAIA,GAAK+B,EAAElB,OAAe,CAAEmP,MAAM,GAAe,CAAEA,MAAM,EAAOrB,MAAO5M,EAAE/B,KAAO,CAAK,CAAC,MAAM,IAAIiQ,UAAU,wIAA2I,CAE5lB,SAASL,GAAkBM,EAAKC,IAAkB,MAAPA,GAAeA,EAAMD,EAAIrP,UAAQsP,EAAMD,EAAIrP,QAAQ,IAAK,IAAIb,EAAI,EAAGoQ,EAAO,IAAIX,MAAMU,GAAMnQ,EAAImQ,EAAKnQ,IAAKoQ,EAAKpQ,GAAKkQ,EAAIlQ,GAAI,OAAOoQ,CAAO,CCFnL,SAASnB,GAAgClN,EAAGmN,GAAkB,IAAIC,EAAuB,oBAAXC,QAA0BrN,EAAEqN,OAAOC,WAAatN,EAAE,cAAe,GAAIoN,EAAI,OAAQA,EAAKA,EAAGG,KAAKvN,IAAIwN,KAAKC,KAAKL,GAAK,GAAIM,MAAMC,QAAQ3N,KAAOoN,EACxN,SAAqCpN,EAAG4N,GAAU,IAAK5N,EAAG,OAAQ,GAAiB,iBAANA,EAAgB,OAAO6N,GAAkB7N,EAAG4N,GAAS,IAAIvL,EAAI8I,OAAOvG,UAAUT,SAASoJ,KAAKvN,GAAGqE,MAAM,GAAI,GAAc,WAANhC,GAAkBrC,EAAEqG,cAAahE,EAAIrC,EAAEqG,YAAYmD,MAAM,GAAU,QAANnH,GAAqB,QAANA,EAAa,OAAOqL,MAAMI,KAAK9N,GAAI,GAAU,cAANqC,GAAqB,2CAA2C0L,KAAK1L,GAAI,OAAOwL,GAAkB7N,EAAG4N,EAAU,CADnMI,CAA4BhO,KAAOmN,GAAkBnN,GAAyB,iBAAbA,EAAElB,OAAqB,CAAMsO,IAAIpN,EAAIoN,GAAI,IAAInP,EAAI,EAAG,OAAO,WAAc,OAAIA,GAAK+B,EAAElB,OAAe,CAAEmP,MAAM,GAAe,CAAEA,MAAM,EAAOrB,MAAO5M,EAAE/B,KAAO,CAAK,CAAC,MAAM,IAAIiQ,UAAU,wIAA2I,CAE5lB,SAASL,GAAkBM,EAAKC,IAAkB,MAAPA,GAAeA,EAAMD,EAAIrP,UAAQsP,EAAMD,EAAIrP,QAAQ,IAAK,IAAIb,EAAI,EAAGoQ,EAAO,IAAIX,MAAMU,GAAMnQ,EAAImQ,EAAKnQ,IAAKoQ,EAAKpQ,GAAKkQ,EAAIlQ,GAAI,OAAOoQ,CAAO,CCDnL,SAAS4G,GAAe9G,EAAKlQ,GAAK,OAKlC,SAAyBkQ,GAAO,GAAIT,MAAMC,QAAQQ,GAAM,OAAOA,CAAM,CAL5B+G,CAAgB/G,IAIzD,SAA+BjQ,EAAGa,GAAK,IAAIyD,EAAI,MAAQtE,EAAI,KAAO,oBAAsBmP,QAAUnP,EAAEmP,OAAOC,WAAapP,EAAE,cAAe,GAAI,MAAQsE,EAAG,CAAE,IAAIpC,EAAGiC,EAAGpE,EAAGkX,EAAGvV,EAAI,GAAIyB,GAAI,EAAIrB,GAAI,EAAI,IAAM,GAAI/B,GAAKuE,EAAIA,EAAE+K,KAAKrP,IAAIsP,KAAM,IAAMzO,EAAG,CAAE,GAAIoM,OAAO3I,KAAOA,EAAG,OAAQnB,GAAI,CAAK,MAAM,OAASA,GAAKjB,EAAInC,EAAEsP,KAAK/K,IAAIyL,QAAUrO,EAAEwG,KAAKhG,EAAEwM,OAAQhN,EAAEd,SAAWC,GAAIsC,GAAI,IAAO,MAAOnD,GAAK8B,GAAI,EAAIqC,EAAInE,CAAE,SAAa,IAAM,IAAKmD,GAAK,MAAQmB,EAAU,SAAM2S,EAAI3S,EAAU,SAAK2I,OAAOgK,KAAOA,GAAI,MAAS,CAAA,QAAW,GAAInV,EAAG,MAAMqC,CAAI,CAAA,CAAG,OAAOzC,CAAE,CAAI,CAJzdwV,CAAsBjH,EAAKlQ,IAAM+P,GAA4BG,EAAKlQ,IACnI,WAA8B,MAAM,IAAIiQ,UAAU,4IAA+I,CADxDmH,EAAqB,CAE9J,SAASrH,GAA4BhO,EAAG4N,GAAU,GAAK5N,EAAL,CAAgB,GAAiB,iBAANA,EAAgB,OAAO6N,GAAkB7N,EAAG4N,GAAS,IAAIvL,EAAI8I,OAAOvG,UAAUT,SAASoJ,KAAKvN,GAAGqE,MAAM,GAAI,GAAiE,MAAnD,WAANhC,GAAkBrC,EAAEqG,cAAahE,EAAIrC,EAAEqG,YAAYmD,MAAgB,QAANnH,GAAqB,QAANA,EAAoBqL,MAAMI,KAAK9N,GAAc,cAANqC,GAAqB,2CAA2C0L,KAAK1L,GAAWwL,GAAkB7N,EAAG4N,QAAzG,EAAmH,CACha,SAASC,GAAkBM,EAAKC,IAAkB,MAAPA,GAAeA,EAAMD,EAAIrP,UAAQsP,EAAMD,EAAIrP,QAAQ,IAAK,IAAIb,EAAI,EAAGoQ,EAAO,IAAIX,MAAMU,GAAMnQ,EAAImQ,EAAKnQ,IAAKoQ,EAAKpQ,GAAKkQ,EAAIlQ,GAAI,OAAOoQ,CAAO,CAKpK,SAAS0I,GAA0BR,EAAOK,GAEvD,GAAqB,IAAjBL,EAAMzX,OACR,MAAO,GAEN,IAACkY,EAAc/B,GAAe2B,EAAY,GACjCI,EAAY,GAexB,IAdF,IAAIC,EAAcD,EAAY,GAQxBE,EAAYD,EAAYxB,OACxB0B,EAAYF,EAAYvB,IAGxB7P,EAAO,IAAI6H,MAAMyJ,GACjBlZ,EAAI,EACDA,EAAIkZ,GAAW,CACpBtR,EAAK5H,GAAK,IAAIyP,MAAMwJ,GAEpB,IADA,IAAI/Y,EAAI,EACDA,EAAI+Y,GACTrR,EAAK5H,GAAGE,GAAK,KACbA,IAEFF,GACD,CAMD,IAAK,IAAwDsQ,EAApDO,EA5CX,SAAyC9O,EAAGmN,GAAkB,IAAIC,EAAuB,oBAAXC,QAA0BrN,EAAEqN,OAAOC,WAAatN,EAAE,cAAe,GAAIoN,EAAI,OAAQA,EAAKA,EAAGG,KAAKvN,IAAIwN,KAAKC,KAAKL,GAAK,GAAIM,MAAMC,QAAQ3N,KAAOoN,EAAKY,GAA4BhO,KAAOmN,GAAkBnN,GAAyB,iBAAbA,EAAElB,OAAqB,CAAMsO,IAAIpN,EAAIoN,GAAI,IAAInP,EAAI,EAAG,OAAO,WAAc,OAAIA,GAAK+B,EAAElB,OAAe,CAAEmP,MAAM,GAAe,CAAEA,MAAM,EAAOrB,MAAO5M,EAAE/B,KAAO,CAAK,CAAC,MAAM,IAAIiQ,UAAU,wIAA2I,CA4CrkBhB,CAAgCqJ,KAAiBhI,EAAQO,KAAab,MAAO,CAChG,IAAIwI,EAAOlI,EAAM3B,MAMbwK,EAAWX,EAAKf,IAAM,EACtB2B,EAAcZ,EAAKhB,OAAS,EAE5B4B,EAAcH,GAAaE,EAAWD,IACxCtR,EAAKuR,GAAUC,GAAeZ,EAAK7J,MAEtC,CAoBD,OAPA/G,EFnEa,SAAuBA,GAUpC,IATA,IAAIoE,EAAOC,UAAUpL,OAAS,QAAsBqL,IAAjBD,UAAU,GAAmBA,UAAU,GAAK,CAAE,EAC/EoN,EAAoBrN,EAAKqN,kBACzBC,EAAgBtN,EAAKuN,SACrBA,OAA6B,IAAlBD,EAA2B,SAAUE,GAC9C,OAAOA,CACb,EAAQF,EACJG,EAAmBzN,EAAKyN,iBAEtBzZ,EAAI4H,EAAK/G,OAAS,EACfb,GAAK,GAAG,CAGb,IADA,IAC+DsQ,EAD3DoJ,GAAQ,EACH7I,EAAY5B,GAAgCrH,EAAK5H,MAAcsQ,EAAQO,KAAab,MAE3F,GAAuB,OAAnBuJ,EADOjJ,EAAM3B,OACY,CAC3B+K,GAAQ,EACR,KACD,CAGH,GAAIA,EACF9R,EAAK+R,OAAO3Z,EAAG,GACXqZ,GACFA,EAAkBM,OAAO3Z,EAAG,QAEzB,GAAIyZ,EACT,MAEFzZ,GACD,CACD,OAAO4H,CACT,CEmCSgS,CDnEM,SAA0BhS,GAQvC,IAPA,IAAIoE,EAAOC,UAAUpL,OAAS,QAAsBqL,IAAjBD,UAAU,GAAmBA,UAAU,GAAK,CAAE,EAC/EqN,EAAgBtN,EAAKuN,SACrBA,OAA6B,IAAlBD,EAA2B,SAAUE,GAC9C,OAAOA,CACb,EAAQF,EACJG,EAAmBzN,EAAKyN,iBACtBzZ,EAAI4H,EAAK,GAAG/G,OAAS,EAClBb,GAAK,GAAG,CAEb,IADA,IAC4DsQ,EADxDoJ,GAAQ,EACH7I,EAAY5B,GAAgCrH,KAAgB0I,EAAQO,KAAab,MAExF,GAAyB,OAArBuJ,EADMjJ,EAAM3B,MACC3O,IAAc,CAC7B0Z,GAAQ,EACR,KACD,CAEH,GAAIA,EAEF,IADA,IAAIxZ,EAAI,EACDA,EAAI0H,EAAK/G,QACd+G,EAAK1H,GAAGyZ,OAAO3Z,EAAG,GAClBE,SAEG,GAAIuZ,EACT,MAEFzZ,GACD,CACD,OAAO4H,CACT,CCsCuBiS,CAAiBjS,EAAM,CAC1C6R,kBAAkB,IAChB,CACFA,kBAAkB,IAIb7R,CACT,CC1Ee,SAASkS,GAAWhb,EAASF,EAAKuS,EAAeC,EAAQX,EAAW1E,GACjF,IAAI+L,EAAgBlZ,EAAIC,eAAeC,GACnCwZ,EAAQD,GAAWP,EAAe3G,EAAeC,EAAQX,EAAW1E,GAIpE4M,EAAaD,GAAqBZ,ICVzB,SAAkDQ,GAC/D,IAAIyB,EAAa,SAAoBpY,EAAG5B,GACtC,OAAO4B,EAAI5B,CACf,EACMia,EAAU1B,EAAMpF,KAAI,SAAUsF,GAChC,OAAOA,EAAKf,GAChB,IAAKwC,KAAKF,GACJG,EAAU5B,EAAMpF,KAAI,SAAUsF,GAChC,OAAOA,EAAKhB,MAChB,IAAKyC,KAAKF,GACJI,EAASH,EAAQ,GACjBI,EAASJ,EAAQA,EAAQnZ,OAAS,GAGtC,MAAO,CAAC,CACN4W,IAAK0C,EACL3C,OAJW0C,EAAQ,IAKlB,CACDzC,IAAK2C,EACL5C,OANW0C,EAAQA,EAAQrZ,OAAS,IAQxC,CDX0DwZ,CAAyC/B,GACjG,OAAOgC,GAA0BhC,EAAOK,EAC1C,CEZA,SAAS1J,GAAgClN,EAAGmN,GAAkB,IAAIC,EAAuB,oBAAXC,QAA0BrN,EAAEqN,OAAOC,WAAatN,EAAE,cAAe,GAAIoN,EAAI,OAAQA,EAAKA,EAAGG,KAAKvN,IAAIwN,KAAKC,KAAKL,GAAK,GAAIM,MAAMC,QAAQ3N,KAAOoN,EACxN,SAAqCpN,EAAG4N,GAAU,IAAK5N,EAAG,OAAQ,GAAiB,iBAANA,EAAgB,OAAO6N,GAAkB7N,EAAG4N,GAAS,IAAIvL,EAAI8I,OAAOvG,UAAUT,SAASoJ,KAAKvN,GAAGqE,MAAM,GAAI,GAAc,WAANhC,GAAkBrC,EAAEqG,cAAahE,EAAIrC,EAAEqG,YAAYmD,MAAM,GAAU,QAANnH,GAAqB,QAANA,EAAa,OAAOqL,MAAMI,KAAK9N,GAAI,GAAU,cAANqC,GAAqB,2CAA2C0L,KAAK1L,GAAI,OAAOwL,GAAkB7N,EAAG4N,EAAU,CADnMI,CAA4BhO,KAAOmN,GAAkBnN,GAAyB,iBAAbA,EAAElB,OAAqB,CAAMsO,IAAIpN,EAAIoN,GAAI,IAAInP,EAAI,EAAG,OAAO,WAAc,OAAIA,GAAK+B,EAAElB,OAAe,CAAEmP,MAAM,GAAe,CAAEA,MAAM,EAAOrB,MAAO5M,EAAE/B,KAAO,CAAK,CAAC,MAAM,IAAIiQ,UAAU,wIAA2I,CAE5lB,SAASL,GAAkBM,EAAKC,IAAkB,MAAPA,GAAeA,EAAMD,EAAIrP,UAAQsP,EAAMD,EAAIrP,QAAQ,IAAK,IAAIb,EAAI,EAAGoQ,EAAO,IAAIX,MAAMU,GAAMnQ,EAAImQ,EAAKnQ,IAAKoQ,EAAKpQ,GAAKkQ,EAAIlQ,GAAI,OAAOoQ,CAAO,CAiBpK,SAASmK,GAAyBC,EAAU5b,GA6BzD,IA5BA,IAAImN,EAAUE,UAAUpL,OAAS,QAAsBqL,IAAjBD,UAAU,GAAmBA,UAAU,GAAK,CAAA,EAC9EwO,EAAiB,SAAwBlJ,GAC3C,IAAKiJ,EAASjJ,GACZ,MAAM,IAAI7O,MAAM,IAAK6S,OAAOhE,EAAU,wDAExC,OAAOiJ,EAASjJ,EACpB,EAKML,EAAYD,GAAewJ,EAAe,8BAA+B7b,GAGzEuS,EAAgBD,EAAUC,cCjCjB,SAA4BrS,EAASF,GAClD,OAAKE,EAGE8P,GAAiBhQ,EAAIC,eAAeC,IAFlC,EAGX,CD4BgD4b,CAAmBD,EAAevJ,EAAUC,eAAgBvS,GAAO,GAG7GwS,EAASF,EAAUE,OAAS0B,GAAY2H,EAAevJ,EAAUE,QAASxS,GAAO,GACjF+b,EAAwBtK,GAAqBoK,EAAe,mBAAoB7b,GAClFgS,EAAS+J,EAAsB/J,OAC/BH,EAAYkK,EAAsBlK,UAChCmK,EAAiB7O,EAAQ6E,QAAU7E,EAAQ6E,OAAOsC,KAAI,SAAUnC,GAClE,OAoBJ,SAAoBA,EAAOH,GACzB,GAAqB,iBAAVG,EAAoB,CAC7B,IAAK,IAAyDT,EAArDO,EAAY5B,GAAgC2B,KAAkBN,EAAQO,KAAab,MAAO,CACjG,IAAI6K,EAASvK,EAAM3B,MACnB,GAAIkM,EAAOtP,OAASwF,EAClB,OAAO8J,EAAO7J,UAEjB,CACD,MAAM,IAAItO,MAAM,UAAW6S,OAAOxE,EAAO,mCAAoCwE,OAAO3E,EAAOsC,KAAI,SAAUlH,GACvG,IAAIT,EAAOS,EAAKT,KAChB,MAAO,IAAKgK,OAAOhK,EAAM,IAC1B,IAAEuP,KAAK,OACZ,CACI,GAAI/J,GAASH,EAAO/P,OAClB,OAAO+P,EAAOG,EAAQ,GAAGC,WAE3B,MAAM,IAAItO,MAAM,+BAA+B6S,OAAOxE,EAAO,8BAA8BwE,OAAO3E,EAAO/P,QAE7G,CAtCWka,CAAWhK,EAAOH,EAC7B,IAIMoK,EAAa,GACRhO,EAAK,EAAGC,EAAeC,OAAOC,KAAK+D,EAAUN,QAAS5D,EAAKC,EAAapM,OAAQmM,IAAM,CAC7F,IAAIiO,EAAUhO,EAAaD,GACvB4N,IAAmBA,EAAeM,SAASD,IAG/CD,EAAW7S,KAAK,CACd4I,MAAOoK,GAAiBF,EAASrK,GACjChJ,KAAMkS,GAAWW,EAAevJ,EAAUN,OAAOqK,IAAWrc,EAAKuS,EAAeC,EAAQX,EAAW1E,IAEtG,CAGD,OAAOiP,CACT,CAoBA,SAASG,GAAiBF,EAASrK,GACjC,IAAK,IAA0DwK,EAAtDC,EAAapM,GAAgC2B,KAAmBwK,EAASC,KAAcrL,MAAO,CACrG,IAAIe,EAAQqK,EAAOzM,MACnB,GAAIoC,EAAMC,aAAeiK,EACvB,OAAOlK,EAAMxF,IAEhB,CACD,MAAM,IAAI7I,MAAM,uBAAuB6S,OAAO0F,GAChD,QE/Ee,SAAsBnP,EAAOC,GAC1C,OrBIa,SAAwBD,GACrC,OAAIA,aAAiBwP,MAAQxP,aAAiBpE,KACrCoE,EAAM0B,cAAcC,KAAKF,GAE3Bd,QAAQC,QAAQZ,GAAO2B,KAAKF,EACrC,CqBTSgO,CAAezP,GAAO2B,MAAK,SAAU+M,GAC1C,OAAOD,GAAyBC,EAAU5b,EAAKmN,EACnD,GACA"}
+{"version":3,"file":"read-excel-file.min.js","sources":["../modules/xml/xmlBrowser.js","../node_modules/fflate/esm/browser.js","../modules/zip/unzipFromArrayBuffer.js","../modules/export/convertValuesFromUint8ArraysToStrings.js","../modules/export/filterZipArchiveEntry.js","../modules/export/unpackXlsxFileBrowser.js","../modules/xml/dom.js","../modules/xml/xlsx.js","../modules/xlsx/parseSpreadsheetInfo.js","../modules/xlsx/parseFilePaths.js","../modules/xlsx/parseStyles.js","../modules/xlsx/parseExcelDate.js","../modules/xlsx/isDateFormat.js","../modules/xlsx/isDateFormatStyle.js","../modules/xlsx/parseCellValue.js","../modules/xlsx/parseCellCoordinates.js","../modules/xlsx/parseCell.js","../modules/xlsx/parseCells.js","../modules/xlsx/parseSheetDimensions.js","../modules/xlsx/dropEmptyRows.js","../modules/xlsx/dropEmptyColumns.js","../modules/xlsx/convertCellsToData2dArray.js","../modules/xlsx/parseSheet.js","../modules/xlsx/reconstructSheetDimensionsFromSheetCells.js","../modules/xlsx/parseSpreadsheetContents.js","../modules/xlsx/parseSharedStrings.js","../modules/export/readXlsxFileBrowser.js"],"sourcesContent":["export default {\n  createDocument: function createDocument(content) {\n    // if (!content) {\n    // \tthrow new Error('No *.xml content')\n    // }\n    // A weird bug: it won't parse XML unless it's trimmed.\n    // https://github.com/catamphetamine/read-excel-file/issues/21\n    return new DOMParser().parseFromString(content.trim(), 'text/xml');\n  }\n};\n//# sourceMappingURL=xmlBrowser.js.map","// 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","// `fflate` readme is too complicated:\n// https://github.com/101arrowz/fflate/issues/251\n// I just used whatever approach seemed to work.\n//\n// It was a choice between \"syncrhonous\" (blocking) unzip via `unzipSync()`\n// and \"asynchronous\" (non-blocking) unzip via `unzip()`.\n//\n// In the readme they say that using \"asynchronous\" API  will cause the compression or decompression\n// run in a separate thread by using Web (or Node) Workers, so it won't block the main thread.\n// Yet, they also say that there is an initial overhead to using workers of about 50ms for each\n// asynchronous function. For small (under about 50kB) payloads, they say that the \"asynchronous\" API\n// will be much slower compared to the \"synchronous\" one. However, when compressing larger files\n// or multiple files at once, the \"synchronous\" API causes the main thread to hang for too long,\n// and the \"asynchronous\" API is an order of magnitude better.\n//\nimport { unzip } from 'fflate';\n\n/**\r\n * Reads `*.zip` file contents. Ignores anything besides `.xml` or `.xml.rels` files.\r\n * @param  {ArrayBuffer} input\r\n * @return {Promise<Record<string,Uint8Array>>} Resolves to an object holding `*.zip` file entries.\r\n */\nexport default function unzipFromArrayBuffer(input, options) {\n  return unzipFromArrayBufferUsingFunction(input, options, unzipAsync, true);\n}\n\n/**\r\n * Reads `*.zip` file contents. Ignores anything besides `.xml` or `.xml.rels` files.\r\n * @param  {ArrayBuffer} input\r\n * @param  {(ArrayBuffer) => Record<string, Uint8Array> | Promise<Record<string, Uint8Array>>} unzip\r\n * @param  {boolean} isAsync — Should be `true` when `unzip()` returns a `Promise`, `false` otherwise.\r\n * @return {Promise<Record<string,Uint8Array>>|Record<string,Uint8Array>} Resolves to an object holding `*.zip` file entries.\r\n */\nexport function unzipFromArrayBufferUsingFunction(input) {\n  var _ref = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {},\n    _filter = _ref.filter;\n  var unzip = arguments.length > 2 ? arguments[2] : undefined;\n  var isAsync = arguments.length > 3 ? arguments[3] : undefined;\n  // Read the `.zip` archive.\n  // `result` is either `object` or `Promise<object>`\n  return unzip(new Uint8Array(input), {\n    // Ignore certain types of files.\n    filter: function filter(file) {\n      if (_filter) {\n        return _filter({\n          path: file.name\n        });\n      }\n      return true;\n    }\n  });\n}\nfunction unzipAsync(archive) {\n  return new Promise(function (resolve, reject) {\n    // `unzip()` will resort to \"synchronous\" decompression in two edge cases:\n    // * When the archive size is less than `512KB`.\n    // * When the data is barely compressed, i.e. the compression ratio is less than 20% reduction in size.\n    unzip(archive, function (error, files) {\n      if (error) {\n        reject(error);\n      } else {\n        resolve(files);\n      }\n    });\n  });\n}\n//# sourceMappingURL=unzipFromArrayBuffer.js.map","import { strFromU8 } from 'fflate';\n\n/**\r\n * @param {Record<string,Uint8Array} entries\r\n * @returns {Record<string,string>}\r\n */\nexport default function convertValuesFromUint8ArraysToStrings(entries) {\n  var convertedEntries = {};\n  for (var _i = 0, _Object$keys = Object.keys(entries); _i < _Object$keys.length; _i++) {\n    var key = _Object$keys[_i];\n    convertedEntries[key] = strFromU8(entries[key]);\n  }\n  return convertedEntries;\n}\n//# sourceMappingURL=convertValuesFromUint8ArraysToStrings.js.map","// An `.xlsx` `.zip` archive could contain all kinds of files,\n// such as `.bin` printer settings or `.png` images, etc.\n//\n// Because `read-excel-file` doesn't support returning any of those types of data,\n// there's no need to read those files from the `.xlsx` `.zip` archive,\n// optimizing the unpacking process a little bit.\n//\nexport default function filterZipArchiveEntry(_ref) {\n  var path = _ref.path;\n  return path.endsWith('.xml') || path.endsWith('.xml.rels');\n}\n//# sourceMappingURL=filterZipArchiveEntry.js.map","// Uses an \"async\" function of the unzipper function\n// just because it feels more correct to use it over the \"sync\" one\n// because it isn't supposed to ever freeze the \"main thread\" (GUI).\n//\n// import unzipFromArrayBufferSync from '../zip/unzipFromArrayBufferSync.js'\nimport unzipFromArrayBuffer from '../zip/unzipFromArrayBuffer.js';\nimport convertValuesFromUint8ArraysToStrings from './convertValuesFromUint8ArraysToStrings.js';\nimport filterZipArchiveEntry from './filterZipArchiveEntry.js';\n\n/**\r\n * Unpacks `*.xlsx` file contents.\r\n * An `.xlsx` file is really just a `.zip` archive with `.xml` files inside.\r\n * @param  {(File|Blob|ArrayBuffer)} input\r\n * @return {Promise<Record<string,string>} Resolves to an object holding `*.xlsx` file entries.\r\n */\nexport default function unpackXlsxFile(input) {\n  if (input instanceof File || input instanceof Blob) {\n    return input.arrayBuffer().then(getResultFromArrayBuffer);\n  }\n  return Promise.resolve(input).then(getResultFromArrayBuffer);\n}\nfunction getResultFromArrayBuffer(arrayBuffer) {\n  return unzipFromArrayBuffer(arrayBuffer, {\n    filter: filterZipArchiveEntry\n  }).then(convertValuesFromUint8ArraysToStrings);\n}\n\n// function getResultFromArrayBufferSync(arrayBuffer) {\n//  const result = unzipFromArrayBufferSync(arrayBuffer, { filter: filterZipArchiveEntry })\n// \treturn convertValuesFromUint8ArraysToStrings(result)\n// }\n//# sourceMappingURL=unpackXlsxFileBrowser.js.map","export function findChild(node, tagName) {\n  var i = 0;\n  while (i < node.childNodes.length) {\n    var childNode = node.childNodes[i];\n    // `nodeType: 1` means \"Element\".\n    // https://www.w3schools.com/xml/prop_element_nodetype.asp\n    if (childNode.nodeType === 1 && getTagName(childNode) === tagName) {\n      return childNode;\n    }\n    i++;\n  }\n}\nexport function findChildren(node, tagName) {\n  var results = [];\n  var i = 0;\n  while (i < node.childNodes.length) {\n    var childNode = node.childNodes[i];\n    // `nodeType: 1` means \"Element\".\n    // https://www.w3schools.com/xml/prop_element_nodetype.asp\n    if (childNode.nodeType === 1 && getTagName(childNode) === tagName) {\n      results.push(childNode);\n    }\n    i++;\n  }\n  return results;\n}\nexport function forEach(node, tagName, func) {\n  // if (typeof tagName === 'function') {\n  // \tfunc = tagName\n  // \ttagName = undefined\n  // }\n  var i = 0;\n  while (i < node.childNodes.length) {\n    var childNode = node.childNodes[i];\n    if (tagName) {\n      // `nodeType: 1` means \"Element\".\n      // https://www.w3schools.com/xml/prop_element_nodetype.asp\n      if (childNode.nodeType === 1 && getTagName(childNode) === tagName) {\n        func(childNode, i);\n      }\n    } else {\n      func(childNode, i);\n    }\n    i++;\n  }\n}\nexport function map(node, tagName, func) {\n  var results = [];\n  forEach(node, tagName, function (node, i) {\n    results.push(func(node, i));\n  });\n  return results;\n}\nvar NAMESPACE_REG_EXP = /.+\\:/;\nexport function getTagName(element) {\n  // For some weird reason, if an element is declared as,\n  // for example, `<x:sheets/>`, then its `.tagName` will be\n  // \"x:sheets\" instead of just \"sheets\".\n  // https://gitlab.com/catamphetamine/read-excel-file/-/issues/25\n  // Its not clear how to tell it to ignore any namespaces\n  // when getting `.tagName`, so just replacing anything\n  // before a colon, if any.\n  return element.tagName.replace(NAMESPACE_REG_EXP, '');\n}\nexport function isElement(node) {\n  // `nodeType: 1` means \"Element\".\n  // https://www.w3schools.com/xml/prop_element_nodetype.asp\n  return node.nodeType === 1;\n}\nexport function getFirstElementChild(element) {\n  var i = 0;\n  while (i < element.childNodes.length) {\n    if (isElement(element.childNodes[i])) {\n      return element.childNodes[i];\n    }\n    i++;\n  }\n}\n\n// This function is only used for occasional debug messages.\nexport function getOuterXml(node) {\n  // `nodeType: 1` means \"Element\".\n  // https://www.w3schools.com/xml/prop_element_nodetype.asp\n  if (node.nodeType !== 1) {\n    return node.textContent;\n  }\n  var xml = '<' + getTagName(node);\n  var j = 0;\n  while (j < node.attributes.length) {\n    xml += ' ' + node.attributes[j].name + '=' + '\"' + node.attributes[j].value + '\"';\n    j++;\n  }\n  xml += '>';\n  var i = 0;\n  while (i < node.childNodes.length) {\n    xml += getOuterXml(node.childNodes[i]);\n    i++;\n  }\n  xml += '</' + getTagName(node) + '>';\n  return xml;\n}\n//# sourceMappingURL=dom.js.map","import { findChild, findChildren, forEach, map, getFirstElementChild, getTagName } from './dom.js';\n\n// Returns an array of cells,\n// each element being an XML DOM element representing a cell.\nexport function getCellElements(document) {\n  var worksheet = document.documentElement;\n  var sheetData = findChild(worksheet, 'sheetData');\n  var cells = [];\n  forEach(sheetData, 'row', function (row) {\n    forEach(row, 'c', function (cell) {\n      cells.push(cell);\n    });\n  });\n  return cells;\n}\nexport function getMergedCellCoordinates(document) {\n  var worksheet = document.documentElement;\n  var mergedCells = findChild(worksheet, 'mergeCells');\n  var mergedCellsInfo = [];\n  if (mergedCells) {\n    forEach(mergedCells, 'mergeCell', function (mergedCell) {\n      mergedCellsInfo.push(mergedCell.getAttribute('ref'));\n    });\n  }\n  return mergedCellsInfo;\n}\nexport function getCellValueElement(document, element) {\n  return findChild(element, 'v');\n}\nexport function getCellInlineStringValue(document, element) {\n  // It seems as if in some weirdly-output \"*.xlsx\" files\n  // there're non-element nodes of some weird nature.\n  // https://gitlab.com/catamphetamine/read-excel-file/-/issues/109\n  // This code filters out such weird non-element nodes.\n  var firstElementChild = getFirstElementChild(element);\n  if (firstElementChild && getTagName(firstElementChild) === 'is') {\n    var firstElementChildFirstElementChild = getFirstElementChild(firstElementChild);\n    if (firstElementChildFirstElementChild && getTagName(firstElementChildFirstElementChild) === 't') {\n      return firstElementChildFirstElementChild.textContent;\n    }\n  }\n}\nexport function getDimensions(document) {\n  var worksheet = document.documentElement;\n  var dimensions = findChild(worksheet, 'dimension');\n  if (dimensions) {\n    return dimensions.getAttribute('ref');\n  }\n}\nexport function getBaseStyles(document) {\n  var styleSheet = document.documentElement;\n  var cellStyleXfs = findChild(styleSheet, 'cellStyleXfs');\n  if (cellStyleXfs) {\n    return findChildren(cellStyleXfs, 'xf');\n  }\n  return [];\n}\nexport function getCellStyles(document) {\n  var styleSheet = document.documentElement;\n  var cellXfs = findChild(styleSheet, 'cellXfs');\n  if (!cellXfs) {\n    return [];\n  }\n  return findChildren(cellXfs, 'xf');\n}\nexport function getNumberFormats(document) {\n  var styleSheet = document.documentElement;\n  var numberFormats = [];\n  var numFmts = findChild(styleSheet, 'numFmts');\n  if (numFmts) {\n    return findChildren(numFmts, 'numFmt');\n  }\n  return [];\n}\nexport function getSharedStrings(document) {\n  // An `<si/>` element can contain a `<t/>` (simplest case) or a set of `<r/>` (\"rich formatting\") elements having `<t/>`.\n  // https://docs.microsoft.com/en-us/dotnet/api/documentformat.openxml.spreadsheet.sharedstringitem?redirectedfrom=MSDN&view=openxml-2.8.1\n  // http://www.datypic.com/sc/ooxml/e-ssml_si-1.html\n\n  var sst = document.documentElement;\n  return map(sst, 'si', function (string) {\n    var t = findChild(string, 't');\n    if (t) {\n      return t.textContent;\n    }\n    var value = '';\n    forEach(string, 'r', function (r) {\n      value += findChild(r, 't').textContent;\n    });\n    return value;\n  });\n}\nexport function getWorkbookProperties(document) {\n  var workbook = document.documentElement;\n  return findChild(workbook, 'workbookPr');\n}\nexport function getRelationships(document) {\n  var relationships = document.documentElement;\n  return findChildren(relationships, 'Relationship');\n}\nexport function getSheets(document) {\n  var workbook = document.documentElement;\n  var sheets = findChild(workbook, 'sheets');\n  return findChildren(sheets, 'sheet');\n}\n//# sourceMappingURL=xlsx.js.map","function _createForOfIteratorHelperLoose(o, allowArrayLike) { var it = typeof Symbol !== \"undefined\" && o[Symbol.iterator] || o[\"@@iterator\"]; if (it) return (it = it.call(o)).next.bind(it); if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === \"number\") { if (it) o = it; var i = 0; return function () { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }; } throw new TypeError(\"Invalid attempt to iterate non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\"); }\nfunction _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === \"string\") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === \"Object\" && o.constructor) n = o.constructor.name; if (n === \"Map\" || n === \"Set\") return Array.from(o); if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }\nfunction _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i]; return arr2; }\nimport { getWorkbookProperties, getSheets } from '../xml/xlsx.js';\n\n// I guess `xl/workbook.xml` file should always be present inside the *.xlsx archive.\nexport default function parseSpreadsheetInfo(content, xml) {\n  var book = xml.createDocument(content);\n\n  // Read `<workbookPr/>` element to detect whether dates are 1900-based or 1904-based.\n  // https://support.microsoft.com/en-gb/help/214330/differences-between-the-1900-and-the-1904-date-system-in-excel\n  // http://webapp.docx4java.org/OnlineDemo/ecma376/SpreadsheetML/workbookPr.html\n  var workbookProperties = getWorkbookProperties(book);\n  var epoch1904 = Boolean(workbookProperties) && workbookProperties.getAttribute('date1904') === '1';\n\n  // Example of `<sheets/>` element:\n  //\n  // <sheets>\n  //   <sheet\n  //     xmlns:ns=\"http://schemas.openxmlformats.org/officeDocument/2006/relationships\"\n  //     name=\"Sheet1\"\n  //     sheetId=\"1\"\n  //     ns:id=\"rId3\"/>\n  // </sheets>\n\n  var sheets = [];\n  for (var _iterator = _createForOfIteratorHelperLoose(getSheets(book)), _step; !(_step = _iterator()).done;) {\n    var sheet = _step.value;\n    if (sheet.getAttribute('name')) {\n      sheets.push({\n        id: sheet.getAttribute('sheetId'),\n        name: sheet.getAttribute('name'),\n        relationId: sheet.getAttribute('r:id')\n      });\n    }\n  }\n  return {\n    epoch1904: epoch1904,\n    sheets: sheets\n  };\n}\n//# sourceMappingURL=parseSpreadsheetInfo.js.map","import { getRelationships } from '../xml/xlsx.js';\n\n/**\r\n * Returns sheet file paths.\r\n * Seems that the correct place to look for the `sheetId` -> `filename` mapping\r\n * is `xl/_rels/workbook.xml.rels` file.\r\n * https://github.com/tidyverse/readxl/issues/104\r\n * @param  {string} content — `xl/_rels/workbook.xml.rels` file contents.\r\n * @param  {object} xml\r\n * @return {object}\r\n */\nexport default function parseFilePaths(content, xml) {\n  // Example:\n  // <Relationships xmlns=\"http://schemas.openxmlformats.org/package/2006/relationships\">\n  //   ...\n  //   <Relationship\n  //     Id=\"rId3\"\n  //     Type=\"http://schemas.openxmlformats.org/officeDocument/2006/relationships/worksheet\"\n  //     Target=\"worksheets/sheet1.xml\"/>\n  // </Relationships>\n  var document = xml.createDocument(content);\n  var filePaths = {\n    sheets: {},\n    sharedStrings: undefined,\n    styles: undefined\n  };\n  var addFilePathInfo = function addFilePathInfo(relationship) {\n    var filePath = relationship.getAttribute('Target');\n    var fileType = relationship.getAttribute('Type');\n    switch (fileType) {\n      case 'http://schemas.openxmlformats.org/officeDocument/2006/relationships/styles':\n        filePaths.styles = getFilePath(filePath);\n        break;\n      case 'http://schemas.openxmlformats.org/officeDocument/2006/relationships/sharedStrings':\n        filePaths.sharedStrings = getFilePath(filePath);\n        break;\n      case 'http://schemas.openxmlformats.org/officeDocument/2006/relationships/worksheet':\n        filePaths.sheets[relationship.getAttribute('Id')] = getFilePath(filePath);\n        break;\n    }\n  };\n  getRelationships(document).forEach(addFilePathInfo);\n\n  // Seems like \"sharedStrings.xml\" is not required to exist.\n  // For example, when the spreadsheet doesn't contain any strings.\n  // https://github.com/catamphetamine/read-excel-file/issues/85\n  // if (!filePaths.sharedStrings) {\n  //   throw new Error('\"sharedStrings.xml\" file not found in the *.xlsx file')\n  // }\n\n  return filePaths;\n}\nfunction getFilePath(path) {\n  // Normally, `path` is a relative path inside the ZIP archive,\n  // like \"worksheets/sheet1.xml\", or \"sharedStrings.xml\", or \"styles.xml\".\n  // There has been one weird case when file path was an absolute path,\n  // like \"/xl/worksheets/sheet1.xml\" (specifically for sheets):\n  // https://github.com/catamphetamine/read-excel-file/pull/95\n  // Other libraries (like `xlsx`) and software (like Google Docs)\n  // seem to support such absolute file paths, so this library does too.\n  if (path[0] === '/') {\n    return path.slice('/'.length);\n  }\n  // // Seems like a path could also be a URL.\n  // // http://officeopenxml.com/anatomyofOOXML-xlsx.php\n  // if (/^[a-z]+\\:\\/\\//.test(path)) {\n  //   return path\n  // }\n  return 'xl/' + path;\n}\n//# sourceMappingURL=parseFilePaths.js.map","function _typeof(o) { \"@babel/helpers - typeof\"; return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (o) { return typeof o; } : function (o) { return o && \"function\" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? \"symbol\" : typeof o; }, _typeof(o); }\nfunction ownKeys(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }\nfunction _objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }\nfunction _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\nfunction _toPropertyKey(arg) { var key = _toPrimitive(arg, \"string\"); return _typeof(key) === \"symbol\" ? key : String(key); }\nfunction _toPrimitive(input, hint) { if (_typeof(input) !== \"object\" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || \"default\"); if (_typeof(res) !== \"object\") return res; throw new TypeError(\"@@toPrimitive must return a primitive value.\"); } return (hint === \"string\" ? String : Number)(input); }\nimport { getBaseStyles, getCellStyles, getNumberFormats } from '../xml/xlsx.js';\n\n// http://officeopenxml.com/SSstyles.php\n// Returns an array of cell styles.\n// A cell style index is its ID.\nexport default function parseStyles(content, xml) {\n  if (!content) {\n    return {};\n  }\n\n  // https://social.msdn.microsoft.com/Forums/sqlserver/en-US/708978af-b598-45c4-a598-d3518a5a09f0/howwhen-is-cellstylexfs-vs-cellxfs-applied-to-a-cell?forum=os_binaryfile\n  // https://www.office-forums.com/threads/cellxfs-cellstylexfs.2163519/\n  var doc = xml.createDocument(content);\n  var baseStyles = getBaseStyles(doc).map(parseCellStyle);\n  var numberFormats = getNumberFormats(doc).map(parseNumberFormatStyle).reduce(function (formats, format) {\n    // Format ID is a numeric index.\n    // There're some standard \"built-in\" formats (in Excel) up to about `100`.\n    formats[format.id] = format;\n    return formats;\n  }, []);\n  var getCellStyle = function getCellStyle(xf) {\n    if (xf.hasAttribute('xfId')) {\n      return _objectSpread(_objectSpread({}, baseStyles[xf.xfId]), parseCellStyle(xf, numberFormats));\n    }\n    return parseCellStyle(xf, numberFormats);\n  };\n  return getCellStyles(doc).map(getCellStyle);\n}\nfunction parseNumberFormatStyle(numFmt) {\n  return {\n    id: numFmt.getAttribute('numFmtId'),\n    template: numFmt.getAttribute('formatCode')\n  };\n}\n\n// http://www.datypic.com/sc/ooxml/e-ssml_xf-2.html\nfunction parseCellStyle(xf, numFmts) {\n  var style = {};\n  if (xf.hasAttribute('numFmtId')) {\n    var numberFormatId = xf.getAttribute('numFmtId');\n    // Built-in number formats don't have a `<numFmt/>` element in `styles.xml`.\n    // https://hexdocs.pm/xlsxir/number_styles.html\n    if (numFmts[numberFormatId]) {\n      style.numberFormat = numFmts[numberFormatId];\n    } else {\n      style.numberFormat = {\n        id: numberFormatId\n      };\n    }\n  }\n  return style;\n}\n//# sourceMappingURL=parseStyles.js.map","// Parses an Excel Date (represented by a \"serial\" floating-point number)\n// into a javascript `Date` in UTC+0 timezone (with time is set to 00:00).\n//\n// https://www.pcworld.com/article/3063622/software/mastering-excel-date-time-serial-numbers-networkdays-datevalue-and-more.html\n// \"If you need to calculate dates in your spreadsheets,\n//  Excel uses its own unique system, which it calls Serial Numbers\".\n//\nexport default function parseExcelDate(excelSerialDate, options) {\n  // Windows operating system uses floating-point numbers to represent dates,\n  // where the number represents the count of days elapsed since January 0th, 1900.\n  //\n  // This also means that there're 2 aspects associated with this choice:\n  //\n  // * January 1st, 1900, 00:00 is represented by `1` rather than `0`, which looks a bit weird.\n  // * 1900 is a special year because it's a \"one in a 100 years\" occasion when it's not a leap year.\n  //\n  // To work around those two aspects, Mac OS chose another baseline — January 1st, 1900.\n  // Although, that only postponed the second issue because 2100 is going to be the next \"speciaL\" year\n  // which is not going to be a \"leap\" one.\n  //\n  // Older versions of Excel on Mac OS used year 1904 as the default baseline for numeric dates.\n  // Since 2011, Microsoft Excel on Mac OS uses year 1900 as the default baseline for cross-platform consistency.\n  // https://support.microsoft.com/en-us/office/date-systems-in-excel-e7fe7167-48a9-4b96-bb53-5612a800b487\n  //\n  // So the 1904 baseline is now deprecated, although still available to be configured manually.\n  // So it still might be encountered in Excel files created on MacOS.\n  // In that case, the Excel file contains a special flag — `<workbook><workbookPr date1904=\"1\"/>...` —\n  // that tells the application which baseline is being used for numeric date timestamps.\n  //\n  if (options && options.epoch1904) {\n    // Convert the numeric date timestamp from 1904 baseline to 1900 baseline.\n    excelSerialDate += (1904 - 1900) * DAYS_IN_YEAR + JANUARY_0TH_1900_DAY + ERRONEOUS_FEBRUARY_29_1990_DAY;\n  }\n  var daysBeforeUnixEpoch = JANUARY_0TH_1900_DAY + ERRONEOUS_FEBRUARY_29_1990_DAY + (1970 - 1900) * DAYS_IN_YEAR + NUMBER_OF_LEAP_YEARS_BETWEEN_1900_AND_1970;\n  return new Date(Math.floor((excelSerialDate - daysBeforeUnixEpoch) * DAY));\n}\n\n// \"Excel serial date\" is just a (fractional) count of days passed since `00/01/1900`.\n//\n// In contrast, \"Unix timestamps\" use `01/01/1970` as the baseline for numeric dates.\n//\n// In order to convert one into another, it should calculate the count of days elapsed\n// since `00/01/1900` (Excel epoch) till `01/01/1970` (Unix epoch), or the count of days\n// between year `1900` and year `1970`, plus one day.\n//\n// It also should account for the number of \"leap years\" between year `1900` and year `1970`,\n// which is 17 of them. https://kalender-365.de/leap-years.php\n//\n// \"One year has the length of 365 days, 5 hours, 48 minutes and 45 seconds.\n//  These are 365.2421875 days. This is hard to calculate with, so for practical reasons\n//  a normal year has been given 365 days and a leap year 366 days. In leap years,\n//  February 29th is added as leap day, which doesn't exist in a normal year.\n//  A leap year is every 4 years, but not every 100 years, then again every 400 years.\n//  So the year 1900 wasn't a leap year, but 2000 was\".\n//\n// And also, Excel has a historical bug when it incorrectly assumes year `1900` to be a leap year,\n// and, as a result, all Excel serial dates starting from March 1st, 1900 lag 1 day behind\n// and require an additional 1 day to be added to them in order to be converted to a proper timestamp.\n//\n// https://learn.microsoft.com/en-us/answers/questions/5249322/why-does-microsoft-excel-considers-29-02-1900-to-b?forum=msoffice-all&referrer=answers#:~:text=This%20made%20it%20easier%20for,other%20programs%20that%20use%20dates.\n//\n// \"When Lotus 1-2-3 was first released, the program assumed that the year 1900 was a leap year,\n//  even though it actually was not a leap year. This made it easier for the program to handle\n//  leap years and caused no harm to almost all date calculations in Lotus 1-2-3.\n//\n//  When Microsoft Multiplan and Microsoft Excel were released, they also assumed that 1900\n//  was a leap year. This assumption allowed Microsoft Multiplan and Microsoft Excel to use\n//  the same serial date system used by Lotus 1-2-3 and provide greater compatibility with Lotus 1-2-3.\n//  Treating 1900 as a leap year also made it easier for users to move worksheets from one program\n//  to the other\".\n//\n// So the historical bug is basically that Excel thinks that February 29th, 1900 existed\n// while in reality it didn't. That's why it's actually 1 day off for any date after that one.\n//\nvar NUMBER_OF_LEAP_YEARS_BETWEEN_1900_AND_1970 = 17;\nvar JANUARY_0TH_1900_DAY = 1;\nvar ERRONEOUS_FEBRUARY_29_1990_DAY = 1;\n\n// An approximate count of seconds in a day is:\n// 24 hours * 60 minutes in an hour * 60 seconds in a minute\n//\n// It is approximate because a minute could be longer than 60 seconds, due to \"leap seconds\".\n//\n// Still, javascript `Date`, and UNIX time in general, intentionally\n// drop the concept of \"leap seconds\" in order to make things simpler.\n// So this approximation is valid and doesn't result in any bugs.\n// https://stackoverflow.com/questions/53019726/where-are-the-leap-seconds-in-javascript\n//\n// \"The JavaScript Date object specifically adheres to the concept of Unix Time\n//  (albeit with higher precision). This is part of the POSIX specification,\n//  and thus is sometimes called \"POSIX Time\". It does not count leap seconds,\n//  but rather assumes every day had exactly 86,400 seconds. You can read about\n//  this in section 20.3.1.1 of the current ECMAScript specification, which states:\n//\n//  \"Time is measured in ECMAScript in milliseconds since 01 January, 1970 UTC.\n//   In time values leap seconds are ignored. It is assumed that there are exactly\n//   86,400,000 milliseconds per day.\"\n//\n// The reason is that the unpredictable nature of leap seconds makes them very\n// difficult to work with in APIs. One can't generally pass timestamps around\n// that need leap seconds tables to be interpreted correctly, and expect that\n// one system will interpret them the same as another. For example, a timestamp\n// `1483228826` that accounts for \"leap seconds\" should've been interpreted as\n// \"2017-01-01T00:00:00Z\", but if the receiver doesn't account for \"leap seconds\",\n// they would interpret it as \"2017-01-01T00:00:26Z\" (e.g. POSIX-based systems like Linux),\n// So \"leap seconds\" aren't really portable.\n// Even on systems that have full frequently-updated \"leap second\" tables,\n// there's no telling what adjustments those tables will contain in the future\n// (i.e. beyond the 6-month IERS announcement period) because \"leap seconds\" can't be\n// determined by a fixed mathematical formula or something like that. Instead,\n// scientists introduce them as needed based on the observed Earth's rotation around the sun.\n//\n// \"Because the Earth's rotational speed varies in response to climatic and geological events,\n//  UTC leap seconds are irregularly spaced and not precisely predictable. The decision to insert\n// a leap second is made by the International Earth Rotation and Reference Systems Service (IERS),\n// typically about six months in advance, to ensure that the difference between UTC and UT1\n// does not exceed ±0.9 seconds.\"\n//\n// One example is year `1900` which is \"every fourth year\" but it still is not a \"leap year\".\n//\n// To reiterate: to support leap seconds in a programming language, the implementation\n// must go out of its way to do so, and must make tradeoffs that are not always acceptable.\n// Though there are exceptions, the general position is to not support them - not because\n// of any subversion or active countermeasures, but because supporting them properly is much,\n// much harder.\n//\n// https://en.wikipedia.org/wiki/Unix_time#Leap_seconds\n// https://en.wikipedia.org/wiki/Leap_year\n// https://en.wikipedia.org/wiki/Leap_second\n//\nvar DAY = 24 * 60 * 60 * 1000;\nvar DAYS_IN_YEAR = 365;\n//# sourceMappingURL=parseExcelDate.js.map","function _createForOfIteratorHelperLoose(o, allowArrayLike) { var it = typeof Symbol !== \"undefined\" && o[Symbol.iterator] || o[\"@@iterator\"]; if (it) return (it = it.call(o)).next.bind(it); if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === \"number\") { if (it) o = it; var i = 0; return function () { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }; } throw new TypeError(\"Invalid attempt to iterate non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\"); }\nfunction _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === \"string\") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === \"Object\" && o.constructor) n = o.constructor.name; if (n === \"Map\" || n === \"Set\") return Array.from(o); if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }\nfunction _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i]; return arr2; }\n// On some date formats, there's a \"[$-...]\" prefix that locks the locale\n// to be a specific one when formatting a date using this format.\n//\n// https://stackoverflow.com/questions/4730152/what-indicates-an-office-open-xml-cell-contains-a-date-time-value\n//\n// Format examples:\n//\n// * \"[$-404]e/m/d\"\n// * \"[$-414]mmmm\\ yyyy;@\"\n// * \"[$-ru-RU]dd.mm.yyyy;@\"\n// * \"[$-x-sysdate]dddd, mmmm dd, yyyy\"\n//\nvar DATE_FORMAT_SPECIFIC_LOCALE_PREFIX = /^\\[\\$-[^\\]]+\\]/;\n\n// On some date formats, there's a \";@\" suffix.\n// It instructs the spreadsheet editor application to display any non-numeric\n// value as is instead of hiding it or something like that.\n//\n// For example, if one inputs \"Some text\" instead of a date in such cell,\n// it will still show \"Some text\" instead of an empty cell, even though\n// the value is strictly-speaking invalid.\n//\n// Specifically, \";\" means \"anything before this applies only to a numeric value,\n// while anything after it applies to a text value\". And a follow-up \"@\" means\n// \"for a text value, just output it as is\".\n//\n// It's not really clear why would anyone add such a feature to a format.\n// Perhaps it feels more \"user-friendly\" towards a non-\"tech-savvy\" user\n// of a spreadsheet editor application.\n//\n// Format examples:\n//\n// * \"m/d/yyyy;@\"\n// * \"[$-414]mmmm\\ yyyy;@\"\n//\nvar DATE_FORMAT_ALLOW_ANY_OTHER_TEXT_SUFFIX = /;@$/;\nvar CACHE = {};\nexport default function isDateFormatCached(template) {\n  if (template in CACHE) {\n    return CACHE[template];\n  }\n  var result = isDateFormat(template);\n  CACHE[template] = result;\n  return result;\n}\nfunction isDateFormat(template) {\n  // Date format tokens could be in upper case or in lower case.\n  // There seems to be no single standard.\n  // So the template is lowercased first.\n  template = template.toLowerCase();\n\n  // On some date formats, there's an \"[$-...]\" prefix.\n  // It forces a specific locale to be used when formatting a date.\n  template = template.replace(DATE_FORMAT_SPECIFIC_LOCALE_PREFIX, '');\n\n  // On some date formats, there's an \";@\" suffix.\n  // It's not clear why would anyone need it in a date format template.\n  // Still, because it occurs there, it should be stripped.\n  template = template.replace(DATE_FORMAT_ALLOW_ANY_OTHER_TEXT_SUFFIX, '');\n\n  // Extract all alphabetic parts from what's left from the template string.\n  // Example: \"mm/dd/yyyy\" → [\"mm\", \"dd\", \"yyyy\"]\n  var tokens = template.split(/\\W+/);\n\n  // If no alphabetic parts are present in what's left from the template string\n  // then it could be any kind of template such as a generic numeric template\n  // such as \"$#,##0.00\" currency template or \"0.0%\" percentage template.\n  if (tokens.length < 0) {\n    return false;\n  }\n  for (var _iterator = _createForOfIteratorHelperLoose(tokens), _step; !(_step = _iterator()).done;) {\n    var token = _step.value;\n    // If a non-date-format-specific alphabetic substring is found,\n    // this might not necessarily be a date format.\n    if (DATE_TEMPLATE_TOKENS.indexOf(token) < 0) {\n      return false;\n    }\n  }\n  return true;\n}\n\n// These tokens could be in upper case or in lower case.\n// There seems to be no single standard, so using lower case.\nvar DATE_TEMPLATE_TOKENS = [\n// Seconds (min two digits). Example: \"05\".\n'ss',\n// Minutes (min two digits). Example: \"05\". Could also be \"Months\". Weird.\n'mm',\n// Hours. Example: \"1\".\n'h',\n// Hours (min two digits). Example: \"01\".\n'hh',\n// \"AM\" part of \"AM/PM\". Lowercased just in case.\n'am',\n// \"PM\" part of \"AM/PM\". Lowercased just in case.\n'pm',\n// Day. Example: \"1\"\n'd',\n// Day (min two digits). Example: \"01\"\n'dd',\n// Month (numeric). Example: \"1\".\n'm',\n// Month (numeric, min two digits). Example: \"01\". Could also be \"Minutes\". Weird.\n'mm',\n// Month (shortened month name). Example: \"Jan\".\n'mmm',\n// Month (full month name). Example: \"January\".\n'mmmm',\n// Two-digit year. Example: \"20\".\n'yy',\n// Full year. Example: \"2020\".\n'yyyy',\n// I don't have any idea what \"e\" means.\n// It's used in \"built-in\" XLSX formats:\n// * 27 '[$-404]e/m/d';\n// * 36 '[$-404]e/m/d';\n// * 50 '[$-404]e/m/d';\n// * 57 '[$-404]e/m/d';\n'e'];\n//# sourceMappingURL=isDateFormat.js.map","// XLSX does have \"d\" type for dates, but it's not commonly used.\n// Instead, it prefers using \"n\" type for storing dates as timestamps.\n//\n// Whether a numeric value is a number or a date timestamp, it sometimes could be\n// detected by looking at the value \"format\" and seeing if it's a date-specific one.\n\nimport isDateFormat from './isDateFormat.js';\nexport default function isDateFormatStyle(styleId, styles, options) {\n  if (styleId) {\n    var style = styles[styleId];\n    if (!style) {\n      throw new Error(\"Cell style not found: \".concat(styleId));\n    }\n    if (!style.numberFormat) {\n      return false;\n    }\n    if (\n    // Whether it's a \"number format\" that's conventionally used for storing date timestamps.\n    BUILT_IN_DATE_FORMAT_IDS.indexOf(Number(style.numberFormat.id)) >= 0 ||\n    // Whether it's a \"number format\" that uses a \"formatting template\"\n    // that the developer is certain is a date formatting template.\n    options.dateFormat && style.numberFormat.template === options.dateFormat ||\n    // Whether the \"smart formatting template\" feature is not disabled\n    // and it has detected that it's a date formatting template by looking at it.\n    options.smartDateParser !== false && style.numberFormat.template && isDateFormat(style.numberFormat.template)) {\n      return true;\n    }\n  }\n}\n\n// Built-in formats have ID < 164.\n// Some of those formats are intended to use when displaying dates.\n//\n// Depending on the \"locale\" used by the spreadsheet viewing application,\n// different built-in format IDs might correspond to different templates.\n// https://learn.microsoft.com/en-us/dotnet/api/documentformat.openxml.spreadsheet.numberingformat?view=openxml-2.8.1\n//\n// Here's a list of \"locale\"-independent built-in format IDs that're known to represent dates.\n//\nvar LOCALE_INDEPENDENT_BUILT_IN_DATE_FORMAT_IDS = [14,\n// mm-dd-yy\n15,\n// d-mmm-yy\n16,\n// d-mmm\n17,\n// mmm-yy\n18,\n// h:mm AM/PM\n19,\n// h:mm:ss AM/PM\n20,\n// h:mm\n21,\n// h:mm:ss\n22,\n// m/d/yy h:mm\n45,\n// mm:ss\n46,\n// [h]:mm:ss\n47 // mmss.0\n];\n\n// \"zh-tw\" OR \"zh-cn\" locales.\n// Language glyphs (aka \"hieroglyphs\") are not replaced with their respective unicode values here.\nvar MAINLAND_CHINESE_OR_TAIWANESE_LOCALE_BUILT_IN_DATE_FORMAT_IDS = [27,\n// [$-404]e/m/d OR yyyy\"年\"m\"月\"\n28,\n// [$-404]e\"年\"m\"月\"d\"日\" OR m\"月\"d\"日\"\n29,\n// [$-404]e\"年\"m\"月\"d\"日\" OR m\"月\"d\"日\"\n30,\n// m/d/yy OR m-d-yy\n31,\n// yyyy\"年\"m\"月\"d\"日\" OR yyyy\"年\"m\"月\"d\"日\"\n32,\n// hh\"時\"mm\"分\" OR h\"时\"mm\"分\"\n33,\n// hh\"時\"mm\"分\"ss\"秒\" OR h\"时\"mm\"分\"ss\"秒\"\n34,\n// 上午/下午hh\"時\"mm\"分\" OR 上午/下午h\"时\"mm\"分\"\n35,\n// 上午/下午hh\"時\"mm\"分\"ss\"秒\" OR 上午/下午h\"时\"mm\"分\"ss\"秒\"\n36,\n// [$-404]e/m/d OR yyyy\"年\"m\"月\"\n50,\n// [$-404]e/m/d OR yyyy\"年\"m\"月\"\n51,\n// [$-404]e\"年\"m\"月\"d\"日\" OR m\"月\"d\"日\"\n52,\n// 上午/下午hh\"時\"mm\"分\" OR yyyy\"年\"m\"月\"\n53,\n// 上午/下午hh\"時\"mm\"分\"ss\"秒\" OR m\"月\"d\"日\"\n54,\n// [$-404]e\"年\"m\"月\"d\"日\" OR m\"月\"d\"日\"\n55,\n// 上午/下午hh\"時\"mm\"分\" OR 上午/下午h\"时\"mm\"分\"\n56,\n// 上午/下午hh\"時\"mm\"分\"ss\"秒\" OR 上午/下午h\"时\"mm\"分\"ss\"秒\"\n57,\n// [$-404]e/m/d OR yyyy\"年\"m\"月\"\n58 // [$-404]e\"年\"m\"月\"d\"日\" OR m\"月\"d\"日\"\n];\n\n// \"ja-jp\" OR \"ko-kr\" locales.\n// Language glyphs (aka \"hieroglyphs\") are not replaced with their respective unicode values here.\nvar JAPANESE_OR_KOREAN_LOCALE_BUILT_IN_DATE_FORMAT_IDS = [27,\n// [$-411]ge.m.d OR yyyy\"年\" mm\"月\" dd\"日\"\n28,\n// [$-411]ggge\"年\"m\"月\"d\"日\" OR mm-dd\n29,\n// [$-411]ggge\"年\"m\"月\"d\"日\" OR mm-dd\n30,\n// m/d/yy OR mm-dd-yy\n31,\n// yyyy\"年\"m\"月\"d\"日\" OR yyyy\"년\" mm\"월\" dd\"일\"\n32,\n// h\"時\"mm\"分\" OR h\"시\" mm\"분\"\n33,\n// h\"時\"mm\"分\"ss\"秒\" OR h\"시\" mm\"분\" ss\"초\"\n34,\n// yyyy\"年\"m\"月\" OR yyyy-mm-dd\n35,\n// m\"月\"d\"日\" OR yyyy-mm-dd\n36,\n// [$-411]ge.m.d OR yyyy\"年\" mm\"月\" dd\"日\"\n50,\n// [$-411]ge.m.d OR yyyy\"年\" mm\"月\" dd\"日\"\n51,\n// [$-411]ggge\"年\"m\"月\"d\"日\" OR mm-dd\n52,\n// yyyy\"年\"m\"月\" OR yyyy-mm-dd\n53,\n// m\"月\"d\"日\" OR yyyy-mm-dd\n54,\n// [$-411]ggge\"年\"m\"月\"d\"日\" OR mm-dd\n55,\n// yyyy\"年\"m\"月\" OR yyyy-mm-dd\n56,\n// m\"月\"d\"日\" OR yyyy-mm-dd\n57,\n// [$-411]ge.m.d OR yyyy\"年\" mm\"月\" dd\"日\"\n58 // [$-411]ggge\"年\"m\"月\"d\"日\" OR mm-dd\n];\n\n// \"th-th\" locale.\n// Language glyphs (aka \"hieroglyphs\") are not replaced with their respective unicode values here.\nvar THAI_LOCALE_BUILT_IN_DATE_FORMAT_IDS = [71,\n// ว/ด/ปปปป\n72,\n// ว-ดดด-ปป\n73,\n// ว-ดดด\n74,\n// ดดด-ปป\n75,\n// ช:นน\n76,\n// ช:นน:ทท\n77,\n// ว/ด/ปปปป ช:นน\n78,\n// นน:ทท\n79,\n// [ช]:นน:ทท\n80,\n// นน:ทท.0\n81 // d/m/bb\n];\n\n// Start with language-agnostic date format IDs.\nvar BUILT_IN_DATE_FORMAT_IDS = LOCALE_INDEPENDENT_BUILT_IN_DATE_FORMAT_IDS.concat(\n// Add Mainland Chinese or Taiwanese date format IDs that haven't already been added.\nMAINLAND_CHINESE_OR_TAIWANESE_LOCALE_BUILT_IN_DATE_FORMAT_IDS).concat(\n// Add Japanese or Korean date format IDs that haven't already been added.\nJAPANESE_OR_KOREAN_LOCALE_BUILT_IN_DATE_FORMAT_IDS.filter(function (numberFormatId) {\n  return MAINLAND_CHINESE_OR_TAIWANESE_LOCALE_BUILT_IN_DATE_FORMAT_IDS.indexOf(numberFormatId) < 0;\n})).concat(\n// Add Thai date format IDs that haven't already been added.\nTHAI_LOCALE_BUILT_IN_DATE_FORMAT_IDS.filter(function (numberFormatId) {\n  return MAINLAND_CHINESE_OR_TAIWANESE_LOCALE_BUILT_IN_DATE_FORMAT_IDS.indexOf(numberFormatId) < 0;\n}).filter(function (numberFormatId) {\n  return JAPANESE_OR_KOREAN_LOCALE_BUILT_IN_DATE_FORMAT_IDS.indexOf(numberFormatId) < 0;\n}));\n//# sourceMappingURL=isDateFormatStyle.js.map","import parseExcelDate from './parseExcelDate.js';\nimport isDateFormatStyle from './isDateFormatStyle.js';\n\n// Parses a string `value` of a cell.\nexport default function parseCellValue(value, type, _ref) {\n  var getInlineStringValue = _ref.getInlineStringValue,\n    getInlineStringXml = _ref.getInlineStringXml,\n    getStyleId = _ref.getStyleId,\n    styles = _ref.styles,\n    sharedStrings = _ref.sharedStrings,\n    epoch1904 = _ref.epoch1904,\n    options = _ref.options;\n  if (!type) {\n    // Default cell type is \"n\" (numeric).\n    // http://www.datypic.com/sc/ooxml/t-ssml_CT_Cell.html\n    type = 'n';\n  }\n\n  // Available Excel cell types:\n  // https://github.com/SheetJS/sheetjs/blob/19620da30be2a7d7b9801938a0b9b1fd3c4c4b00/docbits/52_datatype.md\n  //\n  // Some other document (seems to be old):\n  // http://webapp.docx4java.org/OnlineDemo/ecma376/SpreadsheetML/ST_CellType.html\n  //\n  switch (type) {\n    // XLSX tends to store all strings as \"shared\" (indexed) ones\n    // using \"s\" cell type (for saving on strage space).\n    // \"str\" cell type is then generally only used for storing\n    // formula-pre-calculated cell values.\n    case 'str':\n      value = parseString(value, options);\n      break;\n\n    // Sometimes, XLSX stores strings as \"inline\" strings rather than \"shared\" (indexed) ones.\n    // Perhaps the specification doesn't force it to use one or another.\n    // Example: `<sheetData><row r=\"1\"><c r=\"A1\" s=\"1\" t=\"inlineStr\"><is><t>Test 123</t></is></c></row></sheetData>`.\n    case 'inlineStr':\n      value = getInlineStringValue();\n      if (value === undefined) {\n        throw new Error(\"Unsupported \\\"inline string\\\" cell value structure: \".concat(getInlineStringXml()));\n      }\n      value = parseString(value, options);\n      break;\n\n    // XLSX tends to store string values as \"shared\" (indexed) ones.\n    // \"Shared\" strings is a way for an Excel editor to reduce\n    // the file size by storing \"commonly used\" strings in a dictionary\n    // and then referring to such strings by their index in that dictionary.\n    // Example: `<sheetData><row r=\"1\"><c r=\"A1\" s=\"1\" t=\"s\"><v>0</v></c></row></sheetData>`.\n    case 's':\n      // If a cell has no value then there's no `<c/>` element for it.\n      // If a `<c/>` element exists then it's not empty.\n      // The `<v/>`alue is a key in the \"shared strings\" dictionary of the\n      // XLSX file, so look it up in the `sharedStrings` dictionary by the numeric key.\n      var sharedStringIndex = Number(value);\n      if (isNaN(sharedStringIndex)) {\n        throw new Error(\"Invalid \\\"shared\\\" string index: \".concat(value));\n      }\n      if (sharedStringIndex >= sharedStrings.length) {\n        throw new Error(\"An out-of-bounds \\\"shared\\\" string index: \".concat(value));\n      }\n      value = sharedStrings[sharedStringIndex];\n      value = parseString(value, options);\n      break;\n\n    // Boolean (TRUE/FALSE) values are stored as either \"1\" or \"0\"\n    // in cells of type \"b\".\n    case 'b':\n      if (value === '1') {\n        value = true;\n      } else if (value === '0') {\n        value = false;\n      } else {\n        throw new Error(\"Unsupported \\\"boolean\\\" cell value: \".concat(value));\n      }\n      break;\n\n    // XLSX specification seems to support cells of type \"z\":\n    // blank \"stub\" cells that should be ignored by data processing utilities.\n    case 'z':\n      value = undefined;\n      break;\n\n    // XLSX specification also defines cells of type \"e\" containing a numeric \"error\" code.\n    // It's not clear what that means though.\n    // They also wrote: \"and `w` property stores its common name\".\n    // It's unclear what they meant by that.\n    case 'e':\n      value = decodeError(value);\n      break;\n\n    // XLSX supports date cells of type \"d\", though seems like it (almost?) never\n    // uses it for storing dates, preferring \"n\" numeric timestamp cells instead.\n    // The value of a \"d\" cell is supposedly a string in \"ISO 8601\" format.\n    // I haven't seen an XLSX file having such cells.\n    // Example: `<sheetData><row r=\"1\"><c r=\"A1\" s=\"1\" t=\"d\"><v>2021-06-10T00:47:45.700Z</v></c></row></sheetData>`.\n    case 'd':\n      if (value === undefined) {\n        break;\n      }\n      var parsedDate = new Date(value);\n      if (isNaN(parsedDate.valueOf())) {\n        throw new Error(\"Unsupported \\\"date\\\" cell value: \".concat(value));\n      }\n      value = parsedDate;\n      break;\n\n    // Numeric cells have type \"n\".\n    case 'n':\n      if (value === undefined) {\n        break;\n      }\n      // XLSX does have \"d\" type for dates, but it's not commonly used.\n      // Instead, it prefers using \"n\" type for storing dates as timestamps.\n      var styleId = getStyleId();\n      if (styleId && isDateFormatStyle(styleId, styles, options)) {\n        // Parse the number from string.\n        value = parseNumberDefault(value);\n        // Parse the number as a date timestamp.\n        value = parseExcelDate(value, {\n          epoch1904: epoch1904\n        });\n      } else {\n        // Parse the number from string.\n        // Supports custom parsing function to work around javascript number encoding precision issues.\n        // https://gitlab.com/catamphetamine/read-excel-file/-/issues/85\n        var parseNumber = options.parseNumber || parseNumberDefault;\n        value = parseNumber(value);\n      }\n      break;\n    default:\n      throw new TypeError(\"Cell type not supported: \".concat(type));\n  }\n\n  // Convert empty values to `null`.\n  if (value === undefined) {\n    value = null;\n  }\n  return value;\n}\n\n// Decodes numeric error code to a string code.\n// https://github.com/SheetJS/sheetjs/blob/19620da30be2a7d7b9801938a0b9b1fd3c4c4b00/docbits/52_datatype.md\nfunction decodeError(errorCode) {\n  // While the error values are determined by the application,\n  // the following are some example error values that could be used:\n  switch (errorCode) {\n    case 0x00:\n      return '#NULL!';\n    case 0x07:\n      return '#DIV/0!';\n    case 0x0F:\n      return '#VALUE!';\n    case 0x17:\n      return '#REF!';\n    case 0x1D:\n      return '#NAME?';\n    case 0x24:\n      return '#NUM!';\n    case 0x2A:\n      return '#N/A';\n    case 0x2B:\n      return '#GETTING_DATA';\n    default:\n      // Such error code doesn't exist. I made it up.\n      return \"#ERROR_\".concat(errorCode);\n  }\n}\nfunction parseString(value, options) {\n  // In some weird cases, a developer might want to disable\n  // the automatic trimming of all strings.\n  // For example, leading spaces might express a tree-like hierarchy.\n  // https://github.com/catamphetamine/read-excel-file/pull/106#issuecomment-1136062917\n  if (options.trim !== false) {\n    value = value.trim();\n  }\n  if (value === '') {\n    value = undefined;\n  }\n  return value;\n}\n\n// Parses a number from string.\n// Throws an error if the number couldn't be parsed.\n// When parsing floating-point number, is affected by\n// the javascript number encoding precision issues:\n// https://www.youtube.com/watch?v=2gIxbTn7GSc\n// https://www.avioconsulting.com/blog/overcoming-javascript-numeric-precision-issues\nfunction parseNumberDefault(stringifiedNumber) {\n  var parsedNumber = Number(stringifiedNumber);\n  if (isNaN(parsedNumber)) {\n    throw new Error(\"Invalid \\\"numeric\\\" cell value: \".concat(stringifiedNumber));\n  }\n  return parsedNumber;\n}\n//# sourceMappingURL=parseCellValue.js.map","function _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _unsupportedIterableToArray(arr, i) || _nonIterableRest(); }\nfunction _nonIterableRest() { throw new TypeError(\"Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\"); }\nfunction _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === \"string\") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === \"Object\" && o.constructor) n = o.constructor.name; if (n === \"Map\" || n === \"Set\") return Array.from(o); if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }\nfunction _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i]; return arr2; }\nfunction _iterableToArrayLimit(r, l) { var t = null == r ? null : \"undefined\" != typeof Symbol && r[Symbol.iterator] || r[\"@@iterator\"]; if (null != t) { var e, n, i, u, a = [], f = !0, o = !1; try { if (i = (t = t.call(r)).next, 0 === l) { if (Object(t) !== t) return; f = !1; } else for (; !(f = (e = i.call(t)).done) && (a.push(e.value), a.length !== l); f = !0); } catch (r) { o = !0, n = r; } finally { try { if (!f && null != t[\"return\"] && (u = t[\"return\"](), Object(u) !== u)) return; } finally { if (o) throw n; } } return a; } }\nfunction _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }\nexport default function parseCellCoordinates(coordinatesString) {\n  // Coordinate examples: \"AA2091\", \"R988\", \"B1\".\n  var _coordinatesString$sp = coordinatesString.split(/(\\d+)/),\n    _coordinatesString$sp2 = _slicedToArray(_coordinatesString$sp, 2),\n    column = _coordinatesString$sp2[0],\n    row = _coordinatesString$sp2[1];\n  return [\n  // Row.\n  Number(row),\n  // Column.\n  // It's not clear why would `column` ever be non-trimmed,\n  // but if it was added here then perhaps it could hypothetically happen, or smth.\n  getColumnNumberFromColumnLetters(column.trim())];\n}\n\n// Maps \"A1\"-like coordinates to `{ row, column }` numeric coordinates.\nvar LETTERS = [\"\", \"A\", \"B\", \"C\", \"D\", \"E\", \"F\", \"G\", \"H\", \"I\", \"J\", \"K\", \"L\", \"M\", \"N\", \"O\", \"P\", \"Q\", \"R\", \"S\", \"T\", \"U\", \"V\", \"W\", \"X\", \"Y\", \"Z\"];\n\n// Converts a letter coordinate to a digit coordinate.\n// Examples: \"A\" -> 1, \"B\" -> 2, \"Z\" -> 26, \"AA\" -> 27, etc.\nfunction getColumnNumberFromColumnLetters(columnLetters) {\n  // `for ... of ...` would require Babel polyfill for iterating a string.\n  var n = 0;\n  var i = 0;\n  while (i < columnLetters.length) {\n    n *= 26;\n    n += LETTERS.indexOf(columnLetters[i]);\n    i++;\n  }\n  return n;\n}\n//# sourceMappingURL=parseCellCoordinates.js.map","import parseCellValue from './parseCellValue.js';\nimport parseCellCoordinates from './parseCellCoordinates.js';\nimport { getCellValueElement, getCellInlineStringValue } from '../xml/xlsx.js';\nimport { getOuterXml } from '../xml/dom.js';\n\n// Example of a `<c/>`ell element:\n//\n// <c>\n//    <f>string</f> — formula.\n//    <v>string</v> — formula pre-computed value.\n//    <is>\n//       <t>string</t> — an `inlineStr` string (rather than a \"common string\" from a dictionary).\n//       <r>\n//          <rPr>\n//            ...\n//          </rPr>\n//          <t>string</t>\n//       </r>\n//       <rPh sb=\"1\" eb=\"1\">\n//          <t>string</t>\n//       </rPh>\n//       <phoneticPr fontId=\"1\"/>\n//    </is>\n//    <extLst>\n//       <ext>\n//          <!--any element-->\n//       </ext>\n//    </extLst>\n// </c>\n//\nexport default function parseCell(element, sheetDocument, sharedStrings, styles, epoch1904, options) {\n  var coordinates = parseCellCoordinates(element.getAttribute('r'));\n  var valueElement = getCellValueElement(sheetDocument, element);\n\n  // When the value element doesn't exist, it would be returned as `undefined`\n  // when using `xpath` and as `null` when using `DOMParser`.\n  // So here it uses `value && ...` syntax instead of `if (value !== undefined) { ... }`\n  // for compatibility with both `xpath` and `DOMParser`.\n  var value = valueElement && valueElement.textContent;\n  var type = element.getAttribute('t');\n  return {\n    row: coordinates[0],\n    column: coordinates[1],\n    value: parseCellValue(value, type, {\n      getInlineStringValue: function getInlineStringValue() {\n        return getCellInlineStringValue(sheetDocument, element);\n      },\n      getInlineStringXml: function getInlineStringXml() {\n        return getOuterXml(element);\n      },\n      getStyleId: function getStyleId() {\n        return element.getAttribute('s');\n      },\n      styles: styles,\n      sharedStrings: sharedStrings,\n      epoch1904: epoch1904,\n      options: options\n    })\n  };\n}\n//# sourceMappingURL=parseCell.js.map","import { getCellElements } from '../xml/xlsx.js';\nimport parseCell from './parseCell.js';\nexport default function parseCells(sheetDocument, sharedStrings, styles, epoch1904, options) {\n  var cells = getCellElements(sheetDocument);\n  if (cells.length === 0) {\n    return [];\n  }\n\n  // It seems like the idea of parsing \"merged cells\" was abandoned without being finished.\n  // Here, it seems to just get to the stage of parsing merged cell coordinates.\n  // Perhaps it's because it's not clear how would the package return merged cell results.\n  // I.e. should it just duplicate the value in each one of the merged cells?\n  // Or should it keep the existing behavior of only returning the value of the top-most left-most cell\n  // and then return `null` for the other ones?\n  // Perhaps the latter (existing) approach was found to be the most sensible.\n  //\n  // const mergedCells = getMergedCellCoordinates(sheetDocument)\n  // for (const mergedCell of mergedCells) {\n  //   const [from, to] = mergedCell.split(':').map(parseCellCoordinates)\n  //   console.log('Merged Cell.', 'From:', from, 'To:', to)\n  // }\n\n  return cells.map(function (element) {\n    return parseCell(element, sheetDocument, sharedStrings, styles, epoch1904, options);\n  });\n}\n//# sourceMappingURL=parseCells.js.map","function _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _unsupportedIterableToArray(arr, i) || _nonIterableRest(); }\nfunction _nonIterableRest() { throw new TypeError(\"Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\"); }\nfunction _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === \"string\") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === \"Object\" && o.constructor) n = o.constructor.name; if (n === \"Map\" || n === \"Set\") return Array.from(o); if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }\nfunction _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i]; return arr2; }\nfunction _iterableToArrayLimit(r, l) { var t = null == r ? null : \"undefined\" != typeof Symbol && r[Symbol.iterator] || r[\"@@iterator\"]; if (null != t) { var e, n, i, u, a = [], f = !0, o = !1; try { if (i = (t = t.call(r)).next, 0 === l) { if (Object(t) !== t) return; f = !1; } else for (; !(f = (e = i.call(t)).done) && (a.push(e.value), a.length !== l); f = !0); } catch (r) { o = !0, n = r; } finally { try { if (!f && null != t[\"return\"] && (u = t[\"return\"](), Object(u) !== u)) return; } finally { if (o) throw n; } } return a; } }\nfunction _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }\nimport parseCellCoordinates from './parseCellCoordinates.js';\nimport { getDimensions } from '../xml/xlsx.js';\n\n// `dimensions` defines the spreadsheet area containing all non-empty cells.\n// https://docs.microsoft.com/en-us/dotnet/api/documentformat.openxml.spreadsheet.sheetdimension?view=openxml-2.8.1\nexport default function parseSheetDimensions(sheetDocument) {\n  var dimensions = getDimensions(sheetDocument);\n  if (dimensions) {\n    dimensions = dimensions.split(':').map(parseCellCoordinates).map(function (_ref) {\n      var _ref2 = _slicedToArray(_ref, 2),\n        row = _ref2[0],\n        column = _ref2[1];\n      return {\n        row: row,\n        column: column\n      };\n    });\n    // Sometimes there can be just a single cell as a spreadsheet's \"dimensions\".\n    // For example, the default \"dimensions\" in Apache POI library is \"A1\",\n    // meaning that only the first cell in the spreadsheet is used.\n    //\n    // A quote from Apache POI library:\n    // \"Single cell ranges are formatted like single cell references (e.g. 'A1' instead of 'A1:A1').\"\n    //\n    if (dimensions.length === 1) {\n      dimensions = [dimensions[0], dimensions[0]];\n    }\n    return dimensions;\n  }\n}\n//# sourceMappingURL=parseSheetDimensions.js.map","function _createForOfIteratorHelperLoose(o, allowArrayLike) { var it = typeof Symbol !== \"undefined\" && o[Symbol.iterator] || o[\"@@iterator\"]; if (it) return (it = it.call(o)).next.bind(it); if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === \"number\") { if (it) o = it; var i = 0; return function () { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }; } throw new TypeError(\"Invalid attempt to iterate non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\"); }\nfunction _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === \"string\") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === \"Object\" && o.constructor) n = o.constructor.name; if (n === \"Map\" || n === \"Set\") return Array.from(o); if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }\nfunction _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i]; return arr2; }\nexport default function dropEmptyRows(data) {\n  var _ref = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {},\n    rowIndexSourceMap = _ref.rowIndexSourceMap,\n    _ref$accessor = _ref.accessor,\n    accessor = _ref$accessor === void 0 ? function (_) {\n      return _;\n    } : _ref$accessor,\n    onlyTrimAtTheEnd = _ref.onlyTrimAtTheEnd;\n  // Drop empty rows.\n  var i = data.length - 1;\n  while (i >= 0) {\n    // Check if the row is empty.\n    var empty = true;\n    for (var _iterator = _createForOfIteratorHelperLoose(data[i]), _step; !(_step = _iterator()).done;) {\n      var cell = _step.value;\n      if (accessor(cell) !== null) {\n        empty = false;\n        break;\n      }\n    }\n    // Remove the empty row.\n    if (empty) {\n      data.splice(i, 1);\n      if (rowIndexSourceMap) {\n        rowIndexSourceMap.splice(i, 1);\n      }\n    } else if (onlyTrimAtTheEnd) {\n      break;\n    }\n    i--;\n  }\n  return data;\n}\n//# sourceMappingURL=dropEmptyRows.js.map","function _createForOfIteratorHelperLoose(o, allowArrayLike) { var it = typeof Symbol !== \"undefined\" && o[Symbol.iterator] || o[\"@@iterator\"]; if (it) return (it = it.call(o)).next.bind(it); if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === \"number\") { if (it) o = it; var i = 0; return function () { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }; } throw new TypeError(\"Invalid attempt to iterate non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\"); }\nfunction _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === \"string\") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === \"Object\" && o.constructor) n = o.constructor.name; if (n === \"Map\" || n === \"Set\") return Array.from(o); if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }\nfunction _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i]; return arr2; }\nexport default function dropEmptyColumns(data) {\n  var _ref = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {},\n    _ref$accessor = _ref.accessor,\n    accessor = _ref$accessor === void 0 ? function (_) {\n      return _;\n    } : _ref$accessor,\n    onlyTrimAtTheEnd = _ref.onlyTrimAtTheEnd;\n  var i = data[0].length - 1;\n  while (i >= 0) {\n    var empty = true;\n    for (var _iterator = _createForOfIteratorHelperLoose(data), _step; !(_step = _iterator()).done;) {\n      var row = _step.value;\n      if (accessor(row[i]) !== null) {\n        empty = false;\n        break;\n      }\n    }\n    if (empty) {\n      var j = 0;\n      while (j < data.length) {\n        data[j].splice(i, 1);\n        j++;\n      }\n    } else if (onlyTrimAtTheEnd) {\n      break;\n    }\n    i--;\n  }\n  return data;\n}\n//# sourceMappingURL=dropEmptyColumns.js.map","function _createForOfIteratorHelperLoose(o, allowArrayLike) { var it = typeof Symbol !== \"undefined\" && o[Symbol.iterator] || o[\"@@iterator\"]; if (it) return (it = it.call(o)).next.bind(it); if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === \"number\") { if (it) o = it; var i = 0; return function () { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }; } throw new TypeError(\"Invalid attempt to iterate non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\"); }\nfunction _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _unsupportedIterableToArray(arr, i) || _nonIterableRest(); }\nfunction _nonIterableRest() { throw new TypeError(\"Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\"); }\nfunction _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === \"string\") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === \"Object\" && o.constructor) n = o.constructor.name; if (n === \"Map\" || n === \"Set\") return Array.from(o); if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }\nfunction _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i]; return arr2; }\nfunction _iterableToArrayLimit(r, l) { var t = null == r ? null : \"undefined\" != typeof Symbol && r[Symbol.iterator] || r[\"@@iterator\"]; if (null != t) { var e, n, i, u, a = [], f = !0, o = !1; try { if (i = (t = t.call(r)).next, 0 === l) { if (Object(t) !== t) return; f = !1; } else for (; !(f = (e = i.call(t)).done) && (a.push(e.value), a.length !== l); f = !0); } catch (r) { o = !0, n = r; } finally { try { if (!f && null != t[\"return\"] && (u = t[\"return\"](), Object(u) !== u)) return; } finally { if (o) throw n; } } return a; } }\nfunction _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }\nimport dropEmptyRows from './dropEmptyRows.js';\nimport dropEmptyColumns from './dropEmptyColumns.js';\nexport default function convertCellsToData2dArray(cells, dimensions) {\n  // If the sheet is empty.\n  if (cells.length === 0) {\n    return [];\n  }\n  var _dimensions = _slicedToArray(dimensions, 2),\n    leftTop = _dimensions[0],\n    rightBottom = _dimensions[1];\n\n  // Don't discard empty rows or columns at the start of the spreadsheet,\n  // even when the `*.xlsx` file itself tells that the content starts at an offset.\n  // https://github.com/catamphetamine/read-excel-file/issues/102\n  // const colsCount = (rightBottom.column - leftTop.column) + 1\n  // const rowsCount = (rightBottom.row - leftTop.row) + 1\n\n  var colsCount = rightBottom.column;\n  var rowsCount = rightBottom.row;\n\n  // Initialize spreadsheet data structure.\n  var data = new Array(rowsCount);\n  var i = 0;\n  while (i < rowsCount) {\n    data[i] = new Array(colsCount);\n    var j = 0;\n    while (j < colsCount) {\n      data[i][j] = null;\n      j++;\n    }\n    i++;\n  }\n\n  // Fill in spreadsheet `data`.\n  // (this code implies that `cells` aren't necessarily sorted by row and column:\n  //  maybe that's not correct, this piece code was initially copy-pasted\n  //  from some other library that used `XPath`)\n  for (var _iterator = _createForOfIteratorHelperLoose(cells), _step; !(_step = _iterator()).done;) {\n    var cell = _step.value;\n    // Don't discard empty rows or columns at the start of the spreadsheet,\n    // even when the `*.xlsx` file itself tells that the content starts at an offset.\n    // https://github.com/catamphetamine/read-excel-file/issues/102\n    // const rowIndex = cell.row - leftTop.row\n    // const columnIndex = cell.column - leftTop.column\n    var rowIndex = cell.row - 1;\n    var columnIndex = cell.column - 1;\n    // Ignore the data in the cell if it's outside of the spreadsheet's \"dimensions\".\n    if (columnIndex < colsCount && rowIndex < rowsCount) {\n      data[rowIndex][columnIndex] = cell.value;\n    }\n  }\n\n  // // Fill in the row map, if the row map was passed.\n  // if (options.rowIndexSourceMap) {\n  //   let i = 0\n  //   while (i < data.length) {\n  //     options.rowIndexSourceMap[i] = i\n  //     i++\n  //   }\n  // }\n\n  // Drop (discard) empty columns at the right side.\n  // Drop (discard) empty rows at the bottom.\n  data = dropEmptyRows(dropEmptyColumns(data, {\n    onlyTrimAtTheEnd: true\n  }), {\n    onlyTrimAtTheEnd: true\n  } // { onlyTrimAtTheEnd: true, rowIndexSourceMap: options.rowIndexSourceMap }\n  );\n\n  return data;\n}\n//# sourceMappingURL=convertCellsToData2dArray.js.map","import parseCells from './parseCells.js';\nimport parseSheetDimensions from './parseSheetDimensions.js';\nimport reconstructSheetDimensionsFromSheetCells from './reconstructSheetDimensionsFromSheetCells.js';\nimport convertSheetToData2dArray from './convertCellsToData2dArray.js';\nexport default function parseSheet(content, xml, sharedStrings, styles, epoch1904, options) {\n  var sheetDocument = xml.createDocument(content);\n  var cells = parseCells(sheetDocument, sharedStrings, styles, epoch1904, options);\n\n  // `dimensions` defines the spreadsheet area enclosing all non-empty cells.\n  // https://docs.microsoft.com/en-us/dotnet/api/documentformat.openxml.spreadsheet.sheetdimension?view=openxml-2.8.1\n  var dimensions = parseSheetDimensions(sheetDocument) || reconstructSheetDimensionsFromSheetCells(cells);\n  return convertSheetToData2dArray(cells, dimensions);\n}\n//# sourceMappingURL=parseSheet.js.map","export default function reconstructSheetDimensionsFromSheetCells(cells) {\n  var comparator = function comparator(a, b) {\n    return a - b;\n  };\n  var allRows = cells.map(function (cell) {\n    return cell.row;\n  }).sort(comparator);\n  var allCols = cells.map(function (cell) {\n    return cell.column;\n  }).sort(comparator);\n  var minRow = allRows[0];\n  var maxRow = allRows[allRows.length - 1];\n  var minCol = allCols[0];\n  var maxCol = allCols[allCols.length - 1];\n  return [{\n    row: minRow,\n    column: minCol\n  }, {\n    row: maxRow,\n    column: maxCol\n  }];\n}\n//# sourceMappingURL=reconstructSheetDimensionsFromSheetCells.js.map","function _createForOfIteratorHelperLoose(o, allowArrayLike) { var it = typeof Symbol !== \"undefined\" && o[Symbol.iterator] || o[\"@@iterator\"]; if (it) return (it = it.call(o)).next.bind(it); if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === \"number\") { if (it) o = it; var i = 0; return function () { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }; } throw new TypeError(\"Invalid attempt to iterate non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\"); }\nfunction _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === \"string\") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === \"Object\" && o.constructor) n = o.constructor.name; if (n === \"Map\" || n === \"Set\") return Array.from(o); if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }\nfunction _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i]; return arr2; }\nimport parseSpreadsheetInfo from './parseSpreadsheetInfo.js';\nimport parseFilePaths from './parseFilePaths.js';\nimport parseStyles from './parseStyles.js';\nimport parseSharedStrings from './parseSharedStrings.js';\nimport parseSheet from './parseSheet.js';\n\n// For an introduction in reading `.xlsx` files see \"The minimum viable XLSX reader\":\n// https://www.brendanlong.com/the-minimum-viable-xlsx-reader.html\n\n/**\r\n * Reads data from an `.xlsx` file.\r\n * @param  {Record<string,string>} contents - A map of `.xml` files inside the `.xlsx` file (which itself is just a zipped directory).\r\n * @param  {object} xml — An object having a single property — `createDocument(string)` function.\r\n * @param  {object} [options]\r\n * @return {Sheet[]}\r\n */\nexport default function parseSpreadsheetContents(contents, xml) {\n  var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n  var getFileContent = function getFileContent(filePath) {\n    if (!contents[filePath]) {\n      throw new Error(\"\\\"\".concat(filePath, \"\\\" file not found inside the *.xlsx file zip archive\"));\n    }\n    return contents[filePath];\n  };\n\n  // Read the paths to certain files inside the `.xlsx` file, which is itself just a `.zip` archive.\n  // These paths aren't standardized between different spreadsheet editors.\n  // https://github.com/tidyverse/readxl/issues/104\n  var filePaths = parseFilePaths(getFileContent('xl/_rels/workbook.xml.rels'), xml);\n\n  // The usual file path for \"shared strings\" is \"xl/sharedStrings.xml\".\n  var sharedStrings = filePaths.sharedStrings ? parseSharedStrings(getFileContent(filePaths.sharedStrings), xml) : [];\n\n  // The usual file path for \"styles\" is \"xl/styles.xml\".\n  var styles = filePaths.styles ? parseStyles(getFileContent(filePaths.styles), xml) : {};\n  var _parseSpreadsheetInfo = parseSpreadsheetInfo(getFileContent('xl/workbook.xml'), xml),\n    sheets = _parseSpreadsheetInfo.sheets,\n    epoch1904 = _parseSpreadsheetInfo.epoch1904;\n  var sheetIdsToRead = options.sheets && options.sheets.map(function (sheet) {\n    return getSheetId(sheet, sheets);\n  });\n\n  // Parse sheets data.\n\n  var sheetsData = [];\n  for (var _i = 0, _Object$keys = Object.keys(filePaths.sheets); _i < _Object$keys.length; _i++) {\n    var sheetId = _Object$keys[_i];\n    if (sheetIdsToRead && !sheetIdsToRead.includes(sheetId)) {\n      continue;\n    }\n    sheetsData.push({\n      sheet: getSheetNameById(sheetId, sheets),\n      data: parseSheet(getFileContent(filePaths.sheets[sheetId]), xml, sharedStrings, styles, epoch1904, options)\n    });\n  }\n\n  // Return spreadsheet data.\n  return sheetsData;\n}\nfunction getSheetId(sheet, sheets) {\n  if (typeof sheet === 'string') {\n    for (var _iterator = _createForOfIteratorHelperLoose(sheets), _step; !(_step = _iterator()).done;) {\n      var _sheet = _step.value;\n      if (_sheet.name === sheet) {\n        return _sheet.relationId;\n      }\n    }\n    throw new Error(\"Sheet \\\"\".concat(sheet, \"\\\" not found. Available sheets: \").concat(sheets.map(function (_ref) {\n      var name = _ref.name;\n      return \"\\\"\".concat(name, \"\\\"\");\n    }).join(', ')));\n  } else {\n    if (sheet <= sheets.length) {\n      return sheets[sheet - 1].relationId;\n    }\n    throw new Error(\"Sheet number out of bounds: \".concat(sheet, \". Available sheets count: \").concat(sheets.length));\n  }\n}\nfunction getSheetNameById(sheetId, sheets) {\n  for (var _iterator2 = _createForOfIteratorHelperLoose(sheets), _step2; !(_step2 = _iterator2()).done;) {\n    var sheet = _step2.value;\n    if (sheet.relationId === sheetId) {\n      return sheet.name;\n    }\n  }\n  throw new Error(\"Sheet ID not found: \".concat(sheetId));\n}\n//# sourceMappingURL=parseSpreadsheetContents.js.map","import { getSharedStrings } from '../xml/xlsx.js';\nexport default function parseSharedStrings(content, xml) {\n  if (!content) {\n    return [];\n  }\n  return getSharedStrings(xml.createDocument(content));\n}\n//# sourceMappingURL=parseSharedStrings.js.map","import xml from '../xml/xmlBrowser.js';\nimport unpackXlsxFile from './unpackXlsxFileBrowser.js';\nimport parseSpreadsheetContents from '../xlsx/parseSpreadsheetContents.js';\n\n/**\r\n * Reads an `.xlsx` file.\r\n * @param  {(File|Blob|ArrayBuffer)} input\r\n * @param  {object} [options]\r\n * @return {Promise<Sheet[]>}\r\n */\nexport default function readXlsxFile(input, options) {\n  return unpackXlsxFile(input).then(function (contents) {\n    return parseSpreadsheetContents(contents, xml, options);\n  });\n}\n//# sourceMappingURL=readXlsxFileBrowser.js.map"],"names":["xml","createDocument","content","DOMParser","parseFromString","trim","ch2","u8","Uint8Array","u16","Uint16Array","i32","Int32Array","fleb","fdeb","clim","freb","eb","start","b","i","r","j","_a","fl","revfl","fd","rev","x","hMap","cd","mb","s","length","l","co","le","rvb","sv","r_1","v","m","flt","fdt","flrm","fdrm","max","a","bits","d","p","o","bits16","shft","slc","e","subarray","ec","err","ind","msg","nt","Error","code","captureStackTrace","inflt","dat","st","buf","dict","sl","dl","f","noBuf","resize","noSt","cbuf","bl","nbuf","Math","set","final","pos","bt","lm","dm","lbt","dbt","n","tbts","type","t","hLit","hcLen","tl","ldt","clt","clb","clbmsk","clm","c","lt","dt","lms","dms","lpos","sym","add","dsym","end","shift","dend","min","et","wcln","fn","fnStr","td","toString","ks","slice","indexOf","lastIndexOf","replace","split","k","st_1","prototype","spInd","ch","wrkr","fns","init","id","cb","td_1","mrg","transfer","w","Worker","URL","createObjectURL","Blob","onmessage","data","ed","$e$","stack","postMessage","wk","buffer","push","constructor","cbfs","bInflt","inflateSync","pbf","gopt","out","size","dictionary","cbify","opts","terminate","consume","b2","b4","b8","TextDecoder","decode","stream","dutf8","String","fromCharCode","strFromU8","latin1","apply","slzh","zh","z","fnl","es","bs","z64e","sc","su","off","mt","queueMicrotask","setTimeout","unzip","term","tAll","files","cbd","lft","ze","fltr","filter","_loop_3","c_1","no","cbl","name","originalSize","compression","infl","ev","inflate","unzipFromArrayBuffer","input","options","_ref","arguments","undefined","_filter","file","path","unzipFromArrayBufferUsingFunction","unzipAsync","archive","Promise","resolve","reject","error","convertValuesFromUint8ArraysToStrings","entries","convertedEntries","_i","_Object$keys","Object","keys","key","filterZipArchiveEntry","endsWith","getResultFromArrayBuffer","arrayBuffer","then","findChild","node","tagName","childNodes","childNode","nodeType","getTagName","findChildren","results","forEach","func","NAMESPACE_REG_EXP","element","getFirstElementChild","getOuterXml","textContent","attributes","value","getSharedStrings","document","sst","documentElement","string","_createForOfIteratorHelperLoose","allowArrayLike","it","Symbol","iterator","call","next","bind","Array","isArray","minLen","_arrayLikeToArray","from","test","_unsupportedIterableToArray","done","TypeError","arr","len","arr2","parseSpreadsheetInfo","_step","book","workbookProperties","epoch1904","Boolean","getAttribute","sheets","_iterator","getSheets","sheet","relationId","parseFilePaths","filePaths","sharedStrings","styles","getRelationships","relationship","filePath","getFilePath","_typeof","ownKeys","getOwnPropertySymbols","getOwnPropertyDescriptor","enumerable","_objectSpread","_defineProperty","getOwnPropertyDescriptors","defineProperties","defineProperty","obj","arg","hint","prim","toPrimitive","res","Number","_toPrimitive","_toPropertyKey","configurable","writable","parseStyles","cellStyleXfs","doc","baseStyles","map","parseCellStyle","numberFormats","numFmts","getNumberFormats","parseNumberFormatStyle","reduce","formats","format","cellXfs","getCellStyles","xf","hasAttribute","xfId","numFmt","template","style","numberFormatId","numberFormat","NUMBER_OF_LEAP_YEARS_BETWEEN_1900_AND_1970","JANUARY_0TH_1900_DAY","ERRONEOUS_FEBRUARY_29_1990_DAY","DAY","DAYS_IN_YEAR","DATE_FORMAT_SPECIFIC_LOCALE_PREFIX","DATE_FORMAT_ALLOW_ANY_OTHER_TEXT_SUFFIX","CACHE","isDateFormatCached","result","toLowerCase","tokens","token","DATE_TEMPLATE_TOKENS","isDateFormat","MAINLAND_CHINESE_OR_TAIWANESE_LOCALE_BUILT_IN_DATE_FORMAT_IDS","JAPANESE_OR_KOREAN_LOCALE_BUILT_IN_DATE_FORMAT_IDS","BUILT_IN_DATE_FORMAT_IDS","concat","parseCellValue","getInlineStringValue","getInlineStringXml","getStyleId","parseString","sharedStringIndex","isNaN","errorCode","decodeError","parsedDate","Date","valueOf","styleId","dateFormat","smartDateParser","isDateFormatStyle","excelSerialDate","daysBeforeUnixEpoch","floor","parseExcelDate","parseNumberDefault","parseNumber","stringifiedNumber","parsedNumber","_slicedToArray","_arrayWithHoles","u","_iterableToArrayLimit","_nonIterableRest","parseCellCoordinates","coordinatesString","_coordinatesString$sp2","column","row","getColumnNumberFromColumnLetters","LETTERS","columnLetters","parseCell","sheetDocument","coordinates","valueElement","getCellValueElement","firstElementChild","firstElementChildFirstElementChild","getCellInlineStringValue","parseCells","cells","sheetData","cell","getCellElements","parseSheetDimensions","dimensions","getDimensions","_ref2","convertCellsToData2dArray","_dimensions","rightBottom","colsCount","rowsCount","rowIndex","columnIndex","rowIndexSourceMap","_ref$accessor","accessor","_","onlyTrimAtTheEnd","empty","splice","dropEmptyRows","dropEmptyColumns","parseSheet","comparator","allRows","sort","allCols","minRow","maxRow","reconstructSheetDimensionsFromSheetCells","convertSheetToData2dArray","parseSpreadsheetContents","contents","getFileContent","parseSharedStrings","_parseSpreadsheetInfo","sheetIdsToRead","_sheet","join","getSheetId","sheetsData","sheetId","includes","getSheetNameById","_step2","_iterator2","File","unpackXlsxFile"],"mappings":"6OAAe,IAAAA,EAAA,CACbC,eAAgB,SAAwBC,GAMtC,OAAO,IAAIC,WAAYC,gBAAgBF,EAAQG,OAAQ,WACxD,GCCCC,EAAM,CAAA,EAqBNC,EAAKC,WAAYC,EAAMC,YAAaC,EAAMC,WAE1CC,EAAO,IAAIN,EAAG,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAgB,EAAG,EAAoB,IAE1IO,EAAO,IAAIP,EAAG,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAiB,EAAG,IAEjIQ,EAAO,IAAIR,EAAG,CAAC,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,KAE7ES,EAAO,SAAUC,EAAIC,GAErB,IADA,IAAIC,EAAI,IAAIV,EAAI,IACPW,EAAI,EAAGA,EAAI,KAAMA,EACtBD,EAAEC,GAAKF,GAAS,GAAKD,EAAGG,EAAI,GAGhC,IAAIC,EAAI,IAAIV,EAAIQ,EAAE,KAClB,IAASC,EAAI,EAAGA,EAAI,KAAMA,EACtB,IAAK,IAAIE,EAAIH,EAAEC,GAAIE,EAAIH,EAAEC,EAAI,KAAME,EAC/BD,EAAEC,GAAOA,EAAIH,EAAEC,IAAO,EAAKA,EAGnC,MAAO,CAAED,EAAGA,EAAGE,EAAGA,EACtB,EACIE,EAAKP,EAAKH,EAAM,GAAIW,EAAKD,EAAGJ,EAAGM,EAAQF,EAAGF,EAE9CG,EAAG,IAAM,IAAKC,EAAM,KAAO,GAI3B,IAHG,IAAqBC,EAAfV,EAAKF,EAAM,GAAYK,EAE5BQ,EAAM,IAAIlB,EAAI,OACTW,EAAI,EAAGA,EAAI,QAASA,EAAG,CAE5B,IAAIQ,GAAU,MAAJR,IAAe,GAAW,MAAJA,IAAe,EAE/CQ,GAAU,OADVA,GAAU,MAAJA,IAAe,GAAW,MAAJA,IAAe,KACtB,GAAW,KAAJA,IAAe,EAC3CD,EAAIP,KAAY,MAAJQ,IAAe,GAAW,IAAJA,IAAe,IAAO,CAC5D,CAIA,IAAIC,WAAkBC,EAAIC,EAAIV,GAO1B,IANA,IAAIW,EAAIF,EAAGG,OAEPb,EAAI,EAEJc,EAAI,IAAIzB,EAAIsB,GAETX,EAAIY,IAAKZ,EACRU,EAAGV,MACDc,EAAEJ,EAAGV,GAAK,GAGpB,IAIIe,EAJAC,EAAK,IAAI3B,EAAIsB,GACjB,IAAKX,EAAI,EAAGA,EAAIW,IAAMX,EAClBgB,EAAGhB,GAAMgB,EAAGhB,EAAI,GAAKc,EAAEd,EAAI,IAAO,EAGtC,GAAIC,EAAG,CAEHc,EAAK,IAAI1B,EAAI,GAAKsB,GAElB,IAAIM,EAAM,GAAKN,EACf,IAAKX,EAAI,EAAGA,EAAIY,IAAKZ,EAEjB,GAAIU,EAAGV,GAQH,IANA,IAAIkB,EAAMlB,GAAK,EAAKU,EAAGV,GAEnBmB,EAAMR,EAAKD,EAAGV,GAEdoB,EAAIJ,EAAGN,EAAGV,GAAK,MAAQmB,EAElBE,EAAID,GAAM,GAAKD,GAAO,EAAIC,GAAKC,IAAKD,EAEzCL,EAAGR,EAAIa,IAAMH,GAAOC,CAInC,MAGG,IADAH,EAAK,IAAI1B,EAAIuB,GACRZ,EAAI,EAAGA,EAAIY,IAAKZ,EACbU,EAAGV,KACHe,EAAGf,GAAKO,EAAIS,EAAGN,EAAGV,GAAK,OAAU,GAAKU,EAAGV,IAIrD,OAAOe,CACV,EAEGO,EAAM,IAAInC,EAAG,KACjB,IAASa,EAAI,EAAGA,EAAI,MAAOA,EACvBsB,EAAItB,GAAK,EACb,IAASA,EAAI,IAAKA,EAAI,MAAOA,EACzBsB,EAAItB,GAAK,EACb,IAASA,EAAI,IAAKA,EAAI,MAAOA,EACzBsB,EAAItB,GAAK,EACb,IAASA,EAAI,IAAKA,EAAI,MAAOA,EACzBsB,EAAItB,GAAK,EAEb,IAAIuB,EAAM,IAAIpC,EAAG,IACjB,IAASa,EAAI,EAAGA,EAAI,KAAMA,EACtBuB,EAAIvB,GAAK,EAE4B,IAAAwB,EAAqBf,EAAKa,EAAK,EAAG,GAElCG,EAAqBhB,EAAKc,EAAK,EAAG,GAEvEG,EAAM,SAAUC,GAEhB,IADA,IAAIN,EAAIM,EAAE,GACD3B,EAAI,EAAGA,EAAI2B,EAAEd,SAAUb,EACxB2B,EAAE3B,GAAKqB,IACPA,EAAIM,EAAE3B,IAEd,OAAOqB,CACX,EAEIO,EAAO,SAAUC,EAAGC,EAAGT,GACvB,IAAIU,EAAKD,EAAI,EAAK,EAClB,OAASD,EAAEE,GAAMF,EAAEE,EAAI,IAAM,KAAY,EAAJD,GAAUT,CACnD,EAEIW,EAAS,SAAUH,EAAGC,GACtB,IAAIC,EAAKD,EAAI,EAAK,EAClB,OAASD,EAAEE,GAAMF,EAAEE,EAAI,IAAM,EAAMF,EAAEE,EAAI,IAAM,MAAa,EAAJD,EAC5D,EAEIG,EAAO,SAAUH,GAAK,OAASA,EAAI,GAAK,EAAK,GAG7CI,EAAM,SAAUd,EAAGR,EAAGuB,GAMtB,OALS,MAALvB,GAAaA,EAAI,KACjBA,EAAI,IACC,MAALuB,GAAaA,EAAIf,EAAEP,UACnBsB,EAAIf,EAAEP,QAEH,IAAI1B,EAAGiC,EAAEgB,SAASxB,EAAGuB,GAChC,EAsBIE,EAAK,CACL,iBACA,qBACA,yBACA,mBACA,kBACA,oBACJ,CACI,cACA,qBACA,uBACA,8BACA,oBACA,mBACA,oBAIAC,EAAM,SAAUC,EAAKC,EAAKC,GAC1B,IAAIN,EAAI,IAAIO,MAAMF,GAAOH,EAAGE,IAI5B,GAHAJ,EAAEQ,KAAOJ,EACLG,MAAME,mBACNF,MAAME,kBAAkBT,EAAGG,IAC1BG,EACD,MAAMN,EACV,OAAOA,CACX,EAEIU,EAAQ,SAAUC,EAAKC,EAAIC,EAAKC,GAEhC,IAAIC,EAAKJ,EAAIjC,OAAQsC,EAAKF,EAAOA,EAAKpC,OAAS,EAC/C,IAAKqC,GAAMH,EAAGK,IAAML,EAAGjC,EACnB,OAAOkC,GAAO,IAAI7D,EAAG,GACzB,IAAIkE,GAASL,EAETM,EAASD,GAAiB,GAARN,EAAG/C,EAErBuD,EAAOR,EAAG/C,EAEVqD,IACAL,EAAM,IAAI7D,EAAQ,EAAL+D,IAEjB,IAAIM,EAAO,SAAU1C,GACjB,IAAI2C,EAAKT,EAAInC,OAEb,GAAIC,EAAI2C,EAAI,CAER,IAAIC,EAAO,IAAIvE,EAAGwE,KAAKjC,IAAS,EAAL+B,EAAQ3C,IACnC4C,EAAKE,IAAIZ,GACTA,EAAMU,CACT,CACT,EAEQG,EAAQd,EAAGK,GAAK,EAAGU,EAAMf,EAAGjB,GAAK,EAAGiC,EAAKhB,EAAGhD,GAAK,EAAGiE,EAAKjB,EAAGjC,EAAGmD,EAAKlB,EAAGlB,EAAGqC,EAAMnB,EAAG1B,EAAG8C,EAAMpB,EAAGqB,EAE/FC,EAAY,EAALnB,EACX,EAAG,CACC,IAAKc,EAAI,CAELH,EAAQjC,EAAKkB,EAAKgB,EAAK,GAEvB,IAAIQ,EAAO1C,EAAKkB,EAAKgB,EAAM,EAAG,GAE9B,GADAA,GAAO,GACFQ,EAAM,CAEP,IAAuBxD,EAAIgC,GAAvBlC,EAAIqB,EAAK6B,GAAO,GAAe,GAAMhB,EAAIlC,EAAI,IAAM,EAAI2D,EAAI3D,EAAIE,EACnE,GAAIyD,EAAIrB,EAAI,CACJK,GACAjB,EAAI,GACR,KACH,CAEGgB,GACAE,EAAKO,EAAKjD,GAEdkC,EAAIY,IAAId,EAAIV,SAASxB,EAAG2D,GAAIR,GAE5BhB,EAAGhD,EAAIgE,GAAMjD,EAAGiC,EAAGjB,EAAIgC,EAAU,EAAJS,EAAOxB,EAAGK,EAAIS,EAC3C,QACH,CACI,GAAY,GAARS,EACLN,EAAKxC,EAAMyC,EAAKxC,EAAMyC,EAAM,EAAGC,EAAM,OACpC,GAAY,GAARG,EAAW,CAEhB,IAAIE,EAAO5C,EAAKkB,EAAKgB,EAAK,IAAM,IAAKW,EAAQ7C,EAAKkB,EAAKgB,EAAM,GAAI,IAAM,EACnEY,EAAKF,EAAO5C,EAAKkB,EAAKgB,EAAM,EAAG,IAAM,EACzCA,GAAO,GAKP,IAHA,IAAIa,EAAM,IAAIxF,EAAGuF,GAEbE,EAAM,IAAIzF,EAAG,IACRa,EAAI,EAAGA,EAAIyE,IAASzE,EAEzB4E,EAAIjF,EAAKK,IAAM4B,EAAKkB,EAAKgB,EAAU,EAAJ9D,EAAO,GAE1C8D,GAAe,EAARW,EAEP,IAAII,EAAMnD,EAAIkD,GAAME,GAAU,GAAKD,GAAO,EAEtCE,EAAMtE,EAAKmE,EAAKC,EAAK,GACzB,IAAS7E,EAAI,EAAGA,EAAI0E,GAAK,CACrB,IAII9D,EAJAX,EAAI8E,EAAInD,EAAKkB,EAAKgB,EAAKgB,IAM3B,GAJAhB,GAAW,GAAJ7D,GAEHW,EAAIX,GAAK,GAEL,GACJ0E,EAAI3E,KAAOY,MAEV,CAED,IAAIoE,EAAI,EAAGZ,EAAI,EAOf,IANS,IAALxD,GACAwD,EAAI,EAAIxC,EAAKkB,EAAKgB,EAAK,GAAIA,GAAO,EAAGkB,EAAIL,EAAI3E,EAAI,IACvC,IAALY,GACLwD,EAAI,EAAIxC,EAAKkB,EAAKgB,EAAK,GAAIA,GAAO,GACxB,IAALlD,IACLwD,EAAI,GAAKxC,EAAKkB,EAAKgB,EAAK,KAAMA,GAAO,GAClCM,KACHO,EAAI3E,KAAOgF,CAClB,CACJ,CAED,IAAIC,EAAKN,EAAIvC,SAAS,EAAGoC,GAAOU,EAAKP,EAAIvC,SAASoC,GAElDN,EAAMxC,EAAIuD,GAEVd,EAAMzC,EAAIwD,GACVlB,EAAKvD,EAAKwE,EAAIf,EAAK,GACnBD,EAAKxD,EAAKyE,EAAIf,EAAK,EACtB,MAEG7B,EAAI,GACR,GAAIwB,EAAMO,EAAM,CACRd,GACAjB,EAAI,GACR,KACH,CACJ,CAGGgB,GACAE,EAAKO,EAAK,QAGd,IAFA,IAAIoB,GAAO,GAAKjB,GAAO,EAAGkB,GAAO,GAAKjB,GAAO,EACzCkB,EAAOvB,GACHuB,EAAOvB,EAAK,CAEhB,IAAoCwB,IAAhCN,EAAIhB,EAAGhC,EAAOc,EAAKgB,GAAOqB,KAAiB,EAE/C,IADArB,GAAW,GAAJkB,GACGX,EAAM,CACRd,GACAjB,EAAI,GACR,KACH,CAGD,GAFK0C,GACD1C,EAAI,GACJgD,GAAM,IACNtC,EAAIe,KAAQuB,OACX,IAAW,KAAPA,GAAY,CACjBD,EAAOvB,EAAKE,EAAK,KACjB,KACH,CAEG,IAAIuB,GAAMD,GAAM,IAEhB,GAAIA,GAAM,IAAK,CAEX,IAAmBvF,GAAIN,EAAnBO,EAAIsF,GAAM,KACdC,GAAM3D,EAAKkB,EAAKgB,GAAM,GAAK/D,IAAK,GAAKK,EAAGJ,GACxC8D,GAAO/D,EACV,CAED,IAAI8B,GAAIoC,EAAGjC,EAAOc,EAAKgB,GAAOsB,GAAMI,GAAO3D,IAAK,EAC3CA,IACDS,EAAI,GACRwB,GAAW,GAAJjC,GACHqD,EAAK5E,EAAGkF,IACZ,GAAIA,GAAO,EAAG,CACNzF,GAAIL,EAAK8F,IACbN,GAAMlD,EAAOc,EAAKgB,IAAQ,GAAK/D,IAAK,EAAG+D,GAAO/D,EACjD,CACD,GAAI+D,EAAMO,EAAM,CACRd,GACAjB,EAAI,GACR,KACH,CACGgB,GACAE,EAAKO,EAAK,QACd,IAAI0B,GAAM1B,EAAKwB,GACf,GAAIxB,EAAKmB,EAAI,CACT,IAAIQ,GAAQvC,EAAK+B,EAAIS,GAAOhC,KAAKiC,IAAIV,EAAIO,IAGzC,IAFIC,GAAQ3B,EAAK,GACbzB,EAAI,GACDyB,EAAK4B,KAAQ5B,EAChBf,EAAIe,GAAMd,EAAKyC,GAAQ3B,EAC9B,CACD,KAAOA,EAAK0B,KAAO1B,EACff,EAAIe,GAAMf,EAAIe,EAAKmB,EAC1B,CACJ,CACDnC,EAAGjC,EAAIkD,EAAIjB,EAAGjB,EAAIuD,EAAMtC,EAAGhD,EAAIgE,EAAIhB,EAAGK,EAAIS,EACtCG,IACAH,EAAQ,EAAGd,EAAG1B,EAAI6C,EAAKnB,EAAGlB,EAAIoC,EAAIlB,EAAGqB,EAAID,EAChD,QAASN,GAEV,OAAOE,GAAMf,EAAInC,QAAUwC,EAAQnB,EAAIc,EAAK,EAAGe,GAAMf,EAAIZ,SAAS,EAAG2B,EACzE,EAoOI8B,EAAmB,IAAI1G,EAAG,GA+M1B2G,EAAO,SAAUC,EAAIC,EAAOC,GAI5B,IAHA,IAAIf,EAAKa,IACLhD,EAAKgD,EAAGG,WACRC,EAAKpD,EAAGqD,MAAMrD,EAAGsD,QAAQ,KAAO,EAAGtD,EAAGuD,YAAY,MAAMC,QAAQ,OAAQ,IAAIC,MAAM,KAC7ExG,EAAI,EAAGA,EAAIkF,EAAGrE,SAAUb,EAAG,CAChC,IAAIoB,EAAI8D,EAAGlF,GAAIyG,EAAIN,EAAGnG,GACtB,GAAgB,mBAALoB,EAAiB,CACxB4E,GAAS,IAAMS,EAAI,IACnB,IAAIC,EAAOtF,EAAE8E,WACb,GAAI9E,EAAEuF,UAEF,IAAsC,GAAlCD,EAAKL,QAAQ,iBAAwB,CACrC,IAAIO,EAAQF,EAAKL,QAAQ,IAAK,GAAK,EACnCL,GAASU,EAAKN,MAAMQ,EAAOF,EAAKL,QAAQ,IAAKO,GAChD,MAGG,IAAK,IAAIrC,KADTyB,GAASU,EACKtF,EAAEuF,UACZX,GAAS,IAAMS,EAAI,cAAgBlC,EAAI,IAAMnD,EAAEuF,UAAUpC,GAAG2B,gBAIpEF,GAASU,CAChB,MAEGT,EAAGQ,GAAKrF,CACf,CACD,OAAO4E,CACX,EACIa,EAAK,GAYLC,EAAO,SAAUC,EAAKC,EAAMC,EAAIC,GAChC,IAAKL,EAAGI,GAAK,CAET,IADA,IAAIjB,EAAQ,GAAImB,EAAO,CAAA,EAAI9F,EAAI0F,EAAIlG,OAAS,EACnCb,EAAI,EAAGA,EAAIqB,IAAKrB,EACrBgG,EAAQF,EAAKiB,EAAI/G,GAAIgG,EAAOmB,GAChCN,EAAGI,GAAM,CAAEjC,EAAGc,EAAKiB,EAAI1F,GAAI2E,EAAOmB,GAAOhF,EAAGgF,EAC/C,CACD,IAAIlB,EA/DE,SAAUtE,EAAG5B,GACnB,IAAIgC,EAAI,CAAA,EACR,IAAK,IAAI0E,KAAK9E,EACVI,EAAE0E,GAAK9E,EAAE8E,GACb,IAAK,IAAIA,KAAK1G,EACVgC,EAAE0E,GAAK1G,EAAE0G,GACb,OAAO1E,CACX,CAwDaqF,CAAI,CAAE,EAAEP,EAAGI,GAAI9E,GACxB,OAp2BE,SAAc6C,EAAGiC,EAAIzE,EAAK6E,EAAUH,GACtC,IAAII,EAAI,IAAIC,OAAOrI,EAAI+H,KAAQ/H,EAAI+H,GAAMO,IAAIC,gBAAgB,IAAIC,KAAK,CAClE1C,EAAI,mGACL,CAAEV,KAAM,uBAaX,OAZAgD,EAAEK,UAAY,SAAUxF,GACpB,IAAIN,EAAIM,EAAEyF,KAAMC,EAAKhG,EAAEiG,IACvB,GAAID,EAAI,CACJ,IAAIvF,EAAM,IAAII,MAAMmF,EAAG,IACvBvF,EAAU,KAAIuF,EAAG,GACjBvF,EAAIyF,MAAQF,EAAG,GACfX,EAAG5E,EAAK,KACX,MAEG4E,EAAG,KAAMrF,EACrB,EACIyF,EAAEU,YAAYxF,EAAK6E,GACZC,CACV,CAm1BUW,CAAGpB,EAAGI,GAAIjC,EAAI,0EAA4EgC,EAAKd,WAAa,IAAKe,EAAIhB,EAlBrH,SAAU7E,GACjB,IAAIsD,EAAK,GACT,IAAK,IAAI+B,KAAKrF,EACNA,EAAEqF,GAAGyB,QACLxD,EAAGyD,MAAM/G,EAAEqF,GAAK,IAAIrF,EAAEqF,GAAG2B,YAAYhH,EAAEqF,KAAKyB,QAGpD,OAAOxD,CACX,CAUoI2D,CAAKpC,GAAKiB,EAC9I,EAEIoB,EAAS,WAAc,MAAO,CAACnJ,EAAIE,EAAKE,EAAKE,EAAMC,EAAMC,EAAMS,EAAIE,EAAIkB,EAAMC,EAAMlB,EAAK8B,EAAI5B,EAAMiB,EAAKE,EAAMI,EAAQC,EAAMC,EAAKI,EAAKO,EAAO0F,EAAaC,EAAKC,EAAM,EAWpKD,EAAM,SAAUhG,GAAO,OAAOwF,YAAYxF,EAAK,CAACA,EAAI0F,UAEpDO,EAAO,SAAU1G,GAAK,OAAOA,GAAK,CAClC2G,IAAK3G,EAAE4G,MAAQ,IAAIxJ,EAAG4C,EAAE4G,MACxBC,WAAY7G,EAAE6G,aAGdC,EAAQ,SAAU/F,EAAKgG,EAAM/B,EAAKC,EAAMC,EAAIC,GAC5C,IAAII,EAAIR,EAAKC,EAAKC,EAAMC,GAAI,SAAU3E,EAAKQ,GACvCwE,EAAEyB,YACF7B,EAAG5E,EAAKQ,EAChB,IAEI,OADAwE,EAAEU,YAAY,CAAClF,EAAKgG,GAAOA,EAAKE,QAAU,CAAClG,EAAIoF,QAAU,IAClD,WAAcZ,EAAEyB,WAAY,CACvC,EAgDIE,EAAK,SAAUpH,EAAG9B,GAAK,OAAO8B,EAAE9B,GAAM8B,EAAE9B,EAAI,IAAM,CAAG,EAErDmJ,EAAK,SAAUrH,EAAG9B,GAAK,OAAQ8B,EAAE9B,GAAM8B,EAAE9B,EAAI,IAAM,EAAM8B,EAAE9B,EAAI,IAAM,GAAO8B,EAAE9B,EAAI,IAAM,MAAS,CAAE,EACnGoJ,EAAK,SAAUtH,EAAG9B,GAAK,OAAOmJ,EAAGrH,EAAG9B,GAAqB,WAAfmJ,EAAGrH,EAAG9B,EAAI,IAwPjD,SAASwI,EAAYX,EAAMkB,GAC9B,OAAOjG,EAAM+E,EAAM,CAAE5H,EAAG,GAAK8I,GAAQA,EAAKJ,IAAKI,GAAQA,EAAKF,WAChE,CA0bA,IAAI3C,EAA2B,oBAAfmD,aAA4C,IAAIA,YAGhE,IACInD,EAAGoD,OAAOxD,EAAI,CAAEyD,QAAQ,IAClB,CACV,CACA,MAAOnH,GAAM,CAEb,IAAIoH,EAAQ,SAAU1H,GAClB,IAAK,IAAI5B,EAAI,GAAID,EAAI,IAAK,CACtB,IAAIgF,EAAInD,EAAE7B,KACNH,GAAMmF,EAAI,MAAQA,EAAI,MAAQA,EAAI,KACtC,GAAIhF,EAAIH,EAAKgC,EAAEhB,OACX,MAAO,CAAED,EAAGX,EAAGA,EAAGiC,EAAIL,EAAG7B,EAAI,IAC5BH,EAEU,GAANA,GACLmF,IAAU,GAAJA,IAAW,IAAe,GAATnD,EAAE7B,OAAc,IAAe,GAAT6B,EAAE7B,OAAc,EAAc,GAAT6B,EAAE7B,MAAc,MAC9EC,GAAKuJ,OAAOC,aAAa,MAASzE,GAAK,GAAK,MAAa,KAAJA,IAGzD/E,GADU,EAALJ,EACA2J,OAAOC,cAAkB,GAAJzE,IAAW,EAAc,GAATnD,EAAE7B,MAEvCwJ,OAAOC,cAAkB,GAAJzE,IAAW,IAAe,GAATnD,EAAE7B,OAAc,EAAc,GAAT6B,EAAE7B,MARlEC,GAAKuJ,OAAOC,aAAazE,EAShC,CACL,EA4HO,SAAS0E,EAAU5G,EAAK6G,GAC3B,GAAIA,EAAQ,CAER,IADA,IAAI1J,EAAI,GACCD,EAAI,EAAGA,EAAI8C,EAAIjC,OAAQb,GAAK,MACjCC,GAAKuJ,OAAOC,aAAaG,MAAM,KAAM9G,EAAIV,SAASpC,EAAGA,EAAI,QAC7D,OAAOC,CACV,CACI,GAAIgG,EACL,OAAOA,EAAGoD,OAAOvG,GAGjB,IAAI3C,EAAKoJ,EAAMzG,GAAMlC,EAAIT,EAAGS,EAG5B,OAH+BX,EAAIE,EAAGF,GAChCY,QACFyB,EAAI,GACD1B,CAEf,CAKA,IAAIiJ,EAAO,SAAUhI,EAAG9B,GAAK,OAAOA,EAAI,GAAKkJ,EAAGpH,EAAG9B,EAAI,IAAMkJ,EAAGpH,EAAG9B,EAAI,KAEnE+J,EAAK,SAAUjI,EAAG9B,EAAGgK,GACrB,IAAIC,EAAMf,EAAGpH,EAAG9B,EAAI,IAAKgG,EAAK2D,EAAU7H,EAAEO,SAASrC,EAAI,GAAIA,EAAI,GAAKiK,KAAuB,KAAff,EAAGpH,EAAG9B,EAAI,KAAakK,EAAKlK,EAAI,GAAKiK,EAAKE,EAAKhB,EAAGrH,EAAG9B,EAAI,IACjII,EAAK4J,GAAW,YAANG,EAAmBC,EAAKtI,EAAGoI,GAAM,CAACC,EAAIhB,EAAGrH,EAAG9B,EAAI,IAAKmJ,EAAGrH,EAAG9B,EAAI,KAAMqK,EAAKjK,EAAG,GAAIkK,EAAKlK,EAAG,GAAImK,EAAMnK,EAAG,GACpH,MAAO,CAAC8I,EAAGpH,EAAG9B,EAAI,IAAKqK,EAAIC,EAAItE,EAAIkE,EAAKhB,EAAGpH,EAAG9B,EAAI,IAAMkJ,EAAGpH,EAAG9B,EAAI,IAAKuK,EAC3E,EAEIH,EAAO,SAAUtI,EAAG9B,GACpB,KAAmB,GAAZkJ,EAAGpH,EAAG9B,GAASA,GAAK,EAAIkJ,EAAGpH,EAAG9B,EAAI,IAEzC,MAAO,CAACoJ,EAAGtH,EAAG9B,EAAI,IAAKoJ,EAAGtH,EAAG9B,EAAI,GAAIoJ,EAAGtH,EAAG9B,EAAI,IACnD,EAwrBIwK,EAA8B,mBAAlBC,eAA+BA,eAAsC,mBAAdC,WAA2BA,WAAa,SAAU1E,GAAMA,GAAK,EAC7H,SAAS2E,EAAM9C,EAAMkB,EAAM5B,GACzBA,IACDA,EAAK4B,EAAMA,EAAO,IACL,mBAAN5B,GACP5E,EAAI,GACR,IAAIqI,EAAO,GACPC,EAAO,WACP,IAAK,IAAI5K,EAAI,EAAGA,EAAI2K,EAAK9J,SAAUb,EAC/B2K,EAAK3K,IACjB,EACQ6K,EAAQ,CAAA,EACRC,EAAM,SAAUnJ,EAAG5B,GACnBwK,GAAG,WAAcrD,EAAGvF,EAAG5B,EAAG,GAClC,EACIwK,GAAG,WAAcO,EAAM5D,CAAK,IAE5B,IADA,IAAI/E,EAAIyF,EAAK/G,OAAS,GACA,WAAfqI,EAAGtB,EAAMzF,KAAmBA,EAC/B,IAAKA,GAAKyF,EAAK/G,OAASsB,EAAI,MAExB,OADA2I,EAAIxI,EAAI,GAAI,EAAG,GAAI,MACZsI,EAIf,IAAIG,EAAM9B,EAAGrB,EAAMzF,EAAI,GACvB,GAAI4I,EAAK,CACL,IAAI/F,EAAI+F,EACJhJ,EAAImH,EAAGtB,EAAMzF,EAAI,IACjB4H,EAAS,YAALhI,GAAwB,OAALiD,EAC3B,GAAI+E,EAAG,CACH,IAAIiB,EAAK9B,EAAGtB,EAAMzF,EAAI,KACtB4H,EAAoB,WAAhBb,EAAGtB,EAAMoD,MAEThG,EAAI+F,EAAM7B,EAAGtB,EAAMoD,EAAK,IACxBjJ,EAAImH,EAAGtB,EAAMoD,EAAK,IAEzB,CA6CD,IA5CA,IAAIC,EAAOnC,GAAQA,EAAKoC,OACpBC,EAAU,SAAUnL,GACpB,IAAIG,EAAK2J,EAAGlC,EAAM7F,EAAGgI,GAAIqB,EAAMjL,EAAG,GAAIiK,EAAKjK,EAAG,GAAIkK,EAAKlK,EAAG,GAAI4F,EAAK5F,EAAG,GAAIkL,EAAKlL,EAAG,GAAImK,EAAMnK,EAAG,GAAIJ,EAAI8J,EAAKjC,EAAM0C,GAClHvI,EAAIsJ,EACJ,IAAIC,EAAM,SAAUnJ,EAAGN,GACfM,GACAyI,IACAE,EAAI3I,EAAG,QAGHN,IACAgJ,EAAM9E,GAAMlE,KACTkJ,GACHD,EAAI,KAAMD,GAElC,EACY,IAAKI,GAAQA,EAAK,CACdM,KAAMxF,EACN4C,KAAMyB,EACNoB,aAAcnB,EACdoB,YAAaL,IAEb,GAAKA,EAEA,GAAW,GAAPA,EAAU,CACf,IAAIM,EAAO9D,EAAKxF,SAASrC,EAAGA,EAAIqK,GAEhC,GAAIC,EAAK,QAAUD,EAAK,GAAMC,EAC1B,IACIiB,EAAI,KAAM/C,EAAYmD,EAAM,CAAEhD,IAAK,IAAIvJ,EAAGkL,KAC7C,CACD,MAAOlI,GACHmJ,EAAInJ,EAAG,KACV,MAGDwI,EAAKxC,KAn4CtB,SAAiBP,EAAMkB,EAAM5B,GAKhC,OAJKA,IACDA,EAAK4B,EAAMA,EAAO,IACL,mBAAN5B,GACP5E,EAAI,GACDuG,EAAMjB,EAAMkB,EAAM,CACrBR,IACD,SAAUqD,GAAM,OAAOnD,EAAID,EAAYoD,EAAG/D,KAAK,GAAIa,EAAKkD,EAAG/D,KAAK,QAAU,EAAGV,EACpF,CA23CkC0E,CAAQF,EAAM,CAAE/C,KAAM0B,GAAMiB,GAC7C,MAEGA,EAAIhJ,EAAI,GAAI,4BAA8B8I,EAAK,GAAI,WAhBnDE,EAAI,KAAMpJ,EAAI0F,EAAM7H,EAAGA,EAAIqK,SAmB/BkB,EAAI,KAAM,KAC1B,EACiBtL,EAAI,EAAGA,EAAIgF,IAAKhF,EACrBmL,GAEP,MAEGL,EAAI,KAAM,CAAA,GACd,OAAOF,CACX,CCliFe,SAASiB,EAAqBC,EAAOC,GAClD,OAUK,SAA2CD,GAChD,IAAIE,EAAOC,UAAUpL,OAAS,QAAsBqL,IAAjBD,UAAU,GAAmBA,UAAU,GAAK,CAAE,EAC/EE,EAAUH,EAAKd,OACbR,EAAQuB,UAAUpL,OAAS,EAAIoL,UAAU,QAAKC,EAIlD,OAAOxB,EAAM,IAAItL,WAAW0M,GAAQ,CAElCZ,OAAQ,SAAgBkB,GACtB,OAAID,GACKA,EAAQ,CACbE,KAAMD,EAAKb,MAIhB,GAEL,CA5BSe,CAAkCR,EAAOC,EAASQ,GAAY,EACvE,CA4BA,SAASA,EAAWC,GAClB,OAAO,IAAIC,SAAQ,SAAUC,EAASC,GAIpCjC,EAAM8B,GAAS,SAAUI,EAAO/B,GAC1B+B,EACFD,EAAOC,GAEPF,EAAQ7B,EAEhB,GACA,GACA,CC3De,SAASgC,EAAsCC,GAE5D,IADA,IAAIC,EAAmB,CAAA,EACdC,EAAK,EAAGC,EAAeC,OAAOC,KAAKL,GAAUE,EAAKC,EAAapM,OAAQmM,IAAM,CACpF,IAAII,EAAMH,EAAaD,GACvBD,EAAiBK,GAAO1D,EAAUoD,EAAQM,GAC3C,CACD,OAAOL,CACT,CCNe,SAASM,EAAsBrB,GAC5C,IAAIK,EAAOL,EAAKK,KAChB,OAAOA,EAAKiB,SAAS,SAAWjB,EAAKiB,SAAS,YAChD,CCWA,SAASC,EAAyBC,GAChC,OAAO3B,EAAqB2B,EAAa,CACvCtC,OAAQmC,IACPI,KAAKZ,EACV,CCzBO,SAASa,GAAUC,EAAMC,GAE9B,IADA,IAAI5N,EAAI,EACDA,EAAI2N,EAAKE,WAAWhN,QAAQ,CACjC,IAAIiN,EAAYH,EAAKE,WAAW7N,GAGhC,GAA2B,IAAvB8N,EAAUC,UAAkBC,GAAWF,KAAeF,EACxD,OAAOE,EAET9N,GACD,CACH,CACO,SAASiO,GAAaN,EAAMC,GAGjC,IAFA,IAAIM,EAAU,GACVlO,EAAI,EACDA,EAAI2N,EAAKE,WAAWhN,QAAQ,CACjC,IAAIiN,EAAYH,EAAKE,WAAW7N,GAGL,IAAvB8N,EAAUC,UAAkBC,GAAWF,KAAeF,GACxDM,EAAQ/F,KAAK2F,GAEf9N,GACD,CACD,OAAOkO,CACT,CACO,SAASC,GAAQR,EAAMC,EAASQ,GAMrC,IADA,IAAIpO,EAAI,EACDA,EAAI2N,EAAKE,WAAWhN,QAAQ,CACjC,IAAIiN,EAAYH,EAAKE,WAAW7N,GAC5B4N,EAGyB,IAAvBE,EAAUC,UAAkBC,GAAWF,KAAeF,GACxDQ,EAAKN,EAAW9N,GAGlBoO,EAAKN,EAAW9N,GAElBA,GACD,CACH,CAQA,IAAIqO,GAAoB,OACjB,SAASL,GAAWM,GAQzB,OAAOA,EAAQV,QAAQrH,QAAQ8H,GAAmB,GACpD,CAMO,SAASE,GAAqBD,GAEnC,IADA,IAAItO,EAAI,EACDA,EAAIsO,EAAQT,WAAWhN,QAAQ,CACpC,GALuB,IAKTyN,EAAQT,WAAW7N,GALvB+N,SAMR,OAAOO,EAAQT,WAAW7N,GAE5BA,GACD,CACH,CAGO,SAASwO,GAAYb,GAG1B,GAAsB,IAAlBA,EAAKI,SACP,OAAOJ,EAAKc,YAId,IAFA,IAAI7P,EAAM,IAAMoP,GAAWL,GACvBzN,EAAI,EACDA,EAAIyN,EAAKe,WAAW7N,QACzBjC,GAAO,IAAM+O,EAAKe,WAAWxO,GAAGqL,KAAzB,KAA4CoC,EAAKe,WAAWxO,GAAGyO,MAAQ,IAC9EzO,IAEFtB,GAAO,IAEP,IADA,IAAIoB,EAAI,EACDA,EAAI2N,EAAKE,WAAWhN,QACzBjC,GAAO4P,GAAYb,EAAKE,WAAW7N,IACnCA,IAGF,OADApB,GAAO,KAAOoP,GAAWL,GAAQ,GAEnC,CC1BO,SAASiB,GAAiBC,GAK/B,IDjCiCT,EAC7BF,ECgCAY,EAAMD,EAASE,gBACnB,ODlCiCX,ECkCX,SAAUY,GAC9B,IAAIzK,EAAImJ,GAAUsB,EAAQ,KAC1B,GAAIzK,EACF,OAAOA,EAAEkK,YAEX,IAAIE,EAAQ,GAIZ,OAHAR,GAAQa,EAAQ,KAAK,SAAU/O,GAC7B0O,GAASjB,GAAUzN,EAAG,KAAKwO,WACjC,IACWE,CACX,ED3CMT,EAAU,GACdC,GCgCWW,EAAK,MDhCO,SAAUnB,EAAM3N,GACrCkO,EAAQ/F,KAAKiG,EAAKT,EAAM3N,GAC5B,IACSkO,CCwCT,CC3FA,SAASe,GAAgClN,EAAGmN,GAAkB,IAAIC,EAAuB,oBAAXC,QAA0BrN,EAAEqN,OAAOC,WAAatN,EAAE,cAAe,GAAIoN,EAAI,OAAQA,EAAKA,EAAGG,KAAKvN,IAAIwN,KAAKC,KAAKL,GAAK,GAAIM,MAAMC,QAAQ3N,KAAOoN,EACxN,SAAqCpN,EAAG4N,GAAU,IAAK5N,EAAG,OAAQ,GAAiB,iBAANA,EAAgB,OAAO6N,GAAkB7N,EAAG4N,GAAS,IAAIvL,EAAI8I,OAAOvG,UAAUT,SAASoJ,KAAKvN,GAAGqE,MAAM,GAAI,GAAc,WAANhC,GAAkBrC,EAAEqG,cAAahE,EAAIrC,EAAEqG,YAAYmD,MAAM,GAAU,QAANnH,GAAqB,QAANA,EAAa,OAAOqL,MAAMI,KAAK9N,GAAI,GAAU,cAANqC,GAAqB,2CAA2C0L,KAAK1L,GAAI,OAAOwL,GAAkB7N,EAAG4N,EAAU,CADnMI,CAA4BhO,KAAOmN,GAAkBnN,GAAyB,iBAAbA,EAAElB,OAAqB,CAAMsO,IAAIpN,EAAIoN,GAAI,IAAInP,EAAI,EAAG,OAAO,WAAc,OAAIA,GAAK+B,EAAElB,OAAe,CAAEmP,MAAM,GAAe,CAAEA,MAAM,EAAOrB,MAAO5M,EAAE/B,KAAO,CAAK,CAAC,MAAM,IAAIiQ,UAAU,wIAA2I,CAE5lB,SAASL,GAAkBM,EAAKC,IAAkB,MAAPA,GAAeA,EAAMD,EAAIrP,UAAQsP,EAAMD,EAAIrP,QAAQ,IAAK,IAAIb,EAAI,EAAGoQ,EAAO,IAAIX,MAAMU,GAAMnQ,EAAImQ,EAAKnQ,IAAKoQ,EAAKpQ,GAAKkQ,EAAIlQ,GAAI,OAAOoQ,CAAO,CAIpK,SAASC,GAAqBvR,EAASF,GAoBpD,IAnBA,IAmBuE0R,EAnBnEC,EAAO3R,EAAIC,eAAeC,GAK1B0R,EDkFG9C,GClFwC6C,EDiFvBxB,gBACG,cCjFvB0B,EAAYC,QAAQF,IAAuE,MAAhDA,EAAmBG,aAAa,YAY3EC,EAAS,GACJC,EAAY5B,GD0EhB,SAAmBJ,GAGxB,OAAOZ,GADMP,GADEmB,EAASE,gBACS,UACL,QAC9B,CC9EuD+B,CAAUP,MAAiBD,EAAQO,KAAab,MAAO,CAC1G,IAAIe,EAAQT,EAAM3B,MACdoC,EAAMJ,aAAa,SACrBC,EAAOzI,KAAK,CACVlB,GAAI8J,EAAMJ,aAAa,WACvBpF,KAAMwF,EAAMJ,aAAa,QACzBK,WAAYD,EAAMJ,aAAa,SAGpC,CACD,MAAO,CACLF,UAAWA,EACXG,OAAQA,EAEZ,CC7Be,SAASK,GAAenS,EAASF,GAS9C,IAAIiQ,EAAWjQ,EAAIC,eAAeC,GAC9BoS,EAAY,CACdN,OAAQ,CAAE,EACVO,mBAAejF,EACfkF,YAAQlF,GA0BV,OF8CK,SAA0B2C,GAE/B,OAAOZ,GADaY,EAASE,gBACM,eACrC,CE1DEsC,CAAiBxC,GAAUV,SAfL,SAAyBmD,GAC7C,IAAIC,EAAWD,EAAaX,aAAa,UAEzC,OADeW,EAAaX,aAAa,SAEvC,IAAK,6EACHO,EAAUE,OAASI,GAAYD,GAC/B,MACF,IAAK,oFACHL,EAAUC,cAAgBK,GAAYD,GACtC,MACF,IAAK,gFACHL,EAAUN,OAAOU,EAAaX,aAAa,OAASa,GAAYD,GAGxE,IAUSL,CACT,CACA,SAASM,GAAYnF,GAQnB,MAAgB,MAAZA,EAAK,GACAA,EAAKjG,MAAM,GAOb,MAAQiG,CACjB,CCrEA,SAASoF,GAAQ1P,GAAgC,OAAO0P,GAAU,mBAAqBrC,QAAU,iBAAmBA,OAAOC,SAAW,SAAUtN,GAAK,cAAcA,GAAO,SAAUA,GAAK,OAAOA,GAAK,mBAAqBqN,QAAUrN,EAAEqG,cAAgBgH,QAAUrN,IAAMqN,OAAOzI,UAAY,gBAAkB5E,CAAE,EAAI0P,GAAQ1P,EAAK,CAC9T,SAAS2P,GAAQvP,EAAGlC,GAAK,IAAIsE,EAAI2I,OAAOC,KAAKhL,GAAI,GAAI+K,OAAOyE,sBAAuB,CAAE,IAAI5P,EAAImL,OAAOyE,sBAAsBxP,GAAIlC,IAAM8B,EAAIA,EAAEmJ,QAAO,SAAUjL,GAAK,OAAOiN,OAAO0E,yBAAyBzP,EAAGlC,GAAG4R,UAAW,KAAMtN,EAAE4D,KAAKyB,MAAMrF,EAAGxC,EAAG,CAAG,OAAOwC,CAAI,CAC/P,SAASuN,GAAc3P,GAAK,IAAK,IAAIlC,EAAI,EAAGA,EAAIgM,UAAUpL,OAAQZ,IAAK,CAAE,IAAIsE,EAAI,MAAQ0H,UAAUhM,GAAKgM,UAAUhM,GAAK,CAAE,EAAEA,EAAI,EAAIyR,GAAQxE,OAAO3I,IAAI,GAAI4J,SAAQ,SAAUlO,GAAK8R,GAAgB5P,EAAGlC,EAAGsE,EAAEtE,GAAM,IAAIiN,OAAO8E,0BAA4B9E,OAAO+E,iBAAiB9P,EAAG+K,OAAO8E,0BAA0BzN,IAAMmN,GAAQxE,OAAO3I,IAAI4J,SAAQ,SAAUlO,GAAKiN,OAAOgF,eAAe/P,EAAGlC,EAAGiN,OAAO0E,yBAAyBrN,EAAGtE,GAAI,GAAM,CAAC,OAAOkC,CAAI,CACvb,SAAS4P,GAAgBI,EAAK/E,EAAKuB,GAA4L,OAAnLvB,EAC5C,SAAwBgF,GAAO,IAAIhF,EACnC,SAAsBtB,EAAOuG,GAAQ,GAAuB,WAAnBZ,GAAQ3F,IAAiC,OAAVA,EAAgB,OAAOA,EAAO,IAAIwG,EAAOxG,EAAMsD,OAAOmD,aAAc,QAAarG,IAAToG,EAAoB,CAAE,IAAIE,EAAMF,EAAKhD,KAAKxD,EAAOuG,GAAQ,WAAY,GAAqB,WAAjBZ,GAAQe,GAAmB,OAAOA,EAAK,MAAM,IAAIvC,UAAU,+CAAkD,CAAC,OAAiB,WAAToC,EAAoB7I,OAASiJ,QAAQ3G,EAAS,CADpV4G,CAAaN,EAAK,UAAW,MAAwB,WAAjBX,GAAQrE,GAAoBA,EAAM5D,OAAO4D,EAAO,CAD3EuF,CAAevF,MAAiB+E,EAAOjF,OAAOgF,eAAeC,EAAK/E,EAAK,CAAEuB,MAAOA,EAAOkD,YAAY,EAAMe,cAAc,EAAMC,UAAU,IAAkBV,EAAI/E,GAAOuB,EAAgBwD,CAAM,CAQ7N,SAASW,GAAYhU,EAASF,GAC3C,IAAKE,EACH,MAAO,GAKT,IH+B4B+P,EAExBkE,EGjCAC,EAAMpU,EAAIC,eAAeC,GACzBmU,GH8BwBpE,EG9BGmE,EHgC3BD,EAAerF,GADFmB,EAASE,gBACe,gBACrCgE,EACK9E,GAAa8E,EAAc,MAE7B,IGpC6BG,IAAIC,IACpCC,EH6CC,SAA0BvE,GAC/B,IAEIwE,EAAU3F,GAFGmB,EAASE,gBAEU,WACpC,OAAIsE,EACKpF,GAAaoF,EAAS,UAExB,EACT,CGrDsBC,CAAiBN,GAAKE,IAAIK,IAAwBC,QAAO,SAAUC,EAASC,GAI9F,OADAD,EAAQC,EAAOzM,IAAMyM,EACdD,CACR,GAAE,IAOH,OHyBK,SAAuB5E,GAC5B,IACI8E,EAAUjG,GADGmB,EAASE,gBACU,WACpC,OAAK4E,EAGE1F,GAAa0F,EAAS,MAFpB,EAGX,CGhCSC,CAAcZ,GAAKE,KANP,SAAsBW,GACvC,OAAIA,EAAGC,aAAa,QACXhC,GAAcA,GAAc,CAAE,EAAEmB,EAAWY,EAAGE,OAAQZ,GAAeU,EAAIT,IAE3ED,GAAeU,EAAIT,EAC9B,GAEA,CACA,SAASG,GAAuBS,GAC9B,MAAO,CACL/M,GAAI+M,EAAOrD,aAAa,YACxBsD,SAAUD,EAAOrD,aAAa,cAElC,CAGA,SAASwC,GAAeU,EAAIR,GAC1B,IAAIa,EAAQ,CAAA,EACZ,GAAIL,EAAGC,aAAa,YAAa,CAC/B,IAAIK,EAAiBN,EAAGlD,aAAa,YAGjC0C,EAAQc,GACVD,EAAME,aAAef,EAAQc,GAE7BD,EAAME,aAAe,CACnBnN,GAAIkN,EAGT,CACD,OAAOD,CACT,CCiBA,IAAIG,GAA6C,GAC7CC,GAAuB,EACvBC,GAAiC,EAsDjCC,GAAM,MACNC,GAAe,ICnInB,SAASxF,GAAgClN,EAAGmN,GAAkB,IAAIC,EAAuB,oBAAXC,QAA0BrN,EAAEqN,OAAOC,WAAatN,EAAE,cAAe,GAAIoN,EAAI,OAAQA,EAAKA,EAAGG,KAAKvN,IAAIwN,KAAKC,KAAKL,GAAK,GAAIM,MAAMC,QAAQ3N,KAAOoN,EACxN,SAAqCpN,EAAG4N,GAAU,IAAK5N,EAAG,OAAQ,GAAiB,iBAANA,EAAgB,OAAO6N,GAAkB7N,EAAG4N,GAAS,IAAIvL,EAAI8I,OAAOvG,UAAUT,SAASoJ,KAAKvN,GAAGqE,MAAM,GAAI,GAAc,WAANhC,GAAkBrC,EAAEqG,cAAahE,EAAIrC,EAAEqG,YAAYmD,MAAM,GAAU,QAANnH,GAAqB,QAANA,EAAa,OAAOqL,MAAMI,KAAK9N,GAAI,GAAU,cAANqC,GAAqB,2CAA2C0L,KAAK1L,GAAI,OAAOwL,GAAkB7N,EAAG4N,EAAU,CADnMI,CAA4BhO,KAAOmN,GAAkBnN,GAAyB,iBAAbA,EAAElB,OAAqB,CAAMsO,IAAIpN,EAAIoN,GAAI,IAAInP,EAAI,EAAG,OAAO,WAAc,OAAIA,GAAK+B,EAAElB,OAAe,CAAEmP,MAAM,GAAe,CAAEA,MAAM,EAAOrB,MAAO5M,EAAE/B,KAAO,CAAK,CAAC,MAAM,IAAIiQ,UAAU,wIAA2I,CAE5lB,SAASL,GAAkBM,EAAKC,IAAkB,MAAPA,GAAeA,EAAMD,EAAIrP,UAAQsP,EAAMD,EAAIrP,QAAQ,IAAK,IAAIb,EAAI,EAAGoQ,EAAO,IAAIX,MAAMU,GAAMnQ,EAAImQ,EAAKnQ,IAAKoQ,EAAKpQ,GAAKkQ,EAAIlQ,GAAI,OAAOoQ,CAAO,CAanL,IAAIsE,GAAqC,iBAuBrCC,GAA0C,MAC1CC,GAAQ,CAAA,EACG,SAASC,GAAmBZ,GACzC,GAAIA,KAAYW,GACd,OAAOA,GAAMX,GAEf,IAAIa,EAIN,SAAsBb,GAIpBA,EAAWA,EAASc,cAIpBd,EAAWA,EAAS1N,QAAQmO,GAAoC,IAKhET,EAAWA,EAAS1N,QAAQoO,GAAyC,IAIrE,IAAIK,EAASf,EAASzN,MAAM,OAK5B,GAAIwO,EAAOnU,OAAS,EAClB,OAAO,EAET,IAAK,IAAyDyP,EAArDO,EAAY5B,GAAgC+F,KAAkB1E,EAAQO,KAAab,MAAO,CACjG,IAAIiF,EAAQ3E,EAAM3B,MAGlB,GAAIuG,GAAqB7O,QAAQ4O,GAAS,EACxC,OAAO,CAEV,CACD,OAAO,CACT,CAtCeE,CAAalB,GAE1B,OADAW,GAAMX,GAAYa,EACXA,CACT,CAuCA,IAAII,GAAuB,CAE3B,KAEA,KAEA,IAEA,KAEA,KAEA,KAEA,IAEA,KAEA,IAEA,KAEA,MAEA,OAEA,KAEA,OAOA,KClFA,IA2BIE,GAAgE,CAAC,GAErE,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,IAKIC,GAAqD,CAAC,GAE1D,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,IA6BIC,GArI8C,CAAC,GAEnD,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,IA+G2EC,OAE3EH,IAA+DG,OAE/DF,GAAmDnK,QAAO,SAAUiJ,GAClE,OAAOiB,GAA8D/O,QAAQ8N,GAAkB,CACjG,KAAIoB,OA9BuC,CAAC,GAE5C,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,GAEA,IAYqCrK,QAAO,SAAUiJ,GACpD,OAAOiB,GAA8D/O,QAAQ8N,GAAkB,CACjG,IAAGjJ,QAAO,SAAUiJ,GAClB,OAAOkB,GAAmDhP,QAAQ8N,GAAkB,CACtF,KCpLe,SAASqB,GAAe7G,EAAOrK,EAAM0H,GAClD,IAAIyJ,EAAuBzJ,EAAKyJ,qBAC9BC,EAAqB1J,EAAK0J,mBAC1BC,EAAa3J,EAAK2J,WAClBvE,EAASpF,EAAKoF,OACdD,EAAgBnF,EAAKmF,cACrBV,EAAYzE,EAAKyE,UACjB1E,EAAUC,EAAKD,QAajB,OAZKzH,IAGHA,EAAO,KASDA,GAKN,IAAK,MACHqK,EAAQiH,GAAYjH,EAAO5C,GAC3B,MAKF,IAAK,YAEH,QAAcG,KADdyC,EAAQ8G,KAEN,MAAM,IAAI/S,MAAM,qDAAuD6S,OAAOG,MAEhF/G,EAAQiH,GAAYjH,EAAO5C,GAC3B,MAOF,IAAK,IAKH,IAAI8J,EAAoBpD,OAAO9D,GAC/B,GAAImH,MAAMD,GACR,MAAM,IAAInT,MAAM,kCAAoC6S,OAAO5G,IAE7D,GAAIkH,GAAqB1E,EAActQ,OACrC,MAAM,IAAI6B,MAAM,2CAA6C6S,OAAO5G,IAGtEA,EAAQiH,GADRjH,EAAQwC,EAAc0E,GACK9J,GAC3B,MAIF,IAAK,IACH,GAAc,MAAV4C,EACFA,GAAQ,MACH,IAAc,MAAVA,EAGT,MAAM,IAAIjM,MAAM,qCAAuC6S,OAAO5G,IAF9DA,GAAQ,CAGT,CACD,MAIF,IAAK,IACHA,OAAQzC,EACR,MAMF,IAAK,IACHyC,EAuDN,SAAqBoH,GAGnB,OAAQA,GACN,KAAK,EACH,MAAO,SACT,KAAK,EACH,MAAO,UACT,KAAK,GACH,MAAO,UACT,KAAK,GACH,MAAO,QACT,KAAK,GACH,MAAO,SACT,KAAK,GACH,MAAO,QACT,KAAK,GACH,MAAO,OACT,KAAK,GACH,MAAO,gBACT,QAEE,MAAO,UAAUR,OAAOQ,GAE9B,CA/EcC,CAAYrH,GACpB,MAOF,IAAK,IACH,QAAczC,IAAVyC,EACF,MAEF,IAAIsH,EAAa,IAAIC,KAAKvH,GAC1B,GAAImH,MAAMG,EAAWE,WACnB,MAAM,IAAIzT,MAAM,kCAAoC6S,OAAO5G,IAE7DA,EAAQsH,EACR,MAGF,IAAK,IACH,QAAc/J,IAAVyC,EACF,MAIF,IAAIyH,EAAUT,IACd,GAAIS,GD5GK,SAA2BA,EAAShF,EAAQrF,GACzD,GAAIqK,EAAS,CACX,IAAIlC,EAAQ9C,EAAOgF,GACnB,IAAKlC,EACH,MAAM,IAAIxR,MAAM,yBAAyB6S,OAAOa,IAElD,IAAKlC,EAAME,aACT,OAAO,EAET,GAEAkB,GAAyBjP,QAAQoM,OAAOyB,EAAME,aAAanN,MAAQ,GAGnE8E,EAAQsK,YAAcnC,EAAME,aAAaH,WAAalI,EAAQsK,aAGlC,IAA5BtK,EAAQuK,iBAA6BpC,EAAME,aAAaH,UAAYkB,GAAajB,EAAME,aAAaH,UAClG,OAAO,CAEV,CACH,CCuFqBsC,CAAkBH,EAAShF,EAAQrF,GAIhD4C,EHhHO,SAAwB6H,EAAiBzK,GAsBlDA,GAAWA,EAAQ0E,YAErB+F,GAAmB,EAAgB/B,GAAeH,GAAuBC,IAE3E,IAAIkC,EAAsBnC,GAAuBC,GAAiC,GAAgBE,GAAeJ,GACjH,OAAO,IAAI6B,KAAKvS,KAAK+S,OAAOF,EAAkBC,GAAuBjC,IACvE,CGoFgBmC,CAFRhI,EAAQiI,GAAmBjI,GAEG,CAC5B8B,UAAWA,SAOb9B,GADkB5C,EAAQ8K,aAAeD,IACrBjI,GAEtB,MACF,QACE,MAAM,IAAIsB,UAAU,4BAA4BsF,OAAOjR,IAO3D,YAHc4H,IAAVyC,IACFA,EAAQ,MAEHA,CACT,CA6BA,SAASiH,GAAYjH,EAAO5C,GAW1B,OANqB,IAAjBA,EAAQ9M,OACV0P,EAAQA,EAAM1P,QAEF,KAAV0P,IACFA,OAAQzC,GAEHyC,CACT,CAQA,SAASiI,GAAmBE,GAC1B,IAAIC,EAAetE,OAAOqE,GAC1B,GAAIhB,MAAMiB,GACR,MAAM,IAAIrU,MAAM,iCAAmC6S,OAAOuB,IAE5D,OAAOC,CACT,CClMA,SAASC,GAAe9G,EAAKlQ,GAAK,OAKlC,SAAyBkQ,GAAO,GAAIT,MAAMC,QAAQQ,GAAM,OAAOA,CAAM,CAL5B+G,CAAgB/G,IAIzD,SAA+BjQ,EAAGa,GAAK,IAAIyD,EAAI,MAAQtE,EAAI,KAAO,oBAAsBmP,QAAUnP,EAAEmP,OAAOC,WAAapP,EAAE,cAAe,GAAI,MAAQsE,EAAG,CAAE,IAAIpC,EAAGiC,EAAGpE,EAAGkX,EAAGvV,EAAI,GAAIyB,GAAI,EAAIrB,GAAI,EAAI,IAAM,GAAI/B,GAAKuE,EAAIA,EAAE+K,KAAKrP,IAAIsP,KAAM,IAAMzO,EAAG,CAAE,GAAIoM,OAAO3I,KAAOA,EAAG,OAAQnB,GAAI,CAAK,MAAM,OAASA,GAAKjB,EAAInC,EAAEsP,KAAK/K,IAAIyL,QAAUrO,EAAEwG,KAAKhG,EAAEwM,OAAQhN,EAAEd,SAAWC,GAAIsC,GAAI,IAAO,MAAOnD,GAAK8B,GAAI,EAAIqC,EAAInE,CAAE,SAAa,IAAM,IAAKmD,GAAK,MAAQmB,EAAU,SAAM2S,EAAI3S,EAAU,SAAK2I,OAAOgK,KAAOA,GAAI,MAAS,CAAA,QAAW,GAAInV,EAAG,MAAMqC,CAAI,CAAA,CAAG,OAAOzC,CAAE,CAAI,CAJzdwV,CAAsBjH,EAAKlQ,IAE5F,SAAqC+B,EAAG4N,GAAU,IAAK5N,EAAG,OAAQ,GAAiB,iBAANA,EAAgB,OAAO6N,GAAkB7N,EAAG4N,GAAS,IAAIvL,EAAI8I,OAAOvG,UAAUT,SAASoJ,KAAKvN,GAAGqE,MAAM,GAAI,GAAc,WAANhC,GAAkBrC,EAAEqG,cAAahE,EAAIrC,EAAEqG,YAAYmD,MAAM,GAAU,QAANnH,GAAqB,QAANA,EAAa,OAAOqL,MAAMI,KAAK9N,GAAI,GAAU,cAANqC,GAAqB,2CAA2C0L,KAAK1L,GAAI,OAAOwL,GAAkB7N,EAAG4N,EAAU,CAF9TI,CAA4BG,EAAKlQ,IACnI,WAA8B,MAAM,IAAIiQ,UAAU,4IAA+I,CADxDmH,EAAqB,CAG9J,SAASxH,GAAkBM,EAAKC,IAAkB,MAAPA,GAAeA,EAAMD,EAAIrP,UAAQsP,EAAMD,EAAIrP,QAAQ,IAAK,IAAIb,EAAI,EAAGoQ,EAAO,IAAIX,MAAMU,GAAMnQ,EAAImQ,EAAKnQ,IAAKoQ,EAAKpQ,GAAKkQ,EAAIlQ,GAAI,OAAOoQ,CAAO,CAGpK,SAASiH,GAAqBC,GAE3C,IACEC,EAAyBP,GADCM,EAAkB9Q,MAAM,SACa,GAC/DgR,EAASD,EAAuB,GAChCE,EAAMF,EAAuB,GAC/B,MAAO,CAEP9E,OAAOgF,GAIPC,GAAiCF,EAAOvY,QAC1C,CAGA,IAAI0Y,GAAU,CAAC,GAAI,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,KAIhJ,SAASD,GAAiCE,GAIxC,IAFA,IAAIxT,EAAI,EACJpE,EAAI,EACDA,EAAI4X,EAAc/W,QACvBuD,GAAK,GACLA,GAAKuT,GAAQtR,QAAQuR,EAAc5X,IACnCA,IAEF,OAAOoE,CACT,CCNe,SAASyT,GAAUvJ,EAASwJ,EAAe3G,EAAeC,EAAQX,EAAW1E,GAC1F,IAAIgM,EAAcV,GAAqB/I,EAAQqC,aAAa,MACxDqH,ETNC,SAA6BnJ,EAAUP,GAC5C,OAAOZ,GAAUY,EAAS,IAC5B,CSIqB2J,CAAoBH,EAAexJ,GAMlDK,EAAQqJ,GAAgBA,EAAavJ,YACrCnK,EAAOgK,EAAQqC,aAAa,KAChC,MAAO,CACL8G,IAAKM,EAAY,GACjBP,OAAQO,EAAY,GACpBpJ,MAAO6G,GAAe7G,EAAOrK,EAAM,CACjCmR,qBAAsB,WACpB,OThBD,SAAkC5G,EAAUP,GAKjD,IAAI4J,EAAoB3J,GAAqBD,GAC7C,GAAI4J,GAAuD,OAAlClK,GAAWkK,GAA6B,CAC/D,IAAIC,EAAqC5J,GAAqB2J,GAC9D,GAAIC,GAAyF,MAAnDnK,GAAWmK,GACnD,OAAOA,EAAmC1J,WAE7C,CACH,CSIe2J,CAAyBN,EAAexJ,EAChD,EACDoH,mBAAoB,WAClB,OAAOlH,GAAYF,EACpB,EACDqH,WAAY,WACV,OAAOrH,EAAQqC,aAAa,IAC7B,EACDS,OAAQA,EACRD,cAAeA,EACfV,UAAWA,EACX1E,QAASA,IAGf,CCzDe,SAASsM,GAAWP,EAAe3G,EAAeC,EAAQX,EAAW1E,GAClF,IAAIuM,EVCC,SAAyBzJ,GAC9B,IACI0J,EAAY7K,GADAmB,EAASE,gBACY,aACjCuJ,EAAQ,GAMZ,OALAnK,GAAQoK,EAAW,OAAO,SAAUd,GAClCtJ,GAAQsJ,EAAK,KAAK,SAAUe,GAC1BF,EAAMnQ,KAAKqQ,EACjB,GACA,IACSF,CACT,CUXcG,CAAgBX,GAC5B,OAAqB,IAAjBQ,EAAMzX,OACD,GAiBFyX,EAAMpF,KAAI,SAAU5E,GACzB,OAAOuJ,GAAUvJ,EAASwJ,EAAe3G,EAAeC,EAAQX,EAAW1E,EAC/E,GACA,CCzBA,SAASiL,GAAe9G,EAAKlQ,GAAK,OAKlC,SAAyBkQ,GAAO,GAAIT,MAAMC,QAAQQ,GAAM,OAAOA,CAAM,CAL5B+G,CAAgB/G,IAIzD,SAA+BjQ,EAAGa,GAAK,IAAIyD,EAAI,MAAQtE,EAAI,KAAO,oBAAsBmP,QAAUnP,EAAEmP,OAAOC,WAAapP,EAAE,cAAe,GAAI,MAAQsE,EAAG,CAAE,IAAIpC,EAAGiC,EAAGpE,EAAGkX,EAAGvV,EAAI,GAAIyB,GAAI,EAAIrB,GAAI,EAAI,IAAM,GAAI/B,GAAKuE,EAAIA,EAAE+K,KAAKrP,IAAIsP,KAAM,IAAMzO,EAAG,CAAE,GAAIoM,OAAO3I,KAAOA,EAAG,OAAQnB,GAAI,CAAK,MAAM,OAASA,GAAKjB,EAAInC,EAAEsP,KAAK/K,IAAIyL,QAAUrO,EAAEwG,KAAKhG,EAAEwM,OAAQhN,EAAEd,SAAWC,GAAIsC,GAAI,IAAO,MAAOnD,GAAK8B,GAAI,EAAIqC,EAAInE,CAAE,SAAa,IAAM,IAAKmD,GAAK,MAAQmB,EAAU,SAAM2S,EAAI3S,EAAU,SAAK2I,OAAOgK,KAAOA,GAAI,MAAS,CAAA,QAAW,GAAInV,EAAG,MAAMqC,CAAI,CAAA,CAAG,OAAOzC,CAAE,CAAI,CAJzdwV,CAAsBjH,EAAKlQ,IAE5F,SAAqC+B,EAAG4N,GAAU,IAAK5N,EAAG,OAAQ,GAAiB,iBAANA,EAAgB,OAAO6N,GAAkB7N,EAAG4N,GAAS,IAAIvL,EAAI8I,OAAOvG,UAAUT,SAASoJ,KAAKvN,GAAGqE,MAAM,GAAI,GAAc,WAANhC,GAAkBrC,EAAEqG,cAAahE,EAAIrC,EAAEqG,YAAYmD,MAAM,GAAU,QAANnH,GAAqB,QAANA,EAAa,OAAOqL,MAAMI,KAAK9N,GAAI,GAAU,cAANqC,GAAqB,2CAA2C0L,KAAK1L,GAAI,OAAOwL,GAAkB7N,EAAG4N,EAAU,CAF9TI,CAA4BG,EAAKlQ,IACnI,WAA8B,MAAM,IAAIiQ,UAAU,4IAA+I,CADxDmH,EAAqB,CAG9J,SAASxH,GAAkBM,EAAKC,IAAkB,MAAPA,GAAeA,EAAMD,EAAIrP,UAAQsP,EAAMD,EAAIrP,QAAQ,IAAK,IAAIb,EAAI,EAAGoQ,EAAO,IAAIX,MAAMU,GAAMnQ,EAAImQ,EAAKnQ,IAAKoQ,EAAKpQ,GAAKkQ,EAAIlQ,GAAI,OAAOoQ,CAAO,CAQpK,SAASsI,GAAqBZ,GAC3C,IAAIa,EX8BC,SAAuB9J,GAC5B,IACI8J,EAAajL,GADDmB,EAASE,gBACa,aACtC,GAAI4J,EACF,OAAOA,EAAWhI,aAAa,MAEnC,CWpCmBiI,CAAcd,GAC/B,GAAIa,EAoBF,OAH0B,KAhB1BA,EAAaA,EAAWnS,MAAM,KAAK0M,IAAImE,IAAsBnE,KAAI,SAAUlH,GACzE,IAAI6M,EAAQ7B,GAAehL,EAAM,GAGjC,MAAO,CACLyL,IAHMoB,EAAM,GAIZrB,OAHSqB,EAAM,GAKvB,KAQmBhY,SACb8X,EAAa,CAACA,EAAW,GAAIA,EAAW,KAEnCA,CAEX,CCnCA,SAAS1J,GAAgClN,EAAGmN,GAAkB,IAAIC,EAAuB,oBAAXC,QAA0BrN,EAAEqN,OAAOC,WAAatN,EAAE,cAAe,GAAIoN,EAAI,OAAQA,EAAKA,EAAGG,KAAKvN,IAAIwN,KAAKC,KAAKL,GAAK,GAAIM,MAAMC,QAAQ3N,KAAOoN,EACxN,SAAqCpN,EAAG4N,GAAU,IAAK5N,EAAG,OAAQ,GAAiB,iBAANA,EAAgB,OAAO6N,GAAkB7N,EAAG4N,GAAS,IAAIvL,EAAI8I,OAAOvG,UAAUT,SAASoJ,KAAKvN,GAAGqE,MAAM,GAAI,GAAc,WAANhC,GAAkBrC,EAAEqG,cAAahE,EAAIrC,EAAEqG,YAAYmD,MAAM,GAAU,QAANnH,GAAqB,QAANA,EAAa,OAAOqL,MAAMI,KAAK9N,GAAI,GAAU,cAANqC,GAAqB,2CAA2C0L,KAAK1L,GAAI,OAAOwL,GAAkB7N,EAAG4N,EAAU,CADnMI,CAA4BhO,KAAOmN,GAAkBnN,GAAyB,iBAAbA,EAAElB,OAAqB,CAAMsO,IAAIpN,EAAIoN,GAAI,IAAInP,EAAI,EAAG,OAAO,WAAc,OAAIA,GAAK+B,EAAElB,OAAe,CAAEmP,MAAM,GAAe,CAAEA,MAAM,EAAOrB,MAAO5M,EAAE/B,KAAO,CAAK,CAAC,MAAM,IAAIiQ,UAAU,wIAA2I,CAE5lB,SAASL,GAAkBM,EAAKC,IAAkB,MAAPA,GAAeA,EAAMD,EAAIrP,UAAQsP,EAAMD,EAAIrP,QAAQ,IAAK,IAAIb,EAAI,EAAGoQ,EAAO,IAAIX,MAAMU,GAAMnQ,EAAImQ,EAAKnQ,IAAKoQ,EAAKpQ,GAAKkQ,EAAIlQ,GAAI,OAAOoQ,CAAO,CCFnL,SAASnB,GAAgClN,EAAGmN,GAAkB,IAAIC,EAAuB,oBAAXC,QAA0BrN,EAAEqN,OAAOC,WAAatN,EAAE,cAAe,GAAIoN,EAAI,OAAQA,EAAKA,EAAGG,KAAKvN,IAAIwN,KAAKC,KAAKL,GAAK,GAAIM,MAAMC,QAAQ3N,KAAOoN,EACxN,SAAqCpN,EAAG4N,GAAU,IAAK5N,EAAG,OAAQ,GAAiB,iBAANA,EAAgB,OAAO6N,GAAkB7N,EAAG4N,GAAS,IAAIvL,EAAI8I,OAAOvG,UAAUT,SAASoJ,KAAKvN,GAAGqE,MAAM,GAAI,GAAc,WAANhC,GAAkBrC,EAAEqG,cAAahE,EAAIrC,EAAEqG,YAAYmD,MAAM,GAAU,QAANnH,GAAqB,QAANA,EAAa,OAAOqL,MAAMI,KAAK9N,GAAI,GAAU,cAANqC,GAAqB,2CAA2C0L,KAAK1L,GAAI,OAAOwL,GAAkB7N,EAAG4N,EAAU,CADnMI,CAA4BhO,KAAOmN,GAAkBnN,GAAyB,iBAAbA,EAAElB,OAAqB,CAAMsO,IAAIpN,EAAIoN,GAAI,IAAInP,EAAI,EAAG,OAAO,WAAc,OAAIA,GAAK+B,EAAElB,OAAe,CAAEmP,MAAM,GAAe,CAAEA,MAAM,EAAOrB,MAAO5M,EAAE/B,KAAO,CAAK,CAAC,MAAM,IAAIiQ,UAAU,wIAA2I,CAE5lB,SAASL,GAAkBM,EAAKC,IAAkB,MAAPA,GAAeA,EAAMD,EAAIrP,UAAQsP,EAAMD,EAAIrP,QAAQ,IAAK,IAAIb,EAAI,EAAGoQ,EAAO,IAAIX,MAAMU,GAAMnQ,EAAImQ,EAAKnQ,IAAKoQ,EAAKpQ,GAAKkQ,EAAIlQ,GAAI,OAAOoQ,CAAO,CCDnL,SAAS4G,GAAe9G,EAAKlQ,GAAK,OAKlC,SAAyBkQ,GAAO,GAAIT,MAAMC,QAAQQ,GAAM,OAAOA,CAAM,CAL5B+G,CAAgB/G,IAIzD,SAA+BjQ,EAAGa,GAAK,IAAIyD,EAAI,MAAQtE,EAAI,KAAO,oBAAsBmP,QAAUnP,EAAEmP,OAAOC,WAAapP,EAAE,cAAe,GAAI,MAAQsE,EAAG,CAAE,IAAIpC,EAAGiC,EAAGpE,EAAGkX,EAAGvV,EAAI,GAAIyB,GAAI,EAAIrB,GAAI,EAAI,IAAM,GAAI/B,GAAKuE,EAAIA,EAAE+K,KAAKrP,IAAIsP,KAAM,IAAMzO,EAAG,CAAE,GAAIoM,OAAO3I,KAAOA,EAAG,OAAQnB,GAAI,CAAK,MAAM,OAASA,GAAKjB,EAAInC,EAAEsP,KAAK/K,IAAIyL,QAAUrO,EAAEwG,KAAKhG,EAAEwM,OAAQhN,EAAEd,SAAWC,GAAIsC,GAAI,IAAO,MAAOnD,GAAK8B,GAAI,EAAIqC,EAAInE,CAAE,SAAa,IAAM,IAAKmD,GAAK,MAAQmB,EAAU,SAAM2S,EAAI3S,EAAU,SAAK2I,OAAOgK,KAAOA,GAAI,MAAS,CAAA,QAAW,GAAInV,EAAG,MAAMqC,CAAI,CAAA,CAAG,OAAOzC,CAAE,CAAI,CAJzdwV,CAAsBjH,EAAKlQ,IAAM+P,GAA4BG,EAAKlQ,IACnI,WAA8B,MAAM,IAAIiQ,UAAU,4IAA+I,CADxDmH,EAAqB,CAE9J,SAASrH,GAA4BhO,EAAG4N,GAAU,GAAK5N,EAAL,CAAgB,GAAiB,iBAANA,EAAgB,OAAO6N,GAAkB7N,EAAG4N,GAAS,IAAIvL,EAAI8I,OAAOvG,UAAUT,SAASoJ,KAAKvN,GAAGqE,MAAM,GAAI,GAAiE,MAAnD,WAANhC,GAAkBrC,EAAEqG,cAAahE,EAAIrC,EAAEqG,YAAYmD,MAAgB,QAANnH,GAAqB,QAANA,EAAoBqL,MAAMI,KAAK9N,GAAc,cAANqC,GAAqB,2CAA2C0L,KAAK1L,GAAWwL,GAAkB7N,EAAG4N,QAAzG,EAAmH,CACha,SAASC,GAAkBM,EAAKC,IAAkB,MAAPA,GAAeA,EAAMD,EAAIrP,UAAQsP,EAAMD,EAAIrP,QAAQ,IAAK,IAAIb,EAAI,EAAGoQ,EAAO,IAAIX,MAAMU,GAAMnQ,EAAImQ,EAAKnQ,IAAKoQ,EAAKpQ,GAAKkQ,EAAIlQ,GAAI,OAAOoQ,CAAO,CAKpK,SAAS0I,GAA0BR,EAAOK,GAEvD,GAAqB,IAAjBL,EAAMzX,OACR,MAAO,GAEN,IAACkY,EAAc/B,GAAe2B,EAAY,GACjCI,EAAY,GAexB,IAdF,IAAIC,EAAcD,EAAY,GAQxBE,EAAYD,EAAYxB,OACxB0B,EAAYF,EAAYvB,IAGxB7P,EAAO,IAAI6H,MAAMyJ,GACjBlZ,EAAI,EACDA,EAAIkZ,GAAW,CACpBtR,EAAK5H,GAAK,IAAIyP,MAAMwJ,GAEpB,IADA,IAAI/Y,EAAI,EACDA,EAAI+Y,GACTrR,EAAK5H,GAAGE,GAAK,KACbA,IAEFF,GACD,CAMD,IAAK,IAAwDsQ,EAApDO,EA5CX,SAAyC9O,EAAGmN,GAAkB,IAAIC,EAAuB,oBAAXC,QAA0BrN,EAAEqN,OAAOC,WAAatN,EAAE,cAAe,GAAIoN,EAAI,OAAQA,EAAKA,EAAGG,KAAKvN,IAAIwN,KAAKC,KAAKL,GAAK,GAAIM,MAAMC,QAAQ3N,KAAOoN,EAAKY,GAA4BhO,KAAOmN,GAAkBnN,GAAyB,iBAAbA,EAAElB,OAAqB,CAAMsO,IAAIpN,EAAIoN,GAAI,IAAInP,EAAI,EAAG,OAAO,WAAc,OAAIA,GAAK+B,EAAElB,OAAe,CAAEmP,MAAM,GAAe,CAAEA,MAAM,EAAOrB,MAAO5M,EAAE/B,KAAO,CAAK,CAAC,MAAM,IAAIiQ,UAAU,wIAA2I,CA4CrkBhB,CAAgCqJ,KAAiBhI,EAAQO,KAAab,MAAO,CAChG,IAAIwI,EAAOlI,EAAM3B,MAMbwK,EAAWX,EAAKf,IAAM,EACtB2B,EAAcZ,EAAKhB,OAAS,EAE5B4B,EAAcH,GAAaE,EAAWD,IACxCtR,EAAKuR,GAAUC,GAAeZ,EAAK7J,MAEtC,CAoBD,OAPA/G,EFnEa,SAAuBA,GAUpC,IATA,IAAIoE,EAAOC,UAAUpL,OAAS,QAAsBqL,IAAjBD,UAAU,GAAmBA,UAAU,GAAK,CAAE,EAC/EoN,EAAoBrN,EAAKqN,kBACzBC,EAAgBtN,EAAKuN,SACrBA,OAA6B,IAAlBD,EAA2B,SAAUE,GAC9C,OAAOA,CACb,EAAQF,EACJG,EAAmBzN,EAAKyN,iBAEtBzZ,EAAI4H,EAAK/G,OAAS,EACfb,GAAK,GAAG,CAGb,IADA,IAC+DsQ,EAD3DoJ,GAAQ,EACH7I,EAAY5B,GAAgCrH,EAAK5H,MAAcsQ,EAAQO,KAAab,MAE3F,GAAuB,OAAnBuJ,EADOjJ,EAAM3B,OACY,CAC3B+K,GAAQ,EACR,KACD,CAGH,GAAIA,EACF9R,EAAK+R,OAAO3Z,EAAG,GACXqZ,GACFA,EAAkBM,OAAO3Z,EAAG,QAEzB,GAAIyZ,EACT,MAEFzZ,GACD,CACD,OAAO4H,CACT,CEmCSgS,CDnEM,SAA0BhS,GAQvC,IAPA,IAAIoE,EAAOC,UAAUpL,OAAS,QAAsBqL,IAAjBD,UAAU,GAAmBA,UAAU,GAAK,CAAE,EAC/EqN,EAAgBtN,EAAKuN,SACrBA,OAA6B,IAAlBD,EAA2B,SAAUE,GAC9C,OAAOA,CACb,EAAQF,EACJG,EAAmBzN,EAAKyN,iBACtBzZ,EAAI4H,EAAK,GAAG/G,OAAS,EAClBb,GAAK,GAAG,CAEb,IADA,IAC4DsQ,EADxDoJ,GAAQ,EACH7I,EAAY5B,GAAgCrH,KAAgB0I,EAAQO,KAAab,MAExF,GAAyB,OAArBuJ,EADMjJ,EAAM3B,MACC3O,IAAc,CAC7B0Z,GAAQ,EACR,KACD,CAEH,GAAIA,EAEF,IADA,IAAIxZ,EAAI,EACDA,EAAI0H,EAAK/G,QACd+G,EAAK1H,GAAGyZ,OAAO3Z,EAAG,GAClBE,SAEG,GAAIuZ,EACT,MAEFzZ,GACD,CACD,OAAO4H,CACT,CCsCuBiS,CAAiBjS,EAAM,CAC1C6R,kBAAkB,IAChB,CACFA,kBAAkB,IAIb7R,CACT,CC1Ee,SAASkS,GAAWhb,EAASF,EAAKuS,EAAeC,EAAQX,EAAW1E,GACjF,IAAI+L,EAAgBlZ,EAAIC,eAAeC,GACnCwZ,EAAQD,GAAWP,EAAe3G,EAAeC,EAAQX,EAAW1E,GAIpE4M,EAAaD,GAAqBZ,ICVzB,SAAkDQ,GAC/D,IAAIyB,EAAa,SAAoBpY,EAAG5B,GACtC,OAAO4B,EAAI5B,CACf,EACMia,EAAU1B,EAAMpF,KAAI,SAAUsF,GAChC,OAAOA,EAAKf,GAChB,IAAKwC,KAAKF,GACJG,EAAU5B,EAAMpF,KAAI,SAAUsF,GAChC,OAAOA,EAAKhB,MAChB,IAAKyC,KAAKF,GACJI,EAASH,EAAQ,GACjBI,EAASJ,EAAQA,EAAQnZ,OAAS,GAGtC,MAAO,CAAC,CACN4W,IAAK0C,EACL3C,OAJW0C,EAAQ,IAKlB,CACDzC,IAAK2C,EACL5C,OANW0C,EAAQA,EAAQrZ,OAAS,IAQxC,CDX0DwZ,CAAyC/B,GACjG,OAAOgC,GAA0BhC,EAAOK,EAC1C,CEZA,SAAS1J,GAAgClN,EAAGmN,GAAkB,IAAIC,EAAuB,oBAAXC,QAA0BrN,EAAEqN,OAAOC,WAAatN,EAAE,cAAe,GAAIoN,EAAI,OAAQA,EAAKA,EAAGG,KAAKvN,IAAIwN,KAAKC,KAAKL,GAAK,GAAIM,MAAMC,QAAQ3N,KAAOoN,EACxN,SAAqCpN,EAAG4N,GAAU,IAAK5N,EAAG,OAAQ,GAAiB,iBAANA,EAAgB,OAAO6N,GAAkB7N,EAAG4N,GAAS,IAAIvL,EAAI8I,OAAOvG,UAAUT,SAASoJ,KAAKvN,GAAGqE,MAAM,GAAI,GAAc,WAANhC,GAAkBrC,EAAEqG,cAAahE,EAAIrC,EAAEqG,YAAYmD,MAAM,GAAU,QAANnH,GAAqB,QAANA,EAAa,OAAOqL,MAAMI,KAAK9N,GAAI,GAAU,cAANqC,GAAqB,2CAA2C0L,KAAK1L,GAAI,OAAOwL,GAAkB7N,EAAG4N,EAAU,CADnMI,CAA4BhO,KAAOmN,GAAkBnN,GAAyB,iBAAbA,EAAElB,OAAqB,CAAMsO,IAAIpN,EAAIoN,GAAI,IAAInP,EAAI,EAAG,OAAO,WAAc,OAAIA,GAAK+B,EAAElB,OAAe,CAAEmP,MAAM,GAAe,CAAEA,MAAM,EAAOrB,MAAO5M,EAAE/B,KAAO,CAAK,CAAC,MAAM,IAAIiQ,UAAU,wIAA2I,CAE5lB,SAASL,GAAkBM,EAAKC,IAAkB,MAAPA,GAAeA,EAAMD,EAAIrP,UAAQsP,EAAMD,EAAIrP,QAAQ,IAAK,IAAIb,EAAI,EAAGoQ,EAAO,IAAIX,MAAMU,GAAMnQ,EAAImQ,EAAKnQ,IAAKoQ,EAAKpQ,GAAKkQ,EAAIlQ,GAAI,OAAOoQ,CAAO,CAiBpK,SAASmK,GAAyBC,EAAU5b,GA6BzD,IA5BA,IAAImN,EAAUE,UAAUpL,OAAS,QAAsBqL,IAAjBD,UAAU,GAAmBA,UAAU,GAAK,CAAA,EAC9EwO,EAAiB,SAAwBlJ,GAC3C,IAAKiJ,EAASjJ,GACZ,MAAM,IAAI7O,MAAM,IAAK6S,OAAOhE,EAAU,wDAExC,OAAOiJ,EAASjJ,EACpB,EAKML,EAAYD,GAAewJ,EAAe,8BAA+B7b,GAGzEuS,EAAgBD,EAAUC,cCjCjB,SAA4BrS,EAASF,GAClD,OAAKE,EAGE8P,GAAiBhQ,EAAIC,eAAeC,IAFlC,EAGX,CD4BgD4b,CAAmBD,EAAevJ,EAAUC,eAAgBvS,GAAO,GAG7GwS,EAASF,EAAUE,OAAS0B,GAAY2H,EAAevJ,EAAUE,QAASxS,GAAO,GACjF+b,EAAwBtK,GAAqBoK,EAAe,mBAAoB7b,GAClFgS,EAAS+J,EAAsB/J,OAC/BH,EAAYkK,EAAsBlK,UAChCmK,EAAiB7O,EAAQ6E,QAAU7E,EAAQ6E,OAAOsC,KAAI,SAAUnC,GAClE,OAoBJ,SAAoBA,EAAOH,GACzB,GAAqB,iBAAVG,EAAoB,CAC7B,IAAK,IAAyDT,EAArDO,EAAY5B,GAAgC2B,KAAkBN,EAAQO,KAAab,MAAO,CACjG,IAAI6K,EAASvK,EAAM3B,MACnB,GAAIkM,EAAOtP,OAASwF,EAClB,OAAO8J,EAAO7J,UAEjB,CACD,MAAM,IAAItO,MAAM,UAAW6S,OAAOxE,EAAO,mCAAoCwE,OAAO3E,EAAOsC,KAAI,SAAUlH,GACvG,IAAIT,EAAOS,EAAKT,KAChB,MAAO,IAAKgK,OAAOhK,EAAM,IAC1B,IAAEuP,KAAK,OACZ,CACI,GAAI/J,GAASH,EAAO/P,OAClB,OAAO+P,EAAOG,EAAQ,GAAGC,WAE3B,MAAM,IAAItO,MAAM,+BAA+B6S,OAAOxE,EAAO,8BAA8BwE,OAAO3E,EAAO/P,QAE7G,CAtCWka,CAAWhK,EAAOH,EAC7B,IAIMoK,EAAa,GACRhO,EAAK,EAAGC,EAAeC,OAAOC,KAAK+D,EAAUN,QAAS5D,EAAKC,EAAapM,OAAQmM,IAAM,CAC7F,IAAIiO,EAAUhO,EAAaD,GACvB4N,IAAmBA,EAAeM,SAASD,IAG/CD,EAAW7S,KAAK,CACd4I,MAAOoK,GAAiBF,EAASrK,GACjChJ,KAAMkS,GAAWW,EAAevJ,EAAUN,OAAOqK,IAAWrc,EAAKuS,EAAeC,EAAQX,EAAW1E,IAEtG,CAGD,OAAOiP,CACT,CAoBA,SAASG,GAAiBF,EAASrK,GACjC,IAAK,IAA0DwK,EAAtDC,EAAapM,GAAgC2B,KAAmBwK,EAASC,KAAcrL,MAAO,CACrG,IAAIe,EAAQqK,EAAOzM,MACnB,GAAIoC,EAAMC,aAAeiK,EACvB,OAAOlK,EAAMxF,IAEhB,CACD,MAAM,IAAI7I,MAAM,uBAAuB6S,OAAO0F,GAChD,QE/Ee,SAAsBnP,EAAOC,GAC1C,OrBIa,SAAwBD,GACrC,OAAIA,aAAiBwP,MAAQxP,aAAiBpE,KACrCoE,EAAM0B,cAAcC,KAAKF,GAE3Bd,QAAQC,QAAQZ,GAAO2B,KAAKF,EACrC,CqBTSgO,CAAezP,GAAO2B,MAAK,SAAU+M,GAC1C,OAAOD,GAAyBC,EAAU5b,EAAKmN,EACnD,GACA"}