read-excel-file 6.0.2 → 7.0.0

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/read/unpackXlsxFileBrowser.js","../modules/xml/dom.js","../modules/xml/xlsx.js","../modules/read/parseProperties.js","../modules/read/parseFilePaths.js","../modules/read/parseStyles.js","../modules/read/parseDate.js","../modules/read/isDateTimestamp.js","../modules/read/parseCellValue.js","../modules/read/coordinates.js","../modules/read/parseCell.js","../modules/read/parseCells.js","../modules/read/parseDimensions.js","../modules/read/dropEmptyRows.js","../modules/read/dropEmptyColumns.js","../modules/read/getData.js","../modules/read/readXlsx.js","../modules/read/parseSharedStrings.js","../modules/read/parseSheet.js","../modules/types/InvalidError.js","../modules/types/Number.js","../modules/types/String.js","../modules/types/Boolean.js","../modules/read/schema/mapToObjects.js","../modules/types/Date.js","../modules/read/readXlsxFileContents.js","../modules/read/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","import { unzipSync, strFromU8 } from 'fflate';\n\n/**\r\n * Reads XLSX file in a browser.\r\n * @param  {(File|Blob|ArrayBuffer)} input - A `File` or an `ArrayBuffer`.\r\n * @return {Promise} Resolves to an object holding XLSX file entries.\r\n */\nexport default function unpackXlsxFile(input) {\n  if (input instanceof File) {\n    return input.arrayBuffer().then(unpackXlsxArrayBuffer);\n  }\n  if (input instanceof Blob) {\n    return input.arrayBuffer().then(unpackXlsxArrayBuffer);\n  }\n  return unpackXlsxArrayBuffer(input);\n}\n\n/**\r\n * Reads XLSX file in a browser from an `ArrayBuffer`.\r\n * @param  {ArrayBuffer} input\r\n * @return {Promise} Resolves to an object holding XLSX file entries.\r\n */\nfunction unpackXlsxArrayBuffer(arrayBuffer) {\n  var archive = new Uint8Array(arrayBuffer);\n  var contents = unzipSync(archive);\n  return Promise.resolve(getContents(contents));\n  // return new Promise((resolve, reject) => {\n  // \tunzip(archive, (error, contents) => {\n  // \t\tif (error) {\n  // \t\t\treturn reject(error)\n  // \t\t}\n  // \t\treturn resolve(getContents(contents))\n  // \t})\n  // })\n}\n\nfunction getContents(contents) {\n  var unzippedFiles = [];\n  for (var _i = 0, _Object$keys = Object.keys(contents); _i < _Object$keys.length; _i++) {\n    var key = _Object$keys[_i];\n    unzippedFiles[key] = strFromU8(contents[key]);\n  }\n  return unzippedFiles;\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}\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, isElement, getTagName } from './dom.js';\n\n// Returns an array of cells,\n// each element being an XML DOM element representing a cell.\nexport function getCells(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 getMergedCells(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 getCellValue(document, node) {\n  return findChild(node, 'v');\n}\nexport function getCellInlineStringValue(document, node) {\n  if (node.firstChild && isElement(node.firstChild) && getTagName(node.firstChild) === 'is' && node.firstChild.firstChild && isElement(node.firstChild.firstChild) && getTagName(node.firstChild.firstChild) === 't') {\n    return node.firstChild.firstChild.textContent;\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","import { 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 parseProperties(content, xml) {\n  var book = xml.createDocument(content);\n  var properties = {};\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\n  var workbookProperties = getWorkbookProperties(book);\n  if (workbookProperties && workbookProperties.getAttribute('date1904') === '1') {\n    properties.epoch1904 = true;\n  }\n\n  // Get sheets info (indexes, names, if they're available).\n  // Example:\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  // http://www.datypic.com/sc/ooxml/e-ssml_sheet-1.html\n\n  properties.sheets = [];\n  var addSheetInfo = function addSheetInfo(sheet) {\n    if (sheet.getAttribute('name')) {\n      properties.sheets.push({\n        id: sheet.getAttribute('sheetId'),\n        name: sheet.getAttribute('name'),\n        relationId: sheet.getAttribute('r:id')\n      });\n    }\n  };\n  getSheets(book).forEach(addSheetInfo);\n  return properties;\n}\n//# sourceMappingURL=parseProperties.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 (\"serial\") into a corresponding javascript Date in UTC+0 timezone.\n// (with time equal 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  // https://support.microsoft.com/en-gb/help/214330/differences-between-the-1900-and-the-1904-date-system-in-excel\n  if (options && options.epoch1904) {\n    excelSerialDate += 1462;\n  }\n\n  // \"Excel serial date\" is just\n  // the count of days since `01/01/1900`\n  // (seems that it may be even fractional).\n  //\n  // The count of days elapsed\n  // since `01/01/1900` (Excel epoch)\n  // till `01/01/1970` (Unix epoch).\n  // Accounts for leap years\n  // (19 of them, yielding 19 extra days).\n  var daysBeforeUnixEpoch = 70 * 365 + 19;\n\n  // An hour, approximately, because a minute\n  // may be longer than 60 seconds, due to \"leap seconds\".\n  //\n  // Still, Javascript `Date` (and UNIX time in general) intentionally\n  // drops the concept of \"leap seconds\" in order to make things simpler.\n  // So it's fine.\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 fact 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, while your\n  //  example timestamp 1483228826 is 2017-01-01T00:00:00Z on your system,\n  //  it would be interpreted as 2017-01-01T00:00:26Z on POSIX based systems,\n  //  or systems without leap second tables. So they aren't portable.\n  //  Even on systems that have full updated tables, there's no telling what those\n  //  tables will contain in the future (beyond the 6-month IERS announcement period),\n  //  so I can't produce a future timestamp without risk that it may eventually change.\n  //\n  //  To be clear - 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  //\n  var hour = 60 * 60 * 1000;\n  return new Date(Math.round((excelSerialDate - daysBeforeUnixEpoch) * 24 * hour));\n}\n//# sourceMappingURL=parseDate.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// 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// https://github.com/catamphetamine/read-excel-file/issues/3#issuecomment-395770777\n//\n// The list of generic numeric value \"formats\":\n// https://xlsxwriter.readthedocs.io/format.html#format-set-num-format\n//\nexport default function isDateTimestamp(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_NUMBER_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 && isDateTemplate(style.numberFormat.template)) {\n      return true;\n    }\n  }\n}\n\n// https://hexdocs.pm/xlsxir/number_styles.html\nvar BUILT_IN_DATE_NUMBER_FORMAT_IDS = [14, 15, 16, 17, 18, 19, 20, 21, 22, 27, 30, 36, 45, 46, 47, 50, 57];\n\n// On some date formats, there's an \"[$-414]\" prefix.\n// I don't have any idea what that is.\n//\n// https://stackoverflow.com/questions/4730152/what-indicates-an-office-open-xml-cell-contains-a-date-time-value\n//\n// Examples:\n//\n// * 27 (built-in format) \"[$-404]e/m/d\"\n// * 164 (custom format) \"[$-414]mmmm\\ yyyy;@\"\n//\nvar DATE_FORMAT_WEIRD_PREFIX = /^\\[\\$-414\\]/;\n\n// On some date formats, there's an \";@\" postfix.\n// I don't have any idea what that is.\n// Examples:\n//\n// * 164 (custom format) \"m/d/yyyy;@\"\n// * 164 (custom format) \"[$-414]mmmm\\ yyyy;@\"\n//\nvar DATE_FORMAT_WEIRD_POSTFIX = /;@$/;\nfunction isDateTemplate(template) {\n  // Date format tokens could be in upper case or in lower case.\n  // There seems to be no single standard.\n  // So lowercase the template first.\n  template = template.toLowerCase();\n\n  // On some date formats, there's an \"[$-414]\" prefix.\n  // I don't have any idea what that is. Trim it.\n  template = template.replace(DATE_FORMAT_WEIRD_PREFIX, '');\n\n  // On some date formats, there's an \";@\" postfix.\n  // I don't have any idea what that is. Trim it.\n  template = template.replace(DATE_FORMAT_WEIRD_POSTFIX, '');\n  var tokens = template.split(/\\W+/);\n  for (var _iterator = _createForOfIteratorHelperLoose(tokens), _step; !(_step = _iterator()).done;) {\n    var token = _step.value;\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=isDateTimestamp.js.map","import parseDate from './parseDate.js';\nimport isDateTimestamp from './isDateTimestamp.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    values = _ref.values,\n    properties = _ref.properties,\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 `values` 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 >= values.length) {\n        throw new Error(\"An out-of-bounds \\\"shared\\\" string index: \".concat(value));\n      }\n      value = values[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      var isDateTimestampNumber = isDateTimestamp(getStyleId(), styles, options);\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      if (isDateTimestampNumber) {\n        // Parse the number from string.\n        value = parseNumberDefault(value);\n        // Parse the number as a date timestamp.\n        value = parseDate(value, properties);\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        value = (options.parseNumber || parseNumberDefault)(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","// 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\"];\nexport function calculateDimensions(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\n// Converts a letter coordinate to a digit coordinate.\n// Examples: \"A\" -> 1, \"B\" -> 2, \"Z\" -> 26, \"AA\" -> 27, etc.\nfunction columnLettersToNumber(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}\nexport function parseCellCoordinates(coords) {\n  // Coordinate examples: \"AA2091\", \"R988\", \"B1\".\n  coords = coords.split(/(\\d+)/);\n  return [\n  // Row.\n  parseInt(coords[1]),\n  // Column.\n  columnLettersToNumber(coords[0].trim())];\n}\n//# sourceMappingURL=coordinates.js.map","import parseCellValue from './parseCellValue.js';\nimport { parseCellCoordinates } from './coordinates.js';\nimport { getCellValue, 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(node, sheet, xml, values, styles, properties, options) {\n  var coords = parseCellCoordinates(node.getAttribute('r'));\n  var valueElement = getCellValue(sheet, node);\n\n  // For `xpath`, `value` can be `undefined` while for native `DOMParser` it's `null`.\n  // So using `value && ...` instead of `if (value !== undefined) { ... }` here\n  // for uniform compatibility with both `xpath` and native `DOMParser`.\n  var value = valueElement && valueElement.textContent;\n  var type;\n  if (node.hasAttribute('t')) {\n    type = node.getAttribute('t');\n  }\n  return {\n    row: coords[0],\n    column: coords[1],\n    value: parseCellValue(value, type, {\n      getInlineStringValue: function getInlineStringValue() {\n        return getCellInlineStringValue(sheet, node);\n      },\n      getInlineStringXml: function getInlineStringXml() {\n        return getOuterXml(node);\n      },\n      getStyleId: function getStyleId() {\n        return node.getAttribute('s');\n      },\n      styles: styles,\n      values: values,\n      properties: properties,\n      options: options\n    })\n  };\n}\n//# sourceMappingURL=parseCell.js.map","import parseCell from './parseCell.js';\nimport { getCells, getMergedCells } from '../xml/xlsx.js';\nexport default function parseCells(sheet, xml, values, styles, properties, options) {\n  var cells = getCells(sheet);\n  if (cells.length === 0) {\n    return [];\n  }\n\n  // const mergedCells = getMergedCells(sheet)\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 (node) {\n    return parseCell(node, sheet, xml, values, styles, properties, 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 './coordinates.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 parseDimensions(sheet) {\n  var dimensions = getDimensions(sheet);\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=parseDimensions.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 getData(sheet, options) {\n  var dimensions = sheet.dimensions,\n    cells = sheet.cells;\n\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.\n  var rowIndexSourceMap = options.rowIndexSourceMap;\n  if (rowIndexSourceMap) {\n    var _i = 0;\n    while (_i < data.length) {\n      rowIndexSourceMap[_i] = _i;\n      _i++;\n    }\n  }\n\n  // Drop (discard) empty columns or rows.\n  //\n  // Don't discard empty rows or columns at the start or in the middle.\n  // Only discard empty rows at the bottom or empty columns on the right side.\n  // The rationale is that the data should be output in the same shape or form\n  // as it can be seen in the actual spreadsheet.\n  // If the user decides to discard empty rows or columns, they could do it manually\n  // by passing `transformData()` function as an option.\n  //\n  data = dropEmptyRows(dropEmptyColumns(data, {\n    onlyTrimAtTheEnd: true\n  }), {\n    onlyTrimAtTheEnd: true,\n    rowIndexSourceMap: rowIndexSourceMap\n  });\n\n  // Optionally transform data before applying `schema`.\n  if (options.transformData) {\n    data = options.transformData(data);\n    // data = options.transformData(data, {\n    //   dropEmptyRowsAndColumns(data) {\n    //     return dropEmptyRows(dropEmptyColumns(data), { rowIndexSourceMap })\n    //   }\n    // })\n  }\n\n  return data;\n}\n//# sourceMappingURL=getData.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 _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; }\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 parseProperties from './parseProperties.js';\nimport parseFilePaths from './parseFilePaths.js';\nimport parseStyles from './parseStyles.js';\nimport parseSharedStrings from './parseSharedStrings.js';\nimport parseSheet from './parseSheet.js';\nimport getData from './getData.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 an (unzipped) XLSX file structure into a 2D array of cells.\r\n * @param  {object} contents - A list of XML files inside XLSX file (which is a zipped directory).\r\n * @param  {number?} options.sheet - Workbook sheet id (`1` by default).\r\n * @param  {string?} options.dateFormat - Date format, e.g. \"mm/dd/yyyy\". Values having this format template set will be parsed as dates.\r\n * @param  {object} contents - A list of XML files inside XLSX file (which is a zipped directory).\r\n * @return {object} An object of shape `{ data, cells, properties }`. `data: string[][]` is an array of rows, each row being an array of cell values. `cells: string[][]` is an array of rows, each row being an array of cells. `properties: object` is the spreadsheet properties (e.g. whether date epoch is 1904 instead of 1900).\r\n */\nexport default function readXlsx(contents, xml) {\n  var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n  if (!options.sheet) {\n    options = _objectSpread({\n      sheet: 1\n    }, options);\n  }\n  var getXmlFileContent = function getXmlFileContent(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  // Some Excel editors don't want to use standard naming scheme for sheet files.\n  // https://github.com/tidyverse/readxl/issues/104\n  var filePaths = parseFilePaths(getXmlFileContent('xl/_rels/workbook.xml.rels'), xml);\n\n  // Default file path for \"shared strings\": \"xl/sharedStrings.xml\".\n  var values = filePaths.sharedStrings ? parseSharedStrings(getXmlFileContent(filePaths.sharedStrings), xml) : [];\n\n  // Default file path for \"styles\": \"xl/styles.xml\".\n  var styles = filePaths.styles ? parseStyles(getXmlFileContent(filePaths.styles), xml) : {};\n  var properties = parseProperties(getXmlFileContent('xl/workbook.xml'), xml);\n\n  // A feature for getting the list of sheets in an Excel file.\n  // https://github.com/catamphetamine/read-excel-file/issues/14\n  if (options.getSheets) {\n    return properties.sheets.map(function (_ref) {\n      var name = _ref.name;\n      return {\n        name: name\n      };\n    });\n  }\n\n  // Find the sheet by name, or take the first one.\n  var sheetId = getSheetId(options.sheet, properties.sheets);\n\n  // If the sheet wasn't found then throw an error.\n  // Example: \"xl/worksheets/sheet1.xml\".\n  if (!sheetId || !filePaths.sheets[sheetId]) {\n    throw createSheetNotFoundError(options.sheet, properties.sheets);\n  }\n\n  // Parse sheet data.\n  var sheet = parseSheet(getXmlFileContent(filePaths.sheets[sheetId]), xml, values, styles, properties, options);\n  options = _objectSpread({\n    // Create a `rowIndexSourceMap` for the original dataset, if not passed,\n    // because \"empty\" rows will be dropped from the input data.\n    rowIndexSourceMap: []\n  }, options);\n\n  // Get spreadsheet data.\n  var data = getData(sheet, options);\n\n  // Can return properties, if required.\n  if (options.properties) {\n    return {\n      data: data,\n      properties: properties\n    };\n  }\n\n  // Return spreadsheet data.\n  return data;\n}\nfunction getSheetId(sheet, sheets) {\n  if (typeof sheet === 'number') {\n    var _sheet = sheets[sheet - 1];\n    return _sheet && _sheet.relationId;\n  }\n  for (var _iterator = _createForOfIteratorHelperLoose(sheets), _step; !(_step = _iterator()).done;) {\n    var _sheet2 = _step.value;\n    if (_sheet2.name === sheet) {\n      return _sheet2.relationId;\n    }\n  }\n}\nfunction createSheetNotFoundError(sheet, sheets) {\n  var sheetsList = sheets && sheets.map(function (sheet, i) {\n    return \"\\\"\".concat(sheet.name, \"\\\" (#\").concat(i + 1, \")\");\n  }).join(', ');\n  return new Error(\"Sheet \".concat(typeof sheet === 'number' ? '#' + sheet : '\"' + sheet + '\"', \" not found in the *.xlsx file.\").concat(sheets ? ' Available sheets: ' + sheetsList + '.' : ''));\n}\n//# sourceMappingURL=readXlsx.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 parseCells from './parseCells.js';\nimport parseDimensions from './parseDimensions.js';\nimport { calculateDimensions } from './coordinates.js';\nexport default function parseSheet(content, xml, values, styles, properties, options) {\n  var sheet = xml.createDocument(content);\n  var cells = parseCells(sheet, xml, values, styles, properties, options);\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\n  var dimensions = parseDimensions(sheet) || calculateDimensions(cells);\n  return {\n    cells: cells,\n    dimensions: dimensions\n  };\n}\n//# sourceMappingURL=parseSheet.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 _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, _toPropertyKey(descriptor.key), descriptor); } }\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, \"prototype\", { writable: false }); return Constructor; }\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); }\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function\"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, writable: true, configurable: true } }); Object.defineProperty(subClass, \"prototype\", { writable: false }); if (superClass) _setPrototypeOf(subClass, superClass); }\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = _getPrototypeOf(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = _getPrototypeOf(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return _possibleConstructorReturn(this, result); }; }\nfunction _possibleConstructorReturn(self, call) { if (call && (_typeof(call) === \"object\" || typeof call === \"function\")) { return call; } else if (call !== void 0) { throw new TypeError(\"Derived constructors may only return object or undefined\"); } return _assertThisInitialized(self); }\nfunction _assertThisInitialized(self) { if (self === void 0) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return self; }\nfunction _wrapNativeSuper(Class) { var _cache = typeof Map === \"function\" ? new Map() : undefined; _wrapNativeSuper = function _wrapNativeSuper(Class) { if (Class === null || !_isNativeFunction(Class)) return Class; if (typeof Class !== \"function\") { throw new TypeError(\"Super expression must either be null or a function\"); } if (typeof _cache !== \"undefined\") { if (_cache.has(Class)) return _cache.get(Class); _cache.set(Class, Wrapper); } function Wrapper() { return _construct(Class, arguments, _getPrototypeOf(this).constructor); } Wrapper.prototype = Object.create(Class.prototype, { constructor: { value: Wrapper, enumerable: false, writable: true, configurable: true } }); return _setPrototypeOf(Wrapper, Class); }; return _wrapNativeSuper(Class); }\nfunction _construct(Parent, args, Class) { if (_isNativeReflectConstruct()) { _construct = Reflect.construct.bind(); } else { _construct = function _construct(Parent, args, Class) { var a = [null]; a.push.apply(a, args); var Constructor = Function.bind.apply(Parent, a); var instance = new Constructor(); if (Class) _setPrototypeOf(instance, Class.prototype); return instance; }; } return _construct.apply(null, arguments); }\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); return true; } catch (e) { return false; } }\nfunction _isNativeFunction(fn) { return Function.toString.call(fn).indexOf(\"[native code]\") !== -1; }\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\nfunction _getPrototypeOf(o) { _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf.bind() : function _getPrototypeOf(o) { return o.__proto__ || Object.getPrototypeOf(o); }; return _getPrototypeOf(o); }\nvar InvalidError = /*#__PURE__*/function (_Error) {\n  _inherits(InvalidError, _Error);\n  var _super = _createSuper(InvalidError);\n  function InvalidError(reason) {\n    var _this;\n    _classCallCheck(this, InvalidError);\n    _this = _super.call(this, 'invalid');\n    _this.reason = reason;\n    return _this;\n  }\n  return _createClass(InvalidError);\n}( /*#__PURE__*/_wrapNativeSuper(Error));\nexport { InvalidError as default };\n//# sourceMappingURL=InvalidError.js.map","import InvalidError from './InvalidError.js';\nexport default function NumberType(value) {\n  // An XLSX file editing software might not always correctly\n  // detect numeric values in string-type cells. Users won't bother\n  // manually selecting a cell type, so the editing software has to guess\n  // based on the user's input. One can assume that such auto-detection\n  // might not always work.\n  //\n  // So, if a cell is supposed to be a numeric one, convert a string value to a number.\n  //\n  if (typeof value === 'string') {\n    var stringifiedValue = value;\n    value = Number(value);\n    if (String(value) !== stringifiedValue) {\n      throw new InvalidError('not_a_number');\n    }\n  }\n  if (typeof value !== 'number') {\n    throw new InvalidError('not_a_number');\n  }\n  if (isNaN(value)) {\n    throw new InvalidError('invalid_number');\n  }\n  // At this point, `value` can only be a number.\n  //\n  // The global `isFinite()` function filters out:\n  // * NaN\n  // * -Infinity\n  // * Infinity\n  //\n  // All other values pass (including non-numbers).\n  //\n  if (!isFinite(value)) {\n    throw new InvalidError('out_of_bounds');\n  }\n  return value;\n}\n//# sourceMappingURL=Number.js.map","import InvalidError from './InvalidError.js';\nexport default function StringType(value) {\n  if (typeof value === 'string') {\n    return value;\n  }\n  // Excel tends to perform a forced automatic convertion of string-type values\n  // to number-type ones when the user has input them. Otherwise, users wouldn't\n  // be able to perform formula calculations on those cell values because users\n  // won't bother manually choosing a \"numeric\" cell type for each cell, and\n  // even if they did, choosing a \"numeric\" cell type every time wouldn't be an\n  // acceptable \"user experience\".\n  //\n  // So, if a cell value is supposed to be a string and Excel has automatically\n  // converted it to a number, perform a backwards conversion.\n  //\n  if (typeof value === 'number') {\n    if (isNaN(value)) {\n      throw new InvalidError('invalid_number');\n    }\n    // The global `isFinite()` function filters out:\n    // * NaN\n    // * -Infinity\n    // * Infinity\n    //\n    // All other values pass (including non-numbers).\n    //\n    if (!isFinite(value)) {\n      throw new InvalidError('out_of_bounds');\n    }\n    return String(value);\n  }\n  throw new InvalidError('not_a_string');\n}\n//# sourceMappingURL=String.js.map","import InvalidError from './InvalidError.js';\nexport default function BooleanType(value) {\n  if (typeof value === 'boolean') {\n    return value;\n  }\n  throw new InvalidError('not_a_boolean');\n}\n//# sourceMappingURL=Boolean.js.map","var _excluded = [\"isColumnOriented\", \"ignoreEmptyRows\", \"rowIndexSourceMap\"];\nfunction _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 _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 _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; }\nfunction _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; }\nfunction _objectWithoutProperties(source, excluded) { if (source == null) return {}; var target = _objectWithoutPropertiesLoose(source, excluded); var key, i; if (Object.getOwnPropertySymbols) { var sourceSymbolKeys = Object.getOwnPropertySymbols(source); for (i = 0; i < sourceSymbolKeys.length; i++) { key = sourceSymbolKeys[i]; if (excluded.indexOf(key) >= 0) continue; if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue; target[key] = source[key]; } } return target; }\nfunction _objectWithoutPropertiesLoose(source, excluded) { if (source == null) return {}; var target = {}; var sourceKeys = Object.keys(source); var key, i; for (i = 0; i < sourceKeys.length; i++) { key = sourceKeys[i]; if (excluded.indexOf(key) >= 0) continue; target[key] = source[key]; } return target; }\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 NumberType from '../../types/Number.js';\nimport StringType from '../../types/String.js';\nimport BooleanType from '../../types/Boolean.js';\nimport DateType from '../../types/Date.js';\nvar DEFAULT_OPTIONS = {\n  schemaPropertyValueForMissingColumn: undefined,\n  schemaPropertyValueForMissingValue: null,\n  schemaPropertyShouldSkipRequiredValidationForMissingColumn: function schemaPropertyShouldSkipRequiredValidationForMissingColumn() {\n    return false;\n  },\n  // `getEmptyObjectValue(object, { path })` applies to both the top-level object\n  // and any of its sub-objects.\n  getEmptyObjectValue: function getEmptyObjectValue() {\n    return null;\n  },\n  getEmptyArrayValue: function getEmptyArrayValue() {\n    return null;\n  },\n  isColumnOriented: false,\n  ignoreEmptyRows: true,\n  arrayValueSeparator: ','\n};\n\n/**\r\n * Converts spreadsheet-alike data structure into an array of objects.\r\n *\r\n * Parameters:\r\n *\r\n * * `data` — An array of rows, each row being an array of cells. The first row should be the list of column headers and the rest of the rows should be the data.\r\n * * `schema` — A \"to JSON\" convertion schema (see above).\r\n * * `options` — (optional) Schema conversion parameters of `read-excel-file`:\r\n *   * `schemaPropertyValueForMissingColumn` — By default, when some of the `schema` columns are missing in the input `data`, those properties are set to `undefined` in the output objects. Pass `schemaPropertyValueForMissingColumn: null` to set such \"missing column\" properties to `null` in the output objects.\r\n *   * `schemaPropertyValueForNullCellValue` — By default, when it encounters a `null` value in a cell in input `data`, it sets it to `undefined` in the output object. Pass `schemaPropertyValueForNullCellValue: null` to make it set such values as `null`s in output objects.\r\n *   * `schemaPropertyValueForUndefinedCellValue` — By default, when it encounters an `undefined` value in a cell in input `data`, it it sets it to `undefined` in the output object. Pass `schemaPropertyValueForUndefinedCellValue: null` to make it set such values as `null`s in output objects.\r\n *   * `schemaPropertyShouldSkipRequiredValidationForMissingColumn: (column: string, { object }) => boolean` — By default, it does apply `required` validation to `schema` properties for which columns are missing in the input `data`. One could pass a custom `schemaPropertyShouldSkipRequiredValidationForMissingColumn(column, { object })` to disable `required` validation for missing columns in some or all cases.\r\n *   * `getEmptyObjectValue(object, { path? })` — By default, it returns `null` for \"empty\" objects. One could override that value using `getEmptyObjectValue(object, { path })` parameter. The value applies to both top-level object and any nested sub-objects in case of a nested schema, hence the additional (optional) `path?: string` parameter.\r\n *   * `getEmptyArrayValue(array, { path })` — By default, it returns `null` for an \"empty\" array value. One could override that value using `getEmptyArrayValue(array, { path })` parameter.\r\n *\r\n * When parsing a property value, in case of an error, the value of that property is gonna be `undefined`.\r\n *\r\n * @param {any[][]} data - An array of rows, each row being an array of cells.\r\n * @param {object} schema\r\n * @param {object} [options]\r\n * @param {null} [options.schemaPropertyValueForMissingColumn] — By default, when some of the `schema` columns are missing in the input `data`, those properties are set to `undefined` in the output objects. Pass `schemaPropertyValueForMissingColumn: null` to set such \"missing column\" properties to `null` in the output objects.\r\n * @param {null} [options.schemaPropertyValueForMissingValue] — By default, when it encounters a `null` value in a cell in input `data`, it leaves the value as is. Pass a custom `schemaPropertyValueForMissingValue` to make it set such values to that value.\r\n * @param {object} [options.properties] — An optional object with optional property `epoch1904: true/false`. It is used when parsing dates.\r\n * @param {boolean} [options.schemaPropertyShouldSkipRequiredValidationForMissingColumn(column: string, { object })] — By default, it does apply `required` validation to `schema` properties for which columns are missing in the input `data`. One could pass a custom `schemaPropertyShouldSkipRequiredValidationForMissingColumn(column, { object })` to disable `required` validation for missing columns in some or all cases.\r\n * @param {function} [options.getEmptyObjectValue(object, { path })] — By default, it returns `null` for an \"empty\" resulting object. One could override that value using `getEmptyObjectValue(object, { path })` parameter. The value applies to both top-level object and any nested sub-objects in case of a nested schema, hence the additional `path?: string` parameter.\r\n * @param {function} [getEmptyArrayValue(array, { path })] — By default, it returns `null` for an \"empty\" array value. One could override that value using `getEmptyArrayValue(array, { path })` parameter.\r\n * @param {boolean} [options.isColumnOriented] — By default, the headers are assumed to be the first row in the `data`. Pass `isColumnOriented: true` if the headers are the first column in the `data`. i.e. if `data` is \"transposed\".\r\n * @param {string} [options.arrayValueSeparator] — When specified, string values will be split by this separator to get the array.\r\n * @param {object} [options.rowIndexSourceMap] — Custom row indexes of `data` rows. If present, will overwrite the indexes of `data` rows with the indexes from this `rowIndexSourceMap`.\r\n * @return {object[]}\r\n */\nexport default function mapToObjects(data, schema, options) {\n  if (options) {\n    options = _objectSpread(_objectSpread({}, DEFAULT_OPTIONS), options);\n  } else {\n    options = DEFAULT_OPTIONS;\n  }\n  var _options = options,\n    isColumnOriented = _options.isColumnOriented,\n    ignoreEmptyRows = _options.ignoreEmptyRows,\n    rowIndexSourceMapOriginal = _options.rowIndexSourceMap,\n    schemaTransformOptions = _objectWithoutProperties(_options, _excluded);\n\n  // `rowIndexSourceMap` could be mutated by `ignoreEmptyRows: true` option.\n  // Create a copy of it so that the original `rowIndexSourceMap` is not affected by those changes.\n  var rowIndexSourceMap = rowIndexSourceMapOriginal && rowIndexSourceMapOriginal.slice();\n  validateSchema(schema);\n  if (isColumnOriented) {\n    data = transpose(data);\n  }\n  if (ignoreEmptyRows) {\n    data = data.filter(function (row, i) {\n      var isEmptyRow = row.every(function (cell) {\n        return cell === null;\n      });\n      if (isEmptyRow) {\n        // Adjust `rowIndexSourceMap` now that the row has been removed.\n        if (rowIndexSourceMap) {\n          // Remove the `rowIndexSourceMap` entry that corresponds to the removed row.\n          rowIndexSourceMap.splice(i, 1);\n        }\n        return false;\n      }\n      return true;\n    });\n  }\n  var columns = data[0];\n  var results = [];\n  var errors = [];\n  for (var i = 1; i < data.length; i++) {\n    var result = read(schema, data[i], i, undefined, columns, errors, schemaTransformOptions);\n    results.push(result);\n  }\n\n  // Set the correct `row` number in `errors` if a custom `rowIndexSourceMap` is supplied.\n  if (rowIndexSourceMap) {\n    for (var _iterator = _createForOfIteratorHelperLoose(errors), _step; !(_step = _iterator()).done;) {\n      var error = _step.value;\n      // Convert the `row` index in `data` to the\n      // actual `row` index in the spreadsheet.\n      // `- 1` converts row number to row index.\n      // `+ 1` converts row index to row number.\n      error.row = rowIndexSourceMap[error.row - 1] + 1;\n    }\n  }\n  return {\n    rows: results,\n    errors: errors\n  };\n}\nfunction read(schema, row, rowIndex, path, columns, errors, options) {\n  var object = {};\n  var isEmptyObject = true;\n  var createError = function createError(_ref) {\n    var schemaEntry = _ref.schemaEntry,\n      value = _ref.value,\n      errorMessage = _ref.error,\n      reason = _ref.reason;\n    var error = {\n      error: errorMessage,\n      row: rowIndex + 1,\n      column: schemaEntry.column,\n      value: value\n    };\n    if (reason) {\n      error.reason = reason;\n    }\n    // * Regular values specify a `type?` property, which is included in the `error` object.\n    // * Nested objects specify a `schema` property, which is not included in the `error` object.\n    if (schemaEntry.type) {\n      error.type = schemaEntry.type;\n    }\n    return error;\n  };\n  var pendingRequiredChecks = [];\n\n  // For each schema entry.\n  var _loop = function _loop() {\n    var key = _Object$keys[_i];\n    var schemaEntry = schema[key];\n\n    // `schemaEntry.prop` property is now deprecated and shouldn't be used.\n    // Instead, it now uses `key` as the key in the `object`.\n    // And column name is now read not from `key` but from `schemaEntry.column` property.\n    var propertyName = key;\n    var columnTitle = schemaEntry.column;\n\n    // The path of this property inside the resulting object.\n    var propertyPath = \"\".concat(path || '', \".\").concat(propertyName);\n\n    // Read the cell value for the schema entry.\n    var cellValue;\n    var columnIndex = columns.indexOf(columnTitle);\n    var isMissingColumn = columnIndex < 0;\n    if (!isMissingColumn) {\n      cellValue = row[columnIndex];\n    }\n    var value;\n    var error;\n    var reason;\n\n    // Get property `value` from cell value.\n    if (schemaEntry.schema) {\n      value = read(schemaEntry.schema, row, rowIndex, propertyPath, columns, errors, options);\n    } else {\n      if (isMissingColumn) {\n        if ('schemaPropertyValueForMissingColumn' in options) {\n          value = options.schemaPropertyValueForMissingColumn;\n        }\n      } else if (cellValue === undefined) {\n        // This isn't supposed to be possible. Cell values are always `null` when cells are empty.\n        // Employ some sensible fallback behavior here.\n        if ('schemaPropertyValueForMissingValue' in options) {\n          value = options.schemaPropertyValueForMissingValue;\n        }\n      } else if (cellValue === null) {\n        if ('schemaPropertyValueForMissingValue' in options) {\n          value = options.schemaPropertyValueForMissingValue;\n        }\n      } else if (Array.isArray(schemaEntry.type)) {\n        var array = parseArray(cellValue, options.arrayValueSeparator).map(function (_value) {\n          if (error) {\n            return;\n          }\n          var result = parseValue(_value, schemaEntry, options);\n          if (result.error) {\n            // In case of an error, `value` won't be returned and will just be reported\n            // as part of an `error` object, so it's fine assigning just an element of the array.\n            value = _value;\n            error = result.error;\n            reason = result.reason;\n          }\n          return result.value;\n        });\n        if (!error) {\n          var isEmpty = array.every(isEmptyValue);\n          value = isEmpty ? options.getEmptyArrayValue(array, {\n            path: propertyPath\n          }) : array;\n        }\n      } else {\n        var result = parseValue(cellValue, schemaEntry, options);\n        error = result.error;\n        reason = result.reason;\n        value = error ? cellValue : result.value;\n      }\n    }\n\n    // Apply `required` validation if the value is \"empty\".\n    if (!error && isEmptyValue(value)) {\n      if (schemaEntry.required) {\n        // Will perform this `required()` validation in the end,\n        // when all properties of the mapped object have been mapped.\n        pendingRequiredChecks.push({\n          schemaEntry: schemaEntry,\n          value: value,\n          isMissingColumn: isMissingColumn\n        });\n      }\n    }\n    if (error) {\n      // If there was an error then the property value in the `object` will be `undefined`,\n      // i.e it won't add the property value to the mapped object.\n      errors.push(createError({\n        schemaEntry: schemaEntry,\n        value: value,\n        error: error,\n        reason: reason\n      }));\n    } else {\n      // Possibly unmark the mapped object as \"empty\".\n      if (isEmptyObject && !isEmptyValue(value)) {\n        isEmptyObject = false;\n      }\n      // Set the value in the mapped object.\n      // Skip setting `undefined` values because they're already `undefined`\n      // due to not having previously been set.\n      if (value !== undefined) {\n        object[propertyName] = value;\n      }\n    }\n  };\n  for (var _i = 0, _Object$keys = Object.keys(schema); _i < _Object$keys.length; _i++) {\n    _loop();\n  }\n\n  // Return `null` for an \"empty\" mapped object.\n  if (isEmptyObject) {\n    return options.getEmptyObjectValue(object, {\n      path: path\n    });\n  }\n\n  // Perform any `required` validations.\n  for (var _i2 = 0, _pendingRequiredCheck = pendingRequiredChecks; _i2 < _pendingRequiredCheck.length; _i2++) {\n    var _pendingRequiredCheck2 = _pendingRequiredCheck[_i2],\n      schemaEntry = _pendingRequiredCheck2.schemaEntry,\n      value = _pendingRequiredCheck2.value,\n      isMissingColumn = _pendingRequiredCheck2.isMissingColumn;\n    // Can optionally skip `required` validation for missing columns.\n    var skipRequiredValidation = isMissingColumn && options.schemaPropertyShouldSkipRequiredValidationForMissingColumn(schemaEntry.column, {\n      object: object\n    });\n    if (!skipRequiredValidation) {\n      var required = schemaEntry.required;\n      var isRequired = typeof required === 'boolean' ? required : required(object);\n      if (isRequired) {\n        errors.push(createError({\n          schemaEntry: schemaEntry,\n          value: value,\n          error: 'required'\n        }));\n      }\n    }\n  }\n\n  // Return the mapped object.\n  return object;\n}\n\n/**\r\n * Converts textual value to a javascript typed value.\r\n * @param  {any} value\r\n * @param  {object} schemaEntry\r\n * @return {{ value: any, error: string }}\r\n */\nexport function parseValue(value, schemaEntry, options) {\n  if (value === null) {\n    return {\n      value: null\n    };\n  }\n  var result;\n  if (schemaEntry.parse) {\n    throw new Error('`schemaEntry.parse` property was renamed to `schemaEntry.type`');\n  } else if (schemaEntry.type) {\n    result = parseValueOfType(value,\n    // Supports parsing array types.\n    // See `parseArray()` function for more details.\n    // Example `type`: String[]\n    // Input: 'Barack Obama, \"String, with, colons\", Donald Trump'\n    // Output: ['Barack Obama', 'String, with, colons', 'Donald Trump']\n    Array.isArray(schemaEntry.type) ? schemaEntry.type[0] : schemaEntry.type, options);\n  } else {\n    result = {\n      value: value\n    };\n    // throw new Error('Invalid schema entry: no `type` specified:\\n\\n' + JSON.stringify(schemaEntry, null, 2))\n  }\n  // If errored then return the error.\n  if (result.error) {\n    return result;\n  }\n  if (result.value !== null) {\n    if (schemaEntry.oneOf && schemaEntry.oneOf.indexOf(result.value) < 0) {\n      return {\n        error: 'invalid',\n        reason: 'unknown'\n      };\n    }\n    if (schemaEntry.validate) {\n      try {\n        schemaEntry.validate(result.value);\n      } catch (error) {\n        return {\n          error: error.message\n        };\n      }\n    }\n  }\n  return result;\n}\n\n/**\r\n * Converts textual value to a custom value using supplied `.parse()`.\r\n * @param  {any} value\r\n * @param  {function} parse\r\n * @return {{ value: any, error: string }}\r\n */\nfunction parseCustomValue(value, parse) {\n  try {\n    var parsedValue = parse(value);\n    if (parsedValue === undefined) {\n      return {\n        value: null\n      };\n    }\n    return {\n      value: parsedValue\n    };\n  } catch (error) {\n    var result = {\n      error: error.message\n    };\n    if (error.reason) {\n      result.reason = error.reason;\n    }\n    return result;\n  }\n}\n\n/**\r\n * Converts textual value to a javascript typed value.\r\n * @param  {any} value\r\n * @param  {} type\r\n * @return {{ value: (string|number|Date|boolean), error: string, reason?: string }}\r\n */\nfunction parseValueOfType(value, type, options) {\n  switch (type) {\n    case String:\n      return parseCustomValue(value, StringType);\n    case Number:\n      return parseCustomValue(value, NumberType);\n    case Date:\n      return parseCustomValue(value, function (value) {\n        return DateType(value, {\n          properties: options.properties\n        });\n      });\n    case Boolean:\n      return parseCustomValue(value, BooleanType);\n    default:\n      if (typeof type === 'function') {\n        return parseCustomValue(value, type);\n      }\n      throw new Error(\"Unsupported schema type: \".concat(type && type.name || type));\n  }\n}\nexport function getBlock(string, endCharacter, startIndex) {\n  var i = 0;\n  var substring = '';\n  var character;\n  while (startIndex + i < string.length) {\n    var _character = string[startIndex + i];\n    if (_character === endCharacter) {\n      return [substring, i];\n    } else if (_character === '\"') {\n      var block = getBlock(string, '\"', startIndex + i + 1);\n      substring += block[0];\n      i += '\"'.length + block[1] + '\"'.length;\n    } else {\n      substring += _character;\n      i++;\n    }\n  }\n  return [substring, i];\n}\n\n/**\r\n * Parses a string of comma-separated substrings into an array of substrings.\r\n * (the `export` is just for tests)\r\n * @param  {string} string — A string of comma-separated substrings.\r\n * @return {string[]} An array of substrings.\r\n */\nexport function parseArray(string, arrayValueSeparator) {\n  var blocks = [];\n  var index = 0;\n  while (index < string.length) {\n    var _getBlock = getBlock(string, arrayValueSeparator, index),\n      _getBlock2 = _slicedToArray(_getBlock, 2),\n      substring = _getBlock2[0],\n      length = _getBlock2[1];\n    index += length + arrayValueSeparator.length;\n    blocks.push(substring.trim());\n  }\n  return blocks;\n}\n\n// Transpose a 2D array.\n// https://stackoverflow.com/questions/17428587/transposing-a-2d-array-in-javascript\nvar transpose = function transpose(array) {\n  return array[0].map(function (_, i) {\n    return array.map(function (row) {\n      return row[i];\n    });\n  });\n};\nfunction validateSchema(schema) {\n  for (var _i3 = 0, _Object$keys2 = Object.keys(schema); _i3 < _Object$keys2.length; _i3++) {\n    var key = _Object$keys2[_i3];\n    var schemaEntry = schema[key];\n    // Validate that the `schema` is not using a deprecated `type: nestedSchema` format.\n    if (_typeof(schemaEntry.type) === 'object' && !Array.isArray(schemaEntry.type)) {\n      throw new Error('When defining a nested schema, use a `schema` property instead of a `type` property');\n    }\n    // Validate that every property has a source `column` title specified for it.\n    if (!schemaEntry.schema) {\n      if (!schemaEntry.column) {\n        throw new Error(\"\\\"column\\\" not defined for schema entry \\\"\".concat(key, \"\\\".\"));\n      }\n    }\n  }\n}\nfunction isEmptyValue(value) {\n  return value === undefined || value === null;\n}\n//# sourceMappingURL=mapToObjects.js.map","import parseDate from '../read/parseDate.js';\nimport InvalidError from './InvalidError.js';\nexport default function DateType(value, _ref) {\n  var properties = _ref.properties;\n  // XLSX has no specific format for dates.\n  // Sometimes a date can be heuristically detected.\n  // https://github.com/catamphetamine/read-excel-file/issues/3#issuecomment-395770777\n  if (value instanceof Date) {\n    if (isNaN(value.valueOf())) {\n      throw new InvalidError('out_of_bounds');\n    }\n    return value;\n  }\n  if (typeof value === 'number') {\n    if (isNaN(value)) {\n      throw new InvalidError('invalid_number');\n    }\n    if (!isFinite(value)) {\n      throw new InvalidError('out_of_bounds');\n    }\n    var date = parseDate(value, properties);\n    if (isNaN(date.valueOf())) {\n      throw new InvalidError('out_of_bounds');\n    }\n    return date;\n  }\n  throw new InvalidError('not_a_date');\n}\n//# sourceMappingURL=Date.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); }\nvar _excluded = [\"schema\"];\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); }\nfunction _objectWithoutProperties(source, excluded) { if (source == null) return {}; var target = _objectWithoutPropertiesLoose(source, excluded); var key, i; if (Object.getOwnPropertySymbols) { var sourceSymbolKeys = Object.getOwnPropertySymbols(source); for (i = 0; i < sourceSymbolKeys.length; i++) { key = sourceSymbolKeys[i]; if (excluded.indexOf(key) >= 0) continue; if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue; target[key] = source[key]; } } return target; }\nfunction _objectWithoutPropertiesLoose(source, excluded) { if (source == null) return {}; var target = {}; var sourceKeys = Object.keys(source); var key, i; for (i = 0; i < sourceKeys.length; i++) { key = sourceKeys[i]; if (excluded.indexOf(key) >= 0) continue; target[key] = source[key]; } return target; }\nimport readXlsx from './readXlsx.js';\nimport mapToObjects from './schema/mapToObjects.js';\nexport default function readXlsxFileContents(entries, xml, _ref) {\n  var schema = _ref.schema,\n    options = _objectWithoutProperties(_ref, _excluded);\n  if (options.map) {\n    throw new Error('`map` option was removed. Pass a `schema` option instead.');\n  }\n  // `readXlsx()` function creates `options.rowIndexSourceMap` property.\n  // It maps parsed data row indexes to spreadsheet row indexes.\n  // That's because empty rows are ignored (discarded) when parsing using `schema`.\n  var result = readXlsx(entries, xml, _objectSpread(_objectSpread({}, options), {}, {\n    properties: schema || options.properties\n  }));\n  if (schema) {\n    return mapToObjects(result.data, schema, _objectSpread(_objectSpread({}, options), {}, {\n      properties: result.properties\n    }));\n  }\n  return result;\n}\n//# sourceMappingURL=readXlsxFileContents.js.map","import xml from '../xml/xmlBrowser.js';\nimport unpackXlsxFile from './unpackXlsxFileBrowser.js';\nimport readXlsxFileContents from './readXlsxFileContents.js';\n\n/**\r\n * Reads XLSX file into a 2D array of cells in a browser.\r\n * @param  {file} file - A file being uploaded in the browser.\r\n * @param  {object?} options\r\n * @param  {(number|string)?} options.sheet - Excel document sheet to read. Defaults to `1`. Will only read this sheet and skip others.\r\n * @return {Promise} Resolves to a 2D array of cells: an array of rows, each row being an array of cells.\r\n */\nexport default function readXlsxFile(file) {\n  var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n  return unpackXlsxFile(file).then(function (entries) {\n    return readXlsxFileContents(entries, xml, options);\n  });\n}\n//# sourceMappingURL=readXlsxFileBrowser.js.map"],"names":["xml","createDocument","content","DOMParser","parseFromString","trim","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","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","b2","b4","b8","inflateSync","data","opts","out","dictionary","td","TextDecoder","decode","stream","dutf8","String","fromCharCode","strFromU8","latin1","apply","slzh","zh","z","fnl","fn","es","bs","z64e","sc","su","off","unpackXlsxArrayBuffer","arrayBuffer","contents","files","ze","fltr","filter","c_2","no","name","size","originalSize","compression","unzipSync","Promise","resolve","unzippedFiles","_i","_Object$keys","Object","keys","key","getContents","findChild","node","tagName","childNodes","childNode","nodeType","getTagName","findChildren","results","push","forEach","func","NAMESPACE_REG_EXP","element","replace","isElement","getOuterXml","textContent","attributes","value","getSharedStrings","document","sst","documentElement","string","parseProperties","book","properties","workbookProperties","getAttribute","epoch1904","sheets","getSheets","sheet","id","relationId","parseFilePaths","filePaths","sharedStrings","undefined","styles","getRelationships","relationship","filePath","getFilePath","path","slice","_typeof","Symbol","iterator","constructor","prototype","ownKeys","getOwnPropertySymbols","getOwnPropertyDescriptor","enumerable","_objectSpread","arguments","_defineProperty","getOwnPropertyDescriptors","defineProperties","defineProperty","obj","arg","input","hint","prim","toPrimitive","res","call","TypeError","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","parseExcelDate","excelSerialDate","options","Date","round","_createForOfIteratorHelperLoose","allowArrayLike","it","next","bind","Array","isArray","minLen","_arrayLikeToArray","toString","from","test","_unsupportedIterableToArray","done","arr","len","arr2","isDateTimestamp","styleId","concat","BUILT_IN_DATE_NUMBER_FORMAT_IDS","indexOf","dateFormat","smartDateParser","_step","_iterator","toLowerCase","DATE_FORMAT_WEIRD_PREFIX","DATE_FORMAT_WEIRD_POSTFIX","split","token","DATE_TEMPLATE_TOKENS","isDateTemplate","parseCellValue","_ref","getInlineStringValue","getInlineStringXml","getStyleId","values","parseString","sharedStringIndex","isNaN","errorCode","decodeError","parsedDate","valueOf","parseDate","parseNumberDefault","parseNumber","stringifiedNumber","parsedNumber","LETTERS","columnLettersToNumber","columnLetters","parseCellCoordinates","coords","parseInt","parseCell","valueElement","getCellValue","row","column","firstChild","getCellInlineStringValue","parseCells","cells","sheetData","cell","getCells","_slicedToArray","_arrayWithHoles","u","_iterableToArrayLimit","_nonIterableRest","parseDimensions","dimensions","getDimensions","_ref2","getData","_dimensions","rightBottom","colsCount","rowsCount","rowIndex","columnIndex","rowIndexSourceMap","_ref$accessor","accessor","_","onlyTrimAtTheEnd","empty","splice","dropEmptyRows","dropEmptyColumns","transformData","readXlsx","getXmlFileContent","parseSharedStrings","sheetId","_sheet","_sheet2","getSheetId","sheetsList","join","createSheetNotFoundError","comparator","allRows","sort","allCols","minRow","maxRow","calculateDimensions","parseSheet","_defineProperties","target","props","descriptor","_createSuper","Derived","hasNativeReflectConstruct","_isNativeReflectConstruct","result","Super","_getPrototypeOf","NewTarget","this","Reflect","construct","self","ReferenceError","_assertThisInitialized","_possibleConstructorReturn","_wrapNativeSuper","Class","_cache","Map","Function","has","get","Wrapper","_construct","create","_setPrototypeOf","Parent","args","instance","sham","Proxy","Boolean","setPrototypeOf","__proto__","getPrototypeOf","InvalidError","_Error","subClass","superClass","_inherits","Constructor","protoProps","staticProps","_super","reason","_this","_classCallCheck","NumberType","stringifiedValue","isFinite","StringType","BooleanType","_excluded","_objectWithoutProperties","source","excluded","sourceKeys","_objectWithoutPropertiesLoose","sourceSymbolKeys","propertyIsEnumerable","DEFAULT_OPTIONS","schemaPropertyValueForMissingColumn","schemaPropertyValueForMissingValue","schemaPropertyShouldSkipRequiredValidationForMissingColumn","getEmptyObjectValue","getEmptyArrayValue","isColumnOriented","ignoreEmptyRows","arrayValueSeparator","mapToObjects","schema","_options","rowIndexSourceMapOriginal","schemaTransformOptions","_i3","_Object$keys2","schemaEntry","validateSchema","transpose","every","columns","errors","read","error","rows","object","isEmptyObject","createError","errorMessage","pendingRequiredChecks","_loop","cellValue","propertyName","columnTitle","propertyPath","isMissingColumn","array","blocks","index","_getBlock2","getBlock","substring","parseArray","_value","parseValue","isEmpty","isEmptyValue","required","_i2","_pendingRequiredCheck","_pendingRequiredCheck2","parse","parseCustomValue","date","DateType","parseValueOfType","oneOf","validate","message","parsedValue","endCharacter","startIndex","_character","block","file","File","Blob","then","entries","readXlsxFileContents"],"mappings":"6OAAe,IAAAA,EAAA,CACbC,eAAgB,SAAwBC,GAMtC,OAAO,IAAIC,WAAYC,gBAAgBF,EAAQG,OAAQ,WACxD,GCsBCC,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,EAKIG,EAAM,SAAUb,EAAGR,EAAGsB,GAMtB,OALS,MAALtB,GAAaA,EAAI,KACjBA,EAAI,IACC,MAALsB,GAAaA,EAAId,EAAEP,UACnBqB,EAAId,EAAEP,QAEH,IAAI1B,EAAGiC,EAAEe,SAASvB,EAAGsB,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,EAAIhC,OAAQqC,EAAKF,EAAOA,EAAKnC,OAAS,EAC/C,IAAKoC,GAAMH,EAAGK,IAAML,EAAGhC,EACnB,OAAOiC,GAAO,IAAI5D,EAAG,GACzB,IAAIiE,GAASL,EAETM,EAASD,GAAiB,GAARN,EAAG9C,EAErBsD,EAAOR,EAAG9C,EAEVoD,IACAL,EAAM,IAAI5D,EAAQ,EAAL8D,IAEjB,IAAIM,EAAO,SAAUzC,GACjB,IAAI0C,EAAKT,EAAIlC,OAEb,GAAIC,EAAI0C,EAAI,CAER,IAAIC,EAAO,IAAItE,EAAGuE,KAAKhC,IAAS,EAAL8B,EAAQ1C,IACnC2C,EAAKE,IAAIZ,GACTA,EAAMU,CACT,CACT,EAEQG,EAAQd,EAAGK,GAAK,EAAGU,EAAMf,EAAGhB,GAAK,EAAGgC,EAAKhB,EAAG/C,GAAK,EAAGgE,EAAKjB,EAAGhC,EAAGkD,EAAKlB,EAAGjB,EAAGoC,EAAMnB,EAAGzB,EAAG6C,EAAMpB,EAAGqB,EAE/FC,EAAY,EAALnB,EACX,EAAG,CACC,IAAKc,EAAI,CAELH,EAAQhC,EAAKiB,EAAKgB,EAAK,GAEvB,IAAIQ,EAAOzC,EAAKiB,EAAKgB,EAAM,EAAG,GAE9B,GADAA,GAAO,GACFQ,EAAM,CAEP,IAAuBvD,EAAI+B,GAAvBjC,EAAgB,IAAPiD,EAjGU,GAAK,EAAK,IAiGE,GAAMhB,EAAIjC,EAAI,IAAM,EAAI0D,EAAI1D,EAAIE,EACnE,GAAIwD,EAAIrB,EAAI,CACJK,GACAjB,EAAI,GACR,KACH,CAEGgB,GACAE,EAAKO,EAAKhD,GAEdiC,EAAIY,IAAId,EAAIV,SAASvB,EAAG0D,GAAIR,GAE5BhB,EAAG/C,EAAI+D,GAAMhD,EAAGgC,EAAGhB,EAAI+B,EAAU,EAAJS,EAAOxB,EAAGK,EAAIS,EAC3C,QACH,CACI,GAAY,GAARS,EACLN,EAAKvC,EAAMwC,EAAKvC,EAAMwC,EAAM,EAAGC,EAAM,OACpC,GAAY,GAARG,EAAW,CAEhB,IAAIE,EAAO3C,EAAKiB,EAAKgB,EAAK,IAAM,IAAKW,EAAQ5C,EAAKiB,EAAKgB,EAAM,GAAI,IAAM,EACnEY,EAAKF,EAAO3C,EAAKiB,EAAKgB,EAAM,EAAG,IAAM,EACzCA,GAAO,GAKP,IAHA,IAAIa,EAAM,IAAIvF,EAAGsF,GAEbE,EAAM,IAAIxF,EAAG,IACRa,EAAI,EAAGA,EAAIwE,IAASxE,EAEzB2E,EAAIhF,EAAKK,IAAM4B,EAAKiB,EAAKgB,EAAU,EAAJ7D,EAAO,GAE1C6D,GAAe,EAARW,EAEP,IAAII,EAAMlD,EAAIiD,GAAME,GAAU,GAAKD,GAAO,EAEtCE,EAAMrE,EAAKkE,EAAKC,EAAK,GACzB,IAAS5E,EAAI,EAAGA,EAAIyE,GAAK,CACrB,IAII7D,EAJAX,EAAI6E,EAAIlD,EAAKiB,EAAKgB,EAAKgB,IAM3B,GAJAhB,GAAW,GAAJ5D,GAEHW,EAAIX,GAAK,GAEL,GACJyE,EAAI1E,KAAOY,MAEV,CAED,IAAImE,EAAI,EAAGZ,EAAI,EAOf,IANS,IAALvD,GACAuD,EAAI,EAAIvC,EAAKiB,EAAKgB,EAAK,GAAIA,GAAO,EAAGkB,EAAIL,EAAI1E,EAAI,IACvC,IAALY,GACLuD,EAAI,EAAIvC,EAAKiB,EAAKgB,EAAK,GAAIA,GAAO,GACxB,IAALjD,IACLuD,EAAI,GAAKvC,EAAKiB,EAAKgB,EAAK,KAAMA,GAAO,GAClCM,KACHO,EAAI1E,KAAO+E,CAClB,CACJ,CAED,IAAIC,EAAKN,EAAIvC,SAAS,EAAGoC,GAAOU,EAAKP,EAAIvC,SAASoC,GAElDN,EAAMvC,EAAIsD,GAEVd,EAAMxC,EAAIuD,GACVlB,EAAKtD,EAAKuE,EAAIf,EAAK,GACnBD,EAAKvD,EAAKwE,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,GAAhCN,EAAIhB,EAAG/B,EAAOa,EAAKgB,GAAOqB,KAAiB,EAE/C,IADArB,GAAW,GAAJkB,GACGX,EAAM,CACRd,GACAjB,EAAI,GACR,KACH,CAGD,GAFK0C,GACD1C,EAAI,GACJgD,EAAM,IACNtC,EAAIe,KAAQuB,MACX,IAAW,KAAPA,EAAY,CACjBD,EAAOvB,EAAKE,EAAK,KACjB,KACH,CAEG,IAAIuB,GAAMD,EAAM,IAEhB,GAAIA,EAAM,IAAK,CAEX,IAAmBtF,GAAIN,EAAnBO,EAAIqF,EAAM,KACdC,GAAM1D,EAAKiB,EAAKgB,GAAM,GAAK9D,IAAK,GAAKK,EAAGJ,GACxC6D,GAAO9D,EACV,CAED,IAAI8B,GAAImC,EAAGhC,EAAOa,EAAKgB,GAAOsB,GAAMI,GAAO1D,IAAK,EAC3CA,IACDQ,EAAI,GACRwB,GAAW,GAAJhC,GACHoD,EAAK3E,EAAGiF,IACZ,GAAIA,GAAO,EAAG,CACNxF,GAAIL,EAAK6F,IACbN,GAAMjD,EAAOa,EAAKgB,IAAQ,GAAK9D,IAAK,EAAG8D,GAAO9D,EACjD,CACD,GAAI8D,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,EAAGhC,EAAIiD,EAAIjB,EAAGhB,EAAIsD,EAAMtC,EAAG/C,EAAI+D,EAAIhB,EAAGK,EAAIS,EACtCG,IACAH,EAAQ,EAAGd,EAAGzB,EAAI4C,EAAKnB,EAAGjB,EAAImC,EAAIlB,EAAGqB,EAAID,EAChD,QAASN,GAEV,OAAOE,GAAMf,EAAIlC,QAAUuC,EAAQnB,EAAIc,EAAK,EAAGe,GAAMf,EAAIZ,SAAS,EAAG2B,EACzE,EAoOI8B,EAAmB,IAAIzG,EAAG,GA4U1B0G,EAAK,SAAUhE,EAAG9B,GAAK,OAAO8B,EAAE9B,GAAM8B,EAAE9B,EAAI,IAAM,CAAG,EAErD+F,EAAK,SAAUjE,EAAG9B,GAAK,OAAQ8B,EAAE9B,GAAM8B,EAAE9B,EAAI,IAAM,EAAM8B,EAAE9B,EAAI,IAAM,GAAO8B,EAAE9B,EAAI,IAAM,MAAS,CAAE,EACnGgG,EAAK,SAAUlE,EAAG9B,GAAK,OAAO+F,EAAGjE,EAAG9B,GAAqB,WAAf+F,EAAGjE,EAAG9B,EAAI,IAwPjD,SAASiG,EAAYC,EAAMC,GAC9B,OAAOtD,EAAMqD,EAAM,CAAEjG,EAAG,GAAKkG,GAAQA,EAAKC,IAAKD,GAAQA,EAAKE,WAChE,CA0bA,IAAIC,EAA2B,oBAAfC,aAA4C,IAAIA,YAGhE,IACID,EAAGE,OAAOX,EAAI,CAAEY,QAAQ,IAClB,CACV,CACA,MAAOtE,GAAM,CAEb,IAAIuE,EAAQ,SAAU5E,GAClB,IAAK,IAAI5B,EAAI,GAAID,EAAI,IAAK,CACtB,IAAI+E,EAAIlD,EAAE7B,KACNH,GAAMkF,EAAI,MAAQA,EAAI,MAAQA,EAAI,KACtC,GAAI/E,EAAIH,EAAKgC,EAAEhB,OACX,MAAO,CAAED,EAAGX,EAAGA,EAAGgC,EAAIJ,EAAG7B,EAAI,IAC5BH,EAEU,GAANA,GACLkF,IAAU,GAAJA,IAAW,IAAe,GAATlD,EAAE7B,OAAc,IAAe,GAAT6B,EAAE7B,OAAc,EAAc,GAAT6B,EAAE7B,MAAc,MAC9EC,GAAKyG,OAAOC,aAAa,MAAS5B,GAAK,GAAK,MAAa,KAAJA,IAGzD9E,GADU,EAALJ,EACA6G,OAAOC,cAAkB,GAAJ5B,IAAW,EAAc,GAATlD,EAAE7B,MAEvC0G,OAAOC,cAAkB,GAAJ5B,IAAW,IAAe,GAATlD,EAAE7B,OAAc,EAAc,GAAT6B,EAAE7B,MARlEC,GAAKyG,OAAOC,aAAa5B,EAShC,CACL,EA4HO,SAAS6B,EAAU/D,EAAKgE,GAC3B,GAAIA,EAAQ,CAER,IADA,IAAI5G,EAAI,GACCD,EAAI,EAAGA,EAAI6C,EAAIhC,OAAQb,GAAK,MACjCC,GAAKyG,OAAOC,aAAaG,MAAM,KAAMjE,EAAIV,SAASnC,EAAGA,EAAI,QAC7D,OAAOC,CACV,CACI,GAAIoG,EACL,OAAOA,EAAGE,OAAO1D,GAGjB,IAAI1C,EAAKsG,EAAM5D,GAAMjC,EAAIT,EAAGS,EAG5B,OAH+BX,EAAIE,EAAGF,GAChCY,QACFwB,EAAI,GACDzB,CAEf,CAKA,IAAImG,EAAO,SAAUlF,EAAG9B,GAAK,OAAOA,EAAI,GAAK8F,EAAGhE,EAAG9B,EAAI,IAAM8F,EAAGhE,EAAG9B,EAAI,KAEnEiH,EAAK,SAAUnF,EAAG9B,EAAGkH,GACrB,IAAIC,EAAMrB,EAAGhE,EAAG9B,EAAI,IAAKoH,EAAKP,EAAU/E,EAAEM,SAASpC,EAAI,GAAIA,EAAI,GAAKmH,KAAuB,KAAfrB,EAAGhE,EAAG9B,EAAI,KAAaqH,EAAKrH,EAAI,GAAKmH,EAAKG,EAAKvB,EAAGjE,EAAG9B,EAAI,IACjII,EAAK8G,GAAW,YAANI,EAAmBC,EAAKzF,EAAGuF,GAAM,CAACC,EAAIvB,EAAGjE,EAAG9B,EAAI,IAAK+F,EAAGjE,EAAG9B,EAAI,KAAMwH,EAAKpH,EAAG,GAAIqH,EAAKrH,EAAG,GAAIsH,EAAMtH,EAAG,GACpH,MAAO,CAAC0F,EAAGhE,EAAG9B,EAAI,IAAKwH,EAAIC,EAAIL,EAAIC,EAAKvB,EAAGhE,EAAG9B,EAAI,IAAM8F,EAAGhE,EAAG9B,EAAI,IAAK0H,EAC3E,EAEIH,EAAO,SAAUzF,EAAG9B,GACpB,KAAmB,GAAZ8F,EAAGhE,EAAG9B,GAASA,GAAK,EAAI8F,EAAGhE,EAAG9B,EAAI,IAEzC,MAAO,CAACgG,EAAGlE,EAAG9B,EAAI,IAAKgG,EAAGlE,EAAG9B,EAAI,GAAIgG,EAAGlE,EAAG9B,EAAI,IACnD,EClxDA,SAAS2H,EAAsBC,GAC7B,IACIC,EDwiFC,SAAmB3B,EAAMC,GAG5B,IAFA,IAAI2B,EAAQ,CAAA,EACR3F,EAAI+D,EAAKpF,OAAS,GACA,WAAfiF,EAAGG,EAAM/D,KAAmBA,IAC1BA,GAAK+D,EAAKpF,OAASqB,EAAI,QACxBG,EAAI,IAGZ,IAAI0C,EAAIc,EAAGI,EAAM/D,EAAI,GACrB,IAAK6C,EACD,MAAO,GACX,IAAIhD,EAAI+D,EAAGG,EAAM/D,EAAI,IACjB+E,EAAS,YAALlF,GAAwB,OAALgD,EAC3B,GAAIkC,EAAG,CACH,IAAIa,EAAKhC,EAAGG,EAAM/D,EAAI,KACtB+E,EAAoB,WAAhBnB,EAAGG,EAAM6B,MAET/C,EAAIe,EAAGG,EAAM6B,EAAK,IAClB/F,EAAI+D,EAAGG,EAAM6B,EAAK,IAEzB,CAED,IADA,IAAIC,EAAO7B,GAAQA,EAAK8B,OACfhI,EAAI,EAAGA,EAAI+E,IAAK/E,EAAG,CACxB,IAAIG,EAAK6G,EAAGf,EAAMlE,EAAGkF,GAAIgB,EAAM9H,EAAG,GAAIoH,EAAKpH,EAAG,GAAIqH,EAAKrH,EAAG,GAAIgH,EAAKhH,EAAG,GAAI+H,EAAK/H,EAAG,GAAIsH,EAAMtH,EAAG,GAAIJ,EAAIgH,EAAKd,EAAMwB,GAClH1F,EAAImG,EACCH,IAAQA,EAAK,CACdI,KAAMhB,EACNiB,KAAMb,EACNc,aAAcb,EACdc,YAAaL,MAERA,EAEW,GAAPA,EACLJ,EAAMV,GAAMnB,EAAYC,EAAK9D,SAASpC,EAAGA,EAAIwH,GAAK,CAAEpB,IAAK,IAAIhH,EAAGqI,KAEhEnF,EAAI,GAAI,4BAA8B4F,GAJtCJ,EAAMV,GAAMlF,EAAIgE,EAAMlG,EAAGA,EAAIwH,GAMxC,CACD,OAAOM,CACX,CChlFiBU,CADD,IAAInJ,WAAWuI,IAE7B,OAAOa,QAAQC,QAWjB,SAAqBb,GAEnB,IADA,IAAIc,EAAgB,GACXC,EAAK,EAAGC,EAAeC,OAAOC,KAAKlB,GAAWe,EAAKC,EAAa/H,OAAQ8H,IAAM,CACrF,IAAII,EAAMH,EAAaD,GACvBD,EAAcK,GAAOnC,EAAUgB,EAASmB,GACzC,CACD,OAAOL,CACT,CAlByBM,CAAYpB,GASrC,CClCO,SAASqB,EAAUC,EAAMC,GAE9B,IADA,IAAInJ,EAAI,EACDA,EAAIkJ,EAAKE,WAAWvI,QAAQ,CACjC,IAAIwI,EAAYH,EAAKE,WAAWpJ,GAGhC,GAA2B,IAAvBqJ,EAAUC,UAAkBC,EAAWF,KAAeF,EACxD,OAAOE,EAETrJ,GACD,CACH,CACO,SAASwJ,EAAaN,EAAMC,GAGjC,IAFA,IAAIM,EAAU,GACVzJ,EAAI,EACDA,EAAIkJ,EAAKE,WAAWvI,QAAQ,CACjC,IAAIwI,EAAYH,EAAKE,WAAWpJ,GAGL,IAAvBqJ,EAAUC,UAAkBC,EAAWF,KAAeF,GACxDM,EAAQC,KAAKL,GAEfrJ,GACD,CACD,OAAOyJ,CACT,CACO,SAASE,EAAQT,EAAMC,EAASS,GAMrC,IADA,IAAI5J,EAAI,EACDA,EAAIkJ,EAAKE,WAAWvI,QAAQ,CACjC,IAAIwI,EAAYH,EAAKE,WAAWpJ,GAC5BmJ,EAGyB,IAAvBE,EAAUC,UAAkBC,EAAWF,KAAeF,GACxDS,EAAKP,EAAWrJ,GAGlB4J,EAAKP,EAAWrJ,GAElBA,GACD,CACH,CAQA,IAAI6J,EAAoB,OACjB,SAASN,EAAWO,GAQzB,OAAOA,EAAQX,QAAQY,QAAQF,EAAmB,GACpD,CACO,SAASG,EAAUd,GAGxB,OAAyB,IAAlBA,EAAKI,QACd,CAGO,SAASW,EAAYf,GAG1B,GAAsB,IAAlBA,EAAKI,SACP,OAAOJ,EAAKgB,YAId,IAFA,IAAIrL,EAAM,IAAM0K,EAAWL,GACvBhJ,EAAI,EACDA,EAAIgJ,EAAKiB,WAAWtJ,QACzBhC,GAAO,IAAMqK,EAAKiB,WAAWjK,GAAGiI,KAAzB,KAA4Ce,EAAKiB,WAAWjK,GAAGkK,MAAQ,IAC9ElK,IAEFrB,GAAO,IAEP,IADA,IAAImB,EAAI,EACDA,EAAIkJ,EAAKE,WAAWvI,QACzBhC,GAAOoL,EAAYf,EAAKE,WAAWpJ,IACnCA,IAGF,OADAnB,GAAO,KAAO0K,EAAWL,GAAQ,GAEnC,CCzBO,SAASmB,EAAiBC,GAK/B,IDzBiCV,EAC7BH,ECwBAc,EAAMD,EAASE,gBACnB,OD1BiCZ,EC0BX,SAAUa,GAC9B,IAAInG,EAAI2E,EAAUwB,EAAQ,KAC1B,GAAInG,EACF,OAAOA,EAAE4F,YAEX,IAAIE,EAAQ,GAIZ,OAHAT,EAAQc,EAAQ,KAAK,SAAUxK,GAC7BmK,GAASnB,EAAUhJ,EAAG,KAAKiK,WACjC,IACWE,CACX,EDnCMX,EAAU,GACdE,ECwBWY,EAAK,MDxBO,SAAUrB,EAAMlJ,GACrCyJ,EAAQC,KAAKE,EAAKV,EAAMlJ,GAC5B,IACSyJ,CCgCT,CChFe,SAASiB,EAAgB3L,EAASF,GAC/C,IAAI8L,EAAO9L,EAAIC,eAAeC,GAC1B6L,EAAa,CAAA,EAMbC,ED2EG5B,EC3EwC0B,ED0EvBH,gBACG,cC1EvBK,GAAsE,MAAhDA,EAAmBC,aAAa,cACxDF,EAAWG,WAAY,GAczBH,EAAWI,OAAS,GAWpB,ODsDK,SAAmBV,GAGxB,OAAOd,EADMP,EADEqB,EAASE,gBACS,UACL,QAC9B,CC3DES,CAAUN,GAAMhB,SATG,SAAsBuB,GACnCA,EAAMJ,aAAa,SACrBF,EAAWI,OAAOtB,KAAK,CACrByB,GAAID,EAAMJ,aAAa,WACvB3C,KAAM+C,EAAMJ,aAAa,QACzBM,WAAYF,EAAMJ,aAAa,SAGvC,IAESF,CACT,CC5Be,SAASS,EAAetM,EAASF,GAS9C,IAAIyL,EAAWzL,EAAIC,eAAeC,GAC9BuM,EAAY,CACdN,OAAQ,CAAE,EACVO,mBAAeC,EACfC,YAAQD,GA0BV,OFsCK,SAA0BlB,GAE/B,OAAOd,EADac,EAASE,gBACM,eACrC,CElDEkB,CAAiBpB,GAAUX,SAfL,SAAyBgC,GAC7C,IAAIC,EAAWD,EAAab,aAAa,UAEzC,OADea,EAAab,aAAa,SAEvC,IAAK,6EACHQ,EAAUG,OAASI,EAAYD,GAC/B,MACF,IAAK,oFACHN,EAAUC,cAAgBM,EAAYD,GACtC,MACF,IAAK,gFACHN,EAAUN,OAAOW,EAAab,aAAa,OAASe,EAAYD,GAGxE,IAUSN,CACT,CACA,SAASO,EAAYC,GAQnB,MAAgB,MAAZA,EAAK,GACAA,EAAKC,MAAM,GAOb,MAAQD,CACjB,CCrEA,SAASE,EAAQjK,GAAgC,OAAOiK,EAAU,mBAAqBC,QAAU,iBAAmBA,OAAOC,SAAW,SAAUnK,GAAK,cAAcA,GAAO,SAAUA,GAAK,OAAOA,GAAK,mBAAqBkK,QAAUlK,EAAEoK,cAAgBF,QAAUlK,IAAMkK,OAAOG,UAAY,gBAAkBrK,CAAE,EAAIiK,EAAQjK,EAAK,CAC9T,SAASsK,EAAQnK,EAAGjC,GAAK,IAAIqE,EAAIuE,OAAOC,KAAK5G,GAAI,GAAI2G,OAAOyD,sBAAuB,CAAE,IAAIvK,EAAI8G,OAAOyD,sBAAsBpK,GAAIjC,IAAM8B,EAAIA,EAAEiG,QAAO,SAAU/H,GAAK,OAAO4I,OAAO0D,yBAAyBrK,EAAGjC,GAAGuM,UAAW,KAAMlI,EAAEoF,KAAK5C,MAAMxC,EAAGvC,EAAG,CAAG,OAAOuC,CAAI,CAC/P,SAASmI,EAAcvK,GAAK,IAAK,IAAIjC,EAAI,EAAGA,EAAIyM,UAAU7L,OAAQZ,IAAK,CAAE,IAAIqE,EAAI,MAAQoI,UAAUzM,GAAKyM,UAAUzM,GAAK,CAAE,EAAEA,EAAI,EAAIoM,EAAQxD,OAAOvE,IAAI,GAAIqF,SAAQ,SAAU1J,GAAK0M,EAAgBzK,EAAGjC,EAAGqE,EAAErE,GAAM,IAAI4I,OAAO+D,0BAA4B/D,OAAOgE,iBAAiB3K,EAAG2G,OAAO+D,0BAA0BtI,IAAM+H,EAAQxD,OAAOvE,IAAIqF,SAAQ,SAAU1J,GAAK4I,OAAOiE,eAAe5K,EAAGjC,EAAG4I,OAAO0D,yBAAyBjI,EAAGrE,GAAI,GAAM,CAAC,OAAOiC,CAAI,CACvb,SAASyK,EAAgBI,EAAKhE,EAAKqB,GAA4L,OAAnLrB,EAC5C,SAAwBiE,GAAO,IAAIjE,EACnC,SAAsBkE,EAAOC,GAAQ,GAAuB,WAAnBlB,EAAQiB,IAAiC,OAAVA,EAAgB,OAAOA,EAAO,IAAIE,EAAOF,EAAMhB,OAAOmB,aAAc,QAAa5B,IAAT2B,EAAoB,CAAE,IAAIE,EAAMF,EAAKG,KAAKL,EAAOC,GAAQ,WAAY,GAAqB,WAAjBlB,EAAQqB,GAAmB,OAAOA,EAAK,MAAM,IAAIE,UAAU,+CAAkD,CAAC,OAAiB,WAATL,EAAoBxG,OAAS8G,QAAQP,EAAS,CADpVQ,CAAaT,EAAK,UAAW,MAAwB,WAAjBhB,EAAQjD,GAAoBA,EAAMrC,OAAOqC,EAAO,CAD3E2E,CAAe3E,MAAiBgE,EAAOlE,OAAOiE,eAAeC,EAAKhE,EAAK,CAAEqB,MAAOA,EAAOoC,YAAY,EAAMmB,cAAc,EAAMC,UAAU,IAAkBb,EAAIhE,GAAOqB,EAAgB2C,CAAM,CAQ7N,SAASc,GAAY9O,EAASF,GAC3C,IAAKE,EACH,MAAO,GAKT,IHuB4BuL,EAExBwD,EGzBAC,EAAMlP,EAAIC,eAAeC,GACzBiP,GHsBwB1D,EGtBGyD,EHwB3BD,EAAe7E,EADFqB,EAASE,gBACe,gBACrCsD,EACKtE,EAAasE,EAAc,MAE7B,IG5B6BG,IAAIC,IACpCC,EHqCC,SAA0B7D,GAC/B,IAEI8D,EAAUnF,EAFGqB,EAASE,gBAEU,WACpC,OAAI4D,EACK5E,EAAa4E,EAAS,UAExB,EACT,CG7CsBC,CAAiBN,GAAKE,IAAIK,IAAwBC,QAAO,SAAUC,EAASC,GAI9F,OADAD,EAAQC,EAAOtD,IAAMsD,EACdD,CACR,GAAE,IAOH,OHiBK,SAAuBlE,GAC5B,IACIoE,EAAUzF,EADGqB,EAASE,gBACU,WACpC,OAAKkE,EAGElF,EAAakF,EAAS,MAFpB,EAGX,CGxBSC,CAAcZ,GAAKE,KANP,SAAsBW,GACvC,OAAIA,EAAGC,aAAa,QACXpC,EAAcA,EAAc,CAAE,EAAEuB,EAAWY,EAAGE,OAAQZ,GAAeU,EAAIT,IAE3ED,GAAeU,EAAIT,EAC9B,GAEA,CACA,SAASG,GAAuBS,GAC9B,MAAO,CACL5D,GAAI4D,EAAOjE,aAAa,YACxBkE,SAAUD,EAAOjE,aAAa,cAElC,CAGA,SAASoD,GAAeU,EAAIR,GAC1B,IAAIa,EAAQ,CAAA,EACZ,GAAIL,EAAGC,aAAa,YAAa,CAC/B,IAAIK,EAAiBN,EAAG9D,aAAa,YAGjCsD,EAAQc,GACVD,EAAME,aAAef,EAAQc,GAE7BD,EAAME,aAAe,CACnBhE,GAAI+D,EAGT,CACD,OAAOD,CACT,CClDe,SAASG,GAAeC,EAAiBC,GAElDA,GAAWA,EAAQvE,YACrBsE,GAAmB,MAsDrB,OAAO,IAAIE,KAAK7L,KAAK8L,MAAgD,IAAzCH,EA1CF,OAyCf,MAEb,CCjEA,SAASI,GAAgC1N,EAAG2N,GAAkB,IAAIC,EAAuB,oBAAX1D,QAA0BlK,EAAEkK,OAAOC,WAAanK,EAAE,cAAe,GAAI4N,EAAI,OAAQA,EAAKA,EAAGrC,KAAKvL,IAAI6N,KAAKC,KAAKF,GAAK,GAAIG,MAAMC,QAAQhO,KAAO4N,EACxN,SAAqC5N,EAAGiO,GAAU,IAAKjO,EAAG,OAAQ,GAAiB,iBAANA,EAAgB,OAAOkO,GAAkBlO,EAAGiO,GAAS,IAAI7L,EAAI0E,OAAOuD,UAAU8D,SAAS5C,KAAKvL,GAAGgK,MAAM,GAAI,GAAc,WAAN5H,GAAkBpC,EAAEoK,cAAahI,EAAIpC,EAAEoK,YAAYhE,MAAM,GAAU,QAANhE,GAAqB,QAANA,EAAa,OAAO2L,MAAMK,KAAKpO,GAAI,GAAU,cAANoC,GAAqB,2CAA2CiM,KAAKjM,GAAI,OAAO8L,GAAkBlO,EAAGiO,EAAU,CADnMK,CAA4BtO,KAAO2N,GAAkB3N,GAAyB,iBAAbA,EAAElB,OAAqB,CAAM8O,IAAI5N,EAAI4N,GAAI,IAAI3P,EAAI,EAAG,OAAO,WAAc,OAAIA,GAAK+B,EAAElB,OAAe,CAAEyP,MAAM,GAAe,CAAEA,MAAM,EAAOlG,MAAOrI,EAAE/B,KAAO,CAAK,CAAC,MAAM,IAAIuN,UAAU,wIAA2I,CAE5lB,SAAS0C,GAAkBM,EAAKC,IAAkB,MAAPA,GAAeA,EAAMD,EAAI1P,UAAQ2P,EAAMD,EAAI1P,QAAQ,IAAK,IAAIb,EAAI,EAAGyQ,EAAO,IAAIX,MAAMU,GAAMxQ,EAAIwQ,EAAKxQ,IAAKyQ,EAAKzQ,GAAKuQ,EAAIvQ,GAAI,OAAOyQ,CAAO,CAWpK,SAASC,GAAgBC,EAASlF,EAAQ6D,GACvD,GAAIqB,EAAS,CACX,IAAI1B,EAAQxD,EAAOkF,GACnB,IAAK1B,EACH,MAAM,IAAIxM,MAAM,yBAAyBmO,OAAOD,IAElD,IAAK1B,EAAME,aACT,OAAO,EAET,GAEA0B,GAAgCC,QAAQtD,OAAOyB,EAAME,aAAahE,MAAQ,GAG1EmE,EAAQyB,YAAc9B,EAAME,aAAaH,WAAaM,EAAQyB,aAGlC,IAA5BzB,EAAQ0B,iBAA6B/B,EAAME,aAAaH,UA6B5D,SAAwBA,GActB,IADA,IAC8DiC,EAArDC,EAAYzB,IAFrBT,GAJAA,GAJAA,EAAWA,EAASmC,eAIApH,QAAQqH,GAA0B,KAIlCrH,QAAQsH,GAA2B,KACjCC,MAAM,UAC2CL,EAAQC,KAAaZ,MAAO,CACjG,IAAIiB,EAAQN,EAAM7G,MAClB,GAAIoH,GAAqBV,QAAQS,GAAS,EACxC,OAAO,CAEV,CACD,OAAO,CACT,CAlDwEE,CAAexC,EAAME,aAAaH,UACpG,OAAO,CAEV,CACH,CAGA,IAAI6B,GAAkC,CAAC,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAYnGO,GAA2B,cAS3BC,GAA4B,MA0BhC,IAAIG,GAAuB,CAE3B,KAEA,KAEA,IAEA,KAEA,KAEA,KAEA,IAEA,KAEA,IAEA,KAEA,MAEA,OAEA,KAEA,OAOA,KCnHe,SAASE,GAAetH,EAAO/F,EAAMsN,GAClD,IAAIC,EAAuBD,EAAKC,qBAC9BC,EAAqBF,EAAKE,mBAC1BC,EAAaH,EAAKG,WAClBrG,EAASkG,EAAKlG,OACdsG,EAASJ,EAAKI,OACdnH,EAAa+G,EAAK/G,WAClB0E,EAAUqC,EAAKrC,QAajB,OAZKjL,IAGHA,EAAO,KASDA,GAKN,IAAK,MACH+F,EAAQ4H,GAAY5H,EAAOkF,GAC3B,MAKF,IAAK,YAEH,QAAc9D,KADdpB,EAAQwH,KAEN,MAAM,IAAInP,MAAM,qDAAuDmO,OAAOiB,MAEhFzH,EAAQ4H,GAAY5H,EAAOkF,GAC3B,MAOF,IAAK,IAKH,IAAI2C,EAAoBzE,OAAOpD,GAC/B,GAAI8H,MAAMD,GACR,MAAM,IAAIxP,MAAM,kCAAoCmO,OAAOxG,IAE7D,GAAI6H,GAAqBF,EAAOlR,OAC9B,MAAM,IAAI4B,MAAM,2CAA6CmO,OAAOxG,IAGtEA,EAAQ4H,GADR5H,EAAQ2H,EAAOE,GACY3C,GAC3B,MAIF,IAAK,IACH,GAAc,MAAVlF,EACFA,GAAQ,MACH,IAAc,MAAVA,EAGT,MAAM,IAAI3H,MAAM,qCAAuCmO,OAAOxG,IAF9DA,GAAQ,CAGT,CACD,MAIF,IAAK,IACHA,OAAQoB,EACR,MAMF,IAAK,IACHpB,EAoDN,SAAqB+H,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,UAAUvB,OAAOuB,GAE9B,CA5EcC,CAAYhI,GACpB,MAOF,IAAK,IACH,QAAcoB,IAAVpB,EACF,MAEF,IAAIiI,EAAa,IAAI9C,KAAKnF,GAC1B,GAAI8H,MAAMG,EAAWC,WACnB,MAAM,IAAI7P,MAAM,kCAAoCmO,OAAOxG,IAE7DA,EAAQiI,EACR,MAGF,IAAK,IACH,QAAc7G,IAAVpB,EACF,MASAA,EAP0BsG,GAAgBoB,IAAcrG,EAAQ6D,GAOxDiD,GAFRnI,EAAQoI,GAAmBpI,GAEFQ,IAKhB0E,EAAQmD,aAAeD,IAAoBpI,GAEtD,MACF,QACE,MAAM,IAAImD,UAAU,4BAA4BqD,OAAOvM,IAO3D,YAHcmH,IAAVpB,IACFA,EAAQ,MAEHA,CACT,CA6BA,SAAS4H,GAAY5H,EAAOkF,GAW1B,OANqB,IAAjBA,EAAQpQ,OACVkL,EAAQA,EAAMlL,QAEF,KAAVkL,IACFA,OAAQoB,GAEHpB,CACT,CAQA,SAASoI,GAAmBE,GAC1B,IAAIC,EAAenF,OAAOkF,GAC1B,GAAIR,MAAMS,GACR,MAAM,IAAIlQ,MAAM,iCAAmCmO,OAAO8B,IAE5D,OAAOC,CACT,CC9LA,IAAIC,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,KA0BhJ,SAASC,GAAsBC,GAI7B,IAFA,IAAI3O,EAAI,EACJnE,EAAI,EACDA,EAAI8S,EAAcjS,QACvBsD,GAAK,GACLA,GAAKyO,GAAQ9B,QAAQgC,EAAc9S,IACnCA,IAEF,OAAOmE,CACT,CACO,SAAS4O,GAAqBC,GAGnC,OADAA,EAASA,EAAO1B,MAAM,SACf,CAEP2B,SAASD,EAAO,IAEhBH,GAAsBG,EAAO,GAAG9T,QAClC,CChBe,SAASgU,GAAUhK,EAAMgC,EAAOrM,EAAKkT,EAAQtG,EAAQb,EAAY0E,GAC9E,IAOIjL,EAPA2O,EAASD,GAAqB7J,EAAK4B,aAAa,MAChDqI,ERNC,SAAsB7I,EAAUpB,GACrC,OAAOD,EAAUC,EAAM,IACzB,CQIqBkK,CAAalI,EAAOhC,GAKnCkB,EAAQ+I,GAAgBA,EAAajJ,YAKzC,OAHIhB,EAAK2F,aAAa,OACpBxK,EAAO6E,EAAK4B,aAAa,MAEpB,CACLuI,IAAKL,EAAO,GACZM,OAAQN,EAAO,GACf5I,MAAOsH,GAAetH,EAAO/F,EAAM,CACjCuN,qBAAsB,WACpB,ORlBD,SAAkCtH,EAAUpB,GACjD,GAAIA,EAAKqK,YAAcvJ,EAAUd,EAAKqK,aAA+C,OAAhChK,EAAWL,EAAKqK,aAAwBrK,EAAKqK,WAAWA,YAAcvJ,EAAUd,EAAKqK,WAAWA,aAA0D,MAA3ChK,EAAWL,EAAKqK,WAAWA,YAC7L,OAAOrK,EAAKqK,WAAWA,WAAWrJ,WAEtC,CQcesJ,CAAyBtI,EAAOhC,EACxC,EACD2I,mBAAoB,WAClB,OAAO5H,EAAYf,EACpB,EACD4I,WAAY,WACV,OAAO5I,EAAK4B,aAAa,IAC1B,EACDW,OAAQA,EACRsG,OAAQA,EACRnH,WAAYA,EACZ0E,QAASA,IAGf,CC3De,SAASmE,GAAWvI,EAAOrM,EAAKkT,EAAQtG,EAAQb,EAAY0E,GACzE,IAAIoE,ETCC,SAAkBpJ,GACvB,IACIqJ,EAAY1K,EADAqB,EAASE,gBACY,aACjCkJ,EAAQ,GAMZ,OALA/J,EAAQgK,EAAW,OAAO,SAAUN,GAClC1J,EAAQ0J,EAAK,KAAK,SAAUO,GAC1BF,EAAMhK,KAAKkK,EACjB,GACA,IACSF,CACT,CSXcG,CAAS3I,GACrB,OAAqB,IAAjBwI,EAAM7S,OACD,GASF6S,EAAMzF,KAAI,SAAU/E,GACzB,OAAOgK,GAAUhK,EAAMgC,EAAOrM,EAAKkT,EAAQtG,EAAQb,EAAY0E,EACnE,GACA,CCjBA,SAASwE,GAAevD,EAAKvQ,GAAK,OAKlC,SAAyBuQ,GAAO,GAAIT,MAAMC,QAAQQ,GAAM,OAAOA,CAAM,CAL5BwD,CAAgBxD,IAIzD,SAA+BtQ,EAAGa,GAAK,IAAIwD,EAAI,MAAQrE,EAAI,KAAO,oBAAsBgM,QAAUhM,EAAEgM,OAAOC,WAAajM,EAAE,cAAe,GAAI,MAAQqE,EAAG,CAAE,IAAIpC,EAAGiC,EAAGnE,EAAGgU,EAAGrS,EAAI,GAAIwB,GAAI,EAAIpB,GAAI,EAAI,IAAM,GAAI/B,GAAKsE,EAAIA,EAAEgJ,KAAKrN,IAAI2P,KAAM,IAAM9O,EAAG,CAAE,GAAI+H,OAAOvE,KAAOA,EAAG,OAAQnB,GAAI,CAAK,MAAM,OAASA,GAAKjB,EAAIlC,EAAEsN,KAAKhJ,IAAIgM,QAAU3O,EAAE+H,KAAKxH,EAAEkI,OAAQzI,EAAEd,SAAWC,GAAIqC,GAAI,IAAO,MAAOlD,GAAK8B,GAAI,EAAIoC,EAAIlE,CAAE,SAAa,IAAM,IAAKkD,GAAK,MAAQmB,EAAU,SAAM0P,EAAI1P,EAAU,SAAKuE,OAAOmL,KAAOA,GAAI,MAAS,CAAA,QAAW,GAAIjS,EAAG,MAAMoC,CAAI,CAAA,CAAG,OAAOxC,CAAE,CAAI,CAJzdsS,CAAsB1D,EAAKvQ,IAE5F,SAAqC+B,EAAGiO,GAAU,IAAKjO,EAAG,OAAQ,GAAiB,iBAANA,EAAgB,OAAOkO,GAAkBlO,EAAGiO,GAAS,IAAI7L,EAAI0E,OAAOuD,UAAU8D,SAAS5C,KAAKvL,GAAGgK,MAAM,GAAI,GAAc,WAAN5H,GAAkBpC,EAAEoK,cAAahI,EAAIpC,EAAEoK,YAAYhE,MAAM,GAAU,QAANhE,GAAqB,QAANA,EAAa,OAAO2L,MAAMK,KAAKpO,GAAI,GAAU,cAANoC,GAAqB,2CAA2CiM,KAAKjM,GAAI,OAAO8L,GAAkBlO,EAAGiO,EAAU,CAF9TK,CAA4BE,EAAKvQ,IACnI,WAA8B,MAAM,IAAIuN,UAAU,4IAA+I,CADxD2G,EAAqB,CAG9J,SAASjE,GAAkBM,EAAKC,IAAkB,MAAPA,GAAeA,EAAMD,EAAI1P,UAAQ2P,EAAMD,EAAI1P,QAAQ,IAAK,IAAIb,EAAI,EAAGyQ,EAAO,IAAIX,MAAMU,GAAMxQ,EAAIwQ,EAAKxQ,IAAKyQ,EAAKzQ,GAAKuQ,EAAIvQ,GAAI,OAAOyQ,CAAO,CAQpK,SAAS0D,GAAgBjJ,GACtC,IAAIkJ,EVsBC,SAAuB9J,GAC5B,IACI8J,EAAanL,EADDqB,EAASE,gBACa,aACtC,GAAI4J,EACF,OAAOA,EAAWtJ,aAAa,MAEnC,CU5BmBuJ,CAAcnJ,GAC/B,GAAIkJ,EAoBF,OAH0B,KAhB1BA,EAAaA,EAAW9C,MAAM,KAAKrD,IAAI8E,IAAsB9E,KAAI,SAAU0D,GACzE,IAAI2C,EAAQR,GAAenC,EAAM,GAGjC,MAAO,CACL0B,IAHMiB,EAAM,GAIZhB,OAHSgB,EAAM,GAKvB,KAQmBzT,SACbuT,EAAa,CAACA,EAAW,GAAIA,EAAW,KAEnCA,CAEX,CCnCA,SAAS3E,GAAgC1N,EAAG2N,GAAkB,IAAIC,EAAuB,oBAAX1D,QAA0BlK,EAAEkK,OAAOC,WAAanK,EAAE,cAAe,GAAI4N,EAAI,OAAQA,EAAKA,EAAGrC,KAAKvL,IAAI6N,KAAKC,KAAKF,GAAK,GAAIG,MAAMC,QAAQhO,KAAO4N,EACxN,SAAqC5N,EAAGiO,GAAU,IAAKjO,EAAG,OAAQ,GAAiB,iBAANA,EAAgB,OAAOkO,GAAkBlO,EAAGiO,GAAS,IAAI7L,EAAI0E,OAAOuD,UAAU8D,SAAS5C,KAAKvL,GAAGgK,MAAM,GAAI,GAAc,WAAN5H,GAAkBpC,EAAEoK,cAAahI,EAAIpC,EAAEoK,YAAYhE,MAAM,GAAU,QAANhE,GAAqB,QAANA,EAAa,OAAO2L,MAAMK,KAAKpO,GAAI,GAAU,cAANoC,GAAqB,2CAA2CiM,KAAKjM,GAAI,OAAO8L,GAAkBlO,EAAGiO,EAAU,CADnMK,CAA4BtO,KAAO2N,GAAkB3N,GAAyB,iBAAbA,EAAElB,OAAqB,CAAM8O,IAAI5N,EAAI4N,GAAI,IAAI3P,EAAI,EAAG,OAAO,WAAc,OAAIA,GAAK+B,EAAElB,OAAe,CAAEyP,MAAM,GAAe,CAAEA,MAAM,EAAOlG,MAAOrI,EAAE/B,KAAO,CAAK,CAAC,MAAM,IAAIuN,UAAU,wIAA2I,CAE5lB,SAAS0C,GAAkBM,EAAKC,IAAkB,MAAPA,GAAeA,EAAMD,EAAI1P,UAAQ2P,EAAMD,EAAI1P,QAAQ,IAAK,IAAIb,EAAI,EAAGyQ,EAAO,IAAIX,MAAMU,GAAMxQ,EAAIwQ,EAAKxQ,IAAKyQ,EAAKzQ,GAAKuQ,EAAIvQ,GAAI,OAAOyQ,CAAO,CCFnL,SAAShB,GAAgC1N,EAAG2N,GAAkB,IAAIC,EAAuB,oBAAX1D,QAA0BlK,EAAEkK,OAAOC,WAAanK,EAAE,cAAe,GAAI4N,EAAI,OAAQA,EAAKA,EAAGrC,KAAKvL,IAAI6N,KAAKC,KAAKF,GAAK,GAAIG,MAAMC,QAAQhO,KAAO4N,EACxN,SAAqC5N,EAAGiO,GAAU,IAAKjO,EAAG,OAAQ,GAAiB,iBAANA,EAAgB,OAAOkO,GAAkBlO,EAAGiO,GAAS,IAAI7L,EAAI0E,OAAOuD,UAAU8D,SAAS5C,KAAKvL,GAAGgK,MAAM,GAAI,GAAc,WAAN5H,GAAkBpC,EAAEoK,cAAahI,EAAIpC,EAAEoK,YAAYhE,MAAM,GAAU,QAANhE,GAAqB,QAANA,EAAa,OAAO2L,MAAMK,KAAKpO,GAAI,GAAU,cAANoC,GAAqB,2CAA2CiM,KAAKjM,GAAI,OAAO8L,GAAkBlO,EAAGiO,EAAU,CADnMK,CAA4BtO,KAAO2N,GAAkB3N,GAAyB,iBAAbA,EAAElB,OAAqB,CAAM8O,IAAI5N,EAAI4N,GAAI,IAAI3P,EAAI,EAAG,OAAO,WAAc,OAAIA,GAAK+B,EAAElB,OAAe,CAAEyP,MAAM,GAAe,CAAEA,MAAM,EAAOlG,MAAOrI,EAAE/B,KAAO,CAAK,CAAC,MAAM,IAAIuN,UAAU,wIAA2I,CAE5lB,SAAS0C,GAAkBM,EAAKC,IAAkB,MAAPA,GAAeA,EAAMD,EAAI1P,UAAQ2P,EAAMD,EAAI1P,QAAQ,IAAK,IAAIb,EAAI,EAAGyQ,EAAO,IAAIX,MAAMU,GAAMxQ,EAAIwQ,EAAKxQ,IAAKyQ,EAAKzQ,GAAKuQ,EAAIvQ,GAAI,OAAOyQ,CAAO,CCDnL,SAASqD,GAAevD,EAAKvQ,GAAK,OAKlC,SAAyBuQ,GAAO,GAAIT,MAAMC,QAAQQ,GAAM,OAAOA,CAAM,CAL5BwD,CAAgBxD,IAIzD,SAA+BtQ,EAAGa,GAAK,IAAIwD,EAAI,MAAQrE,EAAI,KAAO,oBAAsBgM,QAAUhM,EAAEgM,OAAOC,WAAajM,EAAE,cAAe,GAAI,MAAQqE,EAAG,CAAE,IAAIpC,EAAGiC,EAAGnE,EAAGgU,EAAGrS,EAAI,GAAIwB,GAAI,EAAIpB,GAAI,EAAI,IAAM,GAAI/B,GAAKsE,EAAIA,EAAEgJ,KAAKrN,IAAI2P,KAAM,IAAM9O,EAAG,CAAE,GAAI+H,OAAOvE,KAAOA,EAAG,OAAQnB,GAAI,CAAK,MAAM,OAASA,GAAKjB,EAAIlC,EAAEsN,KAAKhJ,IAAIgM,QAAU3O,EAAE+H,KAAKxH,EAAEkI,OAAQzI,EAAEd,SAAWC,GAAIqC,GAAI,IAAO,MAAOlD,GAAK8B,GAAI,EAAIoC,EAAIlE,CAAE,SAAa,IAAM,IAAKkD,GAAK,MAAQmB,EAAU,SAAM0P,EAAI1P,EAAU,SAAKuE,OAAOmL,KAAOA,GAAI,MAAS,CAAA,QAAW,GAAIjS,EAAG,MAAMoC,CAAI,CAAA,CAAG,OAAOxC,CAAE,CAAI,CAJzdsS,CAAsB1D,EAAKvQ,IAAMqQ,GAA4BE,EAAKvQ,IACnI,WAA8B,MAAM,IAAIuN,UAAU,4IAA+I,CADxD2G,EAAqB,CAE9J,SAAS7D,GAA4BtO,EAAGiO,GAAU,GAAKjO,EAAL,CAAgB,GAAiB,iBAANA,EAAgB,OAAOkO,GAAkBlO,EAAGiO,GAAS,IAAI7L,EAAI0E,OAAOuD,UAAU8D,SAAS5C,KAAKvL,GAAGgK,MAAM,GAAI,GAAiE,MAAnD,WAAN5H,GAAkBpC,EAAEoK,cAAahI,EAAIpC,EAAEoK,YAAYhE,MAAgB,QAANhE,GAAqB,QAANA,EAAoB2L,MAAMK,KAAKpO,GAAc,cAANoC,GAAqB,2CAA2CiM,KAAKjM,GAAW8L,GAAkBlO,EAAGiO,QAAzG,EAAmH,CACha,SAASC,GAAkBM,EAAKC,IAAkB,MAAPA,GAAeA,EAAMD,EAAI1P,UAAQ2P,EAAMD,EAAI1P,QAAQ,IAAK,IAAIb,EAAI,EAAGyQ,EAAO,IAAIX,MAAMU,GAAMxQ,EAAIwQ,EAAKxQ,IAAKyQ,EAAKzQ,GAAKuQ,EAAIvQ,GAAI,OAAOyQ,CAAO,CAKpK,SAAS8D,GAAQrJ,EAAOoE,GACrC,IAAI8E,EAAalJ,EAAMkJ,WACrBV,EAAQxI,EAAMwI,MAGhB,GAAqB,IAAjBA,EAAM7S,OACR,MAAO,GAEN,IAAC2T,EAAcV,GAAeM,EAAY,GACjCI,EAAY,GAexB,IAdF,IAAIC,EAAcD,EAAY,GAQxBE,EAAYD,EAAYnB,OACxBqB,EAAYF,EAAYpB,IAGxBpN,EAAO,IAAI6J,MAAM6E,GACjB3U,EAAI,EACDA,EAAI2U,GAAW,CACpB1O,EAAKjG,GAAK,IAAI8P,MAAM4E,GAEpB,IADA,IAAIxU,EAAI,EACDA,EAAIwU,GACTzO,EAAKjG,GAAGE,GAAK,KACbA,IAEFF,GACD,CAMD,IAAK,IAAwDiR,EAApDC,EA/CX,SAAyCnP,EAAG2N,GAAkB,IAAIC,EAAuB,oBAAX1D,QAA0BlK,EAAEkK,OAAOC,WAAanK,EAAE,cAAe,GAAI4N,EAAI,OAAQA,EAAKA,EAAGrC,KAAKvL,IAAI6N,KAAKC,KAAKF,GAAK,GAAIG,MAAMC,QAAQhO,KAAO4N,EAAKU,GAA4BtO,KAAO2N,GAAkB3N,GAAyB,iBAAbA,EAAElB,OAAqB,CAAM8O,IAAI5N,EAAI4N,GAAI,IAAI3P,EAAI,EAAG,OAAO,WAAc,OAAIA,GAAK+B,EAAElB,OAAe,CAAEyP,MAAM,GAAe,CAAEA,MAAM,EAAOlG,MAAOrI,EAAE/B,KAAO,CAAK,CAAC,MAAM,IAAIuN,UAAU,wIAA2I,CA+CrkBkC,CAAgCiE,KAAiBzC,EAAQC,KAAaZ,MAAO,CAChG,IAAIsD,EAAO3C,EAAM7G,MAMbwK,EAAWhB,EAAKP,IAAM,EACtBwB,EAAcjB,EAAKN,OAAS,EAE5BuB,EAAcH,GAAaE,EAAWD,IACxC1O,EAAK2O,GAAUC,GAAejB,EAAKxJ,MAEtC,CAGD,IAAI0K,EAAoBxF,EAAQwF,kBAChC,GAAIA,EAEF,IADA,IAAInM,EAAK,EACFA,EAAK1C,EAAKpF,QACfiU,EAAkBnM,GAAMA,EACxBA,IA8BJ,OAjBA1C,EF9Ea,SAAuBA,GAUpC,IATA,IAAI0L,EAAOjF,UAAU7L,OAAS,QAAsB2K,IAAjBkB,UAAU,GAAmBA,UAAU,GAAK,CAAE,EAC/EoI,EAAoBnD,EAAKmD,kBACzBC,EAAgBpD,EAAKqD,SACrBA,OAA6B,IAAlBD,EAA2B,SAAUE,GAC9C,OAAOA,CACb,EAAQF,EACJG,EAAmBvD,EAAKuD,iBAEtBlV,EAAIiG,EAAKpF,OAAS,EACfb,GAAK,GAAG,CAGb,IADA,IAC+DiR,EAD3DkE,GAAQ,EACHjE,EAAYzB,GAAgCxJ,EAAKjG,MAAciR,EAAQC,KAAaZ,MAE3F,GAAuB,OAAnB0E,EADO/D,EAAM7G,OACY,CAC3B+K,GAAQ,EACR,KACD,CAGH,GAAIA,EACFlP,EAAKmP,OAAOpV,EAAG,GACX8U,GACFA,EAAkBM,OAAOpV,EAAG,QAEzB,GAAIkV,EACT,MAEFlV,GACD,CACD,OAAOiG,CACT,CE8CSoP,CD9EM,SAA0BpP,GAQvC,IAPA,IAAI0L,EAAOjF,UAAU7L,OAAS,QAAsB2K,IAAjBkB,UAAU,GAAmBA,UAAU,GAAK,CAAE,EAC/EqI,EAAgBpD,EAAKqD,SACrBA,OAA6B,IAAlBD,EAA2B,SAAUE,GAC9C,OAAOA,CACb,EAAQF,EACJG,EAAmBvD,EAAKuD,iBACtBlV,EAAIiG,EAAK,GAAGpF,OAAS,EAClBb,GAAK,GAAG,CAEb,IADA,IAC4DiR,EADxDkE,GAAQ,EACHjE,EAAYzB,GAAgCxJ,KAAgBgL,EAAQC,KAAaZ,MAExF,GAAyB,OAArB0E,EADM/D,EAAM7G,MACCpK,IAAc,CAC7BmV,GAAQ,EACR,KACD,CAEH,GAAIA,EAEF,IADA,IAAIjV,EAAI,EACDA,EAAI+F,EAAKpF,QACdoF,EAAK/F,GAAGkV,OAAOpV,EAAG,GAClBE,SAEG,GAAIgV,EACT,MAEFlV,GACD,CACD,OAAOiG,CACT,CCiDuBqP,CAAiBrP,EAAM,CAC1CiP,kBAAkB,IAChB,CACFA,kBAAkB,EAClBJ,kBAAmBA,IAIjBxF,EAAQiG,gBACVtP,EAAOqJ,EAAQiG,cAActP,IAQxBA,CACT,CCnGA,SAAS+F,GAAQjK,GAAgC,OAAOiK,GAAU,mBAAqBC,QAAU,iBAAmBA,OAAOC,SAAW,SAAUnK,GAAK,cAAcA,GAAO,SAAUA,GAAK,OAAOA,GAAK,mBAAqBkK,QAAUlK,EAAEoK,cAAgBF,QAAUlK,IAAMkK,OAAOG,UAAY,gBAAkBrK,CAAE,EAAIiK,GAAQjK,EAAK,CAC9T,SAAS0N,GAAgC1N,EAAG2N,GAAkB,IAAIC,EAAuB,oBAAX1D,QAA0BlK,EAAEkK,OAAOC,WAAanK,EAAE,cAAe,GAAI4N,EAAI,OAAQA,EAAKA,EAAGrC,KAAKvL,IAAI6N,KAAKC,KAAKF,GAAK,GAAIG,MAAMC,QAAQhO,KAAO4N,EACxN,SAAqC5N,EAAGiO,GAAU,IAAKjO,EAAG,OAAQ,GAAiB,iBAANA,EAAgB,OAAOkO,GAAkBlO,EAAGiO,GAAS,IAAI7L,EAAI0E,OAAOuD,UAAU8D,SAAS5C,KAAKvL,GAAGgK,MAAM,GAAI,GAAc,WAAN5H,GAAkBpC,EAAEoK,cAAahI,EAAIpC,EAAEoK,YAAYhE,MAAM,GAAU,QAANhE,GAAqB,QAANA,EAAa,OAAO2L,MAAMK,KAAKpO,GAAI,GAAU,cAANoC,GAAqB,2CAA2CiM,KAAKjM,GAAI,OAAO8L,GAAkBlO,EAAGiO,EAAU,CADnMK,CAA4BtO,KAAO2N,GAAkB3N,GAAyB,iBAAbA,EAAElB,OAAqB,CAAM8O,IAAI5N,EAAI4N,GAAI,IAAI3P,EAAI,EAAG,OAAO,WAAc,OAAIA,GAAK+B,EAAElB,OAAe,CAAEyP,MAAM,GAAe,CAAEA,MAAM,EAAOlG,MAAOrI,EAAE/B,KAAO,CAAK,CAAC,MAAM,IAAIuN,UAAU,wIAA2I,CAE5lB,SAAS0C,GAAkBM,EAAKC,IAAkB,MAAPA,GAAeA,EAAMD,EAAI1P,UAAQ2P,EAAMD,EAAI1P,QAAQ,IAAK,IAAIb,EAAI,EAAGyQ,EAAO,IAAIX,MAAMU,GAAMxQ,EAAIwQ,EAAKxQ,IAAKyQ,EAAKzQ,GAAKuQ,EAAIvQ,GAAI,OAAOyQ,CAAO,CACnL,SAASpE,GAAQnK,EAAGjC,GAAK,IAAIqE,EAAIuE,OAAOC,KAAK5G,GAAI,GAAI2G,OAAOyD,sBAAuB,CAAE,IAAIvK,EAAI8G,OAAOyD,sBAAsBpK,GAAIjC,IAAM8B,EAAIA,EAAEiG,QAAO,SAAU/H,GAAK,OAAO4I,OAAO0D,yBAAyBrK,EAAGjC,GAAGuM,UAAW,KAAMlI,EAAEoF,KAAK5C,MAAMxC,EAAGvC,EAAG,CAAG,OAAOuC,CAAI,CAC/P,SAASmI,GAAcvK,GAAK,IAAK,IAAIjC,EAAI,EAAGA,EAAIyM,UAAU7L,OAAQZ,IAAK,CAAE,IAAIqE,EAAI,MAAQoI,UAAUzM,GAAKyM,UAAUzM,GAAK,CAAE,EAAEA,EAAI,EAAIoM,GAAQxD,OAAOvE,IAAI,GAAIqF,SAAQ,SAAU1J,GAAK0M,GAAgBzK,EAAGjC,EAAGqE,EAAErE,GAAM,IAAI4I,OAAO+D,0BAA4B/D,OAAOgE,iBAAiB3K,EAAG2G,OAAO+D,0BAA0BtI,IAAM+H,GAAQxD,OAAOvE,IAAIqF,SAAQ,SAAU1J,GAAK4I,OAAOiE,eAAe5K,EAAGjC,EAAG4I,OAAO0D,yBAAyBjI,EAAGrE,GAAI,GAAM,CAAC,OAAOiC,CAAI,CACvb,SAASyK,GAAgBI,EAAKhE,EAAKqB,GAA4L,OAAnLrB,EAC5C,SAAwBiE,GAAO,IAAIjE,EACnC,SAAsBkE,EAAOC,GAAQ,GAAuB,WAAnBlB,GAAQiB,IAAiC,OAAVA,EAAgB,OAAOA,EAAO,IAAIE,EAAOF,EAAMhB,OAAOmB,aAAc,QAAa5B,IAAT2B,EAAoB,CAAE,IAAIE,EAAMF,EAAKG,KAAKL,EAAOC,GAAQ,WAAY,GAAqB,WAAjBlB,GAAQqB,GAAmB,OAAOA,EAAK,MAAM,IAAIE,UAAU,+CAAkD,CAAC,OAAiB,WAATL,EAAoBxG,OAAS8G,QAAQP,EAAS,CADpVQ,CAAaT,EAAK,UAAW,MAAwB,WAAjBhB,GAAQjD,GAAoBA,EAAMrC,OAAOqC,EAAO,CAD3E2E,CAAe3E,MAAiBgE,EAAOlE,OAAOiE,eAAeC,EAAKhE,EAAK,CAAEqB,MAAOA,EAAOoC,YAAY,EAAMmB,cAAc,EAAMC,UAAU,IAAkBb,EAAIhE,GAAOqB,EAAgB2C,CAAM,CAqB7N,SAASyI,GAAS5N,EAAU/I,GACzC,IAAIyQ,EAAU5C,UAAU7L,OAAS,QAAsB2K,IAAjBkB,UAAU,GAAmBA,UAAU,GAAK,CAAA,EAC7E4C,EAAQpE,QACXoE,EAAU7C,GAAc,CACtBvB,MAAO,GACNoE,IAEL,IAAImG,EAAoB,SAA2B7J,GACjD,IAAKhE,EAASgE,GACZ,MAAM,IAAInJ,MAAM,IAAKmO,OAAOhF,EAAU,wDAExC,OAAOhE,EAASgE,EACpB,EAIMN,EAAYD,EAAeoK,EAAkB,8BAA+B5W,GAG5EkT,EAASzG,EAAUC,cC7CV,SAA4BxM,EAASF,GAClD,OAAKE,EAGEsL,EAAiBxL,EAAIC,eAAeC,IAFlC,EAGX,CDwCyC2W,CAAmBD,EAAkBnK,EAAUC,eAAgB1M,GAAO,GAGzG4M,EAASH,EAAUG,OAASoC,GAAY4H,EAAkBnK,EAAUG,QAAS5M,GAAO,GACpF+L,EAAaF,EAAgB+K,EAAkB,mBAAoB5W,GAIvE,GAAIyQ,EAAQrE,UACV,OAAOL,EAAWI,OAAOiD,KAAI,SAAU0D,GAErC,MAAO,CACLxJ,KAFSwJ,EAAKxJ,KAItB,IAIE,IAAIwN,EA8BN,SAAoBzK,EAAOF,GACzB,GAAqB,iBAAVE,EAAoB,CAC7B,IAAI0K,EAAS5K,EAAOE,EAAQ,GAC5B,OAAO0K,GAAUA,EAAOxK,UACzB,CACD,IAAK,IAAyD6F,EAArDC,EAAYzB,GAAgCzE,KAAkBiG,EAAQC,KAAaZ,MAAO,CACjG,IAAIuF,EAAU5E,EAAM7G,MACpB,GAAIyL,EAAQ1N,OAAS+C,EACnB,OAAO2K,EAAQzK,UAElB,CACH,CAzCgB0K,CAAWxG,EAAQpE,MAAON,EAAWI,QAInD,IAAK2K,IAAYrK,EAAUN,OAAO2K,GAChC,MAqCJ,SAAkCzK,EAAOF,GACvC,IAAI+K,EAAa/K,GAAUA,EAAOiD,KAAI,SAAU/C,EAAOlL,GACrD,MAAO,IAAK4Q,OAAO1F,EAAM/C,KAAM,QAASyI,OAAO5Q,EAAI,EAAG,IAC1D,IAAKgW,KAAK,MACR,OAAO,IAAIvT,MAAM,SAASmO,OAAwB,iBAAV1F,EAAqB,IAAMA,EAAQ,IAAMA,EAAQ,IAAK,kCAAkC0F,OAAO5F,EAAS,sBAAwB+K,EAAa,IAAM,IAC7L,CA1CUE,CAAyB3G,EAAQpE,MAAON,EAAWI,QAI3D,IAAIE,EEtES,SAAoBnM,EAASF,EAAKkT,EAAQtG,EAAQb,EAAY0E,GAC3E,IAAIpE,EAAQrM,EAAIC,eAAeC,GAC3B2U,EAAQD,GAAWvI,EAAOrM,EAAKkT,EAAQtG,EAAQb,EAAY0E,GAI3D8E,EAAaD,GAAgBjJ,ITP5B,SAA6BwI,GAClC,IAAIwC,EAAa,SAAoBvU,EAAG5B,GACtC,OAAO4B,EAAI5B,CACf,EACMoW,EAAUzC,EAAMzF,KAAI,SAAU2F,GAChC,OAAOA,EAAKP,GAChB,IAAK+C,KAAKF,GACJG,EAAU3C,EAAMzF,KAAI,SAAU2F,GAChC,OAAOA,EAAKN,MAChB,IAAK8C,KAAKF,GACJI,EAASH,EAAQ,GACjBI,EAASJ,EAAQA,EAAQtV,OAAS,GAGtC,MAAO,CAAC,CACNwS,IAAKiD,EACLhD,OAJW+C,EAAQ,IAKlB,CACDhD,IAAKkD,EACLjD,OANW+C,EAAQA,EAAQxV,OAAS,IAQxC,CSd6C2V,CAAoB9C,GAC/D,MAAO,CACLA,MAAOA,EACPU,WAAYA,EAEhB,CF2DcqC,CAAWhB,EAAkBnK,EAAUN,OAAO2K,IAAW9W,EAAKkT,EAAQtG,EAAQb,EAAY0E,GAQlGrJ,EAAOsO,GAAQrJ,EAPnBoE,EAAU7C,GAAc,CAGtBqI,kBAAmB,IAClBxF,IAMH,OAAIA,EAAQ1E,WACH,CACL3E,KAAMA,EACN2E,WAAYA,GAKT3E,CACT,CG7FA,SAAS+F,GAAQjK,GAAgC,OAAOiK,GAAU,mBAAqBC,QAAU,iBAAmBA,OAAOC,SAAW,SAAUnK,GAAK,cAAcA,GAAO,SAAUA,GAAK,OAAOA,GAAK,mBAAqBkK,QAAUlK,EAAEoK,cAAgBF,QAAUlK,IAAMkK,OAAOG,UAAY,gBAAkBrK,CAAE,EAAIiK,GAAQjK,EAAK,CAC9T,SAAS2U,GAAkBC,EAAQC,GAAS,IAAK,IAAI5W,EAAI,EAAGA,EAAI4W,EAAM/V,OAAQb,IAAK,CAAE,IAAI6W,EAAaD,EAAM5W,GAAI6W,EAAWrK,WAAaqK,EAAWrK,aAAc,EAAOqK,EAAWlJ,cAAe,EAAU,UAAWkJ,IAAYA,EAAWjJ,UAAW,GAAM/E,OAAOiE,eAAe6J,GAE7P3J,EAFoR6J,EAAW9N,IAEpRA,WACnC,SAAsBkE,EAAOC,GAAQ,GAAuB,WAAnBlB,GAAQiB,IAAiC,OAAVA,EAAgB,OAAOA,EAAO,IAAIE,EAAOF,EAAMhB,OAAOmB,aAAc,QAAa5B,IAAT2B,EAAoB,CAAE,IAAIE,EAAMF,EAAKG,KAAKL,EAAOC,GAAQ,WAAY,GAAqB,WAAjBlB,GAAQqB,GAAmB,OAAOA,EAAK,MAAM,IAAIE,UAAU,+CAAkD,CAAC,OAAiB,WAATL,EAAoBxG,OAAS8G,QAAQP,EAAS,CADpVQ,CAAaT,EAAK,UAAmC,WAAjBhB,GAAQjD,GAAoBA,EAAMrC,OAAOqC,IAFuM8N,GAE7T,IAAwB7J,EAAWjE,CAF0S,CAM7U,SAAS+N,GAAaC,GAAW,IAAIC,EAA4BC,KAA6B,OAAO,WAAkC,IAAsCC,EAAlCC,EAAQC,GAAgBL,GAAkB,GAAIC,EAA2B,CAAE,IAAIK,EAAYD,GAAgBE,MAAMnL,YAAa+K,EAASK,QAAQC,UAAUL,EAAOzK,UAAW2K,QAAqBH,EAASC,EAAMrQ,MAAMwQ,KAAM5K,WAAc,OACpX,SAAoC+K,EAAMnK,GAAQ,GAAIA,IAA2B,WAAlBtB,GAAQsB,IAAsC,mBAATA,GAAwB,OAAOA,EAAa,QAAa,IAATA,EAAmB,MAAM,IAAIC,UAAU,4DAA+D,OAC1P,SAAgCkK,GAAQ,QAAa,IAATA,EAAmB,MAAM,IAAIC,eAAe,6DAAgE,OAAOD,CAAO,CAD2FE,CAAuBF,EAAQ,CAD2FG,CAA2BN,KAAMJ,EAAQ,CAAK,CAGza,SAASW,GAAiBC,GAAS,IAAIC,EAAwB,mBAARC,IAAqB,IAAIA,SAAQxM,EAA8nB,OAAnnBqM,GAAmB,SAA0BC,GAAS,GAAc,OAAVA,IAGlI3Q,EAHuK2Q,GAGjG,IAAzDG,SAAS/H,SAAS5C,KAAKnG,GAAI2J,QAAQ,kBAH+H,OAAOgH,EAGjN,IAA2B3Q,EAH6L,GAAqB,mBAAV2Q,EAAwB,MAAM,IAAIvK,UAAU,sDAAyD,QAAsB,IAAXwK,EAAwB,CAAE,GAAIA,EAAOG,IAAIJ,GAAQ,OAAOC,EAAOI,IAAIL,GAAQC,EAAOpU,IAAImU,EAAOM,EAAW,CAAC,SAASA,IAAY,OAAOC,GAAWP,EAAOpL,UAAW0K,GAAgBE,MAAMnL,aAAgK,OAAhJiM,EAAQhM,UAAYvD,OAAOyP,OAAOR,EAAM1L,UAAW,CAAED,YAAa,CAAE/B,MAAOgO,EAAS5L,YAAY,EAAOoB,UAAU,EAAMD,cAAc,KAAkB4K,GAAgBH,EAASN,EAAS,EAASD,GAAiBC,EAAS,CACvvB,SAASO,GAAWG,EAAQC,EAAMX,GAA4V,OAAhTO,GAA/BpB,KAA4CM,QAAQC,UAAU3H,OAA8B,SAAoB2I,EAAQC,EAAMX,GAAS,IAAInW,EAAI,CAAC,MAAOA,EAAE+H,KAAK5C,MAAMnF,EAAG8W,GAAO,IAAsDC,EAAW,IAA/CT,SAASpI,KAAK/I,MAAM0R,EAAQ7W,IAA6F,OAAnDmW,GAAOS,GAAgBG,EAAUZ,EAAM1L,WAAmBsM,CAAS,EAAaL,GAAWvR,MAAM,KAAM4F,UAAa,CACza,SAASuK,KAA8B,GAAuB,oBAAZM,UAA4BA,QAAQC,UAAW,OAAO,EAAO,GAAID,QAAQC,UAAUmB,KAAM,OAAO,EAAO,GAAqB,mBAAVC,MAAsB,OAAO,EAAM,IAAsF,OAAhFC,QAAQzM,UAAUkG,QAAQhF,KAAKiK,QAAQC,UAAUqB,QAAS,IAAI,WAAc,MAAW,CAAO,CAAC,MAAO3W,GAAK,OAAO,EAAU,CAEzU,SAASqW,GAAgBxW,EAAGD,GAA6I,OAAxIyW,GAAkB1P,OAAOiQ,eAAiBjQ,OAAOiQ,eAAejJ,OAAS,SAAyB9N,EAAGD,GAAsB,OAAjBC,EAAEgX,UAAYjX,EAAUC,CAAI,EAASwW,GAAgBxW,EAAGD,EAAK,CACxM,SAASsV,GAAgBrV,GAA+J,OAA1JqV,GAAkBvO,OAAOiQ,eAAiBjQ,OAAOmQ,eAAenJ,OAAS,SAAyB9N,GAAK,OAAOA,EAAEgX,WAAalQ,OAAOmQ,eAAejX,EAAG,EAAWqV,GAAgBrV,EAAK,CACpN,IAAIkX,GAA4B,SAAUC,IAV1C,SAAmBC,EAAUC,GAAc,GAA0B,mBAAfA,GAA4C,OAAfA,EAAuB,MAAM,IAAI7L,UAAU,sDAAyD4L,EAAS/M,UAAYvD,OAAOyP,OAAOc,GAAcA,EAAWhN,UAAW,CAAED,YAAa,CAAE/B,MAAO+O,EAAUvL,UAAU,EAAMD,cAAc,KAAW9E,OAAOiE,eAAeqM,EAAU,YAAa,CAAEvL,UAAU,IAAcwL,GAAYb,GAAgBY,EAAUC,EAAc,CAWlcC,CAAUJ,EAAcC,GACxB,IAhBoBI,EAAaC,EAAYC,EAgBzCC,EAAS3C,GAAamC,GAC1B,SAASA,EAAaS,GACpB,IAAIC,EAIJ,OAnBJ,SAAyBjB,EAAUY,GAAe,KAAMZ,aAAoBY,GAAgB,MAAM,IAAI/L,UAAU,oCAAyC,CAgBrJqM,CAAgBtC,KAAM2B,IACtBU,EAAQF,EAAOnM,KAAKgK,KAAM,YACpBoC,OAASA,EACRC,CACR,CACD,OAxBoBL,EAwBAL,EAxB4CM,GAAY7C,GAAkB4C,EAAYlN,UAAWmN,GAAiBC,GAAa9C,GAAkB4C,EAAaE,GAAc3Q,OAAOiE,eAAewM,EAAa,YAAa,CAAE1L,UAAU,IAAiB0L,CAyB/Q,CAXgC,CAWhBzB,GAAiBpV,QC1BlB,SAASoX,GAAWzP,GASjC,GAAqB,iBAAVA,EAAoB,CAC7B,IAAI0P,EAAmB1P,EAEvB,GADAA,EAAQoD,OAAOpD,GACX1D,OAAO0D,KAAW0P,EACpB,MAAM,IAAIb,GAAa,eAE1B,CACD,GAAqB,iBAAV7O,EACT,MAAM,IAAI6O,GAAa,gBAEzB,GAAI/G,MAAM9H,GACR,MAAM,IAAI6O,GAAa,kBAWzB,IAAKc,SAAS3P,GACZ,MAAM,IAAI6O,GAAa,iBAEzB,OAAO7O,CACT,CCnCe,SAAS4P,GAAW5P,GACjC,GAAqB,iBAAVA,EACT,OAAOA,EAYT,GAAqB,iBAAVA,EAAoB,CAC7B,GAAI8H,MAAM9H,GACR,MAAM,IAAI6O,GAAa,kBASzB,IAAKc,SAAS3P,GACZ,MAAM,IAAI6O,GAAa,iBAEzB,OAAOvS,OAAO0D,EACf,CACD,MAAM,IAAI6O,GAAa,eACzB,CC/Be,SAASgB,GAAY7P,GAClC,GAAqB,kBAAVA,EACT,OAAOA,EAET,MAAM,IAAI6O,GAAa,gBACzB,CCNA,IAAIiB,GAAY,CAAC,mBAAoB,kBAAmB,qBACxD,SAASlO,GAAQjK,GAAgC,OAAOiK,GAAU,mBAAqBC,QAAU,iBAAmBA,OAAOC,SAAW,SAAUnK,GAAK,cAAcA,GAAO,SAAUA,GAAK,OAAOA,GAAK,mBAAqBkK,QAAUlK,EAAEoK,cAAgBF,QAAUlK,IAAMkK,OAAOG,UAAY,gBAAkBrK,CAAE,EAAIiK,GAAQjK,EAAK,CAC9T,SAAS+R,GAAevD,EAAKvQ,GAAK,OAGlC,SAAyBuQ,GAAO,GAAIT,MAAMC,QAAQQ,GAAM,OAAOA,CAAM,CAH5BwD,CAAgBxD,IAEzD,SAA+BtQ,EAAGa,GAAK,IAAIwD,EAAI,MAAQrE,EAAI,KAAO,oBAAsBgM,QAAUhM,EAAEgM,OAAOC,WAAajM,EAAE,cAAe,GAAI,MAAQqE,EAAG,CAAE,IAAIpC,EAAGiC,EAAGnE,EAAGgU,EAAGrS,EAAI,GAAIwB,GAAI,EAAIpB,GAAI,EAAI,IAAM,GAAI/B,GAAKsE,EAAIA,EAAEgJ,KAAKrN,IAAI2P,KAAM,IAAM9O,EAAG,CAAE,GAAI+H,OAAOvE,KAAOA,EAAG,OAAQnB,GAAI,CAAK,MAAM,OAASA,GAAKjB,EAAIlC,EAAEsN,KAAKhJ,IAAIgM,QAAU3O,EAAE+H,KAAKxH,EAAEkI,OAAQzI,EAAEd,SAAWC,GAAIqC,GAAI,IAAO,MAAOlD,GAAK8B,GAAI,EAAIoC,EAAIlE,CAAE,SAAa,IAAM,IAAKkD,GAAK,MAAQmB,EAAU,SAAM0P,EAAI1P,EAAU,SAAKuE,OAAOmL,KAAOA,GAAI,MAAS,CAAA,QAAW,GAAIjS,EAAG,MAAMoC,CAAI,CAAA,CAAG,OAAOxC,CAAE,CAAI,CAFzdsS,CAAsB1D,EAAKvQ,IAAMqQ,GAA4BE,EAAKvQ,IACnI,WAA8B,MAAM,IAAIuN,UAAU,4IAA+I,CADxD2G,EAAqB,CAK9J,SAAS7D,GAA4BtO,EAAGiO,GAAU,GAAKjO,EAAL,CAAgB,GAAiB,iBAANA,EAAgB,OAAOkO,GAAkBlO,EAAGiO,GAAS,IAAI7L,EAAI0E,OAAOuD,UAAU8D,SAAS5C,KAAKvL,GAAGgK,MAAM,GAAI,GAAiE,MAAnD,WAAN5H,GAAkBpC,EAAEoK,cAAahI,EAAIpC,EAAEoK,YAAYhE,MAAgB,QAANhE,GAAqB,QAANA,EAAoB2L,MAAMK,KAAKpO,GAAc,cAANoC,GAAqB,2CAA2CiM,KAAKjM,GAAW8L,GAAkBlO,EAAGiO,QAAzG,EAAmH,CACha,SAASC,GAAkBM,EAAKC,IAAkB,MAAPA,GAAeA,EAAMD,EAAI1P,UAAQ2P,EAAMD,EAAI1P,QAAQ,IAAK,IAAIb,EAAI,EAAGyQ,EAAO,IAAIX,MAAMU,GAAMxQ,EAAIwQ,EAAKxQ,IAAKyQ,EAAKzQ,GAAKuQ,EAAIvQ,GAAI,OAAOyQ,CAAO,CACnL,SAAS0J,GAAyBC,EAAQC,GAAY,GAAc,MAAVD,EAAgB,MAAO,GAAI,IAAkErR,EAAK/I,EAAnE2W,EACzF,SAAuCyD,EAAQC,GAAY,GAAc,MAAVD,EAAgB,MAAO,CAAE,EAAE,IAA2DrR,EAAK/I,EAA5D2W,EAAS,CAAE,EAAM2D,EAAazR,OAAOC,KAAKsR,GAAqB,IAAKpa,EAAI,EAAGA,EAAIsa,EAAWzZ,OAAQb,IAAO+I,EAAMuR,EAAWta,GAAQqa,EAASvJ,QAAQ/H,IAAQ,IAAa4N,EAAO5N,GAAOqR,EAAOrR,IAAQ,OAAO4N,CAAS,CADjN4D,CAA8BH,EAAQC,GAAuB,GAAIxR,OAAOyD,sBAAuB,CAAE,IAAIkO,EAAmB3R,OAAOyD,sBAAsB8N,GAAS,IAAKpa,EAAI,EAAGA,EAAIwa,EAAiB3Z,OAAQb,IAAO+I,EAAMyR,EAAiBxa,GAAQqa,EAASvJ,QAAQ/H,IAAQ,GAAkBF,OAAOuD,UAAUqO,qBAAqBnN,KAAK8M,EAAQrR,KAAgB4N,EAAO5N,GAAOqR,EAAOrR,GAAO,CAAG,OAAO4N,CAAS,CAE5e,SAAStK,GAAQnK,EAAGjC,GAAK,IAAIqE,EAAIuE,OAAOC,KAAK5G,GAAI,GAAI2G,OAAOyD,sBAAuB,CAAE,IAAIvK,EAAI8G,OAAOyD,sBAAsBpK,GAAIjC,IAAM8B,EAAIA,EAAEiG,QAAO,SAAU/H,GAAK,OAAO4I,OAAO0D,yBAAyBrK,EAAGjC,GAAGuM,UAAW,KAAMlI,EAAEoF,KAAK5C,MAAMxC,EAAGvC,EAAG,CAAG,OAAOuC,CAAI,CAC/P,SAASmI,GAAcvK,GAAK,IAAK,IAAIjC,EAAI,EAAGA,EAAIyM,UAAU7L,OAAQZ,IAAK,CAAE,IAAIqE,EAAI,MAAQoI,UAAUzM,GAAKyM,UAAUzM,GAAK,CAAE,EAAEA,EAAI,EAAIoM,GAAQxD,OAAOvE,IAAI,GAAIqF,SAAQ,SAAU1J,GAAK0M,GAAgBzK,EAAGjC,EAAGqE,EAAErE,GAAM,IAAI4I,OAAO+D,0BAA4B/D,OAAOgE,iBAAiB3K,EAAG2G,OAAO+D,0BAA0BtI,IAAM+H,GAAQxD,OAAOvE,IAAIqF,SAAQ,SAAU1J,GAAK4I,OAAOiE,eAAe5K,EAAGjC,EAAG4I,OAAO0D,yBAAyBjI,EAAGrE,GAAI,GAAM,CAAC,OAAOiC,CAAI,CACvb,SAASyK,GAAgBI,EAAKhE,EAAKqB,GAA4L,OAAnLrB,EAC5C,SAAwBiE,GAAO,IAAIjE,EACnC,SAAsBkE,EAAOC,GAAQ,GAAuB,WAAnBlB,GAAQiB,IAAiC,OAAVA,EAAgB,OAAOA,EAAO,IAAIE,EAAOF,EAAMhB,OAAOmB,aAAc,QAAa5B,IAAT2B,EAAoB,CAAE,IAAIE,EAAMF,EAAKG,KAAKL,EAAOC,GAAQ,WAAY,GAAqB,WAAjBlB,GAAQqB,GAAmB,OAAOA,EAAK,MAAM,IAAIE,UAAU,+CAAkD,CAAC,OAAiB,WAATL,EAAoBxG,OAAS8G,QAAQP,EAAS,CADpVQ,CAAaT,EAAK,UAAW,MAAwB,WAAjBhB,GAAQjD,GAAoBA,EAAMrC,OAAOqC,EAAO,CAD3E2E,CAAe3E,MAAiBgE,EAAOlE,OAAOiE,eAAeC,EAAKhE,EAAK,CAAEqB,MAAOA,EAAOoC,YAAY,EAAMmB,cAAc,EAAMC,UAAU,IAAkBb,EAAIhE,GAAOqB,EAAgB2C,CAAM,CAO5O,IAAI2N,GAAkB,CACpBC,yCAAqCnP,EACrCoP,mCAAoC,KACpCC,2DAA4D,WAC1D,OAAO,CACR,EAGDC,oBAAqB,WACnB,OAAO,IACR,EACDC,mBAAoB,WAClB,OAAO,IACR,EACDC,kBAAkB,EAClBC,iBAAiB,EACjBC,oBAAqB,KAkCR,SAASC,GAAalV,EAAMmV,EAAQ9L,GAMjD,IAAI+L,EAJF/L,EADEA,EACQ7C,GAAcA,GAAc,CAAE,EAAEiO,IAAkBpL,GAElDoL,GAGVM,EAAmBK,EAASL,iBAC5BC,EAAkBI,EAASJ,gBAC3BK,EAA4BD,EAASvG,kBACrCyG,EAAyBpB,GAAyBkB,EAAUnB,IAI1DpF,EAAoBwG,GAA6BA,EAA0BvP,SAoXjF,SAAwBqP,GACtB,IAAK,IAAII,EAAM,EAAGC,EAAgB5S,OAAOC,KAAKsS,GAASI,EAAMC,EAAc5a,OAAQ2a,IAAO,CACxF,IAAIzS,EAAM0S,EAAcD,GACpBE,EAAcN,EAAOrS,GAEzB,GAAkC,WAA9BiD,GAAQ0P,EAAYrX,QAAuByL,MAAMC,QAAQ2L,EAAYrX,MACvE,MAAM,IAAI5B,MAAM,uFAGlB,IAAKiZ,EAAYN,SACVM,EAAYpI,OACf,MAAM,IAAI7Q,MAAM,0CAA6CmO,OAAO7H,EAAK,MAG9E,CACH,CAlYE4S,CAAeP,GACXJ,IACF/U,EAAO2V,GAAU3V,IAEfgV,IACFhV,EAAOA,EAAK+B,QAAO,SAAUqL,EAAKrT,GAIhC,OAHiBqT,EAAIwI,OAAM,SAAUjI,GACnC,OAAgB,OAATA,CACf,MAGYkB,GAEFA,EAAkBM,OAAOpV,EAAG,IAEvB,EAGf,KAKE,IAHA,IAAI8b,EAAU7V,EAAK,GACfwD,EAAU,GACVsS,EAAS,GACJ/b,EAAI,EAAGA,EAAIiG,EAAKpF,OAAQb,IAAK,CACpC,IAAIkX,EAAS8E,GAAKZ,EAAQnV,EAAKjG,GAAIA,OAAGwL,EAAWsQ,EAASC,EAAQR,GAClE9R,EAAQC,KAAKwN,EACd,CAGD,GAAIpC,EACF,IAAK,IAAyD7D,EAArDC,EA7Gb,SAAyCnP,EAAG2N,GAAkB,IAAIC,EAAuB,oBAAX1D,QAA0BlK,EAAEkK,OAAOC,WAAanK,EAAE,cAAe,GAAI4N,EAAI,OAAQA,EAAKA,EAAGrC,KAAKvL,IAAI6N,KAAKC,KAAKF,GAAK,GAAIG,MAAMC,QAAQhO,KAAO4N,EAAKU,GAA4BtO,KAAO2N,GAAkB3N,GAAyB,iBAAbA,EAAElB,OAAqB,CAAM8O,IAAI5N,EAAI4N,GAAI,IAAI3P,EAAI,EAAG,OAAO,WAAc,OAAIA,GAAK+B,EAAElB,OAAe,CAAEyP,MAAM,GAAe,CAAEA,MAAM,EAAOlG,MAAOrI,EAAE/B,KAAO,CAAK,CAAC,MAAM,IAAIuN,UAAU,wIAA2I,CA6GnkBkC,CAAgCsM,KAAkB9K,EAAQC,KAAaZ,MAAO,CACjG,IAAI2L,EAAQhL,EAAM7G,MAKlB6R,EAAM5I,IAAMyB,EAAkBmH,EAAM5I,IAAM,GAAK,CAChD,CAEH,MAAO,CACL6I,KAAMzS,EACNsS,OAAQA,EAEZ,CACA,SAASC,GAAKZ,EAAQ/H,EAAKuB,EAAU9I,EAAMgQ,EAASC,EAAQzM,GAoI1D,IAnIA,IAAI6M,EAAS,CAAA,EACTC,GAAgB,EAChBC,EAAc,SAAqB1K,GACrC,IAAI+J,EAAc/J,EAAK+J,YACrBtR,EAAQuH,EAAKvH,MACbkS,EAAe3K,EAAKsK,MACpBvC,EAAS/H,EAAK+H,OACZuC,EAAQ,CACVA,MAAOK,EACPjJ,IAAKuB,EAAW,EAChBtB,OAAQoI,EAAYpI,OACpBlJ,MAAOA,GAUT,OARIsP,IACFuC,EAAMvC,OAASA,GAIbgC,EAAYrX,OACd4X,EAAM5X,KAAOqX,EAAYrX,MAEpB4X,CACX,EACMM,EAAwB,GAGxBC,EAAQ,WACV,IAaIC,EAMArS,EACA6R,EACAvC,EArBA3Q,EAAMH,EAAaD,GACnB+S,EAAcN,EAAOrS,GAKrB2T,EAAe3T,EACf4T,EAAcjB,EAAYpI,OAG1BsJ,EAAe,GAAGhM,OAAO9E,GAAQ,GAAI,KAAK8E,OAAO8L,GAIjD7H,EAAciH,EAAQhL,QAAQ6L,GAC9BE,EAAkBhI,EAAc,EASpC,GARKgI,IACHJ,EAAYpJ,EAAIwB,IAOd6G,EAAYN,OACdhR,EAAQ4R,GAAKN,EAAYN,OAAQ/H,EAAKuB,EAAUgI,EAAcd,EAASC,EAAQzM,QAE/E,GAAIuN,EACE,wCAAyCvN,IAC3ClF,EAAQkF,EAAQqL,0CAEb,QAAkBnP,IAAdiR,EAGL,uCAAwCnN,IAC1ClF,EAAQkF,EAAQsL,yCAEb,GAAkB,OAAd6B,EACL,uCAAwCnN,IAC1ClF,EAAQkF,EAAQsL,yCAEb,GAAI9K,MAAMC,QAAQ2L,EAAYrX,MAAO,CAC1C,IAAIyY,EA0OL,SAAoBrS,EAAQyQ,GACjC,IAAI6B,EAAS,GACTC,EAAQ,EACZ,KAAOA,EAAQvS,EAAO5J,QAAQ,CAC5B,IACEoc,EAAanJ,GADCoJ,GAASzS,EAAQyQ,EAAqB8B,GACb,GACvCG,EAAYF,EAAW,GAEzBD,GADWC,EAAW,GACJ/B,EAAoBra,OACtCkc,EAAOrT,KAAKyT,EAAUje,OACvB,CACD,OAAO6d,CACT,CAtPoBK,CAAWX,EAAWnN,EAAQ4L,qBAAqBjN,KAAI,SAAUoP,GAC3E,IAAIpB,EAAJ,CAGA,IAAI/E,EAASoG,GAAWD,EAAQ3B,EAAapM,GAQ7C,OAPI4H,EAAO+E,QAGT7R,EAAQiT,EACRpB,EAAQ/E,EAAO+E,MACfvC,EAASxC,EAAOwC,QAEXxC,EAAO9M,KATb,CAUX,IACQ,IAAK6R,EAAO,CACV,IAAIsB,EAAUT,EAAMjB,MAAM2B,IAC1BpT,EAAQmT,EAAUjO,EAAQyL,mBAAmB+B,EAAO,CAClDhR,KAAM8Q,IACHE,CACN,CACT,KAAa,CACL,IAAI5F,EAASoG,GAAWb,EAAWf,EAAapM,GAChD2M,EAAQ/E,EAAO+E,MACfvC,EAASxC,EAAOwC,OAChBtP,EAAQ6R,EAAQQ,EAAYvF,EAAO9M,KACpC,EAIE6R,GAASuB,GAAapT,IACrBsR,EAAY+B,UAGdlB,EAAsB7S,KAAK,CACzBgS,YAAaA,EACbtR,MAAOA,EACPyS,gBAAiBA,IAInBZ,EAGFF,EAAOrS,KAAK2S,EAAY,CACtBX,YAAaA,EACbtR,MAAOA,EACP6R,MAAOA,EACPvC,OAAQA,MAIN0C,IAAkBoB,GAAapT,KACjCgS,GAAgB,QAKJ5Q,IAAVpB,IACF+R,EAAOO,GAAgBtS,GAG/B,EACWzB,EAAK,EAAGC,EAAeC,OAAOC,KAAKsS,GAASzS,EAAKC,EAAa/H,OAAQ8H,IAC7E6T,IAIF,GAAIJ,EACF,OAAO9M,EAAQwL,oBAAoBqB,EAAQ,CACzCrQ,KAAMA,IAKV,IAAK,IAAI4R,EAAM,EAAGC,EAAwBpB,EAAuBmB,EAAMC,EAAsB9c,OAAQ6c,IAAO,CAC1G,IAAIE,EAAyBD,EAAsBD,GACjDhC,EAAckC,EAAuBlC,YACrCtR,EAAQwT,EAAuBxT,MAMjC,KALoBwT,EAAuBf,iBAEKvN,EAAQuL,2DAA2Da,EAAYpI,OAAQ,CACrI6I,OAAQA,KAEmB,CAC3B,IAAIsB,EAAW/B,EAAY+B,UACU,kBAAbA,EAAyBA,EAAWA,EAAStB,KAEnEJ,EAAOrS,KAAK2S,EAAY,CACtBX,YAAaA,EACbtR,MAAOA,EACP6R,MAAO,aAGZ,CACF,CAGD,OAAOE,CACT,CAQO,SAASmB,GAAWlT,EAAOsR,EAAapM,GAC7C,GAAc,OAAVlF,EACF,MAAO,CACLA,MAAO,MAGX,IAAI8M,EACJ,GAAIwE,EAAYmC,MACd,MAAM,IAAIpb,MAAM,kEAgBlB,GAdEyU,EADSwE,EAAYrX,KAwEzB,SAA0B+F,EAAO/F,EAAMiL,GACrC,OAAQjL,GACN,KAAKqC,OACH,OAAOoX,GAAiB1T,EAAO4P,IACjC,KAAKxM,OACH,OAAOsQ,GAAiB1T,EAAOyP,IACjC,KAAKtK,KACH,OAAOuO,GAAiB1T,GAAO,SAAUA,GACvC,OCxYO,SAAkBA,EAAOuH,GACtC,IAAI/G,EAAa+G,EAAK/G,WAItB,GAAIR,aAAiBmF,KAAM,CACzB,GAAI2C,MAAM9H,EAAMkI,WACd,MAAM,IAAI2G,GAAa,iBAEzB,OAAO7O,CACR,CACD,GAAqB,iBAAVA,EAAoB,CAC7B,GAAI8H,MAAM9H,GACR,MAAM,IAAI6O,GAAa,kBAEzB,IAAKc,SAAS3P,GACZ,MAAM,IAAI6O,GAAa,iBAEzB,IAAI8E,EAAOxL,GAAUnI,EAAOQ,GAC5B,GAAIsH,MAAM6L,EAAKzL,WACb,MAAM,IAAI2G,GAAa,iBAEzB,OAAO8E,CACR,CACD,MAAM,IAAI9E,GAAa,aACzB,CD+We+E,CAAS5T,EAAO,CACrBQ,WAAY0E,EAAQ1E,YAE9B,IACI,KAAKiO,QACH,OAAOiF,GAAiB1T,EAAO6P,IACjC,QACE,GAAoB,mBAAT5V,EACT,OAAOyZ,GAAiB1T,EAAO/F,GAEjC,MAAM,IAAI5B,MAAM,4BAA4BmO,OAAOvM,GAAQA,EAAK8D,MAAQ9D,IAE9E,CA3Fa4Z,CAAiB7T,EAM1B0F,MAAMC,QAAQ2L,EAAYrX,MAAQqX,EAAYrX,KAAK,GAAKqX,EAAYrX,KAAMiL,GAEjE,CACPlF,MAAOA,GAKP8M,EAAO+E,MACT,OAAO/E,EAET,GAAqB,OAAjBA,EAAO9M,MAAgB,CACzB,GAAIsR,EAAYwC,OAASxC,EAAYwC,MAAMpN,QAAQoG,EAAO9M,OAAS,EACjE,MAAO,CACL6R,MAAO,UACPvC,OAAQ,WAGZ,GAAIgC,EAAYyC,SACd,IACEzC,EAAYyC,SAASjH,EAAO9M,MAC7B,CAAC,MAAO6R,GACP,MAAO,CACLA,MAAOA,EAAMmC,QAEhB,CAEJ,CACD,OAAOlH,CACT,CAQA,SAAS4G,GAAiB1T,EAAOyT,GAC/B,IACE,IAAIQ,EAAcR,EAAMzT,GACxB,YAAoBoB,IAAhB6S,EACK,CACLjU,MAAO,MAGJ,CACLA,MAAOiU,EAEV,CAAC,MAAOpC,GACP,IAAI/E,EAAS,CACX+E,MAAOA,EAAMmC,SAKf,OAHInC,EAAMvC,SACRxC,EAAOwC,OAASuC,EAAMvC,QAEjBxC,CACR,CACH,CA6BO,SAASgG,GAASzS,EAAQ6T,EAAcC,GAI7C,IAHA,IAAIve,EAAI,EACJmd,EAAY,GAEToB,EAAave,EAAIyK,EAAO5J,QAAQ,CACrC,IAAI2d,EAAa/T,EAAO8T,EAAave,GACrC,GAAIwe,IAAeF,EACjB,MAAO,CAACnB,EAAWnd,GACd,GAAmB,MAAfwe,EAAoB,CAC7B,IAAIC,EAAQvB,GAASzS,EAAQ,IAAK8T,EAAave,EAAI,GACnDmd,GAAasB,EAAM,GACnBze,GAAK,EAAaye,EAAM,GAAK,CACnC,MACMtB,GAAaqB,EACbxe,GAEH,CACD,MAAO,CAACmd,EAAWnd,EACrB,CAwBA,IAAI4b,GAAY,SAAmBkB,GACjC,OAAOA,EAAM,GAAG7O,KAAI,SAAUgH,EAAGjV,GAC/B,OAAO8c,EAAM7O,KAAI,SAAUoF,GACzB,OAAOA,EAAIrT,EACjB,GACA,GACA,EAiBA,SAASwd,GAAapT,GACpB,OAAOA,OACT,CE1dA,SAAS4B,GAAQjK,GAAgC,OAAOiK,GAAU,mBAAqBC,QAAU,iBAAmBA,OAAOC,SAAW,SAAUnK,GAAK,cAAcA,GAAO,SAAUA,GAAK,OAAOA,GAAK,mBAAqBkK,QAAUlK,EAAEoK,cAAgBF,QAAUlK,IAAMkK,OAAOG,UAAY,gBAAkBrK,CAAE,EAAIiK,GAAQjK,EAAK,CAC9T,IAAImY,GAAY,CAAC,UACjB,SAAS7N,GAAQnK,EAAGjC,GAAK,IAAIqE,EAAIuE,OAAOC,KAAK5G,GAAI,GAAI2G,OAAOyD,sBAAuB,CAAE,IAAIvK,EAAI8G,OAAOyD,sBAAsBpK,GAAIjC,IAAM8B,EAAIA,EAAEiG,QAAO,SAAU/H,GAAK,OAAO4I,OAAO0D,yBAAyBrK,EAAGjC,GAAGuM,UAAW,KAAMlI,EAAEoF,KAAK5C,MAAMxC,EAAGvC,EAAG,CAAG,OAAOuC,CAAI,CAC/P,SAASmI,GAAcvK,GAAK,IAAK,IAAIjC,EAAI,EAAGA,EAAIyM,UAAU7L,OAAQZ,IAAK,CAAE,IAAIqE,EAAI,MAAQoI,UAAUzM,GAAKyM,UAAUzM,GAAK,CAAE,EAAEA,EAAI,EAAIoM,GAAQxD,OAAOvE,IAAI,GAAIqF,SAAQ,SAAU1J,GAAK0M,GAAgBzK,EAAGjC,EAAGqE,EAAErE,GAAM,IAAI4I,OAAO+D,0BAA4B/D,OAAOgE,iBAAiB3K,EAAG2G,OAAO+D,0BAA0BtI,IAAM+H,GAAQxD,OAAOvE,IAAIqF,SAAQ,SAAU1J,GAAK4I,OAAOiE,eAAe5K,EAAGjC,EAAG4I,OAAO0D,yBAAyBjI,EAAGrE,GAAI,GAAM,CAAC,OAAOiC,CAAI,CACvb,SAASyK,GAAgBI,EAAKhE,EAAKqB,GAA4L,OAAnLrB,EAC5C,SAAwBiE,GAAO,IAAIjE,EACnC,SAAsBkE,EAAOC,GAAQ,GAAuB,WAAnBlB,GAAQiB,IAAiC,OAAVA,EAAgB,OAAOA,EAAO,IAAIE,EAAOF,EAAMhB,OAAOmB,aAAc,QAAa5B,IAAT2B,EAAoB,CAAE,IAAIE,EAAMF,EAAKG,KAAKL,EAAOC,GAAQ,WAAY,GAAqB,WAAjBlB,GAAQqB,GAAmB,OAAOA,EAAK,MAAM,IAAIE,UAAU,+CAAkD,CAAC,OAAiB,WAATL,EAAoBxG,OAAS8G,QAAQP,EAAS,CADpVQ,CAAaT,EAAK,UAAW,MAAwB,WAAjBhB,GAAQjD,GAAoBA,EAAMrC,OAAOqC,EAAO,CAD3E2E,CAAe3E,MAAiBgE,EAAOlE,OAAOiE,eAAeC,EAAKhE,EAAK,CAAEqB,MAAOA,EAAOoC,YAAY,EAAMmB,cAAc,EAAMC,UAAU,IAAkBb,EAAIhE,GAAOqB,EAAgB2C,CAAM,CAG5O,SAASoN,GAAyBC,EAAQC,GAAY,GAAc,MAAVD,EAAgB,MAAO,GAAI,IAAkErR,EAAK/I,EAAnE2W,EACzF,SAAuCyD,EAAQC,GAAY,GAAc,MAAVD,EAAgB,MAAO,CAAE,EAAE,IAA2DrR,EAAK/I,EAA5D2W,EAAS,CAAE,EAAM2D,EAAazR,OAAOC,KAAKsR,GAAqB,IAAKpa,EAAI,EAAGA,EAAIsa,EAAWzZ,OAAQb,IAAO+I,EAAMuR,EAAWta,GAAQqa,EAASvJ,QAAQ/H,IAAQ,IAAa4N,EAAO5N,GAAOqR,EAAOrR,IAAQ,OAAO4N,CAAS,CADjN4D,CAA8BH,EAAQC,GAAuB,GAAIxR,OAAOyD,sBAAuB,CAAE,IAAIkO,EAAmB3R,OAAOyD,sBAAsB8N,GAAS,IAAKpa,EAAI,EAAGA,EAAIwa,EAAiB3Z,OAAQb,IAAO+I,EAAMyR,EAAiBxa,GAAQqa,EAASvJ,QAAQ/H,IAAQ,GAAkBF,OAAOuD,UAAUqO,qBAAqBnN,KAAK8M,EAAQrR,KAAgB4N,EAAO5N,GAAOqR,EAAOrR,GAAO,CAAG,OAAO4N,CAAS,QCI7d,SAAsB+H,GACnC,I1BLqCzR,E0BKjCqC,EAAU5C,UAAU7L,OAAS,QAAsB2K,IAAjBkB,UAAU,GAAmBA,UAAU,GAAK,CAAA,EAClF,O1BNqCO,E0BMfyR,E1BLlBzR,aAAiB0R,MAGjB1R,aAAiB2R,KAFZ3R,EAAMtF,cAAckX,KAAKnX,GAK3BA,EAAsBuF,I0BDD4R,MAAK,SAAUC,GACzC,ODHW,SAA8BA,EAASjgB,EAAK8S,GACzD,IAAIyJ,EAASzJ,EAAKyJ,OAChB9L,EAAU6K,GAAyBxI,EAAMuI,IAC3C,GAAI5K,EAAQrB,IACV,MAAM,IAAIxL,MAAM,6DAKlB,IAAIyU,EAAS1B,GAASsJ,EAASjgB,EAAK4N,GAAcA,GAAc,CAAE,EAAE6C,GAAU,GAAI,CAChF1E,WAAYwQ,GAAU9L,EAAQ1E,cAEhC,OAAIwQ,EACKD,GAAajE,EAAOjR,KAAMmV,EAAQ3O,GAAcA,GAAc,CAAE,EAAE6C,GAAU,GAAI,CACrF1E,WAAYsM,EAAOtM,cAGhBsM,CACT,CCfW6H,CAAqBD,EAASjgB,EAAKyQ,EAC9C,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/parseProperties.js","../modules/xlsx/parseFilePaths.js","../modules/xlsx/parseStyles.js","../modules/xlsx/parseDate.js","../modules/xlsx/isDateTimestamp.js","../modules/xlsx/parseCellValue.js","../modules/xlsx/coordinates.js","../modules/xlsx/parseCell.js","../modules/xlsx/parseCells.js","../modules/xlsx/parseDimensions.js","../modules/xlsx/dropEmptyRows.js","../modules/xlsx/dropEmptyColumns.js","../modules/xlsx/getData.js","../modules/xlsx/parseXlsxFileContents.js","../modules/xlsx/parseSharedStrings.js","../modules/xlsx/parseSheet.js","../modules/types/InvalidError.js","../modules/types/Number.js","../modules/types/String.js","../modules/types/Boolean.js","../modules/xlsx/schema/mapToObjects.js","../modules/types/Date.js","../modules/xlsx/parseXlsxFileContentsWithOptionalSchema.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/**\r\n * Unpacks `*.xlsx` file contents, because it's just a `*.zip` archive.\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 getCells(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 getMergedCells(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 getCellValue(document, node) {\n  return findChild(node, 'v');\n}\nexport function getCellInlineStringValue(document, node) {\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(node);\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","import { 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 parseProperties(content, xml) {\n  var book = xml.createDocument(content);\n  var properties = {};\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\n  var workbookProperties = getWorkbookProperties(book);\n  if (workbookProperties && workbookProperties.getAttribute('date1904') === '1') {\n    properties.epoch1904 = true;\n  }\n\n  // Get sheets info (indexes, names, if they're available).\n  // Example:\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  // http://www.datypic.com/sc/ooxml/e-ssml_sheet-1.html\n\n  properties.sheets = [];\n  var addSheetInfo = function addSheetInfo(sheet) {\n    if (sheet.getAttribute('name')) {\n      properties.sheets.push({\n        id: sheet.getAttribute('sheetId'),\n        name: sheet.getAttribute('name'),\n        relationId: sheet.getAttribute('r:id')\n      });\n    }\n  };\n  getSheets(book).forEach(addSheetInfo);\n  return properties;\n}\n//# sourceMappingURL=parseProperties.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 (\"serial\") into a corresponding javascript Date in UTC+0 timezone.\n// (with time equal 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  // https://support.microsoft.com/en-gb/help/214330/differences-between-the-1900-and-the-1904-date-system-in-excel\n  if (options && options.epoch1904) {\n    excelSerialDate += 1462;\n  }\n\n  // \"Excel serial date\" is just\n  // the count of days since `01/01/1900`\n  // (seems that it may be even fractional).\n  //\n  // The count of days elapsed\n  // since `01/01/1900` (Excel epoch)\n  // till `01/01/1970` (Unix epoch).\n  // Accounts for leap years\n  // (19 of them, yielding 19 extra days).\n  var daysBeforeUnixEpoch = 70 * 365 + 19;\n\n  // An hour, approximately, because a minute\n  // may be longer than 60 seconds, due to \"leap seconds\".\n  //\n  // Still, Javascript `Date` (and UNIX time in general) intentionally\n  // drops the concept of \"leap seconds\" in order to make things simpler.\n  // So it's fine.\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 fact 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, while your\n  //  example timestamp 1483228826 is 2017-01-01T00:00:00Z on your system,\n  //  it would be interpreted as 2017-01-01T00:00:26Z on POSIX based systems,\n  //  or systems without leap second tables. So they aren't portable.\n  //  Even on systems that have full updated tables, there's no telling what those\n  //  tables will contain in the future (beyond the 6-month IERS announcement period),\n  //  so I can't produce a future timestamp without risk that it may eventually change.\n  //\n  //  To be clear - 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  //\n  var hour = 60 * 60 * 1000;\n  return new Date(Math.round((excelSerialDate - daysBeforeUnixEpoch) * 24 * hour));\n}\n//# sourceMappingURL=parseDate.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// 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// https://github.com/catamphetamine/read-excel-file/issues/3#issuecomment-395770777\n//\n// The list of generic numeric value \"formats\":\n// https://xlsxwriter.readthedocs.io/format.html#format-set-num-format\n//\nexport default function isDateTimestamp(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_NUMBER_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 && isDateTemplate(style.numberFormat.template)) {\n      return true;\n    }\n  }\n}\n\n// https://hexdocs.pm/xlsxir/number_styles.html\nvar BUILT_IN_DATE_NUMBER_FORMAT_IDS = [14, 15, 16, 17, 18, 19, 20, 21, 22, 27, 30, 36, 45, 46, 47, 50, 57];\n\n// On some date formats, there's an \"[$-414]\" prefix.\n// I don't have any idea what that is.\n//\n// https://stackoverflow.com/questions/4730152/what-indicates-an-office-open-xml-cell-contains-a-date-time-value\n//\n// Examples:\n//\n// * 27 (built-in format) \"[$-404]e/m/d\"\n// * 164 (custom format) \"[$-414]mmmm\\ yyyy;@\"\n//\nvar DATE_FORMAT_WEIRD_PREFIX = /^\\[\\$-414\\]/;\n\n// On some date formats, there's an \";@\" postfix.\n// I don't have any idea what that is.\n// Examples:\n//\n// * 164 (custom format) \"m/d/yyyy;@\"\n// * 164 (custom format) \"[$-414]mmmm\\ yyyy;@\"\n//\nvar DATE_FORMAT_WEIRD_POSTFIX = /;@$/;\nfunction isDateTemplate(template) {\n  // Date format tokens could be in upper case or in lower case.\n  // There seems to be no single standard.\n  // So lowercase the template first.\n  template = template.toLowerCase();\n\n  // On some date formats, there's an \"[$-414]\" prefix.\n  // I don't have any idea what that is. Trim it.\n  template = template.replace(DATE_FORMAT_WEIRD_PREFIX, '');\n\n  // On some date formats, there's an \";@\" postfix.\n  // I don't have any idea what that is. Trim it.\n  template = template.replace(DATE_FORMAT_WEIRD_POSTFIX, '');\n  var tokens = template.split(/\\W+/);\n  for (var _iterator = _createForOfIteratorHelperLoose(tokens), _step; !(_step = _iterator()).done;) {\n    var token = _step.value;\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=isDateTimestamp.js.map","import parseDate from './parseDate.js';\nimport isDateTimestamp from './isDateTimestamp.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    values = _ref.values,\n    properties = _ref.properties,\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 `values` 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 >= values.length) {\n        throw new Error(\"An out-of-bounds \\\"shared\\\" string index: \".concat(value));\n      }\n      value = values[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      var isDateTimestampNumber = isDateTimestamp(getStyleId(), styles, options);\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      if (isDateTimestampNumber) {\n        // Parse the number from string.\n        value = parseNumberDefault(value);\n        // Parse the number as a date timestamp.\n        value = parseDate(value, properties);\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        value = (options.parseNumber || parseNumberDefault)(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","// 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\"];\nexport function calculateDimensions(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\n// Converts a letter coordinate to a digit coordinate.\n// Examples: \"A\" -> 1, \"B\" -> 2, \"Z\" -> 26, \"AA\" -> 27, etc.\nfunction columnLettersToNumber(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}\nexport function parseCellCoordinates(coords) {\n  // Coordinate examples: \"AA2091\", \"R988\", \"B1\".\n  coords = coords.split(/(\\d+)/);\n  return [\n  // Row.\n  parseInt(coords[1]),\n  // Column.\n  columnLettersToNumber(coords[0].trim())];\n}\n//# sourceMappingURL=coordinates.js.map","import parseCellValue from './parseCellValue.js';\nimport { parseCellCoordinates } from './coordinates.js';\nimport { getCellValue, 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(node, sheet, xml, values, styles, properties, options) {\n  var coords = parseCellCoordinates(node.getAttribute('r'));\n  var valueElement = getCellValue(sheet, node);\n\n  // For `xpath`, `value` can be `undefined` while for native `DOMParser` it's `null`.\n  // So using `value && ...` instead of `if (value !== undefined) { ... }` here\n  // for uniform compatibility with both `xpath` and native `DOMParser`.\n  var value = valueElement && valueElement.textContent;\n  var type;\n  if (node.hasAttribute('t')) {\n    type = node.getAttribute('t');\n  }\n  return {\n    row: coords[0],\n    column: coords[1],\n    value: parseCellValue(value, type, {\n      getInlineStringValue: function getInlineStringValue() {\n        return getCellInlineStringValue(sheet, node);\n      },\n      getInlineStringXml: function getInlineStringXml() {\n        return getOuterXml(node);\n      },\n      getStyleId: function getStyleId() {\n        return node.getAttribute('s');\n      },\n      styles: styles,\n      values: values,\n      properties: properties,\n      options: options\n    })\n  };\n}\n//# sourceMappingURL=parseCell.js.map","import parseCell from './parseCell.js';\nimport { getCells, getMergedCells } from '../xml/xlsx.js';\nexport default function parseCells(sheet, xml, values, styles, properties, options) {\n  var cells = getCells(sheet);\n  if (cells.length === 0) {\n    return [];\n  }\n\n  // const mergedCells = getMergedCells(sheet)\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 (node) {\n    return parseCell(node, sheet, xml, values, styles, properties, 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 './coordinates.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 parseDimensions(sheet) {\n  var dimensions = getDimensions(sheet);\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=parseDimensions.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 getData(sheet, options) {\n  var dimensions = sheet.dimensions,\n    cells = sheet.cells;\n\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.\n  var rowIndexSourceMap = options.rowIndexSourceMap;\n  if (rowIndexSourceMap) {\n    var _i = 0;\n    while (_i < data.length) {\n      rowIndexSourceMap[_i] = _i;\n      _i++;\n    }\n  }\n\n  // Drop (discard) empty columns or rows.\n  //\n  // Don't discard empty rows or columns at the start or in the middle.\n  // Only discard empty rows at the bottom or empty columns on the right side.\n  // The rationale is that the data should be output in the same shape or form\n  // as it can be seen in the actual spreadsheet.\n  // If the user decides to discard empty rows or columns, they could do it manually\n  // by passing `transformData()` function as an option.\n  //\n  data = dropEmptyRows(dropEmptyColumns(data, {\n    onlyTrimAtTheEnd: true\n  }), {\n    onlyTrimAtTheEnd: true,\n    rowIndexSourceMap: rowIndexSourceMap\n  });\n\n  // Optionally transform data before applying `schema`.\n  if (options.transformData) {\n    data = options.transformData(data);\n    // data = options.transformData(data, {\n    //   dropEmptyRowsAndColumns(data) {\n    //     return dropEmptyRows(dropEmptyColumns(data), { rowIndexSourceMap })\n    //   }\n    // })\n  }\n\n  return data;\n}\n//# sourceMappingURL=getData.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 _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; }\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 parseProperties from './parseProperties.js';\nimport parseFilePaths from './parseFilePaths.js';\nimport parseStyles from './parseStyles.js';\nimport parseSharedStrings from './parseSharedStrings.js';\nimport parseSheet from './parseSheet.js';\nimport getData from './getData.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` spreadsheet.\r\n * @param  {Record<string,string>} contents - A map of XML files inside XLSX file (which is just a zipped directory).\r\n * @param  {object} xml — An object with a function `createDocument(string)`.\r\n * @param  {number?} options.sheet - Workbook sheet id (`1` by default).\r\n * @param  {string?} options.dateFormat - Date format, e.g. \"mm/dd/yyyy\". Values having this format template set will be parsed as dates.\r\n * @return {object} An object of shape `{ data, cells, properties }`. `data: string[][]` is an array of rows, each row being an array of cell values. `cells: string[][]` is an array of rows, each row being an array of cells. `properties: object` is the spreadsheet properties (e.g. whether date epoch is 1904 instead of 1900).\r\n */\nexport default function parseXlsxFileContents(contents, xml) {\n  var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n  if (!options.sheet) {\n    options = _objectSpread({\n      sheet: 1\n    }, options);\n  }\n  var getXmlFileContent = function getXmlFileContent(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` `.zip` archive.\n  // These paths aren't standardized between different spreadsheet editors.\n  // https://github.com/tidyverse/readxl/issues/104\n  var filePaths = parseFilePaths(getXmlFileContent('xl/_rels/workbook.xml.rels'), xml);\n\n  // Usual file path for \"shared strings\": \"xl/sharedStrings.xml\".\n  var values = filePaths.sharedStrings ? parseSharedStrings(getXmlFileContent(filePaths.sharedStrings), xml) : [];\n\n  // Usual file path for \"styles\": \"xl/styles.xml\".\n  var styles = filePaths.styles ? parseStyles(getXmlFileContent(filePaths.styles), xml) : {};\n  var properties = parseProperties(getXmlFileContent('xl/workbook.xml'), xml);\n\n  // A feature for getting the list of sheets in an Excel file.\n  // https://github.com/catamphetamine/read-excel-file/issues/14\n  if (options.getSheets) {\n    return properties.sheets.map(function (_ref) {\n      var name = _ref.name;\n      return {\n        name: name\n      };\n    });\n  }\n\n  // Find the sheet by name, or take the first one.\n  var sheetId = getSheetId(options.sheet, properties.sheets);\n\n  // If the sheet wasn't found then throw an error.\n  // Example: \"xl/worksheets/sheet1.xml\".\n  if (!sheetId || !filePaths.sheets[sheetId]) {\n    throw createSheetNotFoundError(options.sheet, properties.sheets);\n  }\n\n  // Parse sheet data.\n  var sheet = parseSheet(getXmlFileContent(filePaths.sheets[sheetId]), xml, values, styles, properties, options);\n  options = _objectSpread({\n    // Create a `rowIndexSourceMap` for the original dataset, if not passed,\n    // because \"empty\" rows will be dropped from the input data.\n    rowIndexSourceMap: []\n  }, options);\n\n  // Get spreadsheet data.\n  var data = getData(sheet, options);\n\n  // Can return properties, if required.\n  if (options.properties) {\n    return {\n      data: data,\n      properties: properties\n    };\n  }\n\n  // Return spreadsheet data.\n  return data;\n}\nfunction getSheetId(sheet, sheets) {\n  if (typeof sheet === 'number') {\n    var _sheet = sheets[sheet - 1];\n    return _sheet && _sheet.relationId;\n  }\n  for (var _iterator = _createForOfIteratorHelperLoose(sheets), _step; !(_step = _iterator()).done;) {\n    var _sheet2 = _step.value;\n    if (_sheet2.name === sheet) {\n      return _sheet2.relationId;\n    }\n  }\n}\nfunction createSheetNotFoundError(sheet, sheets) {\n  var sheetsList = sheets && sheets.map(function (sheet, i) {\n    return \"\\\"\".concat(sheet.name, \"\\\" (#\").concat(i + 1, \")\");\n  }).join(', ');\n  return new Error(\"Sheet \".concat(typeof sheet === 'number' ? '#' + sheet : '\"' + sheet + '\"', \" not found in the *.xlsx file.\").concat(sheets ? ' Available sheets: ' + sheetsList + '.' : ''));\n}\n//# sourceMappingURL=parseXlsxFileContents.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 parseCells from './parseCells.js';\nimport parseDimensions from './parseDimensions.js';\nimport { calculateDimensions } from './coordinates.js';\nexport default function parseSheet(content, xml, values, styles, properties, options) {\n  var sheet = xml.createDocument(content);\n  var cells = parseCells(sheet, xml, values, styles, properties, options);\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\n  var dimensions = parseDimensions(sheet) || calculateDimensions(cells);\n  return {\n    cells: cells,\n    dimensions: dimensions\n  };\n}\n//# sourceMappingURL=parseSheet.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 _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, _toPropertyKey(descriptor.key), descriptor); } }\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, \"prototype\", { writable: false }); return Constructor; }\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); }\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function\"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, writable: true, configurable: true } }); Object.defineProperty(subClass, \"prototype\", { writable: false }); if (superClass) _setPrototypeOf(subClass, superClass); }\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = _getPrototypeOf(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = _getPrototypeOf(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return _possibleConstructorReturn(this, result); }; }\nfunction _possibleConstructorReturn(self, call) { if (call && (_typeof(call) === \"object\" || typeof call === \"function\")) { return call; } else if (call !== void 0) { throw new TypeError(\"Derived constructors may only return object or undefined\"); } return _assertThisInitialized(self); }\nfunction _assertThisInitialized(self) { if (self === void 0) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return self; }\nfunction _wrapNativeSuper(Class) { var _cache = typeof Map === \"function\" ? new Map() : undefined; _wrapNativeSuper = function _wrapNativeSuper(Class) { if (Class === null || !_isNativeFunction(Class)) return Class; if (typeof Class !== \"function\") { throw new TypeError(\"Super expression must either be null or a function\"); } if (typeof _cache !== \"undefined\") { if (_cache.has(Class)) return _cache.get(Class); _cache.set(Class, Wrapper); } function Wrapper() { return _construct(Class, arguments, _getPrototypeOf(this).constructor); } Wrapper.prototype = Object.create(Class.prototype, { constructor: { value: Wrapper, enumerable: false, writable: true, configurable: true } }); return _setPrototypeOf(Wrapper, Class); }; return _wrapNativeSuper(Class); }\nfunction _construct(Parent, args, Class) { if (_isNativeReflectConstruct()) { _construct = Reflect.construct.bind(); } else { _construct = function _construct(Parent, args, Class) { var a = [null]; a.push.apply(a, args); var Constructor = Function.bind.apply(Parent, a); var instance = new Constructor(); if (Class) _setPrototypeOf(instance, Class.prototype); return instance; }; } return _construct.apply(null, arguments); }\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); return true; } catch (e) { return false; } }\nfunction _isNativeFunction(fn) { return Function.toString.call(fn).indexOf(\"[native code]\") !== -1; }\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\nfunction _getPrototypeOf(o) { _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf.bind() : function _getPrototypeOf(o) { return o.__proto__ || Object.getPrototypeOf(o); }; return _getPrototypeOf(o); }\nvar InvalidError = /*#__PURE__*/function (_Error) {\n  _inherits(InvalidError, _Error);\n  var _super = _createSuper(InvalidError);\n  function InvalidError(reason) {\n    var _this;\n    _classCallCheck(this, InvalidError);\n    _this = _super.call(this, 'invalid');\n    _this.reason = reason;\n    return _this;\n  }\n  return _createClass(InvalidError);\n}( /*#__PURE__*/_wrapNativeSuper(Error));\nexport { InvalidError as default };\n//# sourceMappingURL=InvalidError.js.map","import InvalidError from './InvalidError.js';\nexport default function NumberType(value) {\n  // An XLSX file editing software might not always correctly\n  // detect numeric values in string-type cells. Users won't bother\n  // manually selecting a cell type, so the editing software has to guess\n  // based on the user's input. One can assume that such auto-detection\n  // might not always work.\n  //\n  // So, if a cell is supposed to be a numeric one, convert a string value to a number.\n  //\n  if (typeof value === 'string') {\n    var stringifiedValue = value;\n    value = Number(value);\n    if (String(value) !== stringifiedValue) {\n      throw new InvalidError('not_a_number');\n    }\n  }\n  if (typeof value !== 'number') {\n    throw new InvalidError('not_a_number');\n  }\n  if (isNaN(value)) {\n    throw new InvalidError('invalid_number');\n  }\n  // At this point, `value` can only be a number.\n  //\n  // The global `isFinite()` function filters out:\n  // * NaN\n  // * -Infinity\n  // * Infinity\n  //\n  // All other values pass (including non-numbers).\n  //\n  if (!isFinite(value)) {\n    throw new InvalidError('out_of_bounds');\n  }\n  return value;\n}\n//# sourceMappingURL=Number.js.map","import InvalidError from './InvalidError.js';\nexport default function StringType(value) {\n  if (typeof value === 'string') {\n    return value;\n  }\n  // Excel tends to perform a forced automatic convertion of string-type values\n  // to number-type ones when the user has input them. Otherwise, users wouldn't\n  // be able to perform formula calculations on those cell values because users\n  // won't bother manually choosing a \"numeric\" cell type for each cell, and\n  // even if they did, choosing a \"numeric\" cell type every time wouldn't be an\n  // acceptable \"user experience\".\n  //\n  // So, if a cell value is supposed to be a string and Excel has automatically\n  // converted it to a number, perform a backwards conversion.\n  //\n  if (typeof value === 'number') {\n    if (isNaN(value)) {\n      throw new InvalidError('invalid_number');\n    }\n    // The global `isFinite()` function filters out:\n    // * NaN\n    // * -Infinity\n    // * Infinity\n    //\n    // All other values pass (including non-numbers).\n    //\n    if (!isFinite(value)) {\n      throw new InvalidError('out_of_bounds');\n    }\n    return String(value);\n  }\n  throw new InvalidError('not_a_string');\n}\n//# sourceMappingURL=String.js.map","import InvalidError from './InvalidError.js';\nexport default function BooleanType(value) {\n  if (typeof value === 'boolean') {\n    return value;\n  }\n  throw new InvalidError('not_a_boolean');\n}\n//# sourceMappingURL=Boolean.js.map","var _excluded = [\"isColumnOriented\", \"ignoreEmptyRows\", \"rowIndexSourceMap\"];\nfunction _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 _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 _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; }\nfunction _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; }\nfunction _objectWithoutProperties(source, excluded) { if (source == null) return {}; var target = _objectWithoutPropertiesLoose(source, excluded); var key, i; if (Object.getOwnPropertySymbols) { var sourceSymbolKeys = Object.getOwnPropertySymbols(source); for (i = 0; i < sourceSymbolKeys.length; i++) { key = sourceSymbolKeys[i]; if (excluded.indexOf(key) >= 0) continue; if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue; target[key] = source[key]; } } return target; }\nfunction _objectWithoutPropertiesLoose(source, excluded) { if (source == null) return {}; var target = {}; var sourceKeys = Object.keys(source); var key, i; for (i = 0; i < sourceKeys.length; i++) { key = sourceKeys[i]; if (excluded.indexOf(key) >= 0) continue; target[key] = source[key]; } return target; }\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 NumberType from '../../types/Number.js';\nimport StringType from '../../types/String.js';\nimport BooleanType from '../../types/Boolean.js';\nimport DateType from '../../types/Date.js';\nvar DEFAULT_OPTIONS = {\n  schemaPropertyValueForMissingColumn: undefined,\n  schemaPropertyValueForMissingValue: null,\n  schemaPropertyShouldSkipRequiredValidationForMissingColumn: function schemaPropertyShouldSkipRequiredValidationForMissingColumn() {\n    return false;\n  },\n  // `getEmptyObjectValue(object, { path })` applies to both the top-level object\n  // and any of its sub-objects.\n  getEmptyObjectValue: function getEmptyObjectValue() {\n    return null;\n  },\n  getEmptyArrayValue: function getEmptyArrayValue() {\n    return null;\n  },\n  isColumnOriented: false,\n  ignoreEmptyRows: true,\n  arrayValueSeparator: ','\n};\n\n/**\r\n * Converts spreadsheet-alike data structure into an array of objects.\r\n *\r\n * Parameters:\r\n *\r\n * * `data` — An array of rows, each row being an array of cells. The first row should be the list of column headers and the rest of the rows should be the data.\r\n * * `schema` — A \"to JSON\" convertion schema (see above).\r\n * * `options` — (optional) Schema conversion parameters of `read-excel-file`:\r\n *   * `schemaPropertyValueForMissingColumn` — By default, when some of the `schema` columns are missing in the input `data`, those properties are set to `undefined` in the output objects. Pass `schemaPropertyValueForMissingColumn: null` to set such \"missing column\" properties to `null` in the output objects.\r\n *   * `schemaPropertyValueForNullCellValue` — By default, when it encounters a `null` value in a cell in input `data`, it sets it to `undefined` in the output object. Pass `schemaPropertyValueForNullCellValue: null` to make it set such values as `null`s in output objects.\r\n *   * `schemaPropertyValueForUndefinedCellValue` — By default, when it encounters an `undefined` value in a cell in input `data`, it it sets it to `undefined` in the output object. Pass `schemaPropertyValueForUndefinedCellValue: null` to make it set such values as `null`s in output objects.\r\n *   * `schemaPropertyShouldSkipRequiredValidationForMissingColumn: (column: string, { object }) => boolean` — By default, it does apply `required` validation to `schema` properties for which columns are missing in the input `data`. One could pass a custom `schemaPropertyShouldSkipRequiredValidationForMissingColumn(column, { object })` to disable `required` validation for missing columns in some or all cases.\r\n *   * `getEmptyObjectValue(object, { path? })` — By default, it returns `null` for \"empty\" objects. One could override that value using `getEmptyObjectValue(object, { path })` parameter. The value applies to both top-level object and any nested sub-objects in case of a nested schema, hence the additional (optional) `path?: string` parameter.\r\n *   * `getEmptyArrayValue(array, { path })` — By default, it returns `null` for an \"empty\" array value. One could override that value using `getEmptyArrayValue(array, { path })` parameter.\r\n *\r\n * When parsing a property value, in case of an error, the value of that property is gonna be `undefined`.\r\n *\r\n * @param {any[][]} data - An array of rows, each row being an array of cells.\r\n * @param {object} schema\r\n * @param {object} [options]\r\n * @param {null} [options.schemaPropertyValueForMissingColumn] — By default, when some of the `schema` columns are missing in the input `data`, those properties are set to `undefined` in the output objects. Pass `schemaPropertyValueForMissingColumn: null` to set such \"missing column\" properties to `null` in the output objects.\r\n * @param {null} [options.schemaPropertyValueForMissingValue] — By default, when it encounters a `null` value in a cell in input `data`, it leaves the value as is. Pass a custom `schemaPropertyValueForMissingValue` to make it set such values to that value.\r\n * @param {object} [options.properties] — An optional object with optional property `epoch1904: true/false`. It is used when parsing dates.\r\n * @param {boolean} [options.schemaPropertyShouldSkipRequiredValidationForMissingColumn(column: string, { object })] — By default, it does apply `required` validation to `schema` properties for which columns are missing in the input `data`. One could pass a custom `schemaPropertyShouldSkipRequiredValidationForMissingColumn(column, { object })` to disable `required` validation for missing columns in some or all cases.\r\n * @param {function} [options.getEmptyObjectValue(object, { path })] — By default, it returns `null` for an \"empty\" resulting object. One could override that value using `getEmptyObjectValue(object, { path })` parameter. The value applies to both top-level object and any nested sub-objects in case of a nested schema, hence the additional `path?: string` parameter.\r\n * @param {function} [getEmptyArrayValue(array, { path })] — By default, it returns `null` for an \"empty\" array value. One could override that value using `getEmptyArrayValue(array, { path })` parameter.\r\n * @param {boolean} [options.isColumnOriented] — By default, the headers are assumed to be the first row in the `data`. Pass `isColumnOriented: true` if the headers are the first column in the `data`. i.e. if `data` is \"transposed\".\r\n * @param {string} [options.arrayValueSeparator] — When specified, string values will be split by this separator to get the array.\r\n * @param {object} [options.rowIndexSourceMap] — Custom row indexes of `data` rows. If present, will overwrite the indexes of `data` rows with the indexes from this `rowIndexSourceMap`.\r\n * @return {object[]}\r\n */\nexport default function mapToObjects(data, schema, options) {\n  if (options) {\n    options = _objectSpread(_objectSpread({}, DEFAULT_OPTIONS), options);\n  } else {\n    options = DEFAULT_OPTIONS;\n  }\n  var _options = options,\n    isColumnOriented = _options.isColumnOriented,\n    ignoreEmptyRows = _options.ignoreEmptyRows,\n    rowIndexSourceMapOriginal = _options.rowIndexSourceMap,\n    schemaTransformOptions = _objectWithoutProperties(_options, _excluded);\n\n  // `rowIndexSourceMap` could be mutated by `ignoreEmptyRows: true` option.\n  // Create a copy of it so that the original `rowIndexSourceMap` is not affected by those changes.\n  var rowIndexSourceMap = rowIndexSourceMapOriginal && rowIndexSourceMapOriginal.slice();\n  validateSchema(schema);\n  if (isColumnOriented) {\n    data = transpose(data);\n  }\n  if (ignoreEmptyRows) {\n    data = data.filter(function (row, i) {\n      var isEmptyRow = row.every(function (cell) {\n        return cell === null;\n      });\n      if (isEmptyRow) {\n        // Adjust `rowIndexSourceMap` now that the row has been removed.\n        if (rowIndexSourceMap) {\n          // Remove the `rowIndexSourceMap` entry that corresponds to the removed row.\n          rowIndexSourceMap.splice(i, 1);\n        }\n        return false;\n      }\n      return true;\n    });\n  }\n  var columns = data[0];\n  var results = [];\n  var errors = [];\n  for (var i = 1; i < data.length; i++) {\n    var result = read(schema, data[i], i, undefined, columns, errors, schemaTransformOptions);\n    results.push(result);\n  }\n\n  // Set the correct `row` number in `errors` if a custom `rowIndexSourceMap` is supplied.\n  if (rowIndexSourceMap) {\n    for (var _iterator = _createForOfIteratorHelperLoose(errors), _step; !(_step = _iterator()).done;) {\n      var error = _step.value;\n      // Convert the `row` index in `data` to the\n      // actual `row` index in the spreadsheet.\n      // `- 1` converts row number to row index.\n      // `+ 1` converts row index to row number.\n      error.row = rowIndexSourceMap[error.row - 1] + 1;\n    }\n  }\n  return {\n    rows: results,\n    errors: errors\n  };\n}\nfunction read(schema, row, rowIndex, path, columns, errors, options) {\n  var object = {};\n  var isEmptyObject = true;\n  var createError = function createError(_ref) {\n    var schemaEntry = _ref.schemaEntry,\n      value = _ref.value,\n      errorMessage = _ref.error,\n      reason = _ref.reason;\n    var error = {\n      error: errorMessage,\n      row: rowIndex + 1,\n      column: schemaEntry.column,\n      value: value\n    };\n    if (reason) {\n      error.reason = reason;\n    }\n    // * Regular values specify a `type?` property, which is included in the `error` object.\n    // * Nested objects specify a `schema` property, which is not included in the `error` object.\n    if (schemaEntry.type) {\n      error.type = schemaEntry.type;\n    }\n    return error;\n  };\n  var pendingRequiredChecks = [];\n\n  // For each schema entry.\n  var _loop = function _loop() {\n    var key = _Object$keys[_i];\n    var schemaEntry = schema[key];\n    var propertyName = key;\n    var columnTitle = schemaEntry.column;\n\n    // The path of this property inside the resulting object.\n    var propertyPath = \"\".concat(path || '', \".\").concat(propertyName);\n\n    // Read the cell value for the schema entry.\n    var cellValue;\n    var columnIndex = columns.indexOf(columnTitle);\n    var isMissingColumn = columnIndex < 0;\n    if (!isMissingColumn) {\n      cellValue = row[columnIndex];\n    }\n    var value;\n    var error;\n    var reason;\n\n    // Get property `value` from cell value.\n    if (schemaEntry.schema) {\n      value = read(schemaEntry.schema, row, rowIndex, propertyPath, columns, errors, options);\n    } else {\n      if (isMissingColumn) {\n        if ('schemaPropertyValueForMissingColumn' in options) {\n          value = options.schemaPropertyValueForMissingColumn;\n        }\n      } else if (cellValue === undefined) {\n        // This isn't supposed to be possible. Cell values are always `null` when cells are empty.\n        // Employ some sensible fallback behavior here.\n        if ('schemaPropertyValueForMissingValue' in options) {\n          value = options.schemaPropertyValueForMissingValue;\n        }\n      } else if (cellValue === null) {\n        if ('schemaPropertyValueForMissingValue' in options) {\n          value = options.schemaPropertyValueForMissingValue;\n        }\n      } else if (Array.isArray(schemaEntry.type)) {\n        var array = parseArray(cellValue, options.arrayValueSeparator).map(function (_value) {\n          if (error) {\n            return;\n          }\n          var result = parseValue(_value, schemaEntry, options);\n          if (result.error) {\n            // In case of an error, `value` won't be returned and will just be reported\n            // as part of an `error` object, so it's fine assigning just an element of the array.\n            value = _value;\n            error = result.error;\n            reason = result.reason;\n          }\n          return result.value;\n        });\n        if (!error) {\n          var isEmpty = array.every(isEmptyValue);\n          value = isEmpty ? options.getEmptyArrayValue(array, {\n            path: propertyPath\n          }) : array;\n        }\n      } else {\n        var result = parseValue(cellValue, schemaEntry, options);\n        error = result.error;\n        reason = result.reason;\n        value = error ? cellValue : result.value;\n      }\n    }\n\n    // Apply `required` validation if the value is \"empty\".\n    if (!error && isEmptyValue(value)) {\n      if (schemaEntry.required) {\n        // Will perform this `required()` validation in the end,\n        // when all properties of the mapped object have been mapped.\n        pendingRequiredChecks.push({\n          schemaEntry: schemaEntry,\n          value: value,\n          isMissingColumn: isMissingColumn\n        });\n      }\n    }\n    if (error) {\n      // If there was an error then the property value in the `object` will be `undefined`,\n      // i.e it won't add the property value to the mapped object.\n      errors.push(createError({\n        schemaEntry: schemaEntry,\n        value: value,\n        error: error,\n        reason: reason\n      }));\n    } else {\n      // Possibly unmark the mapped object as \"empty\".\n      if (isEmptyObject && !isEmptyValue(value)) {\n        isEmptyObject = false;\n      }\n      // Set the value in the mapped object.\n      // Skip setting `undefined` values because they're already `undefined`\n      // due to not having previously been set.\n      if (value !== undefined) {\n        object[propertyName] = value;\n      }\n    }\n  };\n  for (var _i = 0, _Object$keys = Object.keys(schema); _i < _Object$keys.length; _i++) {\n    _loop();\n  }\n\n  // Return `null` for an \"empty\" mapped object.\n  if (isEmptyObject) {\n    return options.getEmptyObjectValue(object, {\n      path: path\n    });\n  }\n\n  // Perform any `required` validations.\n  for (var _i2 = 0, _pendingRequiredCheck = pendingRequiredChecks; _i2 < _pendingRequiredCheck.length; _i2++) {\n    var _pendingRequiredCheck2 = _pendingRequiredCheck[_i2],\n      schemaEntry = _pendingRequiredCheck2.schemaEntry,\n      value = _pendingRequiredCheck2.value,\n      isMissingColumn = _pendingRequiredCheck2.isMissingColumn;\n    // Can optionally skip `required` validation for missing columns.\n    var skipRequiredValidation = isMissingColumn && options.schemaPropertyShouldSkipRequiredValidationForMissingColumn(schemaEntry.column, {\n      object: object\n    });\n    if (!skipRequiredValidation) {\n      var required = schemaEntry.required;\n      var isRequired = typeof required === 'boolean' ? required : required(object);\n      if (isRequired) {\n        errors.push(createError({\n          schemaEntry: schemaEntry,\n          value: value,\n          error: 'required'\n        }));\n      }\n    }\n  }\n\n  // Return the mapped object.\n  return object;\n}\n\n/**\r\n * Converts textual value to a javascript typed value.\r\n * @param  {any} value\r\n * @param  {object} schemaEntry\r\n * @return {{ value: any, error: string }}\r\n */\nexport function parseValue(value, schemaEntry, options) {\n  if (value === null) {\n    return {\n      value: null\n    };\n  }\n  var result;\n  if (schemaEntry.parse) {\n    throw new Error('`schemaEntry.parse` property was renamed to `schemaEntry.type`');\n  } else if (schemaEntry.type) {\n    result = parseValueOfType(value,\n    // Supports parsing array types.\n    // See `parseArray()` function for more details.\n    // Example `type`: String[]\n    // Input: 'Barack Obama, \"String, with, colons\", Donald Trump'\n    // Output: ['Barack Obama', 'String, with, colons', 'Donald Trump']\n    Array.isArray(schemaEntry.type) ? schemaEntry.type[0] : schemaEntry.type, options);\n  } else {\n    result = {\n      value: value\n    };\n    // throw new Error('Invalid schema entry: no `type` specified:\\n\\n' + JSON.stringify(schemaEntry, null, 2))\n  }\n  // If errored then return the error.\n  if (result.error) {\n    return result;\n  }\n  if (result.value !== null) {\n    if (schemaEntry.oneOf && schemaEntry.oneOf.indexOf(result.value) < 0) {\n      return {\n        error: 'invalid',\n        reason: 'unknown'\n      };\n    }\n    if (schemaEntry.validate) {\n      try {\n        schemaEntry.validate(result.value);\n      } catch (error) {\n        return {\n          error: error.message\n        };\n      }\n    }\n  }\n  return result;\n}\n\n/**\r\n * Converts textual value to a custom value using supplied `.parse()`.\r\n * @param  {any} value\r\n * @param  {function} parse\r\n * @return {{ value: any, error: string }}\r\n */\nfunction parseCustomValue(value, parse) {\n  try {\n    var parsedValue = parse(value);\n    if (parsedValue === undefined) {\n      return {\n        value: null\n      };\n    }\n    return {\n      value: parsedValue\n    };\n  } catch (error) {\n    var result = {\n      error: error.message\n    };\n    if (error.reason) {\n      result.reason = error.reason;\n    }\n    return result;\n  }\n}\n\n/**\r\n * Converts textual value to a javascript typed value.\r\n * @param  {any} value\r\n * @param  {} type\r\n * @return {{ value: (string|number|Date|boolean), error: string, reason?: string }}\r\n */\nfunction parseValueOfType(value, type, options) {\n  switch (type) {\n    case String:\n      return parseCustomValue(value, StringType);\n    case Number:\n      return parseCustomValue(value, NumberType);\n    case Date:\n      return parseCustomValue(value, function (value) {\n        return DateType(value, {\n          properties: options.properties\n        });\n      });\n    case Boolean:\n      return parseCustomValue(value, BooleanType);\n    default:\n      if (typeof type === 'function') {\n        return parseCustomValue(value, type);\n      }\n      throw new Error(\"Unsupported schema type: \".concat(type && type.name || type));\n  }\n}\nexport function getBlock(string, endCharacter, startIndex) {\n  var i = 0;\n  var substring = '';\n  var character;\n  while (startIndex + i < string.length) {\n    var _character = string[startIndex + i];\n    if (_character === endCharacter) {\n      return [substring, i];\n    } else if (_character === '\"') {\n      var block = getBlock(string, '\"', startIndex + i + 1);\n      substring += block[0];\n      i += '\"'.length + block[1] + '\"'.length;\n    } else {\n      substring += _character;\n      i++;\n    }\n  }\n  return [substring, i];\n}\n\n/**\r\n * Parses a string of comma-separated substrings into an array of substrings.\r\n * (the `export` is just for tests)\r\n * @param  {string} string — A string of comma-separated substrings.\r\n * @return {string[]} An array of substrings.\r\n */\nexport function parseArray(string, arrayValueSeparator) {\n  var blocks = [];\n  var index = 0;\n  while (index < string.length) {\n    var _getBlock = getBlock(string, arrayValueSeparator, index),\n      _getBlock2 = _slicedToArray(_getBlock, 2),\n      substring = _getBlock2[0],\n      length = _getBlock2[1];\n    index += length + arrayValueSeparator.length;\n    blocks.push(substring.trim());\n  }\n  return blocks;\n}\n\n// Transpose a 2D array.\n// https://stackoverflow.com/questions/17428587/transposing-a-2d-array-in-javascript\nvar transpose = function transpose(array) {\n  return array[0].map(function (_, i) {\n    return array.map(function (row) {\n      return row[i];\n    });\n  });\n};\nfunction validateSchema(schema) {\n  for (var _i3 = 0, _Object$keys2 = Object.keys(schema); _i3 < _Object$keys2.length; _i3++) {\n    var key = _Object$keys2[_i3];\n    var schemaEntry = schema[key];\n    // Validate that the `schema` is not using a deprecated `type: nestedSchema` format.\n    if (_typeof(schemaEntry.type) === 'object' && !Array.isArray(schemaEntry.type)) {\n      throw new Error('When defining a nested schema, use a `schema` property instead of a `type` property');\n    }\n    // Validate that every property has a source `column` title specified for it.\n    if (!schemaEntry.schema) {\n      if (!schemaEntry.column) {\n        throw new Error(\"\\\"column\\\" not defined for schema entry \\\"\".concat(key, \"\\\".\"));\n      }\n    }\n  }\n}\nfunction isEmptyValue(value) {\n  return value === undefined || value === null;\n}\n//# sourceMappingURL=mapToObjects.js.map","import parseDate from '../xlsx/parseDate.js';\nimport InvalidError from './InvalidError.js';\nexport default function DateType(value, _ref) {\n  var properties = _ref.properties;\n  // XLSX has no specific format for dates.\n  // Sometimes a date can be heuristically detected.\n  // https://github.com/catamphetamine/read-excel-file/issues/3#issuecomment-395770777\n  if (value instanceof Date) {\n    if (isNaN(value.valueOf())) {\n      throw new InvalidError('out_of_bounds');\n    }\n    return value;\n  }\n  if (typeof value === 'number') {\n    if (isNaN(value)) {\n      throw new InvalidError('invalid_number');\n    }\n    if (!isFinite(value)) {\n      throw new InvalidError('out_of_bounds');\n    }\n    var date = parseDate(value, properties);\n    if (isNaN(date.valueOf())) {\n      throw new InvalidError('out_of_bounds');\n    }\n    return date;\n  }\n  throw new InvalidError('not_a_date');\n}\n//# sourceMappingURL=Date.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); }\nvar _excluded = [\"schema\"];\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); }\nfunction _objectWithoutProperties(source, excluded) { if (source == null) return {}; var target = _objectWithoutPropertiesLoose(source, excluded); var key, i; if (Object.getOwnPropertySymbols) { var sourceSymbolKeys = Object.getOwnPropertySymbols(source); for (i = 0; i < sourceSymbolKeys.length; i++) { key = sourceSymbolKeys[i]; if (excluded.indexOf(key) >= 0) continue; if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue; target[key] = source[key]; } } return target; }\nfunction _objectWithoutPropertiesLoose(source, excluded) { if (source == null) return {}; var target = {}; var sourceKeys = Object.keys(source); var key, i; for (i = 0; i < sourceKeys.length; i++) { key = sourceKeys[i]; if (excluded.indexOf(key) >= 0) continue; target[key] = source[key]; } return target; }\nimport parseXlsxFileContents from './parseXlsxFileContents.js';\nimport mapToObjects from './schema/mapToObjects.js';\n\n/**\r\n * Reads data from an `.xlsx` spreadsheet.\r\n * @param {Record<string,string>} contents — A map of XML files inside XLSX file (which is just a zipped directory).\r\n * @param {object} xml — An object with a function `createDocument(string)`.\r\n * @param {object} options\r\n * @returns Spreadsheet data\r\n */\nexport default function parseXlsxFileContentsWithOptionalSchema(contents, xml, _ref) {\n  var schema = _ref.schema,\n    options = _objectWithoutProperties(_ref, _excluded);\n  if (options.map) {\n    throw new Error('`map` option was removed. Pass a `schema` option instead.');\n  }\n  // `parseXlsxFileContents()` function creates `options.rowIndexSourceMap` property.\n  // It maps parsed data row indexes to spreadsheet row indexes.\n  // That's because empty rows are ignored (discarded) when parsing using `schema`.\n  var result = parseXlsxFileContents(contents, xml, _objectSpread(_objectSpread({}, options), {}, {\n    properties: schema || options.properties\n  }));\n  if (schema) {\n    return mapToObjects(result.data, schema, _objectSpread(_objectSpread({}, options), {}, {\n      properties: result.properties\n    }));\n  }\n  return result;\n}\n//# sourceMappingURL=parseXlsxFileContentsWithOptionalSchema.js.map","import xml from '../xml/xmlBrowser.js';\nimport unpackXlsxFile from './unpackXlsxFileBrowser.js';\nimport parseXlsxFileContents from '../xlsx/parseXlsxFileContentsWithOptionalSchema.js';\n\n/**\r\n * Reads XLSX file into a 2D array of cells.\r\n * @param  {(File|Blob|ArrayBuffer)} input\r\n * @param  {object?} options\r\n * @param  {(number|string)?} options.sheet - Excel document sheet to read. Defaults to `1`. Will only read this sheet and skip others.\r\n * @return {Promise} Resolves to a 2D array of cells: an array of rows, each row being an array of cells.\r\n */\nexport default function readXlsxFile(input) {\n  var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n  return unpackXlsxFile(input).then(function (contents) {\n    return parseXlsxFileContents(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","parseProperties","book","properties","workbookProperties","getAttribute","epoch1904","sheets","getSheets","sheet","relationId","parseFilePaths","filePaths","sharedStrings","styles","getRelationships","relationship","filePath","getFilePath","_typeof","Symbol","iterator","ownKeys","getOwnPropertySymbols","getOwnPropertyDescriptor","enumerable","_objectSpread","_defineProperty","getOwnPropertyDescriptors","defineProperties","defineProperty","obj","arg","hint","prim","toPrimitive","res","call","TypeError","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","parseExcelDate","excelSerialDate","Date","round","_createForOfIteratorHelperLoose","allowArrayLike","it","next","bind","Array","isArray","minLen","_arrayLikeToArray","from","test","_unsupportedIterableToArray","done","arr","len","arr2","isDateTimestamp","styleId","concat","BUILT_IN_DATE_NUMBER_FORMAT_IDS","dateFormat","smartDateParser","_step","_iterator","toLowerCase","DATE_FORMAT_WEIRD_PREFIX","DATE_FORMAT_WEIRD_POSTFIX","token","DATE_TEMPLATE_TOKENS","isDateTemplate","parseCellValue","getInlineStringValue","getInlineStringXml","getStyleId","values","parseString","sharedStringIndex","isNaN","errorCode","decodeError","parsedDate","valueOf","parseDate","parseNumberDefault","parseNumber","stringifiedNumber","parsedNumber","LETTERS","columnLettersToNumber","columnLetters","parseCellCoordinates","coords","parseInt","parseCell","valueElement","getCellValue","row","column","firstElementChild","firstElementChildFirstElementChild","getCellInlineStringValue","parseCells","cells","sheetData","cell","getCells","_slicedToArray","_arrayWithHoles","u","_iterableToArrayLimit","_nonIterableRest","parseDimensions","dimensions","getDimensions","_ref2","getData","_dimensions","rightBottom","colsCount","rowsCount","rowIndex","columnIndex","rowIndexSourceMap","_ref$accessor","accessor","_","onlyTrimAtTheEnd","empty","splice","dropEmptyRows","dropEmptyColumns","transformData","parseXlsxFileContents","contents","getXmlFileContent","parseSharedStrings","sheetId","_sheet","_sheet2","getSheetId","sheetsList","join","createSheetNotFoundError","comparator","allRows","sort","allCols","minRow","maxRow","calculateDimensions","parseSheet","_defineProperties","target","props","descriptor","_createSuper","Derived","hasNativeReflectConstruct","_isNativeReflectConstruct","result","Super","_getPrototypeOf","NewTarget","this","Reflect","construct","self","ReferenceError","_assertThisInitialized","_possibleConstructorReturn","_wrapNativeSuper","Class","_cache","Map","Function","has","get","Wrapper","_construct","create","_setPrototypeOf","Parent","args","instance","sham","Proxy","Boolean","setPrototypeOf","__proto__","getPrototypeOf","InvalidError","_Error","subClass","superClass","_inherits","Constructor","protoProps","staticProps","_super","reason","_this","_classCallCheck","NumberType","stringifiedValue","isFinite","StringType","BooleanType","_excluded","_objectWithoutProperties","source","excluded","sourceKeys","_objectWithoutPropertiesLoose","sourceSymbolKeys","propertyIsEnumerable","DEFAULT_OPTIONS","schemaPropertyValueForMissingColumn","schemaPropertyValueForMissingValue","schemaPropertyShouldSkipRequiredValidationForMissingColumn","getEmptyObjectValue","getEmptyArrayValue","isColumnOriented","ignoreEmptyRows","arrayValueSeparator","mapToObjects","schema","_options","rowIndexSourceMapOriginal","schemaTransformOptions","_i3","_Object$keys2","schemaEntry","validateSchema","transpose","every","columns","errors","read","rows","object","isEmptyObject","createError","errorMessage","pendingRequiredChecks","_loop","cellValue","propertyName","columnTitle","propertyPath","isMissingColumn","array","blocks","index","_getBlock2","getBlock","substring","parseArray","_value","parseValue","isEmpty","isEmptyValue","required","_i2","_pendingRequiredCheck","_pendingRequiredCheck2","parse","parseCustomValue","date","DateType","parseValueOfType","oneOf","validate","message","parsedValue","endCharacter","startIndex","_character","block","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,CCSA,SAASC,EAAyBC,GAChC,OAAO3B,EAAqB2B,EAAa,CACvCtC,OAAQmC,IACPI,KAAKZ,EACV,CCvBO,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,CCxFe,SAASe,GAAgBnQ,EAASF,GAC/C,IAAIsQ,EAAOtQ,EAAIC,eAAeC,GAC1BqQ,EAAa,CAAA,EAMbC,EDmFG1B,GCnFwCwB,EDkFvBH,gBACG,cClFvBK,GAAsE,MAAhDA,EAAmBC,aAAa,cACxDF,EAAWG,WAAY,GAczBH,EAAWI,OAAS,GAWpB,OD8DK,SAAmBV,GAGxB,OAAOZ,GADMP,GADEmB,EAASE,gBACS,UACL,QAC9B,CCnEES,CAAUN,GAAMf,SATG,SAAsBsB,GACnCA,EAAMJ,aAAa,SACrBF,EAAWI,OAAOpH,KAAK,CACrBlB,GAAIwI,EAAMJ,aAAa,WACvB9D,KAAMkE,EAAMJ,aAAa,QACzBK,WAAYD,EAAMJ,aAAa,SAGvC,IAESF,CACT,CC5Be,SAASQ,GAAe7Q,EAASF,GAS9C,IAAIiQ,EAAWjQ,EAAIC,eAAeC,GAC9B8Q,EAAY,CACdL,OAAQ,CAAE,EACVM,mBAAe3D,EACf4D,YAAQ5D,GA0BV,OF8CK,SAA0B2C,GAE/B,OAAOZ,GADaY,EAASE,gBACM,eACrC,CE1DEgB,CAAiBlB,GAAUV,SAfL,SAAyB6B,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,EAAUL,OAAOS,EAAaX,aAAa,OAASa,GAAYD,GAGxE,IAUSL,CACT,CACA,SAASM,GAAY7D,GAQnB,MAAgB,MAAZA,EAAK,GACAA,EAAKjG,MAAM,GAOb,MAAQiG,CACjB,CCrEA,SAAS8D,GAAQpO,GAAgC,OAAOoO,GAAU,mBAAqBC,QAAU,iBAAmBA,OAAOC,SAAW,SAAUtO,GAAK,cAAcA,GAAO,SAAUA,GAAK,OAAOA,GAAK,mBAAqBqO,QAAUrO,EAAEqG,cAAgBgI,QAAUrO,IAAMqO,OAAOzJ,UAAY,gBAAkB5E,CAAE,EAAIoO,GAAQpO,EAAK,CAC9T,SAASuO,GAAQnO,EAAGlC,GAAK,IAAIsE,EAAI2I,OAAOC,KAAKhL,GAAI,GAAI+K,OAAOqD,sBAAuB,CAAE,IAAIxO,EAAImL,OAAOqD,sBAAsBpO,GAAIlC,IAAM8B,EAAIA,EAAEmJ,QAAO,SAAUjL,GAAK,OAAOiN,OAAOsD,yBAAyBrO,EAAGlC,GAAGwQ,UAAW,KAAMlM,EAAE4D,KAAKyB,MAAMrF,EAAGxC,EAAG,CAAG,OAAOwC,CAAI,CAC/P,SAASmM,GAAcvO,GAAK,IAAK,IAAIlC,EAAI,EAAGA,EAAIgM,UAAUpL,OAAQZ,IAAK,CAAE,IAAIsE,EAAI,MAAQ0H,UAAUhM,GAAKgM,UAAUhM,GAAK,CAAE,EAAEA,EAAI,EAAIqQ,GAAQpD,OAAO3I,IAAI,GAAI4J,SAAQ,SAAUlO,GAAK0Q,GAAgBxO,EAAGlC,EAAGsE,EAAEtE,GAAM,IAAIiN,OAAO0D,0BAA4B1D,OAAO2D,iBAAiB1O,EAAG+K,OAAO0D,0BAA0BrM,IAAM+L,GAAQpD,OAAO3I,IAAI4J,SAAQ,SAAUlO,GAAKiN,OAAO4D,eAAe3O,EAAGlC,EAAGiN,OAAOsD,yBAAyBjM,EAAGtE,GAAI,GAAM,CAAC,OAAOkC,CAAI,CACvb,SAASwO,GAAgBI,EAAK3D,EAAKuB,GAA4L,OAAnLvB,EAC5C,SAAwB4D,GAAO,IAAI5D,EACnC,SAAsBtB,EAAOmF,GAAQ,GAAuB,WAAnBd,GAAQrE,IAAiC,OAAVA,EAAgB,OAAOA,EAAO,IAAIoF,EAAOpF,EAAMsE,OAAOe,aAAc,QAAajF,IAATgF,EAAoB,CAAE,IAAIE,EAAMF,EAAKG,KAAKvF,EAAOmF,GAAQ,WAAY,GAAqB,WAAjBd,GAAQiB,GAAmB,OAAOA,EAAK,MAAM,IAAIE,UAAU,+CAAkD,CAAC,OAAiB,WAATL,EAAoBzH,OAAS+H,QAAQzF,EAAS,CADpV0F,CAAaR,EAAK,UAAW,MAAwB,WAAjBb,GAAQ/C,GAAoBA,EAAM5D,OAAO4D,EAAO,CAD3EqE,CAAerE,MAAiB2D,EAAO7D,OAAO4D,eAAeC,EAAK3D,EAAK,CAAEuB,MAAOA,EAAO8B,YAAY,EAAMiB,cAAc,EAAMC,UAAU,IAAkBZ,EAAI3D,GAAOuB,EAAgBoC,CAAM,CAQ7N,SAASa,GAAY9S,EAASF,GAC3C,IAAKE,EACH,MAAO,GAKT,IH+B4B+P,EAExBgD,EGjCAC,EAAMlT,EAAIC,eAAeC,GACzBiT,GH8BwBlD,EG9BGiD,EHgC3BD,EAAenE,GADFmB,EAASE,gBACe,gBACrC8C,EACK5D,GAAa4D,EAAc,MAE7B,IGpC6BG,IAAIC,IACpCC,EH6CC,SAA0BrD,GAC/B,IAEIsD,EAAUzE,GAFGmB,EAASE,gBAEU,WACpC,OAAIoD,EACKlE,GAAakE,EAAS,UAExB,EACT,CGrDsBC,CAAiBN,GAAKE,IAAIK,IAAwBC,QAAO,SAAUC,EAASC,GAI9F,OADAD,EAAQC,EAAOvL,IAAMuL,EACdD,CACR,GAAE,IAOH,OHyBK,SAAuB1D,GAC5B,IACI4D,EAAU/E,GADGmB,EAASE,gBACU,WACpC,OAAK0D,EAGExE,GAAawE,EAAS,MAFpB,EAGX,CGhCSC,CAAcZ,GAAKE,KANP,SAAsBW,GACvC,OAAIA,EAAGC,aAAa,QACXlC,GAAcA,GAAc,CAAE,EAAEqB,EAAWY,EAAGE,OAAQZ,GAAeU,EAAIT,IAE3ED,GAAeU,EAAIT,EAC9B,GAEA,CACA,SAASG,GAAuBS,GAC9B,MAAO,CACL7L,GAAI6L,EAAOzD,aAAa,YACxB0D,SAAUD,EAAOzD,aAAa,cAElC,CAGA,SAAS4C,GAAeU,EAAIR,GAC1B,IAAIa,EAAQ,CAAA,EACZ,GAAIL,EAAGC,aAAa,YAAa,CAC/B,IAAIK,EAAiBN,EAAGtD,aAAa,YAGjC8C,EAAQc,GACVD,EAAME,aAAef,EAAQc,GAE7BD,EAAME,aAAe,CACnBjM,GAAIgM,EAGT,CACD,OAAOD,CACT,CClDe,SAASG,GAAeC,EAAiBrH,GAElDA,GAAWA,EAAQuD,YACrB8D,GAAmB,MAsDrB,OAAO,IAAIC,KAAK1P,KAAK2P,MAAgD,IAAzCF,EA1CF,OAyCf,MAEb,CCjEA,SAASG,GAAgCxR,EAAGyR,GAAkB,IAAIC,EAAuB,oBAAXrD,QAA0BrO,EAAEqO,OAAOC,WAAatO,EAAE,cAAe,GAAI0R,EAAI,OAAQA,EAAKA,EAAGpC,KAAKtP,IAAI2R,KAAKC,KAAKF,GAAK,GAAIG,MAAMC,QAAQ9R,KAAO0R,EACxN,SAAqC1R,EAAG+R,GAAU,IAAK/R,EAAG,OAAQ,GAAiB,iBAANA,EAAgB,OAAOgS,GAAkBhS,EAAG+R,GAAS,IAAI1P,EAAI8I,OAAOvG,UAAUT,SAASmL,KAAKtP,GAAGqE,MAAM,GAAI,GAAc,WAANhC,GAAkBrC,EAAEqG,cAAahE,EAAIrC,EAAEqG,YAAYmD,MAAM,GAAU,QAANnH,GAAqB,QAANA,EAAa,OAAOwP,MAAMI,KAAKjS,GAAI,GAAU,cAANqC,GAAqB,2CAA2C6P,KAAK7P,GAAI,OAAO2P,GAAkBhS,EAAG+R,EAAU,CADnMI,CAA4BnS,KAAOyR,GAAkBzR,GAAyB,iBAAbA,EAAElB,OAAqB,CAAM4S,IAAI1R,EAAI0R,GAAI,IAAIzT,EAAI,EAAG,OAAO,WAAc,OAAIA,GAAK+B,EAAElB,OAAe,CAAEsT,MAAM,GAAe,CAAEA,MAAM,EAAOxF,MAAO5M,EAAE/B,KAAO,CAAK,CAAC,MAAM,IAAIsR,UAAU,wIAA2I,CAE5lB,SAASyC,GAAkBK,EAAKC,IAAkB,MAAPA,GAAeA,EAAMD,EAAIvT,UAAQwT,EAAMD,EAAIvT,QAAQ,IAAK,IAAIb,EAAI,EAAGsU,EAAO,IAAIV,MAAMS,GAAMrU,EAAIqU,EAAKrU,IAAKsU,EAAKtU,GAAKoU,EAAIpU,GAAI,OAAOsU,CAAO,CAWpK,SAASC,GAAgBC,EAAS1E,EAAQ/D,GACvD,GAAIyI,EAAS,CACX,IAAIxB,EAAQlD,EAAO0E,GACnB,IAAKxB,EACH,MAAM,IAAItQ,MAAM,yBAAyB+R,OAAOD,IAElD,IAAKxB,EAAME,aACT,OAAO,EAET,GAEAwB,GAAgCrO,QAAQkL,OAAOyB,EAAME,aAAajM,MAAQ,GAG1E8E,EAAQ4I,YAAc3B,EAAME,aAAaH,WAAahH,EAAQ4I,aAGlC,IAA5B5I,EAAQ6I,iBAA6B5B,EAAME,aAAaH,UA6B5D,SAAwBA,GActB,IADA,IAC8D8B,EAArDC,EAAYvB,IAFrBR,GAJAA,GAJAA,EAAWA,EAASgC,eAIAxO,QAAQyO,GAA0B,KAIlCzO,QAAQ0O,GAA2B,KACjCzO,MAAM,UAC2CqO,EAAQC,KAAaX,MAAO,CACjG,IAAIe,EAAQL,EAAMlG,MAClB,GAAIwG,GAAqB9O,QAAQ6O,GAAS,EACxC,OAAO,CAEV,CACD,OAAO,CACT,CAlDwEE,CAAepC,EAAME,aAAaH,UACpG,OAAO,CAEV,CACH,CAGA,IAAI2B,GAAkC,CAAC,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAYnGM,GAA2B,cAS3BC,GAA4B,MA0BhC,IAAIE,GAAuB,CAE3B,KAEA,KAEA,IAEA,KAEA,KAEA,KAEA,IAEA,KAEA,IAEA,KAEA,MAEA,OAEA,KAEA,OAOA,KCnHe,SAASE,GAAe1G,EAAOrK,EAAM0H,GAClD,IAAIsJ,EAAuBtJ,EAAKsJ,qBAC9BC,EAAqBvJ,EAAKuJ,mBAC1BC,EAAaxJ,EAAKwJ,WAClB1F,EAAS9D,EAAK8D,OACd2F,EAASzJ,EAAKyJ,OACdtG,EAAanD,EAAKmD,WAClBpD,EAAUC,EAAKD,QAajB,OAZKzH,IAGHA,EAAO,KASDA,GAKN,IAAK,MACHqK,EAAQ+G,GAAY/G,EAAO5C,GAC3B,MAKF,IAAK,YAEH,QAAcG,KADdyC,EAAQ2G,KAEN,MAAM,IAAI5S,MAAM,qDAAuD+R,OAAOc,MAEhF5G,EAAQ+G,GAAY/G,EAAO5C,GAC3B,MAOF,IAAK,IAKH,IAAI4J,EAAoBpE,OAAO5C,GAC/B,GAAIiH,MAAMD,GACR,MAAM,IAAIjT,MAAM,kCAAoC+R,OAAO9F,IAE7D,GAAIgH,GAAqBF,EAAO5U,OAC9B,MAAM,IAAI6B,MAAM,2CAA6C+R,OAAO9F,IAGtEA,EAAQ+G,GADR/G,EAAQ8G,EAAOE,GACY5J,GAC3B,MAIF,IAAK,IACH,GAAc,MAAV4C,EACFA,GAAQ,MACH,IAAc,MAAVA,EAGT,MAAM,IAAIjM,MAAM,qCAAuC+R,OAAO9F,IAF9DA,GAAQ,CAGT,CACD,MAIF,IAAK,IACHA,OAAQzC,EACR,MAMF,IAAK,IACHyC,EAoDN,SAAqBkH,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,UAAUpB,OAAOoB,GAE9B,CA5EcC,CAAYnH,GACpB,MAOF,IAAK,IACH,QAAczC,IAAVyC,EACF,MAEF,IAAIoH,EAAa,IAAI1C,KAAK1E,GAC1B,GAAIiH,MAAMG,EAAWC,WACnB,MAAM,IAAItT,MAAM,kCAAoC+R,OAAO9F,IAE7DA,EAAQoH,EACR,MAGF,IAAK,IACH,QAAc7J,IAAVyC,EACF,MASAA,EAP0B4F,GAAgBiB,IAAc1F,EAAQ/D,GAOxDkK,GAFRtH,EAAQuH,GAAmBvH,GAEFQ,IAKhBpD,EAAQoK,aAAeD,IAAoBvH,GAEtD,MACF,QACE,MAAM,IAAI2C,UAAU,4BAA4BmD,OAAOnQ,IAO3D,YAHc4H,IAAVyC,IACFA,EAAQ,MAEHA,CACT,CA6BA,SAAS+G,GAAY/G,EAAO5C,GAW1B,OANqB,IAAjBA,EAAQ9M,OACV0P,EAAQA,EAAM1P,QAEF,KAAV0P,IACFA,OAAQzC,GAEHyC,CACT,CAQA,SAASuH,GAAmBE,GAC1B,IAAIC,EAAe9E,OAAO6E,GAC1B,GAAIR,MAAMS,GACR,MAAM,IAAI3T,MAAM,iCAAmC+R,OAAO2B,IAE5D,OAAOC,CACT,CC9LA,IAAIC,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,KA0BhJ,SAASC,GAAsBC,GAI7B,IAFA,IAAIpS,EAAI,EACJpE,EAAI,EACDA,EAAIwW,EAAc3V,QACvBuD,GAAK,GACLA,GAAKkS,GAAQjQ,QAAQmQ,EAAcxW,IACnCA,IAEF,OAAOoE,CACT,CACO,SAASqS,GAAqBC,GAGnC,OADAA,EAASA,EAAOlQ,MAAM,SACf,CAEPmQ,SAASD,EAAO,IAEhBH,GAAsBG,EAAO,GAAGzX,QAClC,CChBe,SAAS2X,GAAUjJ,EAAM8B,EAAO7Q,EAAK6W,EAAQ3F,EAAQX,EAAYpD,GAC9E,IAOIzH,EAPAoS,EAASD,GAAqB9I,EAAK0B,aAAa,MAChDwH,ERNC,SAAsBhI,EAAUlB,GACrC,OAAOD,GAAUC,EAAM,IACzB,CQIqBmJ,CAAarH,EAAO9B,GAKnCgB,EAAQkI,GAAgBA,EAAapI,YAKzC,OAHId,EAAKiF,aAAa,OACpBtO,EAAOqJ,EAAK0B,aAAa,MAEpB,CACL0H,IAAKL,EAAO,GACZM,OAAQN,EAAO,GACf/H,MAAO0G,GAAe1G,EAAOrK,EAAM,CACjCgR,qBAAsB,WACpB,ORlBD,SAAkCzG,EAAUlB,GAKjD,IAAIsJ,EAAoB1I,GAAqBZ,GAC7C,GAAIsJ,GAAuD,OAAlCjJ,GAAWiJ,GAA6B,CAC/D,IAAIC,EAAqC3I,GAAqB0I,GAC9D,GAAIC,GAAyF,MAAnDlJ,GAAWkJ,GACnD,OAAOA,EAAmCzI,WAE7C,CACH,CQMe0I,CAAyB1H,EAAO9B,EACxC,EACD4H,mBAAoB,WAClB,OAAO/G,GAAYb,EACpB,EACD6H,WAAY,WACV,OAAO7H,EAAK0B,aAAa,IAC1B,EACDS,OAAQA,EACR2F,OAAQA,EACRtG,WAAYA,EACZpD,QAASA,IAGf,CC3De,SAASqL,GAAW3H,EAAO7Q,EAAK6W,EAAQ3F,EAAQX,EAAYpD,GACzE,IAAIsL,ETCC,SAAkBxI,GACvB,IACIyI,EAAY5J,GADAmB,EAASE,gBACY,aACjCsI,EAAQ,GAMZ,OALAlJ,GAAQmJ,EAAW,OAAO,SAAUP,GAClC5I,GAAQ4I,EAAK,KAAK,SAAUQ,GAC1BF,EAAMlP,KAAKoP,EACjB,GACA,IACSF,CACT,CSXcG,CAAS/H,GACrB,OAAqB,IAAjB4H,EAAMxW,OACD,GASFwW,EAAMrF,KAAI,SAAUrE,GACzB,OAAOiJ,GAAUjJ,EAAM8B,EAAO7Q,EAAK6W,EAAQ3F,EAAQX,EAAYpD,EACnE,GACA,CCjBA,SAAS0L,GAAerD,EAAKpU,GAAK,OAKlC,SAAyBoU,GAAO,GAAIR,MAAMC,QAAQO,GAAM,OAAOA,CAAM,CAL5BsD,CAAgBtD,IAIzD,SAA+BnU,EAAGa,GAAK,IAAIyD,EAAI,MAAQtE,EAAI,KAAO,oBAAsBmQ,QAAUnQ,EAAEmQ,OAAOC,WAAapQ,EAAE,cAAe,GAAI,MAAQsE,EAAG,CAAE,IAAIpC,EAAGiC,EAAGpE,EAAG2X,EAAGhW,EAAI,GAAIyB,GAAI,EAAIrB,GAAI,EAAI,IAAM,GAAI/B,GAAKuE,EAAIA,EAAE8M,KAAKpR,IAAIyT,KAAM,IAAM5S,EAAG,CAAE,GAAIoM,OAAO3I,KAAOA,EAAG,OAAQnB,GAAI,CAAK,MAAM,OAASA,GAAKjB,EAAInC,EAAEqR,KAAK9M,IAAI4P,QAAUxS,EAAEwG,KAAKhG,EAAEwM,OAAQhN,EAAEd,SAAWC,GAAIsC,GAAI,IAAO,MAAOnD,GAAK8B,GAAI,EAAIqC,EAAInE,CAAE,SAAa,IAAM,IAAKmD,GAAK,MAAQmB,EAAU,SAAMoT,EAAIpT,EAAU,SAAK2I,OAAOyK,KAAOA,GAAI,MAAS,CAAA,QAAW,GAAI5V,EAAG,MAAMqC,CAAI,CAAA,CAAG,OAAOzC,CAAE,CAAI,CAJzdiW,CAAsBxD,EAAKpU,IAE5F,SAAqC+B,EAAG+R,GAAU,IAAK/R,EAAG,OAAQ,GAAiB,iBAANA,EAAgB,OAAOgS,GAAkBhS,EAAG+R,GAAS,IAAI1P,EAAI8I,OAAOvG,UAAUT,SAASmL,KAAKtP,GAAGqE,MAAM,GAAI,GAAc,WAANhC,GAAkBrC,EAAEqG,cAAahE,EAAIrC,EAAEqG,YAAYmD,MAAM,GAAU,QAANnH,GAAqB,QAANA,EAAa,OAAOwP,MAAMI,KAAKjS,GAAI,GAAU,cAANqC,GAAqB,2CAA2C6P,KAAK7P,GAAI,OAAO2P,GAAkBhS,EAAG+R,EAAU,CAF9TI,CAA4BE,EAAKpU,IACnI,WAA8B,MAAM,IAAIsR,UAAU,4IAA+I,CADxDuG,EAAqB,CAG9J,SAAS9D,GAAkBK,EAAKC,IAAkB,MAAPA,GAAeA,EAAMD,EAAIvT,UAAQwT,EAAMD,EAAIvT,QAAQ,IAAK,IAAIb,EAAI,EAAGsU,EAAO,IAAIV,MAAMS,GAAMrU,EAAIqU,EAAKrU,IAAKsU,EAAKtU,GAAKoU,EAAIpU,GAAI,OAAOsU,CAAO,CAQpK,SAASwD,GAAgBrI,GACtC,IAAIsI,EV8BC,SAAuBlJ,GAC5B,IACIkJ,EAAarK,GADDmB,EAASE,gBACa,aACtC,GAAIgJ,EACF,OAAOA,EAAW1I,aAAa,MAEnC,CUpCmB2I,CAAcvI,GAC/B,GAAIsI,EAoBF,OAH0B,KAhB1BA,EAAaA,EAAWvR,MAAM,KAAKwL,IAAIyE,IAAsBzE,KAAI,SAAUhG,GACzE,IAAIiM,EAAQR,GAAezL,EAAM,GAGjC,MAAO,CACL+K,IAHMkB,EAAM,GAIZjB,OAHSiB,EAAM,GAKvB,KAQmBpX,SACbkX,EAAa,CAACA,EAAW,GAAIA,EAAW,KAEnCA,CAEX,CCnCA,SAASxE,GAAgCxR,EAAGyR,GAAkB,IAAIC,EAAuB,oBAAXrD,QAA0BrO,EAAEqO,OAAOC,WAAatO,EAAE,cAAe,GAAI0R,EAAI,OAAQA,EAAKA,EAAGpC,KAAKtP,IAAI2R,KAAKC,KAAKF,GAAK,GAAIG,MAAMC,QAAQ9R,KAAO0R,EACxN,SAAqC1R,EAAG+R,GAAU,IAAK/R,EAAG,OAAQ,GAAiB,iBAANA,EAAgB,OAAOgS,GAAkBhS,EAAG+R,GAAS,IAAI1P,EAAI8I,OAAOvG,UAAUT,SAASmL,KAAKtP,GAAGqE,MAAM,GAAI,GAAc,WAANhC,GAAkBrC,EAAEqG,cAAahE,EAAIrC,EAAEqG,YAAYmD,MAAM,GAAU,QAANnH,GAAqB,QAANA,EAAa,OAAOwP,MAAMI,KAAKjS,GAAI,GAAU,cAANqC,GAAqB,2CAA2C6P,KAAK7P,GAAI,OAAO2P,GAAkBhS,EAAG+R,EAAU,CADnMI,CAA4BnS,KAAOyR,GAAkBzR,GAAyB,iBAAbA,EAAElB,OAAqB,CAAM4S,IAAI1R,EAAI0R,GAAI,IAAIzT,EAAI,EAAG,OAAO,WAAc,OAAIA,GAAK+B,EAAElB,OAAe,CAAEsT,MAAM,GAAe,CAAEA,MAAM,EAAOxF,MAAO5M,EAAE/B,KAAO,CAAK,CAAC,MAAM,IAAIsR,UAAU,wIAA2I,CAE5lB,SAASyC,GAAkBK,EAAKC,IAAkB,MAAPA,GAAeA,EAAMD,EAAIvT,UAAQwT,EAAMD,EAAIvT,QAAQ,IAAK,IAAIb,EAAI,EAAGsU,EAAO,IAAIV,MAAMS,GAAMrU,EAAIqU,EAAKrU,IAAKsU,EAAKtU,GAAKoU,EAAIpU,GAAI,OAAOsU,CAAO,CCFnL,SAASf,GAAgCxR,EAAGyR,GAAkB,IAAIC,EAAuB,oBAAXrD,QAA0BrO,EAAEqO,OAAOC,WAAatO,EAAE,cAAe,GAAI0R,EAAI,OAAQA,EAAKA,EAAGpC,KAAKtP,IAAI2R,KAAKC,KAAKF,GAAK,GAAIG,MAAMC,QAAQ9R,KAAO0R,EACxN,SAAqC1R,EAAG+R,GAAU,IAAK/R,EAAG,OAAQ,GAAiB,iBAANA,EAAgB,OAAOgS,GAAkBhS,EAAG+R,GAAS,IAAI1P,EAAI8I,OAAOvG,UAAUT,SAASmL,KAAKtP,GAAGqE,MAAM,GAAI,GAAc,WAANhC,GAAkBrC,EAAEqG,cAAahE,EAAIrC,EAAEqG,YAAYmD,MAAM,GAAU,QAANnH,GAAqB,QAANA,EAAa,OAAOwP,MAAMI,KAAKjS,GAAI,GAAU,cAANqC,GAAqB,2CAA2C6P,KAAK7P,GAAI,OAAO2P,GAAkBhS,EAAG+R,EAAU,CADnMI,CAA4BnS,KAAOyR,GAAkBzR,GAAyB,iBAAbA,EAAElB,OAAqB,CAAM4S,IAAI1R,EAAI0R,GAAI,IAAIzT,EAAI,EAAG,OAAO,WAAc,OAAIA,GAAK+B,EAAElB,OAAe,CAAEsT,MAAM,GAAe,CAAEA,MAAM,EAAOxF,MAAO5M,EAAE/B,KAAO,CAAK,CAAC,MAAM,IAAIsR,UAAU,wIAA2I,CAE5lB,SAASyC,GAAkBK,EAAKC,IAAkB,MAAPA,GAAeA,EAAMD,EAAIvT,UAAQwT,EAAMD,EAAIvT,QAAQ,IAAK,IAAIb,EAAI,EAAGsU,EAAO,IAAIV,MAAMS,GAAMrU,EAAIqU,EAAKrU,IAAKsU,EAAKtU,GAAKoU,EAAIpU,GAAI,OAAOsU,CAAO,CCDnL,SAASmD,GAAerD,EAAKpU,GAAK,OAKlC,SAAyBoU,GAAO,GAAIR,MAAMC,QAAQO,GAAM,OAAOA,CAAM,CAL5BsD,CAAgBtD,IAIzD,SAA+BnU,EAAGa,GAAK,IAAIyD,EAAI,MAAQtE,EAAI,KAAO,oBAAsBmQ,QAAUnQ,EAAEmQ,OAAOC,WAAapQ,EAAE,cAAe,GAAI,MAAQsE,EAAG,CAAE,IAAIpC,EAAGiC,EAAGpE,EAAG2X,EAAGhW,EAAI,GAAIyB,GAAI,EAAIrB,GAAI,EAAI,IAAM,GAAI/B,GAAKuE,EAAIA,EAAE8M,KAAKpR,IAAIyT,KAAM,IAAM5S,EAAG,CAAE,GAAIoM,OAAO3I,KAAOA,EAAG,OAAQnB,GAAI,CAAK,MAAM,OAASA,GAAKjB,EAAInC,EAAEqR,KAAK9M,IAAI4P,QAAUxS,EAAEwG,KAAKhG,EAAEwM,OAAQhN,EAAEd,SAAWC,GAAIsC,GAAI,IAAO,MAAOnD,GAAK8B,GAAI,EAAIqC,EAAInE,CAAE,SAAa,IAAM,IAAKmD,GAAK,MAAQmB,EAAU,SAAMoT,EAAIpT,EAAU,SAAK2I,OAAOyK,KAAOA,GAAI,MAAS,CAAA,QAAW,GAAI5V,EAAG,MAAMqC,CAAI,CAAA,CAAG,OAAOzC,CAAE,CAAI,CAJzdiW,CAAsBxD,EAAKpU,IAAMkU,GAA4BE,EAAKpU,IACnI,WAA8B,MAAM,IAAIsR,UAAU,4IAA+I,CADxDuG,EAAqB,CAE9J,SAAS3D,GAA4BnS,EAAG+R,GAAU,GAAK/R,EAAL,CAAgB,GAAiB,iBAANA,EAAgB,OAAOgS,GAAkBhS,EAAG+R,GAAS,IAAI1P,EAAI8I,OAAOvG,UAAUT,SAASmL,KAAKtP,GAAGqE,MAAM,GAAI,GAAiE,MAAnD,WAANhC,GAAkBrC,EAAEqG,cAAahE,EAAIrC,EAAEqG,YAAYmD,MAAgB,QAANnH,GAAqB,QAANA,EAAoBwP,MAAMI,KAAKjS,GAAc,cAANqC,GAAqB,2CAA2C6P,KAAK7P,GAAW2P,GAAkBhS,EAAG+R,QAAzG,EAAmH,CACha,SAASC,GAAkBK,EAAKC,IAAkB,MAAPA,GAAeA,EAAMD,EAAIvT,UAAQwT,EAAMD,EAAIvT,QAAQ,IAAK,IAAIb,EAAI,EAAGsU,EAAO,IAAIV,MAAMS,GAAMrU,EAAIqU,EAAKrU,IAAKsU,EAAKtU,GAAKoU,EAAIpU,GAAI,OAAOsU,CAAO,CAKpK,SAAS4D,GAAQzI,EAAO1D,GACrC,IAAIgM,EAAatI,EAAMsI,WACrBV,EAAQ5H,EAAM4H,MAGhB,GAAqB,IAAjBA,EAAMxW,OACR,MAAO,GAEN,IAACsX,EAAcV,GAAeM,EAAY,GACjCI,EAAY,GAexB,IAdF,IAAIC,EAAcD,EAAY,GAQxBE,EAAYD,EAAYpB,OACxBsB,EAAYF,EAAYrB,IAGxBnP,EAAO,IAAIgM,MAAM0E,GACjBtY,EAAI,EACDA,EAAIsY,GAAW,CACpB1Q,EAAK5H,GAAK,IAAI4T,MAAMyE,GAEpB,IADA,IAAInY,EAAI,EACDA,EAAImY,GACTzQ,EAAK5H,GAAGE,GAAK,KACbA,IAEFF,GACD,CAMD,IAAK,IAAwD6U,EAApDC,EA/CX,SAAyC/S,EAAGyR,GAAkB,IAAIC,EAAuB,oBAAXrD,QAA0BrO,EAAEqO,OAAOC,WAAatO,EAAE,cAAe,GAAI0R,EAAI,OAAQA,EAAKA,EAAGpC,KAAKtP,IAAI2R,KAAKC,KAAKF,GAAK,GAAIG,MAAMC,QAAQ9R,KAAO0R,EAAKS,GAA4BnS,KAAOyR,GAAkBzR,GAAyB,iBAAbA,EAAElB,OAAqB,CAAM4S,IAAI1R,EAAI0R,GAAI,IAAIzT,EAAI,EAAG,OAAO,WAAc,OAAIA,GAAK+B,EAAElB,OAAe,CAAEsT,MAAM,GAAe,CAAEA,MAAM,EAAOxF,MAAO5M,EAAE/B,KAAO,CAAK,CAAC,MAAM,IAAIsR,UAAU,wIAA2I,CA+CrkBiC,CAAgC8D,KAAiBxC,EAAQC,KAAaX,MAAO,CAChG,IAAIoD,EAAO1C,EAAMlG,MAMb4J,EAAWhB,EAAKR,IAAM,EACtByB,EAAcjB,EAAKP,OAAS,EAE5BwB,EAAcH,GAAaE,EAAWD,IACxC1Q,EAAK2Q,GAAUC,GAAejB,EAAK5I,MAEtC,CAGD,IAAI8J,EAAoB1M,EAAQ0M,kBAChC,GAAIA,EAEF,IADA,IAAIzL,EAAK,EACFA,EAAKpF,EAAK/G,QACf4X,EAAkBzL,GAAMA,EACxBA,IA8BJ,OAjBApF,EF9Ea,SAAuBA,GAUpC,IATA,IAAIoE,EAAOC,UAAUpL,OAAS,QAAsBqL,IAAjBD,UAAU,GAAmBA,UAAU,GAAK,CAAE,EAC/EwM,EAAoBzM,EAAKyM,kBACzBC,EAAgB1M,EAAK2M,SACrBA,OAA6B,IAAlBD,EAA2B,SAAUE,GAC9C,OAAOA,CACb,EAAQF,EACJG,EAAmB7M,EAAK6M,iBAEtB7Y,EAAI4H,EAAK/G,OAAS,EACfb,GAAK,GAAG,CAGb,IADA,IAC+D6U,EAD3DiE,GAAQ,EACHhE,EAAYvB,GAAgC3L,EAAK5H,MAAc6U,EAAQC,KAAaX,MAE3F,GAAuB,OAAnBwE,EADO9D,EAAMlG,OACY,CAC3BmK,GAAQ,EACR,KACD,CAGH,GAAIA,EACFlR,EAAKmR,OAAO/Y,EAAG,GACXyY,GACFA,EAAkBM,OAAO/Y,EAAG,QAEzB,GAAI6Y,EACT,MAEF7Y,GACD,CACD,OAAO4H,CACT,CE8CSoR,CD9EM,SAA0BpR,GAQvC,IAPA,IAAIoE,EAAOC,UAAUpL,OAAS,QAAsBqL,IAAjBD,UAAU,GAAmBA,UAAU,GAAK,CAAE,EAC/EyM,EAAgB1M,EAAK2M,SACrBA,OAA6B,IAAlBD,EAA2B,SAAUE,GAC9C,OAAOA,CACb,EAAQF,EACJG,EAAmB7M,EAAK6M,iBACtB7Y,EAAI4H,EAAK,GAAG/G,OAAS,EAClBb,GAAK,GAAG,CAEb,IADA,IAC4D6U,EADxDiE,GAAQ,EACHhE,EAAYvB,GAAgC3L,KAAgBiN,EAAQC,KAAaX,MAExF,GAAyB,OAArBwE,EADM9D,EAAMlG,MACC3O,IAAc,CAC7B8Y,GAAQ,EACR,KACD,CAEH,GAAIA,EAEF,IADA,IAAI5Y,EAAI,EACDA,EAAI0H,EAAK/G,QACd+G,EAAK1H,GAAG6Y,OAAO/Y,EAAG,GAClBE,SAEG,GAAI2Y,EACT,MAEF7Y,GACD,CACD,OAAO4H,CACT,CCiDuBqR,CAAiBrR,EAAM,CAC1CiR,kBAAkB,IAChB,CACFA,kBAAkB,EAClBJ,kBAAmBA,IAIjB1M,EAAQmN,gBACVtR,EAAOmE,EAAQmN,cAActR,IAQxBA,CACT,CCnGA,SAASuI,GAAQpO,GAAgC,OAAOoO,GAAU,mBAAqBC,QAAU,iBAAmBA,OAAOC,SAAW,SAAUtO,GAAK,cAAcA,GAAO,SAAUA,GAAK,OAAOA,GAAK,mBAAqBqO,QAAUrO,EAAEqG,cAAgBgI,QAAUrO,IAAMqO,OAAOzJ,UAAY,gBAAkB5E,CAAE,EAAIoO,GAAQpO,EAAK,CAC9T,SAASwR,GAAgCxR,EAAGyR,GAAkB,IAAIC,EAAuB,oBAAXrD,QAA0BrO,EAAEqO,OAAOC,WAAatO,EAAE,cAAe,GAAI0R,EAAI,OAAQA,EAAKA,EAAGpC,KAAKtP,IAAI2R,KAAKC,KAAKF,GAAK,GAAIG,MAAMC,QAAQ9R,KAAO0R,EACxN,SAAqC1R,EAAG+R,GAAU,IAAK/R,EAAG,OAAQ,GAAiB,iBAANA,EAAgB,OAAOgS,GAAkBhS,EAAG+R,GAAS,IAAI1P,EAAI8I,OAAOvG,UAAUT,SAASmL,KAAKtP,GAAGqE,MAAM,GAAI,GAAc,WAANhC,GAAkBrC,EAAEqG,cAAahE,EAAIrC,EAAEqG,YAAYmD,MAAM,GAAU,QAANnH,GAAqB,QAANA,EAAa,OAAOwP,MAAMI,KAAKjS,GAAI,GAAU,cAANqC,GAAqB,2CAA2C6P,KAAK7P,GAAI,OAAO2P,GAAkBhS,EAAG+R,EAAU,CADnMI,CAA4BnS,KAAOyR,GAAkBzR,GAAyB,iBAAbA,EAAElB,OAAqB,CAAM4S,IAAI1R,EAAI0R,GAAI,IAAIzT,EAAI,EAAG,OAAO,WAAc,OAAIA,GAAK+B,EAAElB,OAAe,CAAEsT,MAAM,GAAe,CAAEA,MAAM,EAAOxF,MAAO5M,EAAE/B,KAAO,CAAK,CAAC,MAAM,IAAIsR,UAAU,wIAA2I,CAE5lB,SAASyC,GAAkBK,EAAKC,IAAkB,MAAPA,GAAeA,EAAMD,EAAIvT,UAAQwT,EAAMD,EAAIvT,QAAQ,IAAK,IAAIb,EAAI,EAAGsU,EAAO,IAAIV,MAAMS,GAAMrU,EAAIqU,EAAKrU,IAAKsU,EAAKtU,GAAKoU,EAAIpU,GAAI,OAAOsU,CAAO,CACnL,SAAShE,GAAQnO,EAAGlC,GAAK,IAAIsE,EAAI2I,OAAOC,KAAKhL,GAAI,GAAI+K,OAAOqD,sBAAuB,CAAE,IAAIxO,EAAImL,OAAOqD,sBAAsBpO,GAAIlC,IAAM8B,EAAIA,EAAEmJ,QAAO,SAAUjL,GAAK,OAAOiN,OAAOsD,yBAAyBrO,EAAGlC,GAAGwQ,UAAW,KAAMlM,EAAE4D,KAAKyB,MAAMrF,EAAGxC,EAAG,CAAG,OAAOwC,CAAI,CAC/P,SAASmM,GAAcvO,GAAK,IAAK,IAAIlC,EAAI,EAAGA,EAAIgM,UAAUpL,OAAQZ,IAAK,CAAE,IAAIsE,EAAI,MAAQ0H,UAAUhM,GAAKgM,UAAUhM,GAAK,CAAE,EAAEA,EAAI,EAAIqQ,GAAQpD,OAAO3I,IAAI,GAAI4J,SAAQ,SAAUlO,GAAK0Q,GAAgBxO,EAAGlC,EAAGsE,EAAEtE,GAAM,IAAIiN,OAAO0D,0BAA4B1D,OAAO2D,iBAAiB1O,EAAG+K,OAAO0D,0BAA0BrM,IAAM+L,GAAQpD,OAAO3I,IAAI4J,SAAQ,SAAUlO,GAAKiN,OAAO4D,eAAe3O,EAAGlC,EAAGiN,OAAOsD,yBAAyBjM,EAAGtE,GAAI,GAAM,CAAC,OAAOkC,CAAI,CACvb,SAASwO,GAAgBI,EAAK3D,EAAKuB,GAA4L,OAAnLvB,EAC5C,SAAwB4D,GAAO,IAAI5D,EACnC,SAAsBtB,EAAOmF,GAAQ,GAAuB,WAAnBd,GAAQrE,IAAiC,OAAVA,EAAgB,OAAOA,EAAO,IAAIoF,EAAOpF,EAAMsE,OAAOe,aAAc,QAAajF,IAATgF,EAAoB,CAAE,IAAIE,EAAMF,EAAKG,KAAKvF,EAAOmF,GAAQ,WAAY,GAAqB,WAAjBd,GAAQiB,GAAmB,OAAOA,EAAK,MAAM,IAAIE,UAAU,+CAAkD,CAAC,OAAiB,WAATL,EAAoBzH,OAAS+H,QAAQzF,EAAS,CADpV0F,CAAaR,EAAK,UAAW,MAAwB,WAAjBb,GAAQ/C,GAAoBA,EAAM5D,OAAO4D,EAAO,CAD3EqE,CAAerE,MAAiB2D,EAAO7D,OAAO4D,eAAeC,EAAK3D,EAAK,CAAEuB,MAAOA,EAAO8B,YAAY,EAAMiB,cAAc,EAAMC,UAAU,IAAkBZ,EAAI3D,GAAOuB,EAAgBoC,CAAM,CAqB7N,SAASoI,GAAsBC,EAAUxa,GACtD,IAAImN,EAAUE,UAAUpL,OAAS,QAAsBqL,IAAjBD,UAAU,GAAmBA,UAAU,GAAK,CAAA,EAC7EF,EAAQ0D,QACX1D,EAAU2E,GAAc,CACtBjB,MAAO,GACN1D,IAEL,IAAIsN,EAAoB,SAA2BpJ,GACjD,IAAKmJ,EAASnJ,GACZ,MAAM,IAAIvN,MAAM,IAAK+R,OAAOxE,EAAU,wDAExC,OAAOmJ,EAASnJ,EACpB,EAKML,EAAYD,GAAe0J,EAAkB,8BAA+Bza,GAG5E6W,EAAS7F,EAAUC,cC9CV,SAA4B/Q,EAASF,GAClD,OAAKE,EAGE8P,GAAiBhQ,EAAIC,eAAeC,IAFlC,EAGX,CDyCyCwa,CAAmBD,EAAkBzJ,EAAUC,eAAgBjR,GAAO,GAGzGkR,EAASF,EAAUE,OAAS8B,GAAYyH,EAAkBzJ,EAAUE,QAASlR,GAAO,GACpFuQ,EAAaF,GAAgBoK,EAAkB,mBAAoBza,GAIvE,GAAImN,EAAQyD,UACV,OAAOL,EAAWI,OAAOyC,KAAI,SAAUhG,GAErC,MAAO,CACLT,KAFSS,EAAKT,KAItB,IAIE,IAAIgO,EA8BN,SAAoB9J,EAAOF,GACzB,GAAqB,iBAAVE,EAAoB,CAC7B,IAAI+J,EAASjK,EAAOE,EAAQ,GAC5B,OAAO+J,GAAUA,EAAO9J,UACzB,CACD,IAAK,IAAyDmF,EAArDC,EAAYvB,GAAgChE,KAAkBsF,EAAQC,KAAaX,MAAO,CACjG,IAAIsF,EAAU5E,EAAMlG,MACpB,GAAI8K,EAAQlO,OAASkE,EACnB,OAAOgK,EAAQ/J,UAElB,CACH,CAzCgBgK,CAAW3N,EAAQ0D,MAAON,EAAWI,QAInD,IAAKgK,IAAY3J,EAAUL,OAAOgK,GAChC,MAqCJ,SAAkC9J,EAAOF,GACvC,IAAIoK,EAAapK,GAAUA,EAAOyC,KAAI,SAAUvC,EAAOzP,GACrD,MAAO,IAAKyU,OAAOhF,EAAMlE,KAAM,QAASkJ,OAAOzU,EAAI,EAAG,IAC1D,IAAK4Z,KAAK,MACR,OAAO,IAAIlX,MAAM,SAAS+R,OAAwB,iBAAVhF,EAAqB,IAAMA,EAAQ,IAAMA,EAAQ,IAAK,kCAAkCgF,OAAOlF,EAAS,sBAAwBoK,EAAa,IAAM,IAC7L,CA1CUE,CAAyB9N,EAAQ0D,MAAON,EAAWI,QAI3D,IAAIE,EEvES,SAAoB3Q,EAASF,EAAK6W,EAAQ3F,EAAQX,EAAYpD,GAC3E,IAAI0D,EAAQ7Q,EAAIC,eAAeC,GAC3BuY,EAAQD,GAAW3H,EAAO7Q,EAAK6W,EAAQ3F,EAAQX,EAAYpD,GAI3DgM,EAAaD,GAAgBrI,ITP5B,SAA6B4H,GAClC,IAAIyC,EAAa,SAAoBnY,EAAG5B,GACtC,OAAO4B,EAAI5B,CACf,EACMga,EAAU1C,EAAMrF,KAAI,SAAUuF,GAChC,OAAOA,EAAKR,GAChB,IAAKiD,KAAKF,GACJG,EAAU5C,EAAMrF,KAAI,SAAUuF,GAChC,OAAOA,EAAKP,MAChB,IAAKgD,KAAKF,GACJI,EAASH,EAAQ,GACjBI,EAASJ,EAAQA,EAAQlZ,OAAS,GAGtC,MAAO,CAAC,CACNkW,IAAKmD,EACLlD,OAJWiD,EAAQ,IAKlB,CACDlD,IAAKoD,EACLnD,OANWiD,EAAQA,EAAQpZ,OAAS,IAQxC,CSd6CuZ,CAAoB/C,GAC/D,MAAO,CACLA,MAAOA,EACPU,WAAYA,EAEhB,CF4DcsC,CAAWhB,EAAkBzJ,EAAUL,OAAOgK,IAAW3a,EAAK6W,EAAQ3F,EAAQX,EAAYpD,GAQlGnE,EAAOsQ,GAAQzI,EAPnB1D,EAAU2E,GAAc,CAGtB+H,kBAAmB,IAClB1M,IAMH,OAAIA,EAAQoD,WACH,CACLvH,KAAMA,EACNuH,WAAYA,GAKTvH,CACT,CG9FA,SAASuI,GAAQpO,GAAgC,OAAOoO,GAAU,mBAAqBC,QAAU,iBAAmBA,OAAOC,SAAW,SAAUtO,GAAK,cAAcA,GAAO,SAAUA,GAAK,OAAOA,GAAK,mBAAqBqO,QAAUrO,EAAEqG,cAAgBgI,QAAUrO,IAAMqO,OAAOzJ,UAAY,gBAAkB5E,CAAE,EAAIoO,GAAQpO,EAAK,CAC9T,SAASuY,GAAkBC,EAAQC,GAAS,IAAK,IAAIxa,EAAI,EAAGA,EAAIwa,EAAM3Z,OAAQb,IAAK,CAAE,IAAIya,EAAaD,EAAMxa,GAAIya,EAAWhK,WAAagK,EAAWhK,aAAc,EAAOgK,EAAW/I,cAAe,EAAU,UAAW+I,IAAYA,EAAW9I,UAAW,GAAMzE,OAAO4D,eAAeyJ,GAE7PvJ,EAFoRyJ,EAAWrN,IAEpRA,WACnC,SAAsBtB,EAAOmF,GAAQ,GAAuB,WAAnBd,GAAQrE,IAAiC,OAAVA,EAAgB,OAAOA,EAAO,IAAIoF,EAAOpF,EAAMsE,OAAOe,aAAc,QAAajF,IAATgF,EAAoB,CAAE,IAAIE,EAAMF,EAAKG,KAAKvF,EAAOmF,GAAQ,WAAY,GAAqB,WAAjBd,GAAQiB,GAAmB,OAAOA,EAAK,MAAM,IAAIE,UAAU,+CAAkD,CAAC,OAAiB,WAATL,EAAoBzH,OAAS+H,QAAQzF,EAAS,CADpV0F,CAAaR,EAAK,UAAmC,WAAjBb,GAAQ/C,GAAoBA,EAAM5D,OAAO4D,IAFuMqN,GAE7T,IAAwBzJ,EAAW5D,CAF0S,CAM7U,SAASsN,GAAaC,GAAW,IAAIC,EAA4BC,KAA6B,OAAO,WAAkC,IAAsCC,EAAlCC,EAAQC,GAAgBL,GAAkB,GAAIC,EAA2B,CAAE,IAAIK,EAAYD,GAAgBE,MAAM9S,YAAa0S,EAASK,QAAQC,UAAUL,EAAO9O,UAAWgP,QAAqBH,EAASC,EAAMnR,MAAMsR,KAAMjP,WAAc,OACpX,SAAoCoP,EAAMhK,GAAQ,GAAIA,IAA2B,WAAlBlB,GAAQkB,IAAsC,mBAATA,GAAwB,OAAOA,EAAa,QAAa,IAATA,EAAmB,MAAM,IAAIC,UAAU,4DAA+D,OAC1P,SAAgC+J,GAAQ,QAAa,IAATA,EAAmB,MAAM,IAAIC,eAAe,6DAAgE,OAAOD,CAAO,CAD2FE,CAAuBF,EAAQ,CAD2FG,CAA2BN,KAAMJ,EAAQ,CAAK,CAGza,SAASW,GAAiBC,GAAS,IAAIC,EAAwB,mBAARC,IAAqB,IAAIA,SAAQ1P,EAA8nB,OAAnnBuP,GAAmB,SAA0BC,GAAS,GAAc,OAAVA,IAGlI3V,EAHuK2V,GAGjG,IAAzDG,SAAS3V,SAASmL,KAAKtL,GAAIM,QAAQ,kBAH+H,OAAOqV,EAGjN,IAA2B3V,EAH6L,GAAqB,mBAAV2V,EAAwB,MAAM,IAAIpK,UAAU,sDAAyD,QAAsB,IAAXqK,EAAwB,CAAE,GAAIA,EAAOG,IAAIJ,GAAQ,OAAOC,EAAOI,IAAIL,GAAQC,EAAO/X,IAAI8X,EAAOM,EAAW,CAAC,SAASA,IAAY,OAAOC,GAAWP,EAAOzP,UAAW+O,GAAgBE,MAAM9S,aAAgK,OAAhJ4T,EAAQrV,UAAYuG,OAAOgP,OAAOR,EAAM/U,UAAW,CAAEyB,YAAa,CAAEuG,MAAOqN,EAASvL,YAAY,EAAOkB,UAAU,EAAMD,cAAc,KAAkByK,GAAgBH,EAASN,EAAS,EAASD,GAAiBC,EAAS,CACvvB,SAASO,GAAWG,EAAQC,EAAMX,GAA4V,OAAhTO,GAA/BpB,KAA4CM,QAAQC,UAAUzH,OAA8B,SAAoByI,EAAQC,EAAMX,GAAS,IAAI/Z,EAAI,CAAC,MAAOA,EAAEwG,KAAKyB,MAAMjI,EAAG0a,GAAO,IAAsDC,EAAW,IAA/CT,SAASlI,KAAK/J,MAAMwS,EAAQza,IAA6F,OAAnD+Z,GAAOS,GAAgBG,EAAUZ,EAAM/U,WAAmB2V,CAAS,EAAaL,GAAWrS,MAAM,KAAMqC,UAAa,CACza,SAAS4O,KAA8B,GAAuB,oBAAZM,UAA4BA,QAAQC,UAAW,OAAO,EAAO,GAAID,QAAQC,UAAUmB,KAAM,OAAO,EAAO,GAAqB,mBAAVC,MAAsB,OAAO,EAAM,IAAsF,OAAhFC,QAAQ9V,UAAUqP,QAAQ3E,KAAK8J,QAAQC,UAAUqB,QAAS,IAAI,WAAc,MAAW,CAAO,CAAC,MAAOta,GAAK,OAAO,EAAU,CAEzU,SAASga,GAAgBpa,EAAGD,GAA6I,OAAxIqa,GAAkBjP,OAAOwP,eAAiBxP,OAAOwP,eAAe/I,OAAS,SAAyB5R,EAAGD,GAAsB,OAAjBC,EAAE4a,UAAY7a,EAAUC,CAAI,EAASoa,GAAgBpa,EAAGD,EAAK,CACxM,SAASkZ,GAAgBjZ,GAA+J,OAA1JiZ,GAAkB9N,OAAOwP,eAAiBxP,OAAO0P,eAAejJ,OAAS,SAAyB5R,GAAK,OAAOA,EAAE4a,WAAazP,OAAO0P,eAAe7a,EAAG,EAAWiZ,GAAgBjZ,EAAK,CACpN,IAAI8a,GAA4B,SAAUC,IAV1C,SAAmBC,EAAUC,GAAc,GAA0B,mBAAfA,GAA4C,OAAfA,EAAuB,MAAM,IAAI1L,UAAU,sDAAyDyL,EAASpW,UAAYuG,OAAOgP,OAAOc,GAAcA,EAAWrW,UAAW,CAAEyB,YAAa,CAAEuG,MAAOoO,EAAUpL,UAAU,EAAMD,cAAc,KAAWxE,OAAO4D,eAAeiM,EAAU,YAAa,CAAEpL,UAAU,IAAcqL,GAAYb,GAAgBY,EAAUC,EAAc,CAWlcC,CAAUJ,EAAcC,GACxB,IAhBoBI,EAAaC,EAAYC,EAgBzCC,EAAS3C,GAAamC,GAC1B,SAASA,EAAaS,GACpB,IAAIC,EAIJ,OAnBJ,SAAyBjB,EAAUY,GAAe,KAAMZ,aAAoBY,GAAgB,MAAM,IAAI5L,UAAU,oCAAyC,CAgBrJkM,CAAgBtC,KAAM2B,IACtBU,EAAQF,EAAOhM,KAAK6J,KAAM,YACpBoC,OAASA,EACRC,CACR,CACD,OAxBoBL,EAwBAL,EAxB4CM,GAAY7C,GAAkB4C,EAAYvW,UAAWwW,GAAiBC,GAAa9C,GAAkB4C,EAAaE,GAAclQ,OAAO4D,eAAeoM,EAAa,YAAa,CAAEvL,UAAU,IAAiBuL,CAyB/Q,CAXgC,CAWhBzB,GAAiB/Y,QC1BlB,SAAS+a,GAAW9O,GASjC,GAAqB,iBAAVA,EAAoB,CAC7B,IAAI+O,EAAmB/O,EAEvB,GADAA,EAAQ4C,OAAO5C,GACXnF,OAAOmF,KAAW+O,EACpB,MAAM,IAAIb,GAAa,eAE1B,CACD,GAAqB,iBAAVlO,EACT,MAAM,IAAIkO,GAAa,gBAEzB,GAAIjH,MAAMjH,GACR,MAAM,IAAIkO,GAAa,kBAWzB,IAAKc,SAAShP,GACZ,MAAM,IAAIkO,GAAa,iBAEzB,OAAOlO,CACT,CCnCe,SAASiP,GAAWjP,GACjC,GAAqB,iBAAVA,EACT,OAAOA,EAYT,GAAqB,iBAAVA,EAAoB,CAC7B,GAAIiH,MAAMjH,GACR,MAAM,IAAIkO,GAAa,kBASzB,IAAKc,SAAShP,GACZ,MAAM,IAAIkO,GAAa,iBAEzB,OAAOrT,OAAOmF,EACf,CACD,MAAM,IAAIkO,GAAa,eACzB,CC/Be,SAASgB,GAAYlP,GAClC,GAAqB,kBAAVA,EACT,OAAOA,EAET,MAAM,IAAIkO,GAAa,gBACzB,CCNA,IAAIiB,GAAY,CAAC,mBAAoB,kBAAmB,qBACxD,SAAS3N,GAAQpO,GAAgC,OAAOoO,GAAU,mBAAqBC,QAAU,iBAAmBA,OAAOC,SAAW,SAAUtO,GAAK,cAAcA,GAAO,SAAUA,GAAK,OAAOA,GAAK,mBAAqBqO,QAAUrO,EAAEqG,cAAgBgI,QAAUrO,IAAMqO,OAAOzJ,UAAY,gBAAkB5E,CAAE,EAAIoO,GAAQpO,EAAK,CAC9T,SAAS0V,GAAerD,EAAKpU,GAAK,OAGlC,SAAyBoU,GAAO,GAAIR,MAAMC,QAAQO,GAAM,OAAOA,CAAM,CAH5BsD,CAAgBtD,IAEzD,SAA+BnU,EAAGa,GAAK,IAAIyD,EAAI,MAAQtE,EAAI,KAAO,oBAAsBmQ,QAAUnQ,EAAEmQ,OAAOC,WAAapQ,EAAE,cAAe,GAAI,MAAQsE,EAAG,CAAE,IAAIpC,EAAGiC,EAAGpE,EAAG2X,EAAGhW,EAAI,GAAIyB,GAAI,EAAIrB,GAAI,EAAI,IAAM,GAAI/B,GAAKuE,EAAIA,EAAE8M,KAAKpR,IAAIyT,KAAM,IAAM5S,EAAG,CAAE,GAAIoM,OAAO3I,KAAOA,EAAG,OAAQnB,GAAI,CAAK,MAAM,OAASA,GAAKjB,EAAInC,EAAEqR,KAAK9M,IAAI4P,QAAUxS,EAAEwG,KAAKhG,EAAEwM,OAAQhN,EAAEd,SAAWC,GAAIsC,GAAI,IAAO,MAAOnD,GAAK8B,GAAI,EAAIqC,EAAInE,CAAE,SAAa,IAAM,IAAKmD,GAAK,MAAQmB,EAAU,SAAMoT,EAAIpT,EAAU,SAAK2I,OAAOyK,KAAOA,GAAI,MAAS,CAAA,QAAW,GAAI5V,EAAG,MAAMqC,CAAI,CAAA,CAAG,OAAOzC,CAAE,CAAI,CAFzdiW,CAAsBxD,EAAKpU,IAAMkU,GAA4BE,EAAKpU,IACnI,WAA8B,MAAM,IAAIsR,UAAU,4IAA+I,CADxDuG,EAAqB,CAK9J,SAAS3D,GAA4BnS,EAAG+R,GAAU,GAAK/R,EAAL,CAAgB,GAAiB,iBAANA,EAAgB,OAAOgS,GAAkBhS,EAAG+R,GAAS,IAAI1P,EAAI8I,OAAOvG,UAAUT,SAASmL,KAAKtP,GAAGqE,MAAM,GAAI,GAAiE,MAAnD,WAANhC,GAAkBrC,EAAEqG,cAAahE,EAAIrC,EAAEqG,YAAYmD,MAAgB,QAANnH,GAAqB,QAANA,EAAoBwP,MAAMI,KAAKjS,GAAc,cAANqC,GAAqB,2CAA2C6P,KAAK7P,GAAW2P,GAAkBhS,EAAG+R,QAAzG,EAAmH,CACha,SAASC,GAAkBK,EAAKC,IAAkB,MAAPA,GAAeA,EAAMD,EAAIvT,UAAQwT,EAAMD,EAAIvT,QAAQ,IAAK,IAAIb,EAAI,EAAGsU,EAAO,IAAIV,MAAMS,GAAMrU,EAAIqU,EAAKrU,IAAKsU,EAAKtU,GAAKoU,EAAIpU,GAAI,OAAOsU,CAAO,CACnL,SAASyJ,GAAyBC,EAAQC,GAAY,GAAc,MAAVD,EAAgB,MAAO,GAAI,IAAkE5Q,EAAKpN,EAAnEua,EACzF,SAAuCyD,EAAQC,GAAY,GAAc,MAAVD,EAAgB,MAAO,CAAE,EAAE,IAA2D5Q,EAAKpN,EAA5Dua,EAAS,CAAE,EAAM2D,EAAahR,OAAOC,KAAK6Q,GAAqB,IAAKhe,EAAI,EAAGA,EAAIke,EAAWrd,OAAQb,IAAOoN,EAAM8Q,EAAWle,GAAQie,EAAS5X,QAAQ+G,IAAQ,IAAamN,EAAOnN,GAAO4Q,EAAO5Q,IAAQ,OAAOmN,CAAS,CADjN4D,CAA8BH,EAAQC,GAAuB,GAAI/Q,OAAOqD,sBAAuB,CAAE,IAAI6N,EAAmBlR,OAAOqD,sBAAsByN,GAAS,IAAKhe,EAAI,EAAGA,EAAIoe,EAAiBvd,OAAQb,IAAOoN,EAAMgR,EAAiBpe,GAAQie,EAAS5X,QAAQ+G,IAAQ,GAAkBF,OAAOvG,UAAU0X,qBAAqBhN,KAAK2M,EAAQ5Q,KAAgBmN,EAAOnN,GAAO4Q,EAAO5Q,GAAO,CAAG,OAAOmN,CAAS,CAE5e,SAASjK,GAAQnO,EAAGlC,GAAK,IAAIsE,EAAI2I,OAAOC,KAAKhL,GAAI,GAAI+K,OAAOqD,sBAAuB,CAAE,IAAIxO,EAAImL,OAAOqD,sBAAsBpO,GAAIlC,IAAM8B,EAAIA,EAAEmJ,QAAO,SAAUjL,GAAK,OAAOiN,OAAOsD,yBAAyBrO,EAAGlC,GAAGwQ,UAAW,KAAMlM,EAAE4D,KAAKyB,MAAMrF,EAAGxC,EAAG,CAAG,OAAOwC,CAAI,CAC/P,SAASmM,GAAcvO,GAAK,IAAK,IAAIlC,EAAI,EAAGA,EAAIgM,UAAUpL,OAAQZ,IAAK,CAAE,IAAIsE,EAAI,MAAQ0H,UAAUhM,GAAKgM,UAAUhM,GAAK,CAAE,EAAEA,EAAI,EAAIqQ,GAAQpD,OAAO3I,IAAI,GAAI4J,SAAQ,SAAUlO,GAAK0Q,GAAgBxO,EAAGlC,EAAGsE,EAAEtE,GAAM,IAAIiN,OAAO0D,0BAA4B1D,OAAO2D,iBAAiB1O,EAAG+K,OAAO0D,0BAA0BrM,IAAM+L,GAAQpD,OAAO3I,IAAI4J,SAAQ,SAAUlO,GAAKiN,OAAO4D,eAAe3O,EAAGlC,EAAGiN,OAAOsD,yBAAyBjM,EAAGtE,GAAI,GAAM,CAAC,OAAOkC,CAAI,CACvb,SAASwO,GAAgBI,EAAK3D,EAAKuB,GAA4L,OAAnLvB,EAC5C,SAAwB4D,GAAO,IAAI5D,EACnC,SAAsBtB,EAAOmF,GAAQ,GAAuB,WAAnBd,GAAQrE,IAAiC,OAAVA,EAAgB,OAAOA,EAAO,IAAIoF,EAAOpF,EAAMsE,OAAOe,aAAc,QAAajF,IAATgF,EAAoB,CAAE,IAAIE,EAAMF,EAAKG,KAAKvF,EAAOmF,GAAQ,WAAY,GAAqB,WAAjBd,GAAQiB,GAAmB,OAAOA,EAAK,MAAM,IAAIE,UAAU,+CAAkD,CAAC,OAAiB,WAATL,EAAoBzH,OAAS+H,QAAQzF,EAAS,CADpV0F,CAAaR,EAAK,UAAW,MAAwB,WAAjBb,GAAQ/C,GAAoBA,EAAM5D,OAAO4D,EAAO,CAD3EqE,CAAerE,MAAiB2D,EAAO7D,OAAO4D,eAAeC,EAAK3D,EAAK,CAAEuB,MAAOA,EAAO8B,YAAY,EAAMiB,cAAc,EAAMC,UAAU,IAAkBZ,EAAI3D,GAAOuB,EAAgBoC,CAAM,CAO5O,IAAIuN,GAAkB,CACpBC,yCAAqCrS,EACrCsS,mCAAoC,KACpCC,2DAA4D,WAC1D,OAAO,CACR,EAGDC,oBAAqB,WACnB,OAAO,IACR,EACDC,mBAAoB,WAClB,OAAO,IACR,EACDC,kBAAkB,EAClBC,iBAAiB,EACjBC,oBAAqB,KAkCR,SAASC,GAAanX,EAAMoX,EAAQjT,GAMjD,IAAIkT,EAJFlT,EADEA,EACQ2E,GAAcA,GAAc,CAAE,EAAE4N,IAAkBvS,GAElDuS,GAGVM,EAAmBK,EAASL,iBAC5BC,EAAkBI,EAASJ,gBAC3BK,EAA4BD,EAASxG,kBACrC0G,EAAyBpB,GAAyBkB,EAAUnB,IAI1DrF,EAAoByG,GAA6BA,EAA0B9Y,SAgXjF,SAAwB4Y,GACtB,IAAK,IAAII,EAAM,EAAGC,EAAgBnS,OAAOC,KAAK6R,GAASI,EAAMC,EAAcxe,OAAQue,IAAO,CACxF,IAAIhS,EAAMiS,EAAcD,GACpBE,EAAcN,EAAO5R,GAEzB,GAAkC,WAA9B+C,GAAQmP,EAAYhb,QAAuBsP,MAAMC,QAAQyL,EAAYhb,MACvE,MAAM,IAAI5B,MAAM,uFAGlB,IAAK4c,EAAYN,SACVM,EAAYtI,OACf,MAAM,IAAItU,MAAM,0CAA6C+R,OAAOrH,EAAK,MAG9E,CACH,CA9XEmS,CAAeP,GACXJ,IACFhX,EAAO4X,GAAU5X,IAEfiX,IACFjX,EAAOA,EAAKsD,QAAO,SAAU6L,EAAK/W,GAIhC,OAHiB+W,EAAI0I,OAAM,SAAUlI,GACnC,OAAgB,OAATA,CACf,MAGYkB,GAEFA,EAAkBM,OAAO/Y,EAAG,IAEvB,EAGf,KAKE,IAHA,IAAI0f,EAAU9X,EAAK,GACfsG,EAAU,GACVyR,EAAS,GACJ3f,EAAI,EAAGA,EAAI4H,EAAK/G,OAAQb,IAAK,CACpC,IAAI8a,EAAS8E,GAAKZ,EAAQpX,EAAK5H,GAAIA,OAAGkM,EAAWwT,EAASC,EAAQR,GAClEjR,EAAQ/F,KAAK2S,EACd,CAGD,GAAIrC,EACF,IAAK,IAAyD5D,EAArDC,EA7Gb,SAAyC/S,EAAGyR,GAAkB,IAAIC,EAAuB,oBAAXrD,QAA0BrO,EAAEqO,OAAOC,WAAatO,EAAE,cAAe,GAAI0R,EAAI,OAAQA,EAAKA,EAAGpC,KAAKtP,IAAI2R,KAAKC,KAAKF,GAAK,GAAIG,MAAMC,QAAQ9R,KAAO0R,EAAKS,GAA4BnS,KAAOyR,GAAkBzR,GAAyB,iBAAbA,EAAElB,OAAqB,CAAM4S,IAAI1R,EAAI0R,GAAI,IAAIzT,EAAI,EAAG,OAAO,WAAc,OAAIA,GAAK+B,EAAElB,OAAe,CAAEsT,MAAM,GAAe,CAAEA,MAAM,EAAOxF,MAAO5M,EAAE/B,KAAO,CAAK,CAAC,MAAM,IAAIsR,UAAU,wIAA2I,CA6GnkBiC,CAAgCoM,KAAkB9K,EAAQC,KAAaX,MAAO,CACjG,IAAIvH,EAAQiI,EAAMlG,MAKlB/B,EAAMmK,IAAM0B,EAAkB7L,EAAMmK,IAAM,GAAK,CAChD,CAEH,MAAO,CACL8I,KAAM3R,EACNyR,OAAQA,EAEZ,CACA,SAASC,GAAKZ,EAAQjI,EAAKwB,EAAUlM,EAAMqT,EAASC,EAAQ5T,GAgI1D,IA/HA,IAAI+T,EAAS,CAAA,EACTC,GAAgB,EAChBC,EAAc,SAAqBhU,GACrC,IAAIsT,EAActT,EAAKsT,YACrB3Q,EAAQ3C,EAAK2C,MACbsR,EAAejU,EAAKY,MACpB0Q,EAAStR,EAAKsR,OACZ1Q,EAAQ,CACVA,MAAOqT,EACPlJ,IAAKwB,EAAW,EAChBvB,OAAQsI,EAAYtI,OACpBrI,MAAOA,GAUT,OARI2O,IACF1Q,EAAM0Q,OAASA,GAIbgC,EAAYhb,OACdsI,EAAMtI,KAAOgb,EAAYhb,MAEpBsI,CACX,EACMsT,EAAwB,GAGxBC,EAAQ,WACV,IASIC,EAMAzR,EACA/B,EACA0Q,EAjBAlQ,EAAMH,EAAaD,GACnBsS,EAAcN,EAAO5R,GACrBiT,EAAejT,EACfkT,EAAchB,EAAYtI,OAG1BuJ,EAAe,GAAG9L,OAAOpI,GAAQ,GAAI,KAAKoI,OAAO4L,GAIjD7H,EAAckH,EAAQrZ,QAAQia,GAC9BE,EAAkBhI,EAAc,EASpC,GARKgI,IACHJ,EAAYrJ,EAAIyB,IAOd8G,EAAYN,OACdrQ,EAAQiR,GAAKN,EAAYN,OAAQjI,EAAKwB,EAAUgI,EAAcb,EAASC,EAAQ5T,QAE/E,GAAIyU,EACE,wCAAyCzU,IAC3C4C,EAAQ5C,EAAQwS,0CAEb,QAAkBrS,IAAdkU,EAGL,uCAAwCrU,IAC1C4C,EAAQ5C,EAAQyS,yCAEb,GAAkB,OAAd4B,EACL,uCAAwCrU,IAC1C4C,EAAQ5C,EAAQyS,yCAEb,GAAI5K,MAAMC,QAAQyL,EAAYhb,MAAO,CAC1C,IAAImc,EA0OL,SAAoBzR,EAAQ8P,GACjC,IAAI4B,EAAS,GACTC,EAAQ,EACZ,KAAOA,EAAQ3R,EAAOnO,QAAQ,CAC5B,IACE+f,EAAanJ,GADCoJ,GAAS7R,EAAQ8P,EAAqB6B,GACb,GACvCG,EAAYF,EAAW,GAEzBD,GADWC,EAAW,GACJ9B,EAAoBje,OACtC6f,EAAOvY,KAAK2Y,EAAU7hB,OACvB,CACD,OAAOyhB,CACT,CAtPoBK,CAAWX,EAAWrU,EAAQ+S,qBAAqB9M,KAAI,SAAUgP,GAC3E,IAAIpU,EAAJ,CAGA,IAAIkO,EAASmG,GAAWD,EAAQ1B,EAAavT,GAQ7C,OAPI+O,EAAOlO,QAGT+B,EAAQqS,EACRpU,EAAQkO,EAAOlO,MACf0Q,EAASxC,EAAOwC,QAEXxC,EAAOnM,KATb,CAUX,IACQ,IAAK/B,EAAO,CACV,IAAIsU,EAAUT,EAAMhB,MAAM0B,IAC1BxS,EAAQuS,EAAUnV,EAAQ4S,mBAAmB8B,EAAO,CAClDpU,KAAMkU,IACHE,CACN,CACT,KAAa,CACL,IAAI3F,EAASmG,GAAWb,EAAWd,EAAavT,GAChDa,EAAQkO,EAAOlO,MACf0Q,EAASxC,EAAOwC,OAChB3O,EAAQ/B,EAAQwT,EAAYtF,EAAOnM,KACpC,EAIE/B,GAASuU,GAAaxS,IACrB2Q,EAAY8B,UAGdlB,EAAsB/X,KAAK,CACzBmX,YAAaA,EACb3Q,MAAOA,EACP6R,gBAAiBA,IAInB5T,EAGF+S,EAAOxX,KAAK6X,EAAY,CACtBV,YAAaA,EACb3Q,MAAOA,EACP/B,MAAOA,EACP0Q,OAAQA,MAINyC,IAAkBoB,GAAaxS,KACjCoR,GAAgB,QAKJ7T,IAAVyC,IACFmR,EAAOO,GAAgB1R,GAG/B,EACW3B,EAAK,EAAGC,EAAeC,OAAOC,KAAK6R,GAAShS,EAAKC,EAAapM,OAAQmM,IAC7EmT,IAIF,GAAIJ,EACF,OAAOhU,EAAQ2S,oBAAoBoB,EAAQ,CACzCzT,KAAMA,IAKV,IAAK,IAAIgV,EAAM,EAAGC,EAAwBpB,EAAuBmB,EAAMC,EAAsBzgB,OAAQwgB,IAAO,CAC1G,IAAIE,EAAyBD,EAAsBD,GACjD/B,EAAciC,EAAuBjC,YACrC3Q,EAAQ4S,EAAuB5S,MAMjC,KALoB4S,EAAuBf,iBAEKzU,EAAQ0S,2DAA2Da,EAAYtI,OAAQ,CACrI8I,OAAQA,KAEmB,CAC3B,IAAIsB,EAAW9B,EAAY8B,UACU,kBAAbA,EAAyBA,EAAWA,EAAStB,KAEnEH,EAAOxX,KAAK6X,EAAY,CACtBV,YAAaA,EACb3Q,MAAOA,EACP/B,MAAO,aAGZ,CACF,CAGD,OAAOkT,CACT,CAQO,SAASmB,GAAWtS,EAAO2Q,EAAavT,GAC7C,GAAc,OAAV4C,EACF,MAAO,CACLA,MAAO,MAGX,IAAImM,EACJ,GAAIwE,EAAYkC,MACd,MAAM,IAAI9e,MAAM,kEAgBlB,GAdEoY,EADSwE,EAAYhb,KAwEzB,SAA0BqK,EAAOrK,EAAMyH,GACrC,OAAQzH,GACN,KAAKkF,OACH,OAAOiY,GAAiB9S,EAAOiP,IACjC,KAAKrM,OACH,OAAOkQ,GAAiB9S,EAAO8O,IACjC,KAAKpK,KACH,OAAOoO,GAAiB9S,GAAO,SAAUA,GACvC,OCpYO,SAAkBA,EAAO3C,GACtC,IAAImD,EAAanD,EAAKmD,WAItB,GAAIR,aAAiB0E,KAAM,CACzB,GAAIuC,MAAMjH,EAAMqH,WACd,MAAM,IAAI6G,GAAa,iBAEzB,OAAOlO,CACR,CACD,GAAqB,iBAAVA,EAAoB,CAC7B,GAAIiH,MAAMjH,GACR,MAAM,IAAIkO,GAAa,kBAEzB,IAAKc,SAAShP,GACZ,MAAM,IAAIkO,GAAa,iBAEzB,IAAI6E,EAAOzL,GAAUtH,EAAOQ,GAC5B,GAAIyG,MAAM8L,EAAK1L,WACb,MAAM,IAAI6G,GAAa,iBAEzB,OAAO6E,CACR,CACD,MAAM,IAAI7E,GAAa,aACzB,CD2We8E,CAAShT,EAAO,CACrBQ,WAAYpD,EAAQoD,YAE9B,IACI,KAAKsN,QACH,OAAOgF,GAAiB9S,EAAOkP,IACjC,QACE,GAAoB,mBAATvZ,EACT,OAAOmd,GAAiB9S,EAAOrK,GAEjC,MAAM,IAAI5B,MAAM,4BAA4B+R,OAAOnQ,GAAQA,EAAKiH,MAAQjH,IAE9E,CA3Fasd,CAAiBjT,EAM1BiF,MAAMC,QAAQyL,EAAYhb,MAAQgb,EAAYhb,KAAK,GAAKgb,EAAYhb,KAAMyH,GAEjE,CACP4C,MAAOA,GAKPmM,EAAOlO,MACT,OAAOkO,EAET,GAAqB,OAAjBA,EAAOnM,MAAgB,CACzB,GAAI2Q,EAAYuC,OAASvC,EAAYuC,MAAMxb,QAAQyU,EAAOnM,OAAS,EACjE,MAAO,CACL/B,MAAO,UACP0Q,OAAQ,WAGZ,GAAIgC,EAAYwC,SACd,IACExC,EAAYwC,SAAShH,EAAOnM,MAC7B,CAAC,MAAO/B,GACP,MAAO,CACLA,MAAOA,EAAMmV,QAEhB,CAEJ,CACD,OAAOjH,CACT,CAQA,SAAS2G,GAAiB9S,EAAO6S,GAC/B,IACE,IAAIQ,EAAcR,EAAM7S,GACxB,YAAoBzC,IAAhB8V,EACK,CACLrT,MAAO,MAGJ,CACLA,MAAOqT,EAEV,CAAC,MAAOpV,GACP,IAAIkO,EAAS,CACXlO,MAAOA,EAAMmV,SAKf,OAHInV,EAAM0Q,SACRxC,EAAOwC,OAAS1Q,EAAM0Q,QAEjBxC,CACR,CACH,CA6BO,SAAS+F,GAAS7R,EAAQiT,EAAcC,GAI7C,IAHA,IAAIliB,EAAI,EACJ8gB,EAAY,GAEToB,EAAaliB,EAAIgP,EAAOnO,QAAQ,CACrC,IAAIshB,EAAanT,EAAOkT,EAAaliB,GACrC,GAAImiB,IAAeF,EACjB,MAAO,CAACnB,EAAW9gB,GACd,GAAmB,MAAfmiB,EAAoB,CAC7B,IAAIC,EAAQvB,GAAS7R,EAAQ,IAAKkT,EAAaliB,EAAI,GACnD8gB,GAAasB,EAAM,GACnBpiB,GAAK,EAAaoiB,EAAM,GAAK,CACnC,MACMtB,GAAaqB,EACbniB,GAEH,CACD,MAAO,CAAC8gB,EAAW9gB,EACrB,CAwBA,IAAIwf,GAAY,SAAmBiB,GACjC,OAAOA,EAAM,GAAGzO,KAAI,SAAU4G,EAAG5Y,GAC/B,OAAOygB,EAAMzO,KAAI,SAAU+E,GACzB,OAAOA,EAAI/W,EACjB,GACA,GACA,EAiBA,SAASmhB,GAAaxS,GACpB,OAAOA,OACT,CEtdA,SAASwB,GAAQpO,GAAgC,OAAOoO,GAAU,mBAAqBC,QAAU,iBAAmBA,OAAOC,SAAW,SAAUtO,GAAK,cAAcA,GAAO,SAAUA,GAAK,OAAOA,GAAK,mBAAqBqO,QAAUrO,EAAEqG,cAAgBgI,QAAUrO,IAAMqO,OAAOzJ,UAAY,gBAAkB5E,CAAE,EAAIoO,GAAQpO,EAAK,CAC9T,IAAI+b,GAAY,CAAC,UACjB,SAASxN,GAAQnO,EAAGlC,GAAK,IAAIsE,EAAI2I,OAAOC,KAAKhL,GAAI,GAAI+K,OAAOqD,sBAAuB,CAAE,IAAIxO,EAAImL,OAAOqD,sBAAsBpO,GAAIlC,IAAM8B,EAAIA,EAAEmJ,QAAO,SAAUjL,GAAK,OAAOiN,OAAOsD,yBAAyBrO,EAAGlC,GAAGwQ,UAAW,KAAMlM,EAAE4D,KAAKyB,MAAMrF,EAAGxC,EAAG,CAAG,OAAOwC,CAAI,CAC/P,SAASmM,GAAcvO,GAAK,IAAK,IAAIlC,EAAI,EAAGA,EAAIgM,UAAUpL,OAAQZ,IAAK,CAAE,IAAIsE,EAAI,MAAQ0H,UAAUhM,GAAKgM,UAAUhM,GAAK,CAAE,EAAEA,EAAI,EAAIqQ,GAAQpD,OAAO3I,IAAI,GAAI4J,SAAQ,SAAUlO,GAAK0Q,GAAgBxO,EAAGlC,EAAGsE,EAAEtE,GAAM,IAAIiN,OAAO0D,0BAA4B1D,OAAO2D,iBAAiB1O,EAAG+K,OAAO0D,0BAA0BrM,IAAM+L,GAAQpD,OAAO3I,IAAI4J,SAAQ,SAAUlO,GAAKiN,OAAO4D,eAAe3O,EAAGlC,EAAGiN,OAAOsD,yBAAyBjM,EAAGtE,GAAI,GAAM,CAAC,OAAOkC,CAAI,CACvb,SAASwO,GAAgBI,EAAK3D,EAAKuB,GAA4L,OAAnLvB,EAC5C,SAAwB4D,GAAO,IAAI5D,EACnC,SAAsBtB,EAAOmF,GAAQ,GAAuB,WAAnBd,GAAQrE,IAAiC,OAAVA,EAAgB,OAAOA,EAAO,IAAIoF,EAAOpF,EAAMsE,OAAOe,aAAc,QAAajF,IAATgF,EAAoB,CAAE,IAAIE,EAAMF,EAAKG,KAAKvF,EAAOmF,GAAQ,WAAY,GAAqB,WAAjBd,GAAQiB,GAAmB,OAAOA,EAAK,MAAM,IAAIE,UAAU,+CAAkD,CAAC,OAAiB,WAATL,EAAoBzH,OAAS+H,QAAQzF,EAAS,CADpV0F,CAAaR,EAAK,UAAW,MAAwB,WAAjBb,GAAQ/C,GAAoBA,EAAM5D,OAAO4D,EAAO,CAD3EqE,CAAerE,MAAiB2D,EAAO7D,OAAO4D,eAAeC,EAAK3D,EAAK,CAAEuB,MAAOA,EAAO8B,YAAY,EAAMiB,cAAc,EAAMC,UAAU,IAAkBZ,EAAI3D,GAAOuB,EAAgBoC,CAAM,CAG5O,SAASgN,GAAyBC,EAAQC,GAAY,GAAc,MAAVD,EAAgB,MAAO,GAAI,IAAkE5Q,EAAKpN,EAAnEua,EACzF,SAAuCyD,EAAQC,GAAY,GAAc,MAAVD,EAAgB,MAAO,CAAE,EAAE,IAA2D5Q,EAAKpN,EAA5Dua,EAAS,CAAE,EAAM2D,EAAahR,OAAOC,KAAK6Q,GAAqB,IAAKhe,EAAI,EAAGA,EAAIke,EAAWrd,OAAQb,IAAOoN,EAAM8Q,EAAWle,GAAQie,EAAS5X,QAAQ+G,IAAQ,IAAamN,EAAOnN,GAAO4Q,EAAO5Q,IAAQ,OAAOmN,CAAS,CADjN4D,CAA8BH,EAAQC,GAAuB,GAAI/Q,OAAOqD,sBAAuB,CAAE,IAAI6N,EAAmBlR,OAAOqD,sBAAsByN,GAAS,IAAKhe,EAAI,EAAGA,EAAIoe,EAAiBvd,OAAQb,IAAOoN,EAAMgR,EAAiBpe,GAAQie,EAAS5X,QAAQ+G,IAAQ,GAAkBF,OAAOvG,UAAU0X,qBAAqBhN,KAAK2M,EAAQ5Q,KAAgBmN,EAAOnN,GAAO4Q,EAAO5Q,GAAO,CAAG,OAAOmN,CAAS,QCI7d,SAAsBzO,GACnC,IAAIC,EAAUE,UAAUpL,OAAS,QAAsBqL,IAAjBD,UAAU,GAAmBA,UAAU,GAAK,CAAA,EAClF,O1BAa,SAAwBH,GACrC,OAAIA,aAAiBuW,MAAQvW,aAAiBpE,KACrCoE,EAAM0B,cAAcC,KAAKF,GAE3Bd,QAAQC,QAAQZ,GAAO2B,KAAKF,EACrC,C0BLS+U,CAAexW,GAAO2B,MAAK,SAAU2L,GAC1C,ODKW,SAAiDA,EAAUxa,EAAKoN,GAC7E,IAAIgT,EAAShT,EAAKgT,OAChBjT,EAAUgS,GAAyB/R,EAAM8R,IAC3C,GAAI/R,EAAQiG,IACV,MAAM,IAAItP,MAAM,6DAKlB,IAAIoY,EAAS3B,GAAsBC,EAAUxa,EAAK8R,GAAcA,GAAc,CAAE,EAAE3E,GAAU,GAAI,CAC9FoD,WAAY6P,GAAUjT,EAAQoD,cAEhC,OAAI6P,EACKD,GAAajE,EAAOlT,KAAMoX,EAAQtO,GAAcA,GAAc,CAAE,EAAE3E,GAAU,GAAI,CACrFoD,WAAY2L,EAAO3L,cAGhB2L,CACT,CCvBW3B,CAAsBC,EAAUxa,EAAKmN,EAChD,GACA"}