@gaddario98/react-core 2.0.0 → 2.0.2

package/dist/state/index.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"index.mjs","sources":[],"sourcesContent":[],"names":[],"mappings":""}
+{"version":3,"file":"index.mjs","sources":["../../../../node_modules/fflate/esm/browser.js","../../state/storage.ts","../../state/node_modules/jotai/esm/vanilla/internals.mjs","../../state/node_modules/jotai/esm/vanilla.mjs","../../state/node_modules/jotai/esm/react.mjs","../../state/node_modules/jotai/esm/vanilla/utils.mjs","../../state/atomStateGenerator.ts"],"sourcesContent":["// DEFLATE is a complex format; to read this code, you should probably check the RFC first:\n// https://tools.ietf.org/html/rfc1951\n// You may also wish to take a look at the guide I made about this program:\n// https://gist.github.com/101arrowz/253f31eb5abc3d9275ab943003ffecad\n// Some of the following code is similar to that of UZIP.js:\n// https://github.com/photopea/UZIP.js\n// However, the vast majority of the codebase has diverged from UZIP.js to increase performance and reduce bundle size.\n// Sometimes 0 will appear where -1 would be more appropriate. This is because using a uint\n// is better for memory in most engines (I *think*).\nvar ch2 = {};\nvar wk = (function (c, id, msg, transfer, cb) {\n    var w = new Worker(ch2[id] || (ch2[id] = URL.createObjectURL(new Blob([\n        c + ';addEventListener(\"error\",function(e){e=e.error;postMessage({$e$:[e.message,e.code,e.stack]})})'\n    ], { type: 'text/javascript' }))));\n    w.onmessage = function (e) {\n        var d = e.data, ed = d.$e$;\n        if (ed) {\n            var err = new Error(ed[0]);\n            err['code'] = ed[1];\n            err.stack = ed[2];\n            cb(err, null);\n        }\n        else\n            cb(null, d);\n    };\n    w.postMessage(msg, transfer);\n    return w;\n});\n\n// aliases for shorter compressed code (most minifers don't do this)\nvar u8 = Uint8Array, u16 = Uint16Array, i32 = Int32Array;\n// fixed length extra bits\nvar fleb = new u8([0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0, /* unused */ 0, 0, /* impossible */ 0]);\n// fixed distance extra bits\nvar fdeb = new u8([0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, /* unused */ 0, 0]);\n// code length index map\nvar clim = new u8([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]);\n// get base, reverse index map from extra bits\nvar freb = function (eb, start) {\n    var b = new u16(31);\n    for (var i = 0; i < 31; ++i) {\n        b[i] = start += 1 << eb[i - 1];\n    }\n    // numbers here are at max 18 bits\n    var r = new i32(b[30]);\n    for (var i = 1; i < 30; ++i) {\n        for (var j = b[i]; j < b[i + 1]; ++j) {\n            r[j] = ((j - b[i]) << 5) | i;\n        }\n    }\n    return { b: b, r: r };\n};\nvar _a = freb(fleb, 2), fl = _a.b, revfl = _a.r;\n// we can ignore the fact that the other numbers are wrong; they never happen anyway\nfl[28] = 258, revfl[258] = 28;\nvar _b = freb(fdeb, 0), fd = _b.b, revfd = _b.r;\n// map of value to reverse (assuming 16 bits)\nvar rev = new u16(32768);\nfor (var i = 0; i < 32768; ++i) {\n    // reverse table algorithm from SO\n    var x = ((i & 0xAAAA) >> 1) | ((i & 0x5555) << 1);\n    x = ((x & 0xCCCC) >> 2) | ((x & 0x3333) << 2);\n    x = ((x & 0xF0F0) >> 4) | ((x & 0x0F0F) << 4);\n    rev[i] = (((x & 0xFF00) >> 8) | ((x & 0x00FF) << 8)) >> 1;\n}\n// create huffman tree from u8 \"map\": index -> code length for code index\n// mb (max bits) must be at most 15\n// TODO: optimize/split up?\nvar hMap = (function (cd, mb, r) {\n    var s = cd.length;\n    // index\n    var i = 0;\n    // u16 \"map\": index -> # of codes with bit length = index\n    var l = new u16(mb);\n    // length of cd must be 288 (total # of codes)\n    for (; i < s; ++i) {\n        if (cd[i])\n            ++l[cd[i] - 1];\n    }\n    // u16 \"map\": index -> minimum code for bit length = index\n    var le = new u16(mb);\n    for (i = 1; i < mb; ++i) {\n        le[i] = (le[i - 1] + l[i - 1]) << 1;\n    }\n    var co;\n    if (r) {\n        // u16 \"map\": index -> number of actual bits, symbol for code\n        co = new u16(1 << mb);\n        // bits to remove for reverser\n        var rvb = 15 - mb;\n        for (i = 0; i < s; ++i) {\n            // ignore 0 lengths\n            if (cd[i]) {\n                // num encoding both symbol and bits read\n                var sv = (i << 4) | cd[i];\n                // free bits\n                var r_1 = mb - cd[i];\n                // start value\n                var v = le[cd[i] - 1]++ << r_1;\n                // m is end value\n                for (var m = v | ((1 << r_1) - 1); v <= m; ++v) {\n                    // every 16 bit value starting with the code yields the same result\n                    co[rev[v] >> rvb] = sv;\n                }\n            }\n        }\n    }\n    else {\n        co = new u16(s);\n        for (i = 0; i < s; ++i) {\n            if (cd[i]) {\n                co[i] = rev[le[cd[i] - 1]++] >> (15 - cd[i]);\n            }\n        }\n    }\n    return co;\n});\n// fixed length tree\nvar flt = new u8(288);\nfor (var i = 0; i < 144; ++i)\n    flt[i] = 8;\nfor (var i = 144; i < 256; ++i)\n    flt[i] = 9;\nfor (var i = 256; i < 280; ++i)\n    flt[i] = 7;\nfor (var i = 280; i < 288; ++i)\n    flt[i] = 8;\n// fixed distance tree\nvar fdt = new u8(32);\nfor (var i = 0; i < 32; ++i)\n    fdt[i] = 5;\n// fixed length map\nvar flm = /*#__PURE__*/ hMap(flt, 9, 0), flrm = /*#__PURE__*/ hMap(flt, 9, 1);\n// fixed distance map\nvar fdm = /*#__PURE__*/ hMap(fdt, 5, 0), fdrm = /*#__PURE__*/ hMap(fdt, 5, 1);\n// find max of array\nvar max = function (a) {\n    var m = a[0];\n    for (var i = 1; i < a.length; ++i) {\n        if (a[i] > m)\n            m = a[i];\n    }\n    return m;\n};\n// read d, starting at bit p and mask with m\nvar bits = function (d, p, m) {\n    var o = (p / 8) | 0;\n    return ((d[o] | (d[o + 1] << 8)) >> (p & 7)) & m;\n};\n// read d, starting at bit p continuing for at least 16 bits\nvar bits16 = function (d, p) {\n    var o = (p / 8) | 0;\n    return ((d[o] | (d[o + 1] << 8) | (d[o + 2] << 16)) >> (p & 7));\n};\n// get end of byte\nvar shft = function (p) { return ((p + 7) / 8) | 0; };\n// typed array slice - allows garbage collector to free original reference,\n// while being more compatible than .slice\nvar slc = function (v, s, e) {\n    if (s == null || s < 0)\n        s = 0;\n    if (e == null || e > v.length)\n        e = v.length;\n    // can't use .constructor in case user-supplied\n    return new u8(v.subarray(s, e));\n};\n/**\n * Codes for errors generated within this library\n */\nexport var FlateErrorCode = {\n    UnexpectedEOF: 0,\n    InvalidBlockType: 1,\n    InvalidLengthLiteral: 2,\n    InvalidDistance: 3,\n    StreamFinished: 4,\n    NoStreamHandler: 5,\n    InvalidHeader: 6,\n    NoCallback: 7,\n    InvalidUTF8: 8,\n    ExtraFieldTooLong: 9,\n    InvalidDate: 10,\n    FilenameTooLong: 11,\n    StreamFinishing: 12,\n    InvalidZipData: 13,\n    UnknownCompressionMethod: 14\n};\n// error codes\nvar ec = [\n    'unexpected EOF',\n    'invalid block type',\n    'invalid length/literal',\n    'invalid distance',\n    'stream finished',\n    'no stream handler',\n    ,\n    'no callback',\n    'invalid UTF-8 data',\n    'extra field too long',\n    'date not in range 1980-2099',\n    'filename too long',\n    'stream finishing',\n    'invalid zip data'\n    // determined by unknown compression method\n];\n;\nvar err = function (ind, msg, nt) {\n    var e = new Error(msg || ec[ind]);\n    e.code = ind;\n    if (Error.captureStackTrace)\n        Error.captureStackTrace(e, err);\n    if (!nt)\n        throw e;\n    return e;\n};\n// expands raw DEFLATE data\nvar inflt = function (dat, st, buf, dict) {\n    // source length       dict length\n    var sl = dat.length, dl = dict ? dict.length : 0;\n    if (!sl || st.f && !st.l)\n        return buf || new u8(0);\n    var noBuf = !buf;\n    // have to estimate size\n    var resize = noBuf || st.i != 2;\n    // no state\n    var noSt = st.i;\n    // Assumes roughly 33% compression ratio average\n    if (noBuf)\n        buf = new u8(sl * 3);\n    // ensure buffer can fit at least l elements\n    var cbuf = function (l) {\n        var bl = buf.length;\n        // need to increase size to fit\n        if (l > bl) {\n            // Double or set to necessary, whichever is greater\n            var nbuf = new u8(Math.max(bl * 2, l));\n            nbuf.set(buf);\n            buf = nbuf;\n        }\n    };\n    //  last chunk         bitpos           bytes\n    var final = st.f || 0, pos = st.p || 0, bt = st.b || 0, lm = st.l, dm = st.d, lbt = st.m, dbt = st.n;\n    // total bits\n    var tbts = sl * 8;\n    do {\n        if (!lm) {\n            // BFINAL - this is only 1 when last chunk is next\n            final = bits(dat, pos, 1);\n            // type: 0 = no compression, 1 = fixed huffman, 2 = dynamic huffman\n            var type = bits(dat, pos + 1, 3);\n            pos += 3;\n            if (!type) {\n                // go to end of byte boundary\n                var s = shft(pos) + 4, l = dat[s - 4] | (dat[s - 3] << 8), t = s + l;\n                if (t > sl) {\n                    if (noSt)\n                        err(0);\n                    break;\n                }\n                // ensure size\n                if (resize)\n                    cbuf(bt + l);\n                // Copy over uncompressed data\n                buf.set(dat.subarray(s, t), bt);\n                // Get new bitpos, update byte count\n                st.b = bt += l, st.p = pos = t * 8, st.f = final;\n                continue;\n            }\n            else if (type == 1)\n                lm = flrm, dm = fdrm, lbt = 9, dbt = 5;\n            else if (type == 2) {\n                //  literal                            lengths\n                var hLit = bits(dat, pos, 31) + 257, hcLen = bits(dat, pos + 10, 15) + 4;\n                var tl = hLit + bits(dat, pos + 5, 31) + 1;\n                pos += 14;\n                // length+distance tree\n                var ldt = new u8(tl);\n                // code length tree\n                var clt = new u8(19);\n                for (var i = 0; i < hcLen; ++i) {\n                    // use index map to get real code\n                    clt[clim[i]] = bits(dat, pos + i * 3, 7);\n                }\n                pos += hcLen * 3;\n                // code lengths bits\n                var clb = max(clt), clbmsk = (1 << clb) - 1;\n                // code lengths map\n                var clm = hMap(clt, clb, 1);\n                for (var i = 0; i < tl;) {\n                    var r = clm[bits(dat, pos, clbmsk)];\n                    // bits read\n                    pos += r & 15;\n                    // symbol\n                    var s = r >> 4;\n                    // code length to copy\n                    if (s < 16) {\n                        ldt[i++] = s;\n                    }\n                    else {\n                        //  copy   count\n                        var c = 0, n = 0;\n                        if (s == 16)\n                            n = 3 + bits(dat, pos, 3), pos += 2, c = ldt[i - 1];\n                        else if (s == 17)\n                            n = 3 + bits(dat, pos, 7), pos += 3;\n                        else if (s == 18)\n                            n = 11 + bits(dat, pos, 127), pos += 7;\n                        while (n--)\n                            ldt[i++] = c;\n                    }\n                }\n                //    length tree                 distance tree\n                var lt = ldt.subarray(0, hLit), dt = ldt.subarray(hLit);\n                // max length bits\n                lbt = max(lt);\n                // max dist bits\n                dbt = max(dt);\n                lm = hMap(lt, lbt, 1);\n                dm = hMap(dt, dbt, 1);\n            }\n            else\n                err(1);\n            if (pos > tbts) {\n                if (noSt)\n                    err(0);\n                break;\n            }\n        }\n        // Make sure the buffer can hold this + the largest possible addition\n        // Maximum chunk size (practically, theoretically infinite) is 2^17\n        if (resize)\n            cbuf(bt + 131072);\n        var lms = (1 << lbt) - 1, dms = (1 << dbt) - 1;\n        var lpos = pos;\n        for (;; lpos = pos) {\n            // bits read, code\n            var c = lm[bits16(dat, pos) & lms], sym = c >> 4;\n            pos += c & 15;\n            if (pos > tbts) {\n                if (noSt)\n                    err(0);\n                break;\n            }\n            if (!c)\n                err(2);\n            if (sym < 256)\n                buf[bt++] = sym;\n            else if (sym == 256) {\n                lpos = pos, lm = null;\n                break;\n            }\n            else {\n                var add = sym - 254;\n                // no extra bits needed if less\n                if (sym > 264) {\n                    // index\n                    var i = sym - 257, b = fleb[i];\n                    add = bits(dat, pos, (1 << b) - 1) + fl[i];\n                    pos += b;\n                }\n                // dist\n                var d = dm[bits16(dat, pos) & dms], dsym = d >> 4;\n                if (!d)\n                    err(3);\n                pos += d & 15;\n                var dt = fd[dsym];\n                if (dsym > 3) {\n                    var b = fdeb[dsym];\n                    dt += bits16(dat, pos) & (1 << b) - 1, pos += b;\n                }\n                if (pos > tbts) {\n                    if (noSt)\n                        err(0);\n                    break;\n                }\n                if (resize)\n                    cbuf(bt + 131072);\n                var end = bt + add;\n                if (bt < dt) {\n                    var shift = dl - dt, dend = Math.min(dt, end);\n                    if (shift + bt < 0)\n                        err(3);\n                    for (; bt < dend; ++bt)\n                        buf[bt] = dict[shift + bt];\n                }\n                for (; bt < end; ++bt)\n                    buf[bt] = buf[bt - dt];\n            }\n        }\n        st.l = lm, st.p = lpos, st.b = bt, st.f = final;\n        if (lm)\n            final = 1, st.m = lbt, st.d = dm, st.n = dbt;\n    } while (!final);\n    // don't reallocate for streams or user buffers\n    return bt != buf.length && noBuf ? slc(buf, 0, bt) : buf.subarray(0, bt);\n};\n// starting at p, write the minimum number of bits that can hold v to d\nvar wbits = function (d, p, v) {\n    v <<= p & 7;\n    var o = (p / 8) | 0;\n    d[o] |= v;\n    d[o + 1] |= v >> 8;\n};\n// starting at p, write the minimum number of bits (>8) that can hold v to d\nvar wbits16 = function (d, p, v) {\n    v <<= p & 7;\n    var o = (p / 8) | 0;\n    d[o] |= v;\n    d[o + 1] |= v >> 8;\n    d[o + 2] |= v >> 16;\n};\n// creates code lengths from a frequency table\nvar hTree = function (d, mb) {\n    // Need extra info to make a tree\n    var t = [];\n    for (var i = 0; i < d.length; ++i) {\n        if (d[i])\n            t.push({ s: i, f: d[i] });\n    }\n    var s = t.length;\n    var t2 = t.slice();\n    if (!s)\n        return { t: et, l: 0 };\n    if (s == 1) {\n        var v = new u8(t[0].s + 1);\n        v[t[0].s] = 1;\n        return { t: v, l: 1 };\n    }\n    t.sort(function (a, b) { return a.f - b.f; });\n    // after i2 reaches last ind, will be stopped\n    // freq must be greater than largest possible number of symbols\n    t.push({ s: -1, f: 25001 });\n    var l = t[0], r = t[1], i0 = 0, i1 = 1, i2 = 2;\n    t[0] = { s: -1, f: l.f + r.f, l: l, r: r };\n    // efficient algorithm from UZIP.js\n    // i0 is lookbehind, i2 is lookahead - after processing two low-freq\n    // symbols that combined have high freq, will start processing i2 (high-freq,\n    // non-composite) symbols instead\n    // see https://reddit.com/r/photopea/comments/ikekht/uzipjs_questions/\n    while (i1 != s - 1) {\n        l = t[t[i0].f < t[i2].f ? i0++ : i2++];\n        r = t[i0 != i1 && t[i0].f < t[i2].f ? i0++ : i2++];\n        t[i1++] = { s: -1, f: l.f + r.f, l: l, r: r };\n    }\n    var maxSym = t2[0].s;\n    for (var i = 1; i < s; ++i) {\n        if (t2[i].s > maxSym)\n            maxSym = t2[i].s;\n    }\n    // code lengths\n    var tr = new u16(maxSym + 1);\n    // max bits in tree\n    var mbt = ln(t[i1 - 1], tr, 0);\n    if (mbt > mb) {\n        // more algorithms from UZIP.js\n        // TODO: find out how this code works (debt)\n        //  ind    debt\n        var i = 0, dt = 0;\n        //    left            cost\n        var lft = mbt - mb, cst = 1 << lft;\n        t2.sort(function (a, b) { return tr[b.s] - tr[a.s] || a.f - b.f; });\n        for (; i < s; ++i) {\n            var i2_1 = t2[i].s;\n            if (tr[i2_1] > mb) {\n                dt += cst - (1 << (mbt - tr[i2_1]));\n                tr[i2_1] = mb;\n            }\n            else\n                break;\n        }\n        dt >>= lft;\n        while (dt > 0) {\n            var i2_2 = t2[i].s;\n            if (tr[i2_2] < mb)\n                dt -= 1 << (mb - tr[i2_2]++ - 1);\n            else\n                ++i;\n        }\n        for (; i >= 0 && dt; --i) {\n            var i2_3 = t2[i].s;\n            if (tr[i2_3] == mb) {\n                --tr[i2_3];\n                ++dt;\n            }\n        }\n        mbt = mb;\n    }\n    return { t: new u8(tr), l: mbt };\n};\n// get the max length and assign length codes\nvar ln = function (n, l, d) {\n    return n.s == -1\n        ? Math.max(ln(n.l, l, d + 1), ln(n.r, l, d + 1))\n        : (l[n.s] = d);\n};\n// length codes generation\nvar lc = function (c) {\n    var s = c.length;\n    // Note that the semicolon was intentional\n    while (s && !c[--s])\n        ;\n    var cl = new u16(++s);\n    //  ind      num         streak\n    var cli = 0, cln = c[0], cls = 1;\n    var w = function (v) { cl[cli++] = v; };\n    for (var i = 1; i <= s; ++i) {\n        if (c[i] == cln && i != s)\n            ++cls;\n        else {\n            if (!cln && cls > 2) {\n                for (; cls > 138; cls -= 138)\n                    w(32754);\n                if (cls > 2) {\n                    w(cls > 10 ? ((cls - 11) << 5) | 28690 : ((cls - 3) << 5) | 12305);\n                    cls = 0;\n                }\n            }\n            else if (cls > 3) {\n                w(cln), --cls;\n                for (; cls > 6; cls -= 6)\n                    w(8304);\n                if (cls > 2)\n                    w(((cls - 3) << 5) | 8208), cls = 0;\n            }\n            while (cls--)\n                w(cln);\n            cls = 1;\n            cln = c[i];\n        }\n    }\n    return { c: cl.subarray(0, cli), n: s };\n};\n// calculate the length of output from tree, code lengths\nvar clen = function (cf, cl) {\n    var l = 0;\n    for (var i = 0; i < cl.length; ++i)\n        l += cf[i] * cl[i];\n    return l;\n};\n// writes a fixed block\n// returns the new bit pos\nvar wfblk = function (out, pos, dat) {\n    // no need to write 00 as type: TypedArray defaults to 0\n    var s = dat.length;\n    var o = shft(pos + 2);\n    out[o] = s & 255;\n    out[o + 1] = s >> 8;\n    out[o + 2] = out[o] ^ 255;\n    out[o + 3] = out[o + 1] ^ 255;\n    for (var i = 0; i < s; ++i)\n        out[o + i + 4] = dat[i];\n    return (o + 4 + s) * 8;\n};\n// writes a block\nvar wblk = function (dat, out, final, syms, lf, df, eb, li, bs, bl, p) {\n    wbits(out, p++, final);\n    ++lf[256];\n    var _a = hTree(lf, 15), dlt = _a.t, mlb = _a.l;\n    var _b = hTree(df, 15), ddt = _b.t, mdb = _b.l;\n    var _c = lc(dlt), lclt = _c.c, nlc = _c.n;\n    var _d = lc(ddt), lcdt = _d.c, ndc = _d.n;\n    var lcfreq = new u16(19);\n    for (var i = 0; i < lclt.length; ++i)\n        ++lcfreq[lclt[i] & 31];\n    for (var i = 0; i < lcdt.length; ++i)\n        ++lcfreq[lcdt[i] & 31];\n    var _e = hTree(lcfreq, 7), lct = _e.t, mlcb = _e.l;\n    var nlcc = 19;\n    for (; nlcc > 4 && !lct[clim[nlcc - 1]]; --nlcc)\n        ;\n    var flen = (bl + 5) << 3;\n    var ftlen = clen(lf, flt) + clen(df, fdt) + eb;\n    var dtlen = clen(lf, dlt) + clen(df, ddt) + eb + 14 + 3 * nlcc + clen(lcfreq, lct) + 2 * lcfreq[16] + 3 * lcfreq[17] + 7 * lcfreq[18];\n    if (bs >= 0 && flen <= ftlen && flen <= dtlen)\n        return wfblk(out, p, dat.subarray(bs, bs + bl));\n    var lm, ll, dm, dl;\n    wbits(out, p, 1 + (dtlen < ftlen)), p += 2;\n    if (dtlen < ftlen) {\n        lm = hMap(dlt, mlb, 0), ll = dlt, dm = hMap(ddt, mdb, 0), dl = ddt;\n        var llm = hMap(lct, mlcb, 0);\n        wbits(out, p, nlc - 257);\n        wbits(out, p + 5, ndc - 1);\n        wbits(out, p + 10, nlcc - 4);\n        p += 14;\n        for (var i = 0; i < nlcc; ++i)\n            wbits(out, p + 3 * i, lct[clim[i]]);\n        p += 3 * nlcc;\n        var lcts = [lclt, lcdt];\n        for (var it = 0; it < 2; ++it) {\n            var clct = lcts[it];\n            for (var i = 0; i < clct.length; ++i) {\n                var len = clct[i] & 31;\n                wbits(out, p, llm[len]), p += lct[len];\n                if (len > 15)\n                    wbits(out, p, (clct[i] >> 5) & 127), p += clct[i] >> 12;\n            }\n        }\n    }\n    else {\n        lm = flm, ll = flt, dm = fdm, dl = fdt;\n    }\n    for (var i = 0; i < li; ++i) {\n        var sym = syms[i];\n        if (sym > 255) {\n            var len = (sym >> 18) & 31;\n            wbits16(out, p, lm[len + 257]), p += ll[len + 257];\n            if (len > 7)\n                wbits(out, p, (sym >> 23) & 31), p += fleb[len];\n            var dst = sym & 31;\n            wbits16(out, p, dm[dst]), p += dl[dst];\n            if (dst > 3)\n                wbits16(out, p, (sym >> 5) & 8191), p += fdeb[dst];\n        }\n        else {\n            wbits16(out, p, lm[sym]), p += ll[sym];\n        }\n    }\n    wbits16(out, p, lm[256]);\n    return p + ll[256];\n};\n// deflate options (nice << 13) | chain\nvar deo = /*#__PURE__*/ new i32([65540, 131080, 131088, 131104, 262176, 1048704, 1048832, 2114560, 2117632]);\n// empty\nvar et = /*#__PURE__*/ new u8(0);\n// compresses data into a raw DEFLATE buffer\nvar dflt = function (dat, lvl, plvl, pre, post, st) {\n    var s = st.z || dat.length;\n    var o = new u8(pre + s + 5 * (1 + Math.ceil(s / 7000)) + post);\n    // writing to this writes to the output buffer\n    var w = o.subarray(pre, o.length - post);\n    var lst = st.l;\n    var pos = (st.r || 0) & 7;\n    if (lvl) {\n        if (pos)\n            w[0] = st.r >> 3;\n        var opt = deo[lvl - 1];\n        var n = opt >> 13, c = opt & 8191;\n        var msk_1 = (1 << plvl) - 1;\n        //    prev 2-byte val map    curr 2-byte val map\n        var prev = st.p || new u16(32768), head = st.h || new u16(msk_1 + 1);\n        var bs1_1 = Math.ceil(plvl / 3), bs2_1 = 2 * bs1_1;\n        var hsh = function (i) { return (dat[i] ^ (dat[i + 1] << bs1_1) ^ (dat[i + 2] << bs2_1)) & msk_1; };\n        // 24576 is an arbitrary number of maximum symbols per block\n        // 424 buffer for last block\n        var syms = new i32(25000);\n        // length/literal freq   distance freq\n        var lf = new u16(288), df = new u16(32);\n        //  l/lcnt  exbits  index          l/lind  waitdx          blkpos\n        var lc_1 = 0, eb = 0, i = st.i || 0, li = 0, wi = st.w || 0, bs = 0;\n        for (; i + 2 < s; ++i) {\n            // hash value\n            var hv = hsh(i);\n            // index mod 32768    previous index mod\n            var imod = i & 32767, pimod = head[hv];\n            prev[imod] = pimod;\n            head[hv] = imod;\n            // We always should modify head and prev, but only add symbols if\n            // this data is not yet processed (\"wait\" for wait index)\n            if (wi <= i) {\n                // bytes remaining\n                var rem = s - i;\n                if ((lc_1 > 7000 || li > 24576) && (rem > 423 || !lst)) {\n                    pos = wblk(dat, w, 0, syms, lf, df, eb, li, bs, i - bs, pos);\n                    li = lc_1 = eb = 0, bs = i;\n                    for (var j = 0; j < 286; ++j)\n                        lf[j] = 0;\n                    for (var j = 0; j < 30; ++j)\n                        df[j] = 0;\n                }\n                //  len    dist   chain\n                var l = 2, d = 0, ch_1 = c, dif = imod - pimod & 32767;\n                if (rem > 2 && hv == hsh(i - dif)) {\n                    var maxn = Math.min(n, rem) - 1;\n                    var maxd = Math.min(32767, i);\n                    // max possible length\n                    // not capped at dif because decompressors implement \"rolling\" index population\n                    var ml = Math.min(258, rem);\n                    while (dif <= maxd && --ch_1 && imod != pimod) {\n                        if (dat[i + l] == dat[i + l - dif]) {\n                            var nl = 0;\n                            for (; nl < ml && dat[i + nl] == dat[i + nl - dif]; ++nl)\n                                ;\n                            if (nl > l) {\n                                l = nl, d = dif;\n                                // break out early when we reach \"nice\" (we are satisfied enough)\n                                if (nl > maxn)\n                                    break;\n                                // now, find the rarest 2-byte sequence within this\n                                // length of literals and search for that instead.\n                                // Much faster than just using the start\n                                var mmd = Math.min(dif, nl - 2);\n                                var md = 0;\n                                for (var j = 0; j < mmd; ++j) {\n                                    var ti = i - dif + j & 32767;\n                                    var pti = prev[ti];\n                                    var cd = ti - pti & 32767;\n                                    if (cd > md)\n                                        md = cd, pimod = ti;\n                                }\n                            }\n                        }\n                        // check the previous match\n                        imod = pimod, pimod = prev[imod];\n                        dif += imod - pimod & 32767;\n                    }\n                }\n                // d will be nonzero only when a match was found\n                if (d) {\n                    // store both dist and len data in one int32\n                    // Make sure this is recognized as a len/dist with 28th bit (2^28)\n                    syms[li++] = 268435456 | (revfl[l] << 18) | revfd[d];\n                    var lin = revfl[l] & 31, din = revfd[d] & 31;\n                    eb += fleb[lin] + fdeb[din];\n                    ++lf[257 + lin];\n                    ++df[din];\n                    wi = i + l;\n                    ++lc_1;\n                }\n                else {\n                    syms[li++] = dat[i];\n                    ++lf[dat[i]];\n                }\n            }\n        }\n        for (i = Math.max(i, wi); i < s; ++i) {\n            syms[li++] = dat[i];\n            ++lf[dat[i]];\n        }\n        pos = wblk(dat, w, lst, syms, lf, df, eb, li, bs, i - bs, pos);\n        if (!lst) {\n            st.r = (pos & 7) | w[(pos / 8) | 0] << 3;\n            // shft(pos) now 1 less if pos & 7 != 0\n            pos -= 7;\n            st.h = head, st.p = prev, st.i = i, st.w = wi;\n        }\n    }\n    else {\n        for (var i = st.w || 0; i < s + lst; i += 65535) {\n            // end\n            var e = i + 65535;\n            if (e >= s) {\n                // write final block\n                w[(pos / 8) | 0] = lst;\n                e = s;\n            }\n            pos = wfblk(w, pos + 1, dat.subarray(i, e));\n        }\n        st.i = s;\n    }\n    return slc(o, 0, pre + shft(pos) + post);\n};\n// CRC32 table\nvar crct = /*#__PURE__*/ (function () {\n    var t = new Int32Array(256);\n    for (var i = 0; i < 256; ++i) {\n        var c = i, k = 9;\n        while (--k)\n            c = ((c & 1) && -306674912) ^ (c >>> 1);\n        t[i] = c;\n    }\n    return t;\n})();\n// CRC32\nvar crc = function () {\n    var c = -1;\n    return {\n        p: function (d) {\n            // closures have awful performance\n            var cr = c;\n            for (var i = 0; i < d.length; ++i)\n                cr = crct[(cr & 255) ^ d[i]] ^ (cr >>> 8);\n            c = cr;\n        },\n        d: function () { return ~c; }\n    };\n};\n// Adler32\nvar adler = function () {\n    var a = 1, b = 0;\n    return {\n        p: function (d) {\n            // closures have awful performance\n            var n = a, m = b;\n            var l = d.length | 0;\n            for (var i = 0; i != l;) {\n                var e = Math.min(i + 2655, l);\n                for (; i < e; ++i)\n                    m += n += d[i];\n                n = (n & 65535) + 15 * (n >> 16), m = (m & 65535) + 15 * (m >> 16);\n            }\n            a = n, b = m;\n        },\n        d: function () {\n            a %= 65521, b %= 65521;\n            return (a & 255) << 24 | (a & 0xFF00) << 8 | (b & 255) << 8 | (b >> 8);\n        }\n    };\n};\n;\n// deflate with opts\nvar dopt = function (dat, opt, pre, post, st) {\n    if (!st) {\n        st = { l: 1 };\n        if (opt.dictionary) {\n            var dict = opt.dictionary.subarray(-32768);\n            var newDat = new u8(dict.length + dat.length);\n            newDat.set(dict);\n            newDat.set(dat, dict.length);\n            dat = newDat;\n            st.w = dict.length;\n        }\n    }\n    return dflt(dat, opt.level == null ? 6 : opt.level, opt.mem == null ? (st.l ? Math.ceil(Math.max(8, Math.min(13, Math.log(dat.length))) * 1.5) : 20) : (12 + opt.mem), pre, post, st);\n};\n// Walmart object spread\nvar mrg = function (a, b) {\n    var o = {};\n    for (var k in a)\n        o[k] = a[k];\n    for (var k in b)\n        o[k] = b[k];\n    return o;\n};\n// worker clone\n// This is possibly the craziest part of the entire codebase, despite how simple it may seem.\n// The only parameter to this function is a closure that returns an array of variables outside of the function scope.\n// We're going to try to figure out the variable names used in the closure as strings because that is crucial for workerization.\n// We will return an object mapping of true variable name to value (basically, the current scope as a JS object).\n// The reason we can't just use the original variable names is minifiers mangling the toplevel scope.\n// This took me three weeks to figure out how to do.\nvar wcln = function (fn, fnStr, td) {\n    var dt = fn();\n    var st = fn.toString();\n    var ks = st.slice(st.indexOf('[') + 1, st.lastIndexOf(']')).replace(/\\s+/g, '').split(',');\n    for (var i = 0; i < dt.length; ++i) {\n        var v = dt[i], k = ks[i];\n        if (typeof v == 'function') {\n            fnStr += ';' + k + '=';\n            var st_1 = v.toString();\n            if (v.prototype) {\n                // for global objects\n                if (st_1.indexOf('[native code]') != -1) {\n                    var spInd = st_1.indexOf(' ', 8) + 1;\n                    fnStr += st_1.slice(spInd, st_1.indexOf('(', spInd));\n                }\n                else {\n                    fnStr += st_1;\n                    for (var t in v.prototype)\n                        fnStr += ';' + k + '.prototype.' + t + '=' + v.prototype[t].toString();\n                }\n            }\n            else\n                fnStr += st_1;\n        }\n        else\n            td[k] = v;\n    }\n    return fnStr;\n};\nvar ch = [];\n// clone bufs\nvar cbfs = function (v) {\n    var tl = [];\n    for (var k in v) {\n        if (v[k].buffer) {\n            tl.push((v[k] = new v[k].constructor(v[k])).buffer);\n        }\n    }\n    return tl;\n};\n// use a worker to execute code\nvar wrkr = function (fns, init, id, cb) {\n    if (!ch[id]) {\n        var fnStr = '', td_1 = {}, m = fns.length - 1;\n        for (var i = 0; i < m; ++i)\n            fnStr = wcln(fns[i], fnStr, td_1);\n        ch[id] = { c: wcln(fns[m], fnStr, td_1), e: td_1 };\n    }\n    var td = mrg({}, ch[id].e);\n    return wk(ch[id].c + ';onmessage=function(e){for(var k in e.data)self[k]=e.data[k];onmessage=' + init.toString() + '}', id, td, cbfs(td), cb);\n};\n// base async inflate fn\nvar bInflt = function () { return [u8, u16, i32, fleb, fdeb, clim, fl, fd, flrm, fdrm, rev, ec, hMap, max, bits, bits16, shft, slc, err, inflt, inflateSync, pbf, gopt]; };\nvar bDflt = function () { return [u8, u16, i32, fleb, fdeb, clim, revfl, revfd, flm, flt, fdm, fdt, rev, deo, et, hMap, wbits, wbits16, hTree, ln, lc, clen, wfblk, wblk, shft, slc, dflt, dopt, deflateSync, pbf]; };\n// gzip extra\nvar gze = function () { return [gzh, gzhl, wbytes, crc, crct]; };\n// gunzip extra\nvar guze = function () { return [gzs, gzl]; };\n// zlib extra\nvar zle = function () { return [zlh, wbytes, adler]; };\n// unzlib extra\nvar zule = function () { return [zls]; };\n// post buf\nvar pbf = function (msg) { return postMessage(msg, [msg.buffer]); };\n// get opts\nvar gopt = function (o) { return o && {\n    out: o.size && new u8(o.size),\n    dictionary: o.dictionary\n}; };\n// async helper\nvar cbify = function (dat, opts, fns, init, id, cb) {\n    var w = wrkr(fns, init, id, function (err, dat) {\n        w.terminate();\n        cb(err, dat);\n    });\n    w.postMessage([dat, opts], opts.consume ? [dat.buffer] : []);\n    return function () { w.terminate(); };\n};\n// auto stream\nvar astrm = function (strm) {\n    strm.ondata = function (dat, final) { return postMessage([dat, final], [dat.buffer]); };\n    return function (ev) {\n        if (ev.data.length) {\n            strm.push(ev.data[0], ev.data[1]);\n            postMessage([ev.data[0].length]);\n        }\n        else\n            strm.flush();\n    };\n};\n// async stream attach\nvar astrmify = function (fns, strm, opts, init, id, flush, ext) {\n    var t;\n    var w = wrkr(fns, init, id, function (err, dat) {\n        if (err)\n            w.terminate(), strm.ondata.call(strm, err);\n        else if (!Array.isArray(dat))\n            ext(dat);\n        else if (dat.length == 1) {\n            strm.queuedSize -= dat[0];\n            if (strm.ondrain)\n                strm.ondrain(dat[0]);\n        }\n        else {\n            if (dat[1])\n                w.terminate();\n            strm.ondata.call(strm, err, dat[0], dat[1]);\n        }\n    });\n    w.postMessage(opts);\n    strm.queuedSize = 0;\n    strm.push = function (d, f) {\n        if (!strm.ondata)\n            err(5);\n        if (t)\n            strm.ondata(err(4, 0, 1), null, !!f);\n        strm.queuedSize += d.length;\n        w.postMessage([d, t = f], [d.buffer]);\n    };\n    strm.terminate = function () { w.terminate(); };\n    if (flush) {\n        strm.flush = function () { w.postMessage([]); };\n    }\n};\n// read 2 bytes\nvar b2 = function (d, b) { return d[b] | (d[b + 1] << 8); };\n// read 4 bytes\nvar b4 = function (d, b) { return (d[b] | (d[b + 1] << 8) | (d[b + 2] << 16) | (d[b + 3] << 24)) >>> 0; };\nvar b8 = function (d, b) { return b4(d, b) + (b4(d, b + 4) * 4294967296); };\n// write bytes\nvar wbytes = function (d, b, v) {\n    for (; v; ++b)\n        d[b] = v, v >>>= 8;\n};\n// gzip header\nvar gzh = function (c, o) {\n    var fn = o.filename;\n    c[0] = 31, c[1] = 139, c[2] = 8, c[8] = o.level < 2 ? 4 : o.level == 9 ? 2 : 0, c[9] = 3; // assume Unix\n    if (o.mtime != 0)\n        wbytes(c, 4, Math.floor(new Date(o.mtime || Date.now()) / 1000));\n    if (fn) {\n        c[3] = 8;\n        for (var i = 0; i <= fn.length; ++i)\n            c[i + 10] = fn.charCodeAt(i);\n    }\n};\n// gzip footer: -8 to -4 = CRC, -4 to -0 is length\n// gzip start\nvar gzs = function (d) {\n    if (d[0] != 31 || d[1] != 139 || d[2] != 8)\n        err(6, 'invalid gzip data');\n    var flg = d[3];\n    var st = 10;\n    if (flg & 4)\n        st += (d[10] | d[11] << 8) + 2;\n    for (var zs = (flg >> 3 & 1) + (flg >> 4 & 1); zs > 0; zs -= !d[st++])\n        ;\n    return st + (flg & 2);\n};\n// gzip length\nvar gzl = function (d) {\n    var l = d.length;\n    return (d[l - 4] | d[l - 3] << 8 | d[l - 2] << 16 | d[l - 1] << 24) >>> 0;\n};\n// gzip header length\nvar gzhl = function (o) { return 10 + (o.filename ? o.filename.length + 1 : 0); };\n// zlib header\nvar zlh = function (c, o) {\n    var lv = o.level, fl = lv == 0 ? 0 : lv < 6 ? 1 : lv == 9 ? 3 : 2;\n    c[0] = 120, c[1] = (fl << 6) | (o.dictionary && 32);\n    c[1] |= 31 - ((c[0] << 8) | c[1]) % 31;\n    if (o.dictionary) {\n        var h = adler();\n        h.p(o.dictionary);\n        wbytes(c, 2, h.d());\n    }\n};\n// zlib start\nvar zls = function (d, dict) {\n    if ((d[0] & 15) != 8 || (d[0] >> 4) > 7 || ((d[0] << 8 | d[1]) % 31))\n        err(6, 'invalid zlib data');\n    if ((d[1] >> 5 & 1) == +!dict)\n        err(6, 'invalid zlib data: ' + (d[1] & 32 ? 'need' : 'unexpected') + ' dictionary');\n    return (d[1] >> 3 & 4) + 2;\n};\nfunction StrmOpt(opts, cb) {\n    if (typeof opts == 'function')\n        cb = opts, opts = {};\n    this.ondata = cb;\n    return opts;\n}\n/**\n * Streaming DEFLATE compression\n */\nvar Deflate = /*#__PURE__*/ (function () {\n    function Deflate(opts, cb) {\n        if (typeof opts == 'function')\n            cb = opts, opts = {};\n        this.ondata = cb;\n        this.o = opts || {};\n        this.s = { l: 0, i: 32768, w: 32768, z: 32768 };\n        // Buffer length must always be 0 mod 32768 for index calculations to be correct when modifying head and prev\n        // 98304 = 32768 (lookback) + 65536 (common chunk size)\n        this.b = new u8(98304);\n        if (this.o.dictionary) {\n            var dict = this.o.dictionary.subarray(-32768);\n            this.b.set(dict, 32768 - dict.length);\n            this.s.i = 32768 - dict.length;\n        }\n    }\n    Deflate.prototype.p = function (c, f) {\n        this.ondata(dopt(c, this.o, 0, 0, this.s), f);\n    };\n    /**\n     * Pushes a chunk to be deflated\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Deflate.prototype.push = function (chunk, final) {\n        if (!this.ondata)\n            err(5);\n        if (this.s.l)\n            err(4);\n        var endLen = chunk.length + this.s.z;\n        if (endLen > this.b.length) {\n            if (endLen > 2 * this.b.length - 32768) {\n                var newBuf = new u8(endLen & -32768);\n                newBuf.set(this.b.subarray(0, this.s.z));\n                this.b = newBuf;\n            }\n            var split = this.b.length - this.s.z;\n            this.b.set(chunk.subarray(0, split), this.s.z);\n            this.s.z = this.b.length;\n            this.p(this.b, false);\n            this.b.set(this.b.subarray(-32768));\n            this.b.set(chunk.subarray(split), 32768);\n            this.s.z = chunk.length - split + 32768;\n            this.s.i = 32766, this.s.w = 32768;\n        }\n        else {\n            this.b.set(chunk, this.s.z);\n            this.s.z += chunk.length;\n        }\n        this.s.l = final & 1;\n        if (this.s.z > this.s.w + 8191 || final) {\n            this.p(this.b, final || false);\n            this.s.w = this.s.i, this.s.i -= 2;\n        }\n    };\n    /**\n     * Flushes buffered uncompressed data. Useful to immediately retrieve the\n     * deflated output for small inputs.\n     */\n    Deflate.prototype.flush = function () {\n        if (!this.ondata)\n            err(5);\n        if (this.s.l)\n            err(4);\n        this.p(this.b, false);\n        this.s.w = this.s.i, this.s.i -= 2;\n    };\n    return Deflate;\n}());\nexport { Deflate };\n/**\n * Asynchronous streaming DEFLATE compression\n */\nvar AsyncDeflate = /*#__PURE__*/ (function () {\n    function AsyncDeflate(opts, cb) {\n        astrmify([\n            bDflt,\n            function () { return [astrm, Deflate]; }\n        ], this, StrmOpt.call(this, opts, cb), function (ev) {\n            var strm = new Deflate(ev.data);\n            onmessage = astrm(strm);\n        }, 6, 1);\n    }\n    return AsyncDeflate;\n}());\nexport { AsyncDeflate };\nexport function deflate(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return cbify(data, opts, [\n        bDflt,\n    ], function (ev) { return pbf(deflateSync(ev.data[0], ev.data[1])); }, 0, cb);\n}\n/**\n * Compresses data with DEFLATE without any wrapper\n * @param data The data to compress\n * @param opts The compression options\n * @returns The deflated version of the data\n */\nexport function deflateSync(data, opts) {\n    return dopt(data, opts || {}, 0, 0);\n}\n/**\n * Streaming DEFLATE decompression\n */\nvar Inflate = /*#__PURE__*/ (function () {\n    function Inflate(opts, cb) {\n        // no StrmOpt here to avoid adding to workerizer\n        if (typeof opts == 'function')\n            cb = opts, opts = {};\n        this.ondata = cb;\n        var dict = opts && opts.dictionary && opts.dictionary.subarray(-32768);\n        this.s = { i: 0, b: dict ? dict.length : 0 };\n        this.o = new u8(32768);\n        this.p = new u8(0);\n        if (dict)\n            this.o.set(dict);\n    }\n    Inflate.prototype.e = function (c) {\n        if (!this.ondata)\n            err(5);\n        if (this.d)\n            err(4);\n        if (!this.p.length)\n            this.p = c;\n        else if (c.length) {\n            var n = new u8(this.p.length + c.length);\n            n.set(this.p), n.set(c, this.p.length), this.p = n;\n        }\n    };\n    Inflate.prototype.c = function (final) {\n        this.s.i = +(this.d = final || false);\n        var bts = this.s.b;\n        var dt = inflt(this.p, this.s, this.o);\n        this.ondata(slc(dt, bts, this.s.b), this.d);\n        this.o = slc(dt, this.s.b - 32768), this.s.b = this.o.length;\n        this.p = slc(this.p, (this.s.p / 8) | 0), this.s.p &= 7;\n    };\n    /**\n     * Pushes a chunk to be inflated\n     * @param chunk The chunk to push\n     * @param final Whether this is the final chunk\n     */\n    Inflate.prototype.push = function (chunk, final) {\n        this.e(chunk), this.c(final);\n    };\n    return Inflate;\n}());\nexport { Inflate };\n/**\n * Asynchronous streaming DEFLATE decompression\n */\nvar AsyncInflate = /*#__PURE__*/ (function () {\n    function AsyncInflate(opts, cb) {\n        astrmify([\n            bInflt,\n            function () { return [astrm, Inflate]; }\n        ], this, StrmOpt.call(this, opts, cb), function (ev) {\n            var strm = new Inflate(ev.data);\n            onmessage = astrm(strm);\n        }, 7, 0);\n    }\n    return AsyncInflate;\n}());\nexport { AsyncInflate };\nexport function inflate(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return cbify(data, opts, [\n        bInflt\n    ], function (ev) { return pbf(inflateSync(ev.data[0], gopt(ev.data[1]))); }, 1, cb);\n}\n/**\n * Expands DEFLATE data with no wrapper\n * @param data The data to decompress\n * @param opts The decompression options\n * @returns The decompressed version of the data\n */\nexport function inflateSync(data, opts) {\n    return inflt(data, { i: 2 }, opts && opts.out, opts && opts.dictionary);\n}\n// before you yell at me for not just using extends, my reason is that TS inheritance is hard to workerize.\n/**\n * Streaming GZIP compression\n */\nvar Gzip = /*#__PURE__*/ (function () {\n    function Gzip(opts, cb) {\n        this.c = crc();\n        this.l = 0;\n        this.v = 1;\n        Deflate.call(this, opts, cb);\n    }\n    /**\n     * Pushes a chunk to be GZIPped\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Gzip.prototype.push = function (chunk, final) {\n        this.c.p(chunk);\n        this.l += chunk.length;\n        Deflate.prototype.push.call(this, chunk, final);\n    };\n    Gzip.prototype.p = function (c, f) {\n        var raw = dopt(c, this.o, this.v && gzhl(this.o), f && 8, this.s);\n        if (this.v)\n            gzh(raw, this.o), this.v = 0;\n        if (f)\n            wbytes(raw, raw.length - 8, this.c.d()), wbytes(raw, raw.length - 4, this.l);\n        this.ondata(raw, f);\n    };\n    /**\n     * Flushes buffered uncompressed data. Useful to immediately retrieve the\n     * GZIPped output for small inputs.\n     */\n    Gzip.prototype.flush = function () {\n        Deflate.prototype.flush.call(this);\n    };\n    return Gzip;\n}());\nexport { Gzip };\n/**\n * Asynchronous streaming GZIP compression\n */\nvar AsyncGzip = /*#__PURE__*/ (function () {\n    function AsyncGzip(opts, cb) {\n        astrmify([\n            bDflt,\n            gze,\n            function () { return [astrm, Deflate, Gzip]; }\n        ], this, StrmOpt.call(this, opts, cb), function (ev) {\n            var strm = new Gzip(ev.data);\n            onmessage = astrm(strm);\n        }, 8, 1);\n    }\n    return AsyncGzip;\n}());\nexport { AsyncGzip };\nexport function gzip(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return cbify(data, opts, [\n        bDflt,\n        gze,\n        function () { return [gzipSync]; }\n    ], function (ev) { return pbf(gzipSync(ev.data[0], ev.data[1])); }, 2, cb);\n}\n/**\n * Compresses data with GZIP\n * @param data The data to compress\n * @param opts The compression options\n * @returns The gzipped version of the data\n */\nexport function gzipSync(data, opts) {\n    if (!opts)\n        opts = {};\n    var c = crc(), l = data.length;\n    c.p(data);\n    var d = dopt(data, opts, gzhl(opts), 8), s = d.length;\n    return gzh(d, opts), wbytes(d, s - 8, c.d()), wbytes(d, s - 4, l), d;\n}\n/**\n * Streaming single or multi-member GZIP decompression\n */\nvar Gunzip = /*#__PURE__*/ (function () {\n    function Gunzip(opts, cb) {\n        this.v = 1;\n        this.r = 0;\n        Inflate.call(this, opts, cb);\n    }\n    /**\n     * Pushes a chunk to be GUNZIPped\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Gunzip.prototype.push = function (chunk, final) {\n        Inflate.prototype.e.call(this, chunk);\n        this.r += chunk.length;\n        if (this.v) {\n            var p = this.p.subarray(this.v - 1);\n            var s = p.length > 3 ? gzs(p) : 4;\n            if (s > p.length) {\n                if (!final)\n                    return;\n            }\n            else if (this.v > 1 && this.onmember) {\n                this.onmember(this.r - p.length);\n            }\n            this.p = p.subarray(s), this.v = 0;\n        }\n        // necessary to prevent TS from using the closure value\n        // This allows for workerization to function correctly\n        Inflate.prototype.c.call(this, final);\n        // process concatenated GZIP\n        if (this.s.f && !this.s.l && !final) {\n            this.v = shft(this.s.p) + 9;\n            this.s = { i: 0 };\n            this.o = new u8(0);\n            this.push(new u8(0), final);\n        }\n    };\n    return Gunzip;\n}());\nexport { Gunzip };\n/**\n * Asynchronous streaming single or multi-member GZIP decompression\n */\nvar AsyncGunzip = /*#__PURE__*/ (function () {\n    function AsyncGunzip(opts, cb) {\n        var _this = this;\n        astrmify([\n            bInflt,\n            guze,\n            function () { return [astrm, Inflate, Gunzip]; }\n        ], this, StrmOpt.call(this, opts, cb), function (ev) {\n            var strm = new Gunzip(ev.data);\n            strm.onmember = function (offset) { return postMessage(offset); };\n            onmessage = astrm(strm);\n        }, 9, 0, function (offset) { return _this.onmember && _this.onmember(offset); });\n    }\n    return AsyncGunzip;\n}());\nexport { AsyncGunzip };\nexport function gunzip(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return cbify(data, opts, [\n        bInflt,\n        guze,\n        function () { return [gunzipSync]; }\n    ], function (ev) { return pbf(gunzipSync(ev.data[0], ev.data[1])); }, 3, cb);\n}\n/**\n * Expands GZIP data\n * @param data The data to decompress\n * @param opts The decompression options\n * @returns The decompressed version of the data\n */\nexport function gunzipSync(data, opts) {\n    var st = gzs(data);\n    if (st + 8 > data.length)\n        err(6, 'invalid gzip data');\n    return inflt(data.subarray(st, -8), { i: 2 }, opts && opts.out || new u8(gzl(data)), opts && opts.dictionary);\n}\n/**\n * Streaming Zlib compression\n */\nvar Zlib = /*#__PURE__*/ (function () {\n    function Zlib(opts, cb) {\n        this.c = adler();\n        this.v = 1;\n        Deflate.call(this, opts, cb);\n    }\n    /**\n     * Pushes a chunk to be zlibbed\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Zlib.prototype.push = function (chunk, final) {\n        this.c.p(chunk);\n        Deflate.prototype.push.call(this, chunk, final);\n    };\n    Zlib.prototype.p = function (c, f) {\n        var raw = dopt(c, this.o, this.v && (this.o.dictionary ? 6 : 2), f && 4, this.s);\n        if (this.v)\n            zlh(raw, this.o), this.v = 0;\n        if (f)\n            wbytes(raw, raw.length - 4, this.c.d());\n        this.ondata(raw, f);\n    };\n    /**\n     * Flushes buffered uncompressed data. Useful to immediately retrieve the\n     * zlibbed output for small inputs.\n     */\n    Zlib.prototype.flush = function () {\n        Deflate.prototype.flush.call(this);\n    };\n    return Zlib;\n}());\nexport { Zlib };\n/**\n * Asynchronous streaming Zlib compression\n */\nvar AsyncZlib = /*#__PURE__*/ (function () {\n    function AsyncZlib(opts, cb) {\n        astrmify([\n            bDflt,\n            zle,\n            function () { return [astrm, Deflate, Zlib]; }\n        ], this, StrmOpt.call(this, opts, cb), function (ev) {\n            var strm = new Zlib(ev.data);\n            onmessage = astrm(strm);\n        }, 10, 1);\n    }\n    return AsyncZlib;\n}());\nexport { AsyncZlib };\nexport function zlib(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return cbify(data, opts, [\n        bDflt,\n        zle,\n        function () { return [zlibSync]; }\n    ], function (ev) { return pbf(zlibSync(ev.data[0], ev.data[1])); }, 4, cb);\n}\n/**\n * Compress data with Zlib\n * @param data The data to compress\n * @param opts The compression options\n * @returns The zlib-compressed version of the data\n */\nexport function zlibSync(data, opts) {\n    if (!opts)\n        opts = {};\n    var a = adler();\n    a.p(data);\n    var d = dopt(data, opts, opts.dictionary ? 6 : 2, 4);\n    return zlh(d, opts), wbytes(d, d.length - 4, a.d()), d;\n}\n/**\n * Streaming Zlib decompression\n */\nvar Unzlib = /*#__PURE__*/ (function () {\n    function Unzlib(opts, cb) {\n        Inflate.call(this, opts, cb);\n        this.v = opts && opts.dictionary ? 2 : 1;\n    }\n    /**\n     * Pushes a chunk to be unzlibbed\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Unzlib.prototype.push = function (chunk, final) {\n        Inflate.prototype.e.call(this, chunk);\n        if (this.v) {\n            if (this.p.length < 6 && !final)\n                return;\n            this.p = this.p.subarray(zls(this.p, this.v - 1)), this.v = 0;\n        }\n        if (final) {\n            if (this.p.length < 4)\n                err(6, 'invalid zlib data');\n            this.p = this.p.subarray(0, -4);\n        }\n        // necessary to prevent TS from using the closure value\n        // This allows for workerization to function correctly\n        Inflate.prototype.c.call(this, final);\n    };\n    return Unzlib;\n}());\nexport { Unzlib };\n/**\n * Asynchronous streaming Zlib decompression\n */\nvar AsyncUnzlib = /*#__PURE__*/ (function () {\n    function AsyncUnzlib(opts, cb) {\n        astrmify([\n            bInflt,\n            zule,\n            function () { return [astrm, Inflate, Unzlib]; }\n        ], this, StrmOpt.call(this, opts, cb), function (ev) {\n            var strm = new Unzlib(ev.data);\n            onmessage = astrm(strm);\n        }, 11, 0);\n    }\n    return AsyncUnzlib;\n}());\nexport { AsyncUnzlib };\nexport function unzlib(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return cbify(data, opts, [\n        bInflt,\n        zule,\n        function () { return [unzlibSync]; }\n    ], function (ev) { return pbf(unzlibSync(ev.data[0], gopt(ev.data[1]))); }, 5, cb);\n}\n/**\n * Expands Zlib data\n * @param data The data to decompress\n * @param opts The decompression options\n * @returns The decompressed version of the data\n */\nexport function unzlibSync(data, opts) {\n    return inflt(data.subarray(zls(data, opts && opts.dictionary), -4), { i: 2 }, opts && opts.out, opts && opts.dictionary);\n}\n// Default algorithm for compression (used because having a known output size allows faster decompression)\nexport { gzip as compress, AsyncGzip as AsyncCompress };\nexport { gzipSync as compressSync, Gzip as Compress };\n/**\n * Streaming GZIP, Zlib, or raw DEFLATE decompression\n */\nvar Decompress = /*#__PURE__*/ (function () {\n    function Decompress(opts, cb) {\n        this.o = StrmOpt.call(this, opts, cb) || {};\n        this.G = Gunzip;\n        this.I = Inflate;\n        this.Z = Unzlib;\n    }\n    // init substream\n    // overriden by AsyncDecompress\n    Decompress.prototype.i = function () {\n        var _this = this;\n        this.s.ondata = function (dat, final) {\n            _this.ondata(dat, final);\n        };\n    };\n    /**\n     * Pushes a chunk to be decompressed\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Decompress.prototype.push = function (chunk, final) {\n        if (!this.ondata)\n            err(5);\n        if (!this.s) {\n            if (this.p && this.p.length) {\n                var n = new u8(this.p.length + chunk.length);\n                n.set(this.p), n.set(chunk, this.p.length);\n            }\n            else\n                this.p = chunk;\n            if (this.p.length > 2) {\n                this.s = (this.p[0] == 31 && this.p[1] == 139 && this.p[2] == 8)\n                    ? new this.G(this.o)\n                    : ((this.p[0] & 15) != 8 || (this.p[0] >> 4) > 7 || ((this.p[0] << 8 | this.p[1]) % 31))\n                        ? new this.I(this.o)\n                        : new this.Z(this.o);\n                this.i();\n                this.s.push(this.p, final);\n                this.p = null;\n            }\n        }\n        else\n            this.s.push(chunk, final);\n    };\n    return Decompress;\n}());\nexport { Decompress };\n/**\n * Asynchronous streaming GZIP, Zlib, or raw DEFLATE decompression\n */\nvar AsyncDecompress = /*#__PURE__*/ (function () {\n    function AsyncDecompress(opts, cb) {\n        Decompress.call(this, opts, cb);\n        this.queuedSize = 0;\n        this.G = AsyncGunzip;\n        this.I = AsyncInflate;\n        this.Z = AsyncUnzlib;\n    }\n    AsyncDecompress.prototype.i = function () {\n        var _this = this;\n        this.s.ondata = function (err, dat, final) {\n            _this.ondata(err, dat, final);\n        };\n        this.s.ondrain = function (size) {\n            _this.queuedSize -= size;\n            if (_this.ondrain)\n                _this.ondrain(size);\n        };\n    };\n    /**\n     * Pushes a chunk to be decompressed\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    AsyncDecompress.prototype.push = function (chunk, final) {\n        this.queuedSize += chunk.length;\n        Decompress.prototype.push.call(this, chunk, final);\n    };\n    return AsyncDecompress;\n}());\nexport { AsyncDecompress };\nexport function decompress(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return (data[0] == 31 && data[1] == 139 && data[2] == 8)\n        ? gunzip(data, opts, cb)\n        : ((data[0] & 15) != 8 || (data[0] >> 4) > 7 || ((data[0] << 8 | data[1]) % 31))\n            ? inflate(data, opts, cb)\n            : unzlib(data, opts, cb);\n}\n/**\n * Expands compressed GZIP, Zlib, or raw DEFLATE data, automatically detecting the format\n * @param data The data to decompress\n * @param opts The decompression options\n * @returns The decompressed version of the data\n */\nexport function decompressSync(data, opts) {\n    return (data[0] == 31 && data[1] == 139 && data[2] == 8)\n        ? gunzipSync(data, opts)\n        : ((data[0] & 15) != 8 || (data[0] >> 4) > 7 || ((data[0] << 8 | data[1]) % 31))\n            ? inflateSync(data, opts)\n            : unzlibSync(data, opts);\n}\n// flatten a directory structure\nvar fltn = function (d, p, t, o) {\n    for (var k in d) {\n        var val = d[k], n = p + k, op = o;\n        if (Array.isArray(val))\n            op = mrg(o, val[1]), val = val[0];\n        if (val instanceof u8)\n            t[n] = [val, op];\n        else {\n            t[n += '/'] = [new u8(0), op];\n            fltn(val, n, t, o);\n        }\n    }\n};\n// text encoder\nvar te = typeof TextEncoder != 'undefined' && /*#__PURE__*/ new TextEncoder();\n// text decoder\nvar td = typeof TextDecoder != 'undefined' && /*#__PURE__*/ new TextDecoder();\n// text decoder stream\nvar tds = 0;\ntry {\n    td.decode(et, { stream: true });\n    tds = 1;\n}\ncatch (e) { }\n// decode UTF8\nvar dutf8 = function (d) {\n    for (var r = '', i = 0;;) {\n        var c = d[i++];\n        var eb = (c > 127) + (c > 223) + (c > 239);\n        if (i + eb > d.length)\n            return { s: r, r: slc(d, i - 1) };\n        if (!eb)\n            r += String.fromCharCode(c);\n        else if (eb == 3) {\n            c = ((c & 15) << 18 | (d[i++] & 63) << 12 | (d[i++] & 63) << 6 | (d[i++] & 63)) - 65536,\n                r += String.fromCharCode(55296 | (c >> 10), 56320 | (c & 1023));\n        }\n        else if (eb & 1)\n            r += String.fromCharCode((c & 31) << 6 | (d[i++] & 63));\n        else\n            r += String.fromCharCode((c & 15) << 12 | (d[i++] & 63) << 6 | (d[i++] & 63));\n    }\n};\n/**\n * Streaming UTF-8 decoding\n */\nvar DecodeUTF8 = /*#__PURE__*/ (function () {\n    /**\n     * Creates a UTF-8 decoding stream\n     * @param cb The callback to call whenever data is decoded\n     */\n    function DecodeUTF8(cb) {\n        this.ondata = cb;\n        if (tds)\n            this.t = new TextDecoder();\n        else\n            this.p = et;\n    }\n    /**\n     * Pushes a chunk to be decoded from UTF-8 binary\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    DecodeUTF8.prototype.push = function (chunk, final) {\n        if (!this.ondata)\n            err(5);\n        final = !!final;\n        if (this.t) {\n            this.ondata(this.t.decode(chunk, { stream: true }), final);\n            if (final) {\n                if (this.t.decode().length)\n                    err(8);\n                this.t = null;\n            }\n            return;\n        }\n        if (!this.p)\n            err(4);\n        var dat = new u8(this.p.length + chunk.length);\n        dat.set(this.p);\n        dat.set(chunk, this.p.length);\n        var _a = dutf8(dat), s = _a.s, r = _a.r;\n        if (final) {\n            if (r.length)\n                err(8);\n            this.p = null;\n        }\n        else\n            this.p = r;\n        this.ondata(s, final);\n    };\n    return DecodeUTF8;\n}());\nexport { DecodeUTF8 };\n/**\n * Streaming UTF-8 encoding\n */\nvar EncodeUTF8 = /*#__PURE__*/ (function () {\n    /**\n     * Creates a UTF-8 decoding stream\n     * @param cb The callback to call whenever data is encoded\n     */\n    function EncodeUTF8(cb) {\n        this.ondata = cb;\n    }\n    /**\n     * Pushes a chunk to be encoded to UTF-8\n     * @param chunk The string data to push\n     * @param final Whether this is the last chunk\n     */\n    EncodeUTF8.prototype.push = function (chunk, final) {\n        if (!this.ondata)\n            err(5);\n        if (this.d)\n            err(4);\n        this.ondata(strToU8(chunk), this.d = final || false);\n    };\n    return EncodeUTF8;\n}());\nexport { EncodeUTF8 };\n/**\n * Converts a string into a Uint8Array for use with compression/decompression methods\n * @param str The string to encode\n * @param latin1 Whether or not to interpret the data as Latin-1. This should\n *               not need to be true unless decoding a binary string.\n * @returns The string encoded in UTF-8/Latin-1 binary\n */\nexport function strToU8(str, latin1) {\n    if (latin1) {\n        var ar_1 = new u8(str.length);\n        for (var i = 0; i < str.length; ++i)\n            ar_1[i] = str.charCodeAt(i);\n        return ar_1;\n    }\n    if (te)\n        return te.encode(str);\n    var l = str.length;\n    var ar = new u8(str.length + (str.length >> 1));\n    var ai = 0;\n    var w = function (v) { ar[ai++] = v; };\n    for (var i = 0; i < l; ++i) {\n        if (ai + 5 > ar.length) {\n            var n = new u8(ai + 8 + ((l - i) << 1));\n            n.set(ar);\n            ar = n;\n        }\n        var c = str.charCodeAt(i);\n        if (c < 128 || latin1)\n            w(c);\n        else if (c < 2048)\n            w(192 | (c >> 6)), w(128 | (c & 63));\n        else if (c > 55295 && c < 57344)\n            c = 65536 + (c & 1023 << 10) | (str.charCodeAt(++i) & 1023),\n                w(240 | (c >> 18)), w(128 | ((c >> 12) & 63)), w(128 | ((c >> 6) & 63)), w(128 | (c & 63));\n        else\n            w(224 | (c >> 12)), w(128 | ((c >> 6) & 63)), w(128 | (c & 63));\n    }\n    return slc(ar, 0, ai);\n}\n/**\n * Converts a Uint8Array to a string\n * @param dat The data to decode to string\n * @param latin1 Whether or not to interpret the data as Latin-1. This should\n *               not need to be true unless encoding to binary string.\n * @returns The original UTF-8/Latin-1 string\n */\nexport function strFromU8(dat, latin1) {\n    if (latin1) {\n        var r = '';\n        for (var i = 0; i < dat.length; i += 16384)\n            r += String.fromCharCode.apply(null, dat.subarray(i, i + 16384));\n        return r;\n    }\n    else if (td) {\n        return td.decode(dat);\n    }\n    else {\n        var _a = dutf8(dat), s = _a.s, r = _a.r;\n        if (r.length)\n            err(8);\n        return s;\n    }\n}\n;\n// deflate bit flag\nvar dbf = function (l) { return l == 1 ? 3 : l < 6 ? 2 : l == 9 ? 1 : 0; };\n// skip local zip header\nvar slzh = function (d, b) { return b + 30 + b2(d, b + 26) + b2(d, b + 28); };\n// read zip header\nvar zh = function (d, b, z) {\n    var fnl = b2(d, b + 28), fn = strFromU8(d.subarray(b + 46, b + 46 + fnl), !(b2(d, b + 8) & 2048)), es = b + 46 + fnl, bs = b4(d, b + 20);\n    var _a = z && bs == 4294967295 ? z64e(d, es) : [bs, b4(d, b + 24), b4(d, b + 42)], sc = _a[0], su = _a[1], off = _a[2];\n    return [b2(d, b + 10), sc, su, fn, es + b2(d, b + 30) + b2(d, b + 32), off];\n};\n// read zip64 extra field\nvar z64e = function (d, b) {\n    for (; b2(d, b) != 1; b += 4 + b2(d, b + 2))\n        ;\n    return [b8(d, b + 12), b8(d, b + 4), b8(d, b + 20)];\n};\n// extra field length\nvar exfl = function (ex) {\n    var le = 0;\n    if (ex) {\n        for (var k in ex) {\n            var l = ex[k].length;\n            if (l > 65535)\n                err(9);\n            le += l + 4;\n        }\n    }\n    return le;\n};\n// write zip header\nvar wzh = function (d, b, f, fn, u, c, ce, co) {\n    var fl = fn.length, ex = f.extra, col = co && co.length;\n    var exl = exfl(ex);\n    wbytes(d, b, ce != null ? 0x2014B50 : 0x4034B50), b += 4;\n    if (ce != null)\n        d[b++] = 20, d[b++] = f.os;\n    d[b] = 20, b += 2; // spec compliance? what's that?\n    d[b++] = (f.flag << 1) | (c < 0 && 8), d[b++] = u && 8;\n    d[b++] = f.compression & 255, d[b++] = f.compression >> 8;\n    var dt = new Date(f.mtime == null ? Date.now() : f.mtime), y = dt.getFullYear() - 1980;\n    if (y < 0 || y > 119)\n        err(10);\n    wbytes(d, b, (y << 25) | ((dt.getMonth() + 1) << 21) | (dt.getDate() << 16) | (dt.getHours() << 11) | (dt.getMinutes() << 5) | (dt.getSeconds() >> 1)), b += 4;\n    if (c != -1) {\n        wbytes(d, b, f.crc);\n        wbytes(d, b + 4, c < 0 ? -c - 2 : c);\n        wbytes(d, b + 8, f.size);\n    }\n    wbytes(d, b + 12, fl);\n    wbytes(d, b + 14, exl), b += 16;\n    if (ce != null) {\n        wbytes(d, b, col);\n        wbytes(d, b + 6, f.attrs);\n        wbytes(d, b + 10, ce), b += 14;\n    }\n    d.set(fn, b);\n    b += fl;\n    if (exl) {\n        for (var k in ex) {\n            var exf = ex[k], l = exf.length;\n            wbytes(d, b, +k);\n            wbytes(d, b + 2, l);\n            d.set(exf, b + 4), b += 4 + l;\n        }\n    }\n    if (col)\n        d.set(co, b), b += col;\n    return b;\n};\n// write zip footer (end of central directory)\nvar wzf = function (o, b, c, d, e) {\n    wbytes(o, b, 0x6054B50); // skip disk\n    wbytes(o, b + 8, c);\n    wbytes(o, b + 10, c);\n    wbytes(o, b + 12, d);\n    wbytes(o, b + 16, e);\n};\n/**\n * A pass-through stream to keep data uncompressed in a ZIP archive.\n */\nvar ZipPassThrough = /*#__PURE__*/ (function () {\n    /**\n     * Creates a pass-through stream that can be added to ZIP archives\n     * @param filename The filename to associate with this data stream\n     */\n    function ZipPassThrough(filename) {\n        this.filename = filename;\n        this.c = crc();\n        this.size = 0;\n        this.compression = 0;\n    }\n    /**\n     * Processes a chunk and pushes to the output stream. You can override this\n     * method in a subclass for custom behavior, but by default this passes\n     * the data through. You must call this.ondata(err, chunk, final) at some\n     * point in this method.\n     * @param chunk The chunk to process\n     * @param final Whether this is the last chunk\n     */\n    ZipPassThrough.prototype.process = function (chunk, final) {\n        this.ondata(null, chunk, final);\n    };\n    /**\n     * Pushes a chunk to be added. If you are subclassing this with a custom\n     * compression algorithm, note that you must push data from the source\n     * file only, pre-compression.\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    ZipPassThrough.prototype.push = function (chunk, final) {\n        if (!this.ondata)\n            err(5);\n        this.c.p(chunk);\n        this.size += chunk.length;\n        if (final)\n            this.crc = this.c.d();\n        this.process(chunk, final || false);\n    };\n    return ZipPassThrough;\n}());\nexport { ZipPassThrough };\n// I don't extend because TypeScript extension adds 1kB of runtime bloat\n/**\n * Streaming DEFLATE compression for ZIP archives. Prefer using AsyncZipDeflate\n * for better performance\n */\nvar ZipDeflate = /*#__PURE__*/ (function () {\n    /**\n     * Creates a DEFLATE stream that can be added to ZIP archives\n     * @param filename The filename to associate with this data stream\n     * @param opts The compression options\n     */\n    function ZipDeflate(filename, opts) {\n        var _this = this;\n        if (!opts)\n            opts = {};\n        ZipPassThrough.call(this, filename);\n        this.d = new Deflate(opts, function (dat, final) {\n            _this.ondata(null, dat, final);\n        });\n        this.compression = 8;\n        this.flag = dbf(opts.level);\n    }\n    ZipDeflate.prototype.process = function (chunk, final) {\n        try {\n            this.d.push(chunk, final);\n        }\n        catch (e) {\n            this.ondata(e, null, final);\n        }\n    };\n    /**\n     * Pushes a chunk to be deflated\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    ZipDeflate.prototype.push = function (chunk, final) {\n        ZipPassThrough.prototype.push.call(this, chunk, final);\n    };\n    return ZipDeflate;\n}());\nexport { ZipDeflate };\n/**\n * Asynchronous streaming DEFLATE compression for ZIP archives\n */\nvar AsyncZipDeflate = /*#__PURE__*/ (function () {\n    /**\n     * Creates an asynchronous DEFLATE stream that can be added to ZIP archives\n     * @param filename The filename to associate with this data stream\n     * @param opts The compression options\n     */\n    function AsyncZipDeflate(filename, opts) {\n        var _this = this;\n        if (!opts)\n            opts = {};\n        ZipPassThrough.call(this, filename);\n        this.d = new AsyncDeflate(opts, function (err, dat, final) {\n            _this.ondata(err, dat, final);\n        });\n        this.compression = 8;\n        this.flag = dbf(opts.level);\n        this.terminate = this.d.terminate;\n    }\n    AsyncZipDeflate.prototype.process = function (chunk, final) {\n        this.d.push(chunk, final);\n    };\n    /**\n     * Pushes a chunk to be deflated\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    AsyncZipDeflate.prototype.push = function (chunk, final) {\n        ZipPassThrough.prototype.push.call(this, chunk, final);\n    };\n    return AsyncZipDeflate;\n}());\nexport { AsyncZipDeflate };\n// TODO: Better tree shaking\n/**\n * A zippable archive to which files can incrementally be added\n */\nvar Zip = /*#__PURE__*/ (function () {\n    /**\n     * Creates an empty ZIP archive to which files can be added\n     * @param cb The callback to call whenever data for the generated ZIP archive\n     *           is available\n     */\n    function Zip(cb) {\n        this.ondata = cb;\n        this.u = [];\n        this.d = 1;\n    }\n    /**\n     * Adds a file to the ZIP archive\n     * @param file The file stream to add\n     */\n    Zip.prototype.add = function (file) {\n        var _this = this;\n        if (!this.ondata)\n            err(5);\n        // finishing or finished\n        if (this.d & 2)\n            this.ondata(err(4 + (this.d & 1) * 8, 0, 1), null, false);\n        else {\n            var f = strToU8(file.filename), fl_1 = f.length;\n            var com = file.comment, o = com && strToU8(com);\n            var u = fl_1 != file.filename.length || (o && (com.length != o.length));\n            var hl_1 = fl_1 + exfl(file.extra) + 30;\n            if (fl_1 > 65535)\n                this.ondata(err(11, 0, 1), null, false);\n            var header = new u8(hl_1);\n            wzh(header, 0, file, f, u, -1);\n            var chks_1 = [header];\n            var pAll_1 = function () {\n                for (var _i = 0, chks_2 = chks_1; _i < chks_2.length; _i++) {\n                    var chk = chks_2[_i];\n                    _this.ondata(null, chk, false);\n                }\n                chks_1 = [];\n            };\n            var tr_1 = this.d;\n            this.d = 0;\n            var ind_1 = this.u.length;\n            var uf_1 = mrg(file, {\n                f: f,\n                u: u,\n                o: o,\n                t: function () {\n                    if (file.terminate)\n                        file.terminate();\n                },\n                r: function () {\n                    pAll_1();\n                    if (tr_1) {\n                        var nxt = _this.u[ind_1 + 1];\n                        if (nxt)\n                            nxt.r();\n                        else\n                            _this.d = 1;\n                    }\n                    tr_1 = 1;\n                }\n            });\n            var cl_1 = 0;\n            file.ondata = function (err, dat, final) {\n                if (err) {\n                    _this.ondata(err, dat, final);\n                    _this.terminate();\n                }\n                else {\n                    cl_1 += dat.length;\n                    chks_1.push(dat);\n                    if (final) {\n                        var dd = new u8(16);\n                        wbytes(dd, 0, 0x8074B50);\n                        wbytes(dd, 4, file.crc);\n                        wbytes(dd, 8, cl_1);\n                        wbytes(dd, 12, file.size);\n                        chks_1.push(dd);\n                        uf_1.c = cl_1, uf_1.b = hl_1 + cl_1 + 16, uf_1.crc = file.crc, uf_1.size = file.size;\n                        if (tr_1)\n                            uf_1.r();\n                        tr_1 = 1;\n                    }\n                    else if (tr_1)\n                        pAll_1();\n                }\n            };\n            this.u.push(uf_1);\n        }\n    };\n    /**\n     * Ends the process of adding files and prepares to emit the final chunks.\n     * This *must* be called after adding all desired files for the resulting\n     * ZIP file to work properly.\n     */\n    Zip.prototype.end = function () {\n        var _this = this;\n        if (this.d & 2) {\n            this.ondata(err(4 + (this.d & 1) * 8, 0, 1), null, true);\n            return;\n        }\n        if (this.d)\n            this.e();\n        else\n            this.u.push({\n                r: function () {\n                    if (!(_this.d & 1))\n                        return;\n                    _this.u.splice(-1, 1);\n                    _this.e();\n                },\n                t: function () { }\n            });\n        this.d = 3;\n    };\n    Zip.prototype.e = function () {\n        var bt = 0, l = 0, tl = 0;\n        for (var _i = 0, _a = this.u; _i < _a.length; _i++) {\n            var f = _a[_i];\n            tl += 46 + f.f.length + exfl(f.extra) + (f.o ? f.o.length : 0);\n        }\n        var out = new u8(tl + 22);\n        for (var _b = 0, _c = this.u; _b < _c.length; _b++) {\n            var f = _c[_b];\n            wzh(out, bt, f, f.f, f.u, -f.c - 2, l, f.o);\n            bt += 46 + f.f.length + exfl(f.extra) + (f.o ? f.o.length : 0), l += f.b;\n        }\n        wzf(out, bt, this.u.length, tl, l);\n        this.ondata(null, out, true);\n        this.d = 2;\n    };\n    /**\n     * A method to terminate any internal workers used by the stream. Subsequent\n     * calls to add() will fail.\n     */\n    Zip.prototype.terminate = function () {\n        for (var _i = 0, _a = this.u; _i < _a.length; _i++) {\n            var f = _a[_i];\n            f.t();\n        }\n        this.d = 2;\n    };\n    return Zip;\n}());\nexport { Zip };\nexport function zip(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    var r = {};\n    fltn(data, '', r, opts);\n    var k = Object.keys(r);\n    var lft = k.length, o = 0, tot = 0;\n    var slft = lft, files = new Array(lft);\n    var term = [];\n    var tAll = function () {\n        for (var i = 0; i < term.length; ++i)\n            term[i]();\n    };\n    var cbd = function (a, b) {\n        mt(function () { cb(a, b); });\n    };\n    mt(function () { cbd = cb; });\n    var cbf = function () {\n        var out = new u8(tot + 22), oe = o, cdl = tot - o;\n        tot = 0;\n        for (var i = 0; i < slft; ++i) {\n            var f = files[i];\n            try {\n                var l = f.c.length;\n                wzh(out, tot, f, f.f, f.u, l);\n                var badd = 30 + f.f.length + exfl(f.extra);\n                var loc = tot + badd;\n                out.set(f.c, loc);\n                wzh(out, o, f, f.f, f.u, l, tot, f.m), o += 16 + badd + (f.m ? f.m.length : 0), tot = loc + l;\n            }\n            catch (e) {\n                return cbd(e, null);\n            }\n        }\n        wzf(out, o, files.length, cdl, oe);\n        cbd(null, out);\n    };\n    if (!lft)\n        cbf();\n    var _loop_1 = function (i) {\n        var fn = k[i];\n        var _a = r[fn], file = _a[0], p = _a[1];\n        var c = crc(), size = file.length;\n        c.p(file);\n        var f = strToU8(fn), s = f.length;\n        var com = p.comment, m = com && strToU8(com), ms = m && m.length;\n        var exl = exfl(p.extra);\n        var compression = p.level == 0 ? 0 : 8;\n        var cbl = function (e, d) {\n            if (e) {\n                tAll();\n                cbd(e, null);\n            }\n            else {\n                var l = d.length;\n                files[i] = mrg(p, {\n                    size: size,\n                    crc: c.d(),\n                    c: d,\n                    f: f,\n                    m: m,\n                    u: s != fn.length || (m && (com.length != ms)),\n                    compression: compression\n                });\n                o += 30 + s + exl + l;\n                tot += 76 + 2 * (s + exl) + (ms || 0) + l;\n                if (!--lft)\n                    cbf();\n            }\n        };\n        if (s > 65535)\n            cbl(err(11, 0, 1), null);\n        if (!compression)\n            cbl(null, file);\n        else if (size < 160000) {\n            try {\n                cbl(null, deflateSync(file, p));\n            }\n            catch (e) {\n                cbl(e, null);\n            }\n        }\n        else\n            term.push(deflate(file, p, cbl));\n    };\n    // Cannot use lft because it can decrease\n    for (var i = 0; i < slft; ++i) {\n        _loop_1(i);\n    }\n    return tAll;\n}\n/**\n * Synchronously creates a ZIP file. Prefer using `zip` for better performance\n * with more than one file.\n * @param data The directory structure for the ZIP archive\n * @param opts The main options, merged with per-file options\n * @returns The generated ZIP archive\n */\nexport function zipSync(data, opts) {\n    if (!opts)\n        opts = {};\n    var r = {};\n    var files = [];\n    fltn(data, '', r, opts);\n    var o = 0;\n    var tot = 0;\n    for (var fn in r) {\n        var _a = r[fn], file = _a[0], p = _a[1];\n        var compression = p.level == 0 ? 0 : 8;\n        var f = strToU8(fn), s = f.length;\n        var com = p.comment, m = com && strToU8(com), ms = m && m.length;\n        var exl = exfl(p.extra);\n        if (s > 65535)\n            err(11);\n        var d = compression ? deflateSync(file, p) : file, l = d.length;\n        var c = crc();\n        c.p(file);\n        files.push(mrg(p, {\n            size: file.length,\n            crc: c.d(),\n            c: d,\n            f: f,\n            m: m,\n            u: s != fn.length || (m && (com.length != ms)),\n            o: o,\n            compression: compression\n        }));\n        o += 30 + s + exl + l;\n        tot += 76 + 2 * (s + exl) + (ms || 0) + l;\n    }\n    var out = new u8(tot + 22), oe = o, cdl = tot - o;\n    for (var i = 0; i < files.length; ++i) {\n        var f = files[i];\n        wzh(out, f.o, f, f.f, f.u, f.c.length);\n        var badd = 30 + f.f.length + exfl(f.extra);\n        out.set(f.c, f.o + badd);\n        wzh(out, o, f, f.f, f.u, f.c.length, f.o, f.m), o += 16 + badd + (f.m ? f.m.length : 0);\n    }\n    wzf(out, o, files.length, cdl, oe);\n    return out;\n}\n/**\n * Streaming pass-through decompression for ZIP archives\n */\nvar UnzipPassThrough = /*#__PURE__*/ (function () {\n    function UnzipPassThrough() {\n    }\n    UnzipPassThrough.prototype.push = function (data, final) {\n        this.ondata(null, data, final);\n    };\n    UnzipPassThrough.compression = 0;\n    return UnzipPassThrough;\n}());\nexport { UnzipPassThrough };\n/**\n * Streaming DEFLATE decompression for ZIP archives. Prefer AsyncZipInflate for\n * better performance.\n */\nvar UnzipInflate = /*#__PURE__*/ (function () {\n    /**\n     * Creates a DEFLATE decompression that can be used in ZIP archives\n     */\n    function UnzipInflate() {\n        var _this = this;\n        this.i = new Inflate(function (dat, final) {\n            _this.ondata(null, dat, final);\n        });\n    }\n    UnzipInflate.prototype.push = function (data, final) {\n        try {\n            this.i.push(data, final);\n        }\n        catch (e) {\n            this.ondata(e, null, final);\n        }\n    };\n    UnzipInflate.compression = 8;\n    return UnzipInflate;\n}());\nexport { UnzipInflate };\n/**\n * Asynchronous streaming DEFLATE decompression for ZIP archives\n */\nvar AsyncUnzipInflate = /*#__PURE__*/ (function () {\n    /**\n     * Creates a DEFLATE decompression that can be used in ZIP archives\n     */\n    function AsyncUnzipInflate(_, sz) {\n        var _this = this;\n        if (sz < 320000) {\n            this.i = new Inflate(function (dat, final) {\n                _this.ondata(null, dat, final);\n            });\n        }\n        else {\n            this.i = new AsyncInflate(function (err, dat, final) {\n                _this.ondata(err, dat, final);\n            });\n            this.terminate = this.i.terminate;\n        }\n    }\n    AsyncUnzipInflate.prototype.push = function (data, final) {\n        if (this.i.terminate)\n            data = slc(data, 0);\n        this.i.push(data, final);\n    };\n    AsyncUnzipInflate.compression = 8;\n    return AsyncUnzipInflate;\n}());\nexport { AsyncUnzipInflate };\n/**\n * A ZIP archive decompression stream that emits files as they are discovered\n */\nvar Unzip = /*#__PURE__*/ (function () {\n    /**\n     * Creates a ZIP decompression stream\n     * @param cb The callback to call whenever a file in the ZIP archive is found\n     */\n    function Unzip(cb) {\n        this.onfile = cb;\n        this.k = [];\n        this.o = {\n            0: UnzipPassThrough\n        };\n        this.p = et;\n    }\n    /**\n     * Pushes a chunk to be unzipped\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Unzip.prototype.push = function (chunk, final) {\n        var _this = this;\n        if (!this.onfile)\n            err(5);\n        if (!this.p)\n            err(4);\n        if (this.c > 0) {\n            var len = Math.min(this.c, chunk.length);\n            var toAdd = chunk.subarray(0, len);\n            this.c -= len;\n            if (this.d)\n                this.d.push(toAdd, !this.c);\n            else\n                this.k[0].push(toAdd);\n            chunk = chunk.subarray(len);\n            if (chunk.length)\n                return this.push(chunk, final);\n        }\n        else {\n            var f = 0, i = 0, is = void 0, buf = void 0;\n            if (!this.p.length)\n                buf = chunk;\n            else if (!chunk.length)\n                buf = this.p;\n            else {\n                buf = new u8(this.p.length + chunk.length);\n                buf.set(this.p), buf.set(chunk, this.p.length);\n            }\n            var l = buf.length, oc = this.c, add = oc && this.d;\n            var _loop_2 = function () {\n                var _a;\n                var sig = b4(buf, i);\n                if (sig == 0x4034B50) {\n                    f = 1, is = i;\n                    this_1.d = null;\n                    this_1.c = 0;\n                    var bf = b2(buf, i + 6), cmp_1 = b2(buf, i + 8), u = bf & 2048, dd = bf & 8, fnl = b2(buf, i + 26), es = b2(buf, i + 28);\n                    if (l > i + 30 + fnl + es) {\n                        var chks_3 = [];\n                        this_1.k.unshift(chks_3);\n                        f = 2;\n                        var sc_1 = b4(buf, i + 18), su_1 = b4(buf, i + 22);\n                        var fn_1 = strFromU8(buf.subarray(i + 30, i += 30 + fnl), !u);\n                        if (sc_1 == 4294967295) {\n                            _a = dd ? [-2] : z64e(buf, i), sc_1 = _a[0], su_1 = _a[1];\n                        }\n                        else if (dd)\n                            sc_1 = -1;\n                        i += es;\n                        this_1.c = sc_1;\n                        var d_1;\n                        var file_1 = {\n                            name: fn_1,\n                            compression: cmp_1,\n                            start: function () {\n                                if (!file_1.ondata)\n                                    err(5);\n                                if (!sc_1)\n                                    file_1.ondata(null, et, true);\n                                else {\n                                    var ctr = _this.o[cmp_1];\n                                    if (!ctr)\n                                        file_1.ondata(err(14, 'unknown compression type ' + cmp_1, 1), null, false);\n                                    d_1 = sc_1 < 0 ? new ctr(fn_1) : new ctr(fn_1, sc_1, su_1);\n                                    d_1.ondata = function (err, dat, final) { file_1.ondata(err, dat, final); };\n                                    for (var _i = 0, chks_4 = chks_3; _i < chks_4.length; _i++) {\n                                        var dat = chks_4[_i];\n                                        d_1.push(dat, false);\n                                    }\n                                    if (_this.k[0] == chks_3 && _this.c)\n                                        _this.d = d_1;\n                                    else\n                                        d_1.push(et, true);\n                                }\n                            },\n                            terminate: function () {\n                                if (d_1 && d_1.terminate)\n                                    d_1.terminate();\n                            }\n                        };\n                        if (sc_1 >= 0)\n                            file_1.size = sc_1, file_1.originalSize = su_1;\n                        this_1.onfile(file_1);\n                    }\n                    return \"break\";\n                }\n                else if (oc) {\n                    if (sig == 0x8074B50) {\n                        is = i += 12 + (oc == -2 && 8), f = 3, this_1.c = 0;\n                        return \"break\";\n                    }\n                    else if (sig == 0x2014B50) {\n                        is = i -= 4, f = 3, this_1.c = 0;\n                        return \"break\";\n                    }\n                }\n            };\n            var this_1 = this;\n            for (; i < l - 4; ++i) {\n                var state_1 = _loop_2();\n                if (state_1 === \"break\")\n                    break;\n            }\n            this.p = et;\n            if (oc < 0) {\n                var dat = f ? buf.subarray(0, is - 12 - (oc == -2 && 8) - (b4(buf, is - 16) == 0x8074B50 && 4)) : buf.subarray(0, i);\n                if (add)\n                    add.push(dat, !!f);\n                else\n                    this.k[+(f == 2)].push(dat);\n            }\n            if (f & 2)\n                return this.push(buf.subarray(i), final);\n            this.p = buf.subarray(i);\n        }\n        if (final) {\n            if (this.c)\n                err(13);\n            this.p = null;\n        }\n    };\n    /**\n     * Registers a decoder with the stream, allowing for files compressed with\n     * the compression type provided to be expanded correctly\n     * @param decoder The decoder constructor\n     */\n    Unzip.prototype.register = function (decoder) {\n        this.o[decoder.compression] = decoder;\n    };\n    return Unzip;\n}());\nexport { Unzip };\nvar mt = typeof queueMicrotask == 'function' ? queueMicrotask : typeof setTimeout == 'function' ? setTimeout : function (fn) { fn(); };\nexport function unzip(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    var term = [];\n    var tAll = function () {\n        for (var i = 0; i < term.length; ++i)\n            term[i]();\n    };\n    var files = {};\n    var cbd = function (a, b) {\n        mt(function () { cb(a, b); });\n    };\n    mt(function () { cbd = cb; });\n    var e = data.length - 22;\n    for (; b4(data, e) != 0x6054B50; --e) {\n        if (!e || data.length - e > 65558) {\n            cbd(err(13, 0, 1), null);\n            return tAll;\n        }\n    }\n    ;\n    var lft = b2(data, e + 8);\n    if (lft) {\n        var c = lft;\n        var o = b4(data, e + 16);\n        var z = o == 4294967295 || c == 65535;\n        if (z) {\n            var ze = b4(data, e - 12);\n            z = b4(data, ze) == 0x6064B50;\n            if (z) {\n                c = lft = b4(data, ze + 32);\n                o = b4(data, ze + 48);\n            }\n        }\n        var fltr = opts && opts.filter;\n        var _loop_3 = function (i) {\n            var _a = zh(data, o, z), c_1 = _a[0], sc = _a[1], su = _a[2], fn = _a[3], no = _a[4], off = _a[5], b = slzh(data, off);\n            o = no;\n            var cbl = function (e, d) {\n                if (e) {\n                    tAll();\n                    cbd(e, null);\n                }\n                else {\n                    if (d)\n                        files[fn] = d;\n                    if (!--lft)\n                        cbd(null, files);\n                }\n            };\n            if (!fltr || fltr({\n                name: fn,\n                size: sc,\n                originalSize: su,\n                compression: c_1\n            })) {\n                if (!c_1)\n                    cbl(null, slc(data, b, b + sc));\n                else if (c_1 == 8) {\n                    var infl = data.subarray(b, b + sc);\n                    // Synchronously decompress under 512KB, or barely-compressed data\n                    if (su < 524288 || sc > 0.8 * su) {\n                        try {\n                            cbl(null, inflateSync(infl, { out: new u8(su) }));\n                        }\n                        catch (e) {\n                            cbl(e, null);\n                        }\n                    }\n                    else\n                        term.push(inflate(infl, { size: su }, cbl));\n                }\n                else\n                    cbl(err(14, 'unknown compression type ' + c_1, 1), null);\n            }\n            else\n                cbl(null, null);\n        };\n        for (var i = 0; i < c; ++i) {\n            _loop_3(i);\n        }\n    }\n    else\n        cbd(null, {});\n    return tAll;\n}\n/**\n * Synchronously decompresses a ZIP archive. Prefer using `unzip` for better\n * performance with more than one file.\n * @param data The raw compressed ZIP file\n * @param opts The ZIP extraction options\n * @returns The decompressed files\n */\nexport function unzipSync(data, opts) {\n    var files = {};\n    var e = data.length - 22;\n    for (; b4(data, e) != 0x6054B50; --e) {\n        if (!e || data.length - e > 65558)\n            err(13);\n    }\n    ;\n    var c = b2(data, e + 8);\n    if (!c)\n        return {};\n    var o = b4(data, e + 16);\n    var z = o == 4294967295 || c == 65535;\n    if (z) {\n        var ze = b4(data, e - 12);\n        z = b4(data, ze) == 0x6064B50;\n        if (z) {\n            c = b4(data, ze + 32);\n            o = b4(data, ze + 48);\n        }\n    }\n    var fltr = opts && opts.filter;\n    for (var i = 0; i < c; ++i) {\n        var _a = zh(data, o, z), c_2 = _a[0], sc = _a[1], su = _a[2], fn = _a[3], no = _a[4], off = _a[5], b = slzh(data, off);\n        o = no;\n        if (!fltr || fltr({\n            name: fn,\n            size: sc,\n            originalSize: su,\n            compression: c_2\n        })) {\n            if (!c_2)\n                files[fn] = slc(data, b, b + sc);\n            else if (c_2 == 8)\n                files[fn] = inflateSync(data.subarray(b, b + sc), { out: new u8(su) });\n            else\n                err(14, 'unknown compression type ' + c_2);\n        }\n    }\n    return files;\n}\n","import { deflateSync, inflateSync, strFromU8, strToU8 } from 'fflate'\n\nexport type SyncStorage = Pick<Storage, 'getItem' | 'setItem' | 'removeItem'>\n\nconst RAW_PREFIX = 'storage:raw:'\nconst DEFLATE_PREFIX = 'storage:deflate:v1:'\n\nconst isProbablyJson = (value: string) => {\n  if (!value) return false\n  const c = value.charCodeAt(0)\n  // { [ \" digits, t/f/n (true/false/null)\n  return (\n    c === 123 ||\n    c === 91 ||\n    c === 34 ||\n    (c >= 48 && c <= 57) ||\n    c === 45 ||\n    c === 116 ||\n    c === 102 ||\n    c === 110\n  )\n}\n\nconst u8ToBase64 = (bytes: Uint8Array) => {\n  let binary = ''\n  const chunkSize = 0x8000\n  for (let i = 0; i < bytes.length; i += chunkSize) {\n    binary += String.fromCharCode(...bytes.subarray(i, i + chunkSize))\n  }\n  return btoa(binary)\n}\n\nconst base64ToU8 = (base64: string) => {\n  const binary = atob(base64)\n  const bytes = new Uint8Array(binary.length)\n  for (let i = 0; i < binary.length; i++) {\n    bytes[i] = binary.charCodeAt(i)\n  }\n  return bytes\n}\n\ntype CompressedStorageOptions = {\n  minSizeToCompress?: number\n  deflateLevel?: 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9\n  writeDebounceMs?: number\n}\n\nconst createCompressedStorage = (\n  base: SyncStorage,\n  options: CompressedStorageOptions = {},\n): SyncStorage => {\n  const {\n    minSizeToCompress = 1024,\n    deflateLevel = 1,\n    writeDebounceMs = 50,\n  } = options\n\n  const pendingWrites = new Map<string, string>()\n  let flushTimer: number | undefined\n  let lifecycleHooksInstalled = false\n\n  const flush = () => {\n    flushTimer = undefined\n    for (const [key, value] of pendingWrites) {\n      try {\n        if (value.length < minSizeToCompress) {\n          base.setItem(key, RAW_PREFIX + value)\n          continue\n        }\n\n        const input = strToU8(value)\n        const compressed = deflateSync(input, { level: deflateLevel })\n        base.setItem(key, DEFLATE_PREFIX + u8ToBase64(compressed))\n      } catch (error) {\n        console.error('Error setting item:', error)\n        try {\n          base.setItem(key, RAW_PREFIX + value)\n        } catch {\n          // ignore\n        }\n      }\n    }\n    pendingWrites.clear()\n  }\n\n  const scheduleFlush = () => {\n    if (flushTimer != null) return\n    if (!lifecycleHooksInstalled && typeof window !== 'undefined') {\n      lifecycleHooksInstalled = true\n      window.addEventListener('beforeunload', flush)\n      document.addEventListener('visibilitychange', () => {\n        if (document.visibilityState === 'hidden') flush()\n      })\n    }\n    flushTimer = globalThis.setTimeout(\n      flush,\n      writeDebounceMs,\n    ) as unknown as number\n  }\n\n  return {\n    getItem: (key: string): string | null => {\n      try {\n        const stored = base.getItem(key)\n        if (!stored) return null\n\n        if (stored.startsWith(RAW_PREFIX)) {\n          return stored.slice(RAW_PREFIX.length)\n        }\n\n        if (stored.startsWith(DEFLATE_PREFIX)) {\n          const b64 = stored.slice(DEFLATE_PREFIX.length)\n          const bytes = base64ToU8(b64)\n          const decompressed = inflateSync(bytes)\n          return strFromU8(decompressed)\n        }\n\n        // Back-compat: older versions may have stored raw JSON without any prefix\n        if (isProbablyJson(stored)) return stored\n\n        return null\n      } catch (error) {\n        console.error('Error getting item:', error)\n        return null\n      }\n    },\n\n    setItem: (key: string, value: string) => {\n      try {\n        // Some upstream serializers can return `undefined` (e.g. JSON.stringify(undefined)).\n        const rawValue = value as unknown as string | null | undefined\n        if (rawValue == null) {\n          pendingWrites.delete(key)\n          base.removeItem(key)\n          return\n        }\n\n        const stringValue = typeof rawValue === 'string' ? rawValue : String(rawValue)\n        pendingWrites.set(key, stringValue)\n        scheduleFlush()\n      } catch (error) {\n        console.error('Error setting item:', error)\n      }\n    },\n\n    removeItem: (key: string) => {\n      try {\n        pendingWrites.delete(key)\n        base.removeItem(key)\n      } catch (error) {\n        console.error('Error removing item:', error)\n      }\n    },\n  }\n}\n\nconst baseStorage: SyncStorage = {\n  getItem: (key) => {\n    if (typeof localStorage === 'undefined') return null\n    return localStorage.getItem(key)\n  },\n  setItem: (key, value) => {\n    if (typeof localStorage === 'undefined') return\n    localStorage.setItem(key, value)\n  },\n  removeItem: (key) => {\n    if (typeof localStorage === 'undefined') return\n    localStorage.removeItem(key)\n  },\n}\n\nexport let storage: SyncStorage = createCompressedStorage(baseStorage)\n\nexport const setCustomStorage = (newStorage: SyncStorage) => {\n  storage = newStorage\n}\n","function hasInitialValue(atom) {\n  return \"init\" in atom;\n}\nfunction isActuallyWritableAtom(atom) {\n  return !!atom.write;\n}\nfunction isAtomStateInitialized(atomState) {\n  return \"v\" in atomState || \"e\" in atomState;\n}\nfunction returnAtomValue(atomState) {\n  if (\"e\" in atomState) {\n    throw atomState.e;\n  }\n  if ((import.meta.env ? import.meta.env.MODE : void 0) !== \"production\" && !(\"v\" in atomState)) {\n    throw new Error(\"[Bug] atom state is not initialized\");\n  }\n  return atomState.v;\n}\nconst promiseStateMap = /* @__PURE__ */ new WeakMap();\nfunction isPendingPromise(value) {\n  var _a;\n  return isPromiseLike(value) && !!((_a = promiseStateMap.get(value)) == null ? void 0 : _a[0]);\n}\nfunction abortPromise(promise) {\n  const promiseState = promiseStateMap.get(promise);\n  if (promiseState == null ? void 0 : promiseState[0]) {\n    promiseState[0] = false;\n    promiseState[1].forEach((fn) => fn());\n  }\n}\nfunction registerAbortHandler(promise, abortHandler) {\n  let promiseState = promiseStateMap.get(promise);\n  if (!promiseState) {\n    promiseState = [true, /* @__PURE__ */ new Set()];\n    promiseStateMap.set(promise, promiseState);\n    const settle = () => {\n      promiseState[0] = false;\n    };\n    promise.then(settle, settle);\n  }\n  promiseState[1].add(abortHandler);\n}\nfunction isPromiseLike(p) {\n  return typeof (p == null ? void 0 : p.then) === \"function\";\n}\nfunction addPendingPromiseToDependency(atom, promise, dependencyAtomState) {\n  if (!dependencyAtomState.p.has(atom)) {\n    dependencyAtomState.p.add(atom);\n    const cleanup = () => dependencyAtomState.p.delete(atom);\n    promise.then(cleanup, cleanup);\n  }\n}\nfunction getMountedOrPendingDependents(atom, atomState, mountedMap) {\n  var _a;\n  const dependents = /* @__PURE__ */ new Set();\n  for (const a of ((_a = mountedMap.get(atom)) == null ? void 0 : _a.t) || []) {\n    if (mountedMap.has(a)) {\n      dependents.add(a);\n    }\n  }\n  for (const atomWithPendingPromise of atomState.p) {\n    dependents.add(atomWithPendingPromise);\n  }\n  return dependents;\n}\nconst createStoreHook = () => {\n  const callbacks = /* @__PURE__ */ new Set();\n  const notify = () => callbacks.forEach((fn) => fn());\n  notify.add = (fn) => {\n    callbacks.add(fn);\n    return () => callbacks.delete(fn);\n  };\n  return notify;\n};\nconst createStoreHookForAtoms = () => {\n  const all = {};\n  const callbacks = /* @__PURE__ */ new WeakMap();\n  const notify = (atom) => {\n    var _a, _b;\n    (_a = callbacks.get(all)) == null ? void 0 : _a.forEach((fn) => fn(atom));\n    (_b = callbacks.get(atom)) == null ? void 0 : _b.forEach((fn) => fn());\n  };\n  notify.add = (atom, fn) => {\n    const key = atom || all;\n    const fns = (callbacks.has(key) ? callbacks : callbacks.set(key, /* @__PURE__ */ new Set())).get(key);\n    fns.add(fn);\n    return () => {\n      fns == null ? void 0 : fns.delete(fn);\n      if (!fns.size) {\n        callbacks.delete(key);\n      }\n    };\n  };\n  return notify;\n};\nfunction initializeStoreHooks(storeHooks) {\n  storeHooks.r || (storeHooks.r = createStoreHookForAtoms());\n  storeHooks.c || (storeHooks.c = createStoreHookForAtoms());\n  storeHooks.m || (storeHooks.m = createStoreHookForAtoms());\n  storeHooks.u || (storeHooks.u = createStoreHookForAtoms());\n  storeHooks.f || (storeHooks.f = createStoreHook());\n  return storeHooks;\n}\nconst atomRead = (_store, atom, ...params) => atom.read(...params);\nconst atomWrite = (_store, atom, ...params) => atom.write(...params);\nconst atomOnInit = (store, atom) => {\n  var _a;\n  return (_a = atom.unstable_onInit) == null ? void 0 : _a.call(atom, store);\n};\nconst atomOnMount = (_store, atom, setAtom) => {\n  var _a;\n  return (_a = atom.onMount) == null ? void 0 : _a.call(atom, setAtom);\n};\nconst ensureAtomState = (store, atom) => {\n  const buildingBlocks = getInternalBuildingBlocks(store);\n  const atomStateMap = buildingBlocks[0];\n  const atomOnInit2 = buildingBlocks[9];\n  if ((import.meta.env ? import.meta.env.MODE : void 0) !== \"production\" && !atom) {\n    throw new Error(\"Atom is undefined or null\");\n  }\n  let atomState = atomStateMap.get(atom);\n  if (!atomState) {\n    atomState = { d: /* @__PURE__ */ new Map(), p: /* @__PURE__ */ new Set(), n: 0 };\n    atomStateMap.set(atom, atomState);\n    atomOnInit2 == null ? void 0 : atomOnInit2(store, atom);\n  }\n  return atomState;\n};\nconst flushCallbacks = (store) => {\n  const buildingBlocks = getInternalBuildingBlocks(store);\n  const mountedMap = buildingBlocks[1];\n  const changedAtoms = buildingBlocks[3];\n  const mountCallbacks = buildingBlocks[4];\n  const unmountCallbacks = buildingBlocks[5];\n  const storeHooks = buildingBlocks[6];\n  const recomputeInvalidatedAtoms2 = buildingBlocks[13];\n  const errors = [];\n  const call = (fn) => {\n    try {\n      fn();\n    } catch (e) {\n      errors.push(e);\n    }\n  };\n  do {\n    if (storeHooks.f) {\n      call(storeHooks.f);\n    }\n    const callbacks = /* @__PURE__ */ new Set();\n    const add = callbacks.add.bind(callbacks);\n    changedAtoms.forEach((atom) => {\n      var _a;\n      return (_a = mountedMap.get(atom)) == null ? void 0 : _a.l.forEach(add);\n    });\n    changedAtoms.clear();\n    unmountCallbacks.forEach(add);\n    unmountCallbacks.clear();\n    mountCallbacks.forEach(add);\n    mountCallbacks.clear();\n    callbacks.forEach(call);\n    if (changedAtoms.size) {\n      recomputeInvalidatedAtoms2(store);\n    }\n  } while (changedAtoms.size || unmountCallbacks.size || mountCallbacks.size);\n  if (errors.length) {\n    throw new AggregateError(errors);\n  }\n};\nconst recomputeInvalidatedAtoms = (store) => {\n  const buildingBlocks = getInternalBuildingBlocks(store);\n  const mountedMap = buildingBlocks[1];\n  const invalidatedAtoms = buildingBlocks[2];\n  const changedAtoms = buildingBlocks[3];\n  const ensureAtomState2 = buildingBlocks[11];\n  const readAtomState2 = buildingBlocks[14];\n  const mountDependencies2 = buildingBlocks[17];\n  const topSortedReversed = [];\n  const visiting = /* @__PURE__ */ new WeakSet();\n  const visited = /* @__PURE__ */ new WeakSet();\n  const stack = Array.from(changedAtoms);\n  while (stack.length) {\n    const a = stack[stack.length - 1];\n    const aState = ensureAtomState2(store, a);\n    if (visited.has(a)) {\n      stack.pop();\n      continue;\n    }\n    if (visiting.has(a)) {\n      if (invalidatedAtoms.get(a) === aState.n) {\n        topSortedReversed.push([a, aState]);\n      } else if ((import.meta.env ? import.meta.env.MODE : void 0) !== \"production\" && invalidatedAtoms.has(a)) {\n        throw new Error(\"[Bug] invalidated atom exists\");\n      }\n      visited.add(a);\n      stack.pop();\n      continue;\n    }\n    visiting.add(a);\n    for (const d of getMountedOrPendingDependents(a, aState, mountedMap)) {\n      if (!visiting.has(d)) {\n        stack.push(d);\n      }\n    }\n  }\n  for (let i = topSortedReversed.length - 1; i >= 0; --i) {\n    const [a, aState] = topSortedReversed[i];\n    let hasChangedDeps = false;\n    for (const dep of aState.d.keys()) {\n      if (dep !== a && changedAtoms.has(dep)) {\n        hasChangedDeps = true;\n        break;\n      }\n    }\n    if (hasChangedDeps) {\n      readAtomState2(store, a);\n      mountDependencies2(store, a);\n    }\n    invalidatedAtoms.delete(a);\n  }\n};\nconst readAtomState = (store, atom) => {\n  var _a, _b;\n  const buildingBlocks = getInternalBuildingBlocks(store);\n  const mountedMap = buildingBlocks[1];\n  const invalidatedAtoms = buildingBlocks[2];\n  const changedAtoms = buildingBlocks[3];\n  const storeHooks = buildingBlocks[6];\n  const atomRead2 = buildingBlocks[7];\n  const ensureAtomState2 = buildingBlocks[11];\n  const flushCallbacks2 = buildingBlocks[12];\n  const recomputeInvalidatedAtoms2 = buildingBlocks[13];\n  const readAtomState2 = buildingBlocks[14];\n  const writeAtomState2 = buildingBlocks[16];\n  const mountDependencies2 = buildingBlocks[17];\n  const atomState = ensureAtomState2(store, atom);\n  if (isAtomStateInitialized(atomState)) {\n    if (mountedMap.has(atom) && invalidatedAtoms.get(atom) !== atomState.n) {\n      return atomState;\n    }\n    if (Array.from(atomState.d).every(\n      ([a, n]) => (\n        // Recursively, read the atom state of the dependency, and\n        // check if the atom epoch number is unchanged\n        readAtomState2(store, a).n === n\n      )\n    )) {\n      return atomState;\n    }\n  }\n  atomState.d.clear();\n  let isSync = true;\n  function mountDependenciesIfAsync() {\n    if (mountedMap.has(atom)) {\n      mountDependencies2(store, atom);\n      recomputeInvalidatedAtoms2(store);\n      flushCallbacks2(store);\n    }\n  }\n  function getter(a) {\n    var _a2;\n    if (a === atom) {\n      const aState2 = ensureAtomState2(store, a);\n      if (!isAtomStateInitialized(aState2)) {\n        if (hasInitialValue(a)) {\n          setAtomStateValueOrPromise(store, a, a.init);\n        } else {\n          throw new Error(\"no atom init\");\n        }\n      }\n      return returnAtomValue(aState2);\n    }\n    const aState = readAtomState2(store, a);\n    try {\n      return returnAtomValue(aState);\n    } finally {\n      atomState.d.set(a, aState.n);\n      if (isPendingPromise(atomState.v)) {\n        addPendingPromiseToDependency(atom, atomState.v, aState);\n      }\n      (_a2 = mountedMap.get(a)) == null ? void 0 : _a2.t.add(atom);\n      if (!isSync) {\n        mountDependenciesIfAsync();\n      }\n    }\n  }\n  let controller;\n  let setSelf;\n  const options = {\n    get signal() {\n      if (!controller) {\n        controller = new AbortController();\n      }\n      return controller.signal;\n    },\n    get setSelf() {\n      if ((import.meta.env ? import.meta.env.MODE : void 0) !== \"production\" && !isActuallyWritableAtom(atom)) {\n        console.warn(\"setSelf function cannot be used with read-only atom\");\n      }\n      if (!setSelf && isActuallyWritableAtom(atom)) {\n        setSelf = (...args) => {\n          if ((import.meta.env ? import.meta.env.MODE : void 0) !== \"production\" && isSync) {\n            console.warn(\"setSelf function cannot be called in sync\");\n          }\n          if (!isSync) {\n            try {\n              return writeAtomState2(store, atom, ...args);\n            } finally {\n              recomputeInvalidatedAtoms2(store);\n              flushCallbacks2(store);\n            }\n          }\n        };\n      }\n      return setSelf;\n    }\n  };\n  const prevEpochNumber = atomState.n;\n  try {\n    const valueOrPromise = atomRead2(store, atom, getter, options);\n    setAtomStateValueOrPromise(store, atom, valueOrPromise);\n    if (isPromiseLike(valueOrPromise)) {\n      registerAbortHandler(valueOrPromise, () => controller == null ? void 0 : controller.abort());\n      valueOrPromise.then(mountDependenciesIfAsync, mountDependenciesIfAsync);\n    }\n    (_a = storeHooks.r) == null ? void 0 : _a.call(storeHooks, atom);\n    return atomState;\n  } catch (error) {\n    delete atomState.v;\n    atomState.e = error;\n    ++atomState.n;\n    return atomState;\n  } finally {\n    isSync = false;\n    if (prevEpochNumber !== atomState.n && invalidatedAtoms.get(atom) === prevEpochNumber) {\n      invalidatedAtoms.set(atom, atomState.n);\n      changedAtoms.add(atom);\n      (_b = storeHooks.c) == null ? void 0 : _b.call(storeHooks, atom);\n    }\n  }\n};\nconst invalidateDependents = (store, atom) => {\n  const buildingBlocks = getInternalBuildingBlocks(store);\n  const mountedMap = buildingBlocks[1];\n  const invalidatedAtoms = buildingBlocks[2];\n  const ensureAtomState2 = buildingBlocks[11];\n  const stack = [atom];\n  while (stack.length) {\n    const a = stack.pop();\n    const aState = ensureAtomState2(store, a);\n    for (const d of getMountedOrPendingDependents(a, aState, mountedMap)) {\n      const dState = ensureAtomState2(store, d);\n      invalidatedAtoms.set(d, dState.n);\n      stack.push(d);\n    }\n  }\n};\nconst writeAtomState = (store, atom, ...args) => {\n  const buildingBlocks = getInternalBuildingBlocks(store);\n  const changedAtoms = buildingBlocks[3];\n  const storeHooks = buildingBlocks[6];\n  const atomWrite2 = buildingBlocks[8];\n  const ensureAtomState2 = buildingBlocks[11];\n  const flushCallbacks2 = buildingBlocks[12];\n  const recomputeInvalidatedAtoms2 = buildingBlocks[13];\n  const readAtomState2 = buildingBlocks[14];\n  const invalidateDependents2 = buildingBlocks[15];\n  const mountDependencies2 = buildingBlocks[17];\n  let isSync = true;\n  const getter = (a) => returnAtomValue(readAtomState2(store, a));\n  const setter = (a, ...args2) => {\n    var _a;\n    const aState = ensureAtomState2(store, a);\n    try {\n      if (a === atom) {\n        if (!hasInitialValue(a)) {\n          throw new Error(\"atom not writable\");\n        }\n        const prevEpochNumber = aState.n;\n        const v = args2[0];\n        setAtomStateValueOrPromise(store, a, v);\n        mountDependencies2(store, a);\n        if (prevEpochNumber !== aState.n) {\n          changedAtoms.add(a);\n          (_a = storeHooks.c) == null ? void 0 : _a.call(storeHooks, a);\n          invalidateDependents2(store, a);\n        }\n        return void 0;\n      } else {\n        return writeAtomState(store, a, ...args2);\n      }\n    } finally {\n      if (!isSync) {\n        recomputeInvalidatedAtoms2(store);\n        flushCallbacks2(store);\n      }\n    }\n  };\n  try {\n    return atomWrite2(store, atom, getter, setter, ...args);\n  } finally {\n    isSync = false;\n  }\n};\nconst mountDependencies = (store, atom) => {\n  var _a;\n  const buildingBlocks = getInternalBuildingBlocks(store);\n  const mountedMap = buildingBlocks[1];\n  const changedAtoms = buildingBlocks[3];\n  const storeHooks = buildingBlocks[6];\n  const ensureAtomState2 = buildingBlocks[11];\n  const invalidateDependents2 = buildingBlocks[15];\n  const mountAtom2 = buildingBlocks[18];\n  const unmountAtom2 = buildingBlocks[19];\n  const atomState = ensureAtomState2(store, atom);\n  const mounted = mountedMap.get(atom);\n  if (mounted && !isPendingPromise(atomState.v)) {\n    for (const [a, n] of atomState.d) {\n      if (!mounted.d.has(a)) {\n        const aState = ensureAtomState2(store, a);\n        const aMounted = mountAtom2(store, a);\n        aMounted.t.add(atom);\n        mounted.d.add(a);\n        if (n !== aState.n) {\n          changedAtoms.add(a);\n          (_a = storeHooks.c) == null ? void 0 : _a.call(storeHooks, a);\n          invalidateDependents2(store, a);\n        }\n      }\n    }\n    for (const a of mounted.d || []) {\n      if (!atomState.d.has(a)) {\n        mounted.d.delete(a);\n        const aMounted = unmountAtom2(store, a);\n        aMounted == null ? void 0 : aMounted.t.delete(atom);\n      }\n    }\n  }\n};\nconst mountAtom = (store, atom) => {\n  var _a;\n  const buildingBlocks = getInternalBuildingBlocks(store);\n  const mountedMap = buildingBlocks[1];\n  const mountCallbacks = buildingBlocks[4];\n  const storeHooks = buildingBlocks[6];\n  const atomOnMount2 = buildingBlocks[10];\n  const ensureAtomState2 = buildingBlocks[11];\n  const flushCallbacks2 = buildingBlocks[12];\n  const recomputeInvalidatedAtoms2 = buildingBlocks[13];\n  const readAtomState2 = buildingBlocks[14];\n  const writeAtomState2 = buildingBlocks[16];\n  const atomState = ensureAtomState2(store, atom);\n  let mounted = mountedMap.get(atom);\n  if (!mounted) {\n    readAtomState2(store, atom);\n    for (const a of atomState.d.keys()) {\n      const aMounted = mountAtom(store, a);\n      aMounted.t.add(atom);\n    }\n    mounted = {\n      l: /* @__PURE__ */ new Set(),\n      d: new Set(atomState.d.keys()),\n      t: /* @__PURE__ */ new Set()\n    };\n    mountedMap.set(atom, mounted);\n    (_a = storeHooks.m) == null ? void 0 : _a.call(storeHooks, atom);\n    if (isActuallyWritableAtom(atom)) {\n      const processOnMount = () => {\n        let isSync = true;\n        const setAtom = (...args) => {\n          try {\n            return writeAtomState2(store, atom, ...args);\n          } finally {\n            if (!isSync) {\n              recomputeInvalidatedAtoms2(store);\n              flushCallbacks2(store);\n            }\n          }\n        };\n        try {\n          const onUnmount = atomOnMount2(store, atom, setAtom);\n          if (onUnmount) {\n            mounted.u = () => {\n              isSync = true;\n              try {\n                onUnmount();\n              } finally {\n                isSync = false;\n              }\n            };\n          }\n        } finally {\n          isSync = false;\n        }\n      };\n      mountCallbacks.add(processOnMount);\n    }\n  }\n  return mounted;\n};\nconst unmountAtom = (store, atom) => {\n  var _a;\n  const buildingBlocks = getInternalBuildingBlocks(store);\n  const mountedMap = buildingBlocks[1];\n  const unmountCallbacks = buildingBlocks[5];\n  const storeHooks = buildingBlocks[6];\n  const ensureAtomState2 = buildingBlocks[11];\n  const unmountAtom2 = buildingBlocks[19];\n  const atomState = ensureAtomState2(store, atom);\n  let mounted = mountedMap.get(atom);\n  if (mounted && !mounted.l.size && !Array.from(mounted.t).some((a) => {\n    var _a2;\n    return (_a2 = mountedMap.get(a)) == null ? void 0 : _a2.d.has(atom);\n  })) {\n    if (mounted.u) {\n      unmountCallbacks.add(mounted.u);\n    }\n    mounted = void 0;\n    mountedMap.delete(atom);\n    (_a = storeHooks.u) == null ? void 0 : _a.call(storeHooks, atom);\n    for (const a of atomState.d.keys()) {\n      const aMounted = unmountAtom2(store, a);\n      aMounted == null ? void 0 : aMounted.t.delete(atom);\n    }\n    return void 0;\n  }\n  return mounted;\n};\nconst setAtomStateValueOrPromise = (store, atom, valueOrPromise) => {\n  const ensureAtomState2 = getInternalBuildingBlocks(store)[11];\n  const atomState = ensureAtomState2(store, atom);\n  const hasPrevValue = \"v\" in atomState;\n  const prevValue = atomState.v;\n  if (isPromiseLike(valueOrPromise)) {\n    for (const a of atomState.d.keys()) {\n      addPendingPromiseToDependency(\n        atom,\n        valueOrPromise,\n        ensureAtomState2(store, a)\n      );\n    }\n  }\n  atomState.v = valueOrPromise;\n  delete atomState.e;\n  if (!hasPrevValue || !Object.is(prevValue, atomState.v)) {\n    ++atomState.n;\n    if (isPromiseLike(prevValue)) {\n      abortPromise(prevValue);\n    }\n  }\n};\nconst storeGet = (store, atom) => {\n  const readAtomState2 = getInternalBuildingBlocks(store)[14];\n  return returnAtomValue(readAtomState2(store, atom));\n};\nconst storeSet = (store, atom, ...args) => {\n  const buildingBlocks = getInternalBuildingBlocks(store);\n  const flushCallbacks2 = buildingBlocks[12];\n  const recomputeInvalidatedAtoms2 = buildingBlocks[13];\n  const writeAtomState2 = buildingBlocks[16];\n  try {\n    return writeAtomState2(store, atom, ...args);\n  } finally {\n    recomputeInvalidatedAtoms2(store);\n    flushCallbacks2(store);\n  }\n};\nconst storeSub = (store, atom, listener) => {\n  const buildingBlocks = getInternalBuildingBlocks(store);\n  const flushCallbacks2 = buildingBlocks[12];\n  const mountAtom2 = buildingBlocks[18];\n  const unmountAtom2 = buildingBlocks[19];\n  const mounted = mountAtom2(store, atom);\n  const listeners = mounted.l;\n  listeners.add(listener);\n  flushCallbacks2(store);\n  return () => {\n    listeners.delete(listener);\n    unmountAtom2(store, atom);\n    flushCallbacks2(store);\n  };\n};\nconst buildingBlockMap = /* @__PURE__ */ new WeakMap();\nconst getInternalBuildingBlocks = (store) => {\n  const buildingBlocks = buildingBlockMap.get(store);\n  if ((import.meta.env ? import.meta.env.MODE : void 0) !== \"production\" && !buildingBlocks) {\n    throw new Error(\n      \"Store must be created by buildStore to read its building blocks\"\n    );\n  }\n  return buildingBlocks;\n};\nfunction getBuildingBlocks(store) {\n  const buildingBlocks = getInternalBuildingBlocks(store);\n  const enhanceBuildingBlocks = buildingBlocks[24];\n  if (enhanceBuildingBlocks) {\n    return enhanceBuildingBlocks(buildingBlocks);\n  }\n  return buildingBlocks;\n}\nfunction buildStore(...buildArgs) {\n  const store = {\n    get(atom) {\n      const storeGet2 = getInternalBuildingBlocks(store)[21];\n      return storeGet2(store, atom);\n    },\n    set(atom, ...args) {\n      const storeSet2 = getInternalBuildingBlocks(store)[22];\n      return storeSet2(store, atom, ...args);\n    },\n    sub(atom, listener) {\n      const storeSub2 = getInternalBuildingBlocks(store)[23];\n      return storeSub2(store, atom, listener);\n    }\n  };\n  const buildingBlocks = [\n    // store state\n    /* @__PURE__ */ new WeakMap(),\n    // atomStateMap\n    /* @__PURE__ */ new WeakMap(),\n    // mountedMap\n    /* @__PURE__ */ new WeakMap(),\n    // invalidatedAtoms\n    /* @__PURE__ */ new Set(),\n    // changedAtoms\n    /* @__PURE__ */ new Set(),\n    // mountCallbacks\n    /* @__PURE__ */ new Set(),\n    // unmountCallbacks\n    {},\n    // storeHooks\n    // atom interceptors\n    atomRead,\n    atomWrite,\n    atomOnInit,\n    atomOnMount,\n    // building-block functions\n    ensureAtomState,\n    flushCallbacks,\n    recomputeInvalidatedAtoms,\n    readAtomState,\n    invalidateDependents,\n    writeAtomState,\n    mountDependencies,\n    mountAtom,\n    unmountAtom,\n    setAtomStateValueOrPromise,\n    storeGet,\n    storeSet,\n    storeSub,\n    void 0\n  ].map((fn, i) => buildArgs[i] || fn);\n  buildingBlockMap.set(store, Object.freeze(buildingBlocks));\n  return store;\n}\n\nexport { abortPromise as INTERNAL_abortPromise, addPendingPromiseToDependency as INTERNAL_addPendingPromiseToDependency, buildStore as INTERNAL_buildStoreRev2, getBuildingBlocks as INTERNAL_getBuildingBlocksRev2, getMountedOrPendingDependents as INTERNAL_getMountedOrPendingDependents, hasInitialValue as INTERNAL_hasInitialValue, initializeStoreHooks as INTERNAL_initializeStoreHooksRev2, isActuallyWritableAtom as INTERNAL_isActuallyWritableAtom, isAtomStateInitialized as INTERNAL_isAtomStateInitialized, isPendingPromise as INTERNAL_isPendingPromise, isPromiseLike as INTERNAL_isPromiseLike, promiseStateMap as INTERNAL_promiseStateMap, registerAbortHandler as INTERNAL_registerAbortHandler, returnAtomValue as INTERNAL_returnAtomValue };\n","import { INTERNAL_buildStoreRev2 } from 'jotai/vanilla/internals';\n\nlet keyCount = 0;\nfunction atom(read, write) {\n  const key = `atom${++keyCount}`;\n  const config = {\n    toString() {\n      return (import.meta.env ? import.meta.env.MODE : void 0) !== \"production\" && this.debugLabel ? key + \":\" + this.debugLabel : key;\n    }\n  };\n  if (typeof read === \"function\") {\n    config.read = read;\n  } else {\n    config.init = read;\n    config.read = defaultRead;\n    config.write = defaultWrite;\n  }\n  if (write) {\n    config.write = write;\n  }\n  return config;\n}\nfunction defaultRead(get) {\n  return get(this);\n}\nfunction defaultWrite(get, set, arg) {\n  return set(\n    this,\n    typeof arg === \"function\" ? arg(get(this)) : arg\n  );\n}\n\nlet overiddenCreateStore;\nfunction INTERNAL_overrideCreateStore(fn) {\n  overiddenCreateStore = fn(overiddenCreateStore);\n}\nfunction createStore() {\n  if (overiddenCreateStore) {\n    return overiddenCreateStore();\n  }\n  return INTERNAL_buildStoreRev2();\n}\nlet defaultStore;\nfunction getDefaultStore() {\n  if (!defaultStore) {\n    defaultStore = createStore();\n    if ((import.meta.env ? import.meta.env.MODE : void 0) !== \"production\") {\n      globalThis.__JOTAI_DEFAULT_STORE__ || (globalThis.__JOTAI_DEFAULT_STORE__ = defaultStore);\n      if (globalThis.__JOTAI_DEFAULT_STORE__ !== defaultStore) {\n        console.warn(\n          \"Detected multiple Jotai instances. It may cause unexpected behavior with the default store. https://github.com/pmndrs/jotai/discussions/2044\"\n        );\n      }\n    }\n  }\n  return defaultStore;\n}\n\nexport { INTERNAL_overrideCreateStore, atom, createStore, getDefaultStore };\n","'use client';\nimport React, { createContext, useContext, useRef, createElement, useReducer, useEffect, useDebugValue, useCallback } from 'react';\nimport { getDefaultStore, createStore } from 'jotai/vanilla';\nimport { INTERNAL_registerAbortHandler } from 'jotai/vanilla/internals';\n\nconst StoreContext = createContext(\n  void 0\n);\nfunction useStore(options) {\n  const store = useContext(StoreContext);\n  return (options == null ? void 0 : options.store) || store || getDefaultStore();\n}\nfunction Provider({\n  children,\n  store\n}) {\n  const storeRef = useRef(null);\n  if (store) {\n    return createElement(StoreContext.Provider, { value: store }, children);\n  }\n  if (storeRef.current === null) {\n    storeRef.current = createStore();\n  }\n  return createElement(\n    StoreContext.Provider,\n    {\n      // TODO should we use useState instead?\n      // eslint-disable-next-line react-hooks/refs\n      value: storeRef.current\n    },\n    children\n  );\n}\n\nconst isPromiseLike = (x) => typeof (x == null ? void 0 : x.then) === \"function\";\nconst attachPromiseStatus = (promise) => {\n  if (!promise.status) {\n    promise.status = \"pending\";\n    promise.then(\n      (v) => {\n        promise.status = \"fulfilled\";\n        promise.value = v;\n      },\n      (e) => {\n        promise.status = \"rejected\";\n        promise.reason = e;\n      }\n    );\n  }\n};\nconst use = React.use || // A shim for older React versions\n((promise) => {\n  if (promise.status === \"pending\") {\n    throw promise;\n  } else if (promise.status === \"fulfilled\") {\n    return promise.value;\n  } else if (promise.status === \"rejected\") {\n    throw promise.reason;\n  } else {\n    attachPromiseStatus(promise);\n    throw promise;\n  }\n});\nconst continuablePromiseMap = /* @__PURE__ */ new WeakMap();\nconst createContinuablePromise = (promise, getValue) => {\n  let continuablePromise = continuablePromiseMap.get(promise);\n  if (!continuablePromise) {\n    continuablePromise = new Promise((resolve, reject) => {\n      let curr = promise;\n      const onFulfilled = (me) => (v) => {\n        if (curr === me) {\n          resolve(v);\n        }\n      };\n      const onRejected = (me) => (e) => {\n        if (curr === me) {\n          reject(e);\n        }\n      };\n      const onAbort = () => {\n        try {\n          const nextValue = getValue();\n          if (isPromiseLike(nextValue)) {\n            continuablePromiseMap.set(nextValue, continuablePromise);\n            curr = nextValue;\n            nextValue.then(onFulfilled(nextValue), onRejected(nextValue));\n            INTERNAL_registerAbortHandler(nextValue, onAbort);\n          } else {\n            resolve(nextValue);\n          }\n        } catch (e) {\n          reject(e);\n        }\n      };\n      promise.then(onFulfilled(promise), onRejected(promise));\n      INTERNAL_registerAbortHandler(promise, onAbort);\n    });\n    continuablePromiseMap.set(promise, continuablePromise);\n  }\n  return continuablePromise;\n};\nfunction useAtomValue(atom, options) {\n  const { delay, unstable_promiseStatus: promiseStatus = !React.use } = options || {};\n  const store = useStore(options);\n  const [[valueFromReducer, storeFromReducer, atomFromReducer], rerender] = useReducer(\n    (prev) => {\n      const nextValue = store.get(atom);\n      if (Object.is(prev[0], nextValue) && prev[1] === store && prev[2] === atom) {\n        return prev;\n      }\n      return [nextValue, store, atom];\n    },\n    void 0,\n    () => [store.get(atom), store, atom]\n  );\n  let value = valueFromReducer;\n  if (storeFromReducer !== store || atomFromReducer !== atom) {\n    rerender();\n    value = store.get(atom);\n  }\n  useEffect(() => {\n    const unsub = store.sub(atom, () => {\n      if (promiseStatus) {\n        try {\n          const value2 = store.get(atom);\n          if (isPromiseLike(value2)) {\n            attachPromiseStatus(\n              createContinuablePromise(value2, () => store.get(atom))\n            );\n          }\n        } catch (e) {\n        }\n      }\n      if (typeof delay === \"number\") {\n        setTimeout(rerender, delay);\n        return;\n      }\n      rerender();\n    });\n    rerender();\n    return unsub;\n  }, [store, atom, delay, promiseStatus]);\n  useDebugValue(value);\n  if (isPromiseLike(value)) {\n    const promise = createContinuablePromise(value, () => store.get(atom));\n    if (promiseStatus) {\n      attachPromiseStatus(promise);\n    }\n    return use(promise);\n  }\n  return value;\n}\n\nfunction useSetAtom(atom, options) {\n  const store = useStore(options);\n  const setAtom = useCallback(\n    (...args) => {\n      if ((import.meta.env ? import.meta.env.MODE : void 0) !== \"production\" && !(\"write\" in atom)) {\n        throw new Error(\"not writable atom\");\n      }\n      return store.set(atom, ...args);\n    },\n    [store, atom]\n  );\n  return setAtom;\n}\n\nfunction useAtom(atom, options) {\n  return [\n    useAtomValue(atom, options),\n    // We do wrong type assertion here, which results in throwing an error.\n    useSetAtom(atom, options)\n  ];\n}\n\nexport { Provider, useAtom, useAtomValue, useSetAtom, useStore };\n","import { atom } from 'jotai/vanilla';\n\nconst RESET = Symbol(\n  (import.meta.env ? import.meta.env.MODE : void 0) !== \"production\" ? \"RESET\" : \"\"\n);\n\nfunction atomWithReset(initialValue) {\n  const anAtom = atom(\n    initialValue,\n    (get, set, update) => {\n      const nextValue = typeof update === \"function\" ? update(get(anAtom)) : update;\n      set(anAtom, nextValue === RESET ? initialValue : nextValue);\n    }\n  );\n  return anAtom;\n}\n\nfunction atomWithReducer(initialValue, reducer) {\n  return atom(initialValue, function(get, set, action) {\n    set(this, reducer(get(this), action));\n  });\n}\n\nfunction atomFamily(initializeAtom, areEqual) {\n  let shouldRemove = null;\n  const atoms = /* @__PURE__ */ new Map();\n  const listeners = /* @__PURE__ */ new Set();\n  const createAtom = (param) => {\n    let item;\n    if (areEqual === void 0) {\n      item = atoms.get(param);\n    } else {\n      for (const [key, value] of atoms) {\n        if (areEqual(key, param)) {\n          item = value;\n          break;\n        }\n      }\n    }\n    if (item !== void 0) {\n      if (shouldRemove == null ? void 0 : shouldRemove(item[1], param)) {\n        createAtom.remove(param);\n      } else {\n        return item[0];\n      }\n    }\n    const newAtom = initializeAtom(param);\n    atoms.set(param, [newAtom, Date.now()]);\n    notifyListeners(\"CREATE\", param, newAtom);\n    return newAtom;\n  };\n  const notifyListeners = (type, param, atom) => {\n    for (const listener of listeners) {\n      listener({ type, param, atom });\n    }\n  };\n  createAtom.unstable_listen = (callback) => {\n    listeners.add(callback);\n    return () => {\n      listeners.delete(callback);\n    };\n  };\n  createAtom.getParams = () => atoms.keys();\n  createAtom.remove = (param) => {\n    if (areEqual === void 0) {\n      if (!atoms.has(param)) return;\n      const [atom] = atoms.get(param);\n      atoms.delete(param);\n      notifyListeners(\"REMOVE\", param, atom);\n    } else {\n      for (const [key, [atom]] of atoms) {\n        if (areEqual(key, param)) {\n          atoms.delete(key);\n          notifyListeners(\"REMOVE\", key, atom);\n          break;\n        }\n      }\n    }\n  };\n  createAtom.setShouldRemove = (fn) => {\n    shouldRemove = fn;\n    if (!shouldRemove) return;\n    for (const [key, [atom, createdAt]] of atoms) {\n      if (shouldRemove(createdAt, key)) {\n        atoms.delete(key);\n        notifyListeners(\"REMOVE\", key, atom);\n      }\n    }\n  };\n  return createAtom;\n}\n\nconst getCached$2 = (c, m, k) => (m.has(k) ? m : m.set(k, c())).get(k);\nconst cache1$3 = /* @__PURE__ */ new WeakMap();\nconst memo3 = (create, dep1, dep2, dep3) => {\n  const cache2 = getCached$2(() => /* @__PURE__ */ new WeakMap(), cache1$3, dep1);\n  const cache3 = getCached$2(() => /* @__PURE__ */ new WeakMap(), cache2, dep2);\n  return getCached$2(create, cache3, dep3);\n};\nfunction selectAtom(anAtom, selector, equalityFn = Object.is) {\n  return memo3(\n    () => {\n      const EMPTY = Symbol();\n      const selectValue = ([value, prevSlice]) => {\n        if (prevSlice === EMPTY) {\n          return selector(value);\n        }\n        const slice = selector(value, prevSlice);\n        return equalityFn(prevSlice, slice) ? prevSlice : slice;\n      };\n      const derivedAtom = atom((get) => {\n        const prev = get(derivedAtom);\n        const value = get(anAtom);\n        return selectValue([value, prev]);\n      });\n      derivedAtom.init = EMPTY;\n      return derivedAtom;\n    },\n    anAtom,\n    selector,\n    equalityFn\n  );\n}\n\nconst frozenAtoms = /* @__PURE__ */ new WeakSet();\nconst deepFreeze = (value) => {\n  if (typeof value !== \"object\" || value === null) {\n    return value;\n  }\n  Object.freeze(value);\n  const propNames = Object.getOwnPropertyNames(value);\n  for (const name of propNames) {\n    deepFreeze(value[name]);\n  }\n  return value;\n};\nfunction freezeAtom(anAtom) {\n  if (frozenAtoms.has(anAtom)) {\n    return anAtom;\n  }\n  frozenAtoms.add(anAtom);\n  const origRead = anAtom.read;\n  anAtom.read = function(get, options) {\n    return deepFreeze(origRead.call(this, get, options));\n  };\n  if (\"write\" in anAtom) {\n    const origWrite = anAtom.write;\n    anAtom.write = function(get, set, ...args) {\n      return origWrite.call(\n        this,\n        get,\n        (...setArgs) => {\n          if (setArgs[0] === anAtom) {\n            setArgs[1] = deepFreeze(setArgs[1]);\n          }\n          return set(...setArgs);\n        },\n        ...args\n      );\n    };\n  }\n  return anAtom;\n}\nfunction freezeAtomCreator(createAtom) {\n  if ((import.meta.env ? import.meta.env.MODE : void 0) !== \"production\") {\n    console.warn(\n      \"[DEPRECATED] freezeAtomCreator is deprecated, define it on users end\"\n    );\n  }\n  return ((...args) => freezeAtom(createAtom(...args)));\n}\n\nconst getCached$1 = (c, m, k) => (m.has(k) ? m : m.set(k, c())).get(k);\nconst cache1$2 = /* @__PURE__ */ new WeakMap();\nconst memo2$1 = (create, dep1, dep2) => {\n  const cache2 = getCached$1(() => /* @__PURE__ */ new WeakMap(), cache1$2, dep1);\n  return getCached$1(create, cache2, dep2);\n};\nconst cacheKeyForEmptyKeyExtractor = {};\nconst isWritable = (atom2) => !!atom2.write;\nconst isFunction = (x) => typeof x === \"function\";\nfunction splitAtom(arrAtom, keyExtractor) {\n  return memo2$1(\n    () => {\n      const mappingCache = /* @__PURE__ */ new WeakMap();\n      const getMapping = (arr, prev) => {\n        let mapping = mappingCache.get(arr);\n        if (mapping) {\n          return mapping;\n        }\n        const prevMapping = prev && mappingCache.get(prev);\n        const atomList = [];\n        const keyList = [];\n        arr.forEach((item, index) => {\n          const key = keyExtractor ? keyExtractor(item) : index;\n          keyList[index] = key;\n          const cachedAtom = prevMapping && prevMapping.atomList[prevMapping.keyList.indexOf(key)];\n          if (cachedAtom) {\n            atomList[index] = cachedAtom;\n            return;\n          }\n          const read = (get) => {\n            const prev2 = get(mappingAtom);\n            const currArr = get(arrAtom);\n            const mapping2 = getMapping(currArr, prev2 == null ? void 0 : prev2.arr);\n            const index2 = mapping2.keyList.indexOf(key);\n            if (index2 < 0 || index2 >= currArr.length) {\n              const prevItem = arr[getMapping(arr).keyList.indexOf(key)];\n              if (prevItem) {\n                return prevItem;\n              }\n              throw new Error(\"splitAtom: index out of bounds for read\");\n            }\n            return currArr[index2];\n          };\n          const write = (get, set, update) => {\n            const prev2 = get(mappingAtom);\n            const arr2 = get(arrAtom);\n            const mapping2 = getMapping(arr2, prev2 == null ? void 0 : prev2.arr);\n            const index2 = mapping2.keyList.indexOf(key);\n            if (index2 < 0 || index2 >= arr2.length) {\n              throw new Error(\"splitAtom: index out of bounds for write\");\n            }\n            const nextItem = isFunction(update) ? update(arr2[index2]) : update;\n            if (!Object.is(arr2[index2], nextItem)) {\n              set(arrAtom, [\n                ...arr2.slice(0, index2),\n                nextItem,\n                ...arr2.slice(index2 + 1)\n              ]);\n            }\n          };\n          atomList[index] = isWritable(arrAtom) ? atom(read, write) : atom(read);\n        });\n        if (prevMapping && prevMapping.keyList.length === keyList.length && prevMapping.keyList.every((x, i) => x === keyList[i])) {\n          mapping = prevMapping;\n        } else {\n          mapping = { arr, atomList, keyList };\n        }\n        mappingCache.set(arr, mapping);\n        return mapping;\n      };\n      const mappingAtom = atom((get) => {\n        const prev = get(mappingAtom);\n        const arr = get(arrAtom);\n        const mapping = getMapping(arr, prev == null ? void 0 : prev.arr);\n        return mapping;\n      });\n      if ((import.meta.env ? import.meta.env.MODE : void 0) !== \"production\") {\n        mappingAtom.debugPrivate = true;\n      }\n      mappingAtom.init = void 0;\n      const splittedAtom = isWritable(arrAtom) ? atom(\n        (get) => get(mappingAtom).atomList,\n        (get, set, action) => {\n          switch (action.type) {\n            case \"remove\": {\n              const index = get(splittedAtom).indexOf(action.atom);\n              if (index >= 0) {\n                const arr = get(arrAtom);\n                set(arrAtom, [\n                  ...arr.slice(0, index),\n                  ...arr.slice(index + 1)\n                ]);\n              }\n              break;\n            }\n            case \"insert\": {\n              const index = action.before ? get(splittedAtom).indexOf(action.before) : get(splittedAtom).length;\n              if (index >= 0) {\n                const arr = get(arrAtom);\n                set(arrAtom, [\n                  ...arr.slice(0, index),\n                  action.value,\n                  ...arr.slice(index)\n                ]);\n              }\n              break;\n            }\n            case \"move\": {\n              const index1 = get(splittedAtom).indexOf(action.atom);\n              const index2 = action.before ? get(splittedAtom).indexOf(action.before) : get(splittedAtom).length;\n              if (index1 >= 0 && index2 >= 0) {\n                const arr = get(arrAtom);\n                if (index1 < index2) {\n                  set(arrAtom, [\n                    ...arr.slice(0, index1),\n                    ...arr.slice(index1 + 1, index2),\n                    arr[index1],\n                    ...arr.slice(index2)\n                  ]);\n                } else {\n                  set(arrAtom, [\n                    ...arr.slice(0, index2),\n                    arr[index1],\n                    ...arr.slice(index2, index1),\n                    ...arr.slice(index1 + 1)\n                  ]);\n                }\n              }\n              break;\n            }\n          }\n        }\n      ) : atom((get) => get(mappingAtom).atomList);\n      return splittedAtom;\n    },\n    arrAtom,\n    keyExtractor || cacheKeyForEmptyKeyExtractor\n  );\n}\n\nfunction atomWithDefault(getDefault) {\n  const EMPTY = Symbol();\n  const overwrittenAtom = atom(EMPTY);\n  if ((import.meta.env ? import.meta.env.MODE : void 0) !== \"production\") {\n    overwrittenAtom.debugPrivate = true;\n  }\n  const anAtom = atom(\n    (get, options) => {\n      const overwritten = get(overwrittenAtom);\n      if (overwritten !== EMPTY) {\n        return overwritten;\n      }\n      return getDefault(get, options);\n    },\n    (get, set, update) => {\n      const newValue = typeof update === \"function\" ? update(get(anAtom)) : update;\n      set(overwrittenAtom, newValue === RESET ? EMPTY : newValue);\n    }\n  );\n  return anAtom;\n}\n\nconst isPromiseLike$3 = (x) => typeof (x == null ? void 0 : x.then) === \"function\";\nfunction withStorageValidator(validator) {\n  return (unknownStorage) => {\n    const storage = {\n      ...unknownStorage,\n      getItem: (key, initialValue) => {\n        const validate = (value2) => {\n          if (!validator(value2)) {\n            return initialValue;\n          }\n          return value2;\n        };\n        const value = unknownStorage.getItem(key, initialValue);\n        if (isPromiseLike$3(value)) {\n          return value.then(validate);\n        }\n        return validate(value);\n      }\n    };\n    return storage;\n  };\n}\nfunction createJSONStorage(getStringStorage = () => {\n  try {\n    return window.localStorage;\n  } catch (e) {\n    if ((import.meta.env ? import.meta.env.MODE : void 0) !== \"production\") {\n      if (typeof window !== \"undefined\") {\n        console.warn(e);\n      }\n    }\n    return void 0;\n  }\n}, options) {\n  var _a;\n  let lastStr;\n  let lastValue;\n  const storage = {\n    getItem: (key, initialValue) => {\n      var _a2, _b;\n      const parse = (str2) => {\n        str2 = str2 || \"\";\n        if (lastStr !== str2) {\n          try {\n            lastValue = JSON.parse(str2, options == null ? void 0 : options.reviver);\n          } catch (e) {\n            return initialValue;\n          }\n          lastStr = str2;\n        }\n        return lastValue;\n      };\n      const str = (_b = (_a2 = getStringStorage()) == null ? void 0 : _a2.getItem(key)) != null ? _b : null;\n      if (isPromiseLike$3(str)) {\n        return str.then(parse);\n      }\n      return parse(str);\n    },\n    setItem: (key, newValue) => {\n      var _a2;\n      return (_a2 = getStringStorage()) == null ? void 0 : _a2.setItem(\n        key,\n        JSON.stringify(newValue, options == null ? void 0 : options.replacer)\n      );\n    },\n    removeItem: (key) => {\n      var _a2;\n      return (_a2 = getStringStorage()) == null ? void 0 : _a2.removeItem(key);\n    }\n  };\n  const createHandleSubscribe = (subscriber2) => (key, callback, initialValue) => subscriber2(key, (v) => {\n    let newValue;\n    try {\n      newValue = JSON.parse(v || \"\");\n    } catch (e) {\n      newValue = initialValue;\n    }\n    callback(newValue);\n  });\n  let subscriber;\n  try {\n    subscriber = (_a = getStringStorage()) == null ? void 0 : _a.subscribe;\n  } catch (e) {\n  }\n  if (!subscriber && typeof window !== \"undefined\" && typeof window.addEventListener === \"function\" && window.Storage) {\n    subscriber = (key, callback) => {\n      if (!(getStringStorage() instanceof window.Storage)) {\n        return () => {\n        };\n      }\n      const storageEventCallback = (e) => {\n        if (e.storageArea === getStringStorage() && e.key === key) {\n          callback(e.newValue);\n        }\n      };\n      window.addEventListener(\"storage\", storageEventCallback);\n      return () => {\n        window.removeEventListener(\"storage\", storageEventCallback);\n      };\n    };\n  }\n  if (subscriber) {\n    storage.subscribe = createHandleSubscribe(subscriber);\n  }\n  return storage;\n}\nconst defaultStorage = createJSONStorage();\nfunction atomWithStorage(key, initialValue, storage = defaultStorage, options) {\n  const getOnInit = options == null ? void 0 : options.getOnInit;\n  const baseAtom = atom(\n    getOnInit ? storage.getItem(key, initialValue) : initialValue\n  );\n  if ((import.meta.env ? import.meta.env.MODE : void 0) !== \"production\") {\n    baseAtom.debugPrivate = true;\n  }\n  baseAtom.onMount = (setAtom) => {\n    setAtom(storage.getItem(key, initialValue));\n    let unsub;\n    if (storage.subscribe) {\n      unsub = storage.subscribe(key, setAtom, initialValue);\n    }\n    return unsub;\n  };\n  const anAtom = atom(\n    (get) => get(baseAtom),\n    (get, set, update) => {\n      const nextValue = typeof update === \"function\" ? update(get(baseAtom)) : update;\n      if (nextValue === RESET) {\n        set(baseAtom, initialValue);\n        return storage.removeItem(key);\n      }\n      if (isPromiseLike$3(nextValue)) {\n        return nextValue.then((resolvedValue) => {\n          set(baseAtom, resolvedValue);\n          return storage.setItem(key, resolvedValue);\n        });\n      }\n      set(baseAtom, nextValue);\n      return storage.setItem(key, nextValue);\n    }\n  );\n  return anAtom;\n}\n\nconst isPromiseLike$2 = (x) => typeof (x == null ? void 0 : x.then) === \"function\";\nfunction atomWithObservable(getObservable, options) {\n  const returnResultData = (result) => {\n    if (\"e\" in result) {\n      throw result.e;\n    }\n    return result.d;\n  };\n  const observableResultAtom = atom((get) => {\n    var _a;\n    let observable = getObservable(get);\n    const itself = (_a = observable[Symbol.observable]) == null ? void 0 : _a.call(observable);\n    if (itself) {\n      observable = itself;\n    }\n    let resolve;\n    const makePending = () => new Promise((r) => {\n      resolve = r;\n    });\n    const initialResult = options && \"initialValue\" in options ? {\n      d: typeof options.initialValue === \"function\" ? options.initialValue() : options.initialValue\n    } : makePending();\n    let setResult;\n    let lastResult;\n    const listener = (result) => {\n      lastResult = result;\n      resolve == null ? void 0 : resolve(result);\n      setResult == null ? void 0 : setResult(result);\n    };\n    let subscription;\n    let timer;\n    const isNotMounted = () => !setResult;\n    const unsubscribe = () => {\n      if (subscription) {\n        subscription.unsubscribe();\n        subscription = void 0;\n      }\n    };\n    const start = () => {\n      if (subscription) {\n        clearTimeout(timer);\n        subscription.unsubscribe();\n      }\n      subscription = observable.subscribe({\n        next: (d) => listener({ d }),\n        error: (e) => listener({ e }),\n        complete: () => {\n        }\n      });\n      if (isNotMounted() && (options == null ? void 0 : options.unstable_timeout)) {\n        timer = setTimeout(unsubscribe, options.unstable_timeout);\n      }\n    };\n    start();\n    const resultAtom = atom(lastResult || initialResult);\n    if ((import.meta.env ? import.meta.env.MODE : void 0) !== \"production\") {\n      resultAtom.debugPrivate = true;\n    }\n    resultAtom.onMount = (update) => {\n      setResult = update;\n      if (lastResult) {\n        update(lastResult);\n      }\n      if (subscription) {\n        clearTimeout(timer);\n      } else {\n        start();\n      }\n      return () => {\n        setResult = void 0;\n        if (options == null ? void 0 : options.unstable_timeout) {\n          timer = setTimeout(unsubscribe, options.unstable_timeout);\n        } else {\n          unsubscribe();\n        }\n      };\n    };\n    return [resultAtom, observable, makePending, start, isNotMounted];\n  });\n  if ((import.meta.env ? import.meta.env.MODE : void 0) !== \"production\") {\n    observableResultAtom.debugPrivate = true;\n  }\n  const observableAtom = atom(\n    (get) => {\n      const [resultAtom] = get(observableResultAtom);\n      const result = get(resultAtom);\n      if (isPromiseLike$2(result)) {\n        return result.then(returnResultData);\n      }\n      return returnResultData(result);\n    },\n    (get, set, data) => {\n      const [resultAtom, observable, makePending, start, isNotMounted] = get(observableResultAtom);\n      if (\"next\" in observable) {\n        if (isNotMounted()) {\n          set(resultAtom, makePending());\n          start();\n        }\n        observable.next(data);\n      } else {\n        throw new Error(\"observable is not subject\");\n      }\n    }\n  );\n  return observableAtom;\n}\n\nconst cache1$1 = /* @__PURE__ */ new WeakMap();\nconst memo1 = (create, dep1) => (cache1$1.has(dep1) ? cache1$1 : cache1$1.set(dep1, create())).get(dep1);\nconst isPromiseLike$1 = (p) => typeof (p == null ? void 0 : p.then) === \"function\";\nconst LOADING = { state: \"loading\" };\nfunction loadable(anAtom) {\n  return memo1(() => {\n    const loadableCache = /* @__PURE__ */ new WeakMap();\n    const refreshAtom = atom(0);\n    if ((import.meta.env ? import.meta.env.MODE : void 0) !== \"production\") {\n      refreshAtom.debugPrivate = true;\n    }\n    const derivedAtom = atom(\n      (get, { setSelf }) => {\n        get(refreshAtom);\n        let value;\n        try {\n          value = get(anAtom);\n        } catch (error) {\n          return { state: \"hasError\", error };\n        }\n        if (!isPromiseLike$1(value)) {\n          return { state: \"hasData\", data: value };\n        }\n        const promise = value;\n        const cached1 = loadableCache.get(promise);\n        if (cached1) {\n          return cached1;\n        }\n        promise.then(\n          (data) => {\n            loadableCache.set(promise, { state: \"hasData\", data });\n            setSelf();\n          },\n          (error) => {\n            loadableCache.set(promise, { state: \"hasError\", error });\n            setSelf();\n          }\n        );\n        const cached2 = loadableCache.get(promise);\n        if (cached2) {\n          return cached2;\n        }\n        loadableCache.set(promise, LOADING);\n        return LOADING;\n      },\n      (_get, set) => {\n        set(refreshAtom, (c) => c + 1);\n      }\n    );\n    if ((import.meta.env ? import.meta.env.MODE : void 0) !== \"production\") {\n      derivedAtom.debugPrivate = true;\n    }\n    return atom((get) => get(derivedAtom));\n  }, anAtom);\n}\n\nconst getCached = (c, m, k) => (m.has(k) ? m : m.set(k, c())).get(k);\nconst cache1 = /* @__PURE__ */ new WeakMap();\nconst memo2 = (create, dep1, dep2) => {\n  const cache2 = getCached(() => /* @__PURE__ */ new WeakMap(), cache1, dep1);\n  return getCached(create, cache2, dep2);\n};\nconst isPromiseLike = (p) => typeof (p == null ? void 0 : p.then) === \"function\";\nconst defaultFallback = () => void 0;\nfunction unwrap(anAtom, fallback = defaultFallback) {\n  return memo2(\n    () => {\n      const promiseErrorCache = /* @__PURE__ */ new WeakMap();\n      const promiseResultCache = /* @__PURE__ */ new WeakMap();\n      const refreshAtom = atom(0);\n      if ((import.meta.env ? import.meta.env.MODE : void 0) !== \"production\") {\n        refreshAtom.debugPrivate = true;\n      }\n      const promiseAndValueAtom = atom(\n        (get, { setSelf }) => {\n          get(refreshAtom);\n          let prev;\n          try {\n            prev = get(promiseAndValueAtom);\n          } catch (e) {\n          }\n          const promise = get(anAtom);\n          if (!isPromiseLike(promise)) {\n            return { v: promise };\n          }\n          if (promise !== (prev == null ? void 0 : prev.p)) {\n            promise.then(\n              (v) => {\n                promiseResultCache.set(promise, v);\n                setSelf();\n              },\n              (e) => {\n                promiseErrorCache.set(promise, e);\n                setSelf();\n              }\n            );\n          }\n          if (promiseErrorCache.has(promise)) {\n            throw promiseErrorCache.get(promise);\n          }\n          if (promiseResultCache.has(promise)) {\n            return {\n              p: promise,\n              v: promiseResultCache.get(promise)\n            };\n          }\n          if (prev && \"v\" in prev) {\n            return { p: promise, f: fallback(prev.v), v: prev.v };\n          }\n          return { p: promise, f: fallback() };\n        },\n        (_get, set) => {\n          set(refreshAtom, (c) => c + 1);\n        }\n      );\n      promiseAndValueAtom.init = void 0;\n      if ((import.meta.env ? import.meta.env.MODE : void 0) !== \"production\") {\n        promiseAndValueAtom.debugPrivate = true;\n      }\n      return atom(\n        (get) => {\n          const state = get(promiseAndValueAtom);\n          if (\"f\" in state) {\n            return state.f;\n          }\n          return state.v;\n        },\n        (_get, set, ...args) => set(anAtom, ...args)\n      );\n    },\n    anAtom,\n    fallback\n  );\n}\n\nfunction atomWithRefresh(read, write) {\n  const refreshAtom = atom(0);\n  if ((import.meta.env ? import.meta.env.MODE : void 0) !== \"production\") {\n    refreshAtom.debugPrivate = true;\n  }\n  return atom(\n    (get, options) => {\n      get(refreshAtom);\n      return read(get, options);\n    },\n    (get, set, ...args) => {\n      if (args.length === 0) {\n        set(refreshAtom, (c) => c + 1);\n      } else if (write) {\n        return write(get, set, ...args);\n      } else if ((import.meta.env ? import.meta.env.MODE : void 0) !== \"production\") {\n        throw new Error(\"refresh must be called without arguments\");\n      }\n    }\n  );\n}\n\nfunction atomWithLazy(makeInitial) {\n  const a = atom(void 0);\n  delete a.init;\n  Object.defineProperty(a, \"init\", {\n    get() {\n      return makeInitial();\n    }\n  });\n  return a;\n}\n\nexport { RESET, atomFamily, atomWithDefault, atomWithLazy, atomWithObservable, atomWithReducer, atomWithRefresh, atomWithReset, atomWithStorage, createJSONStorage, freezeAtom, freezeAtomCreator, loadable, selectAtom, splitAtom, withStorageValidator as unstable_withStorageValidator, unwrap };\n","import { atom, useAtom } from 'jotai'\nimport { atomWithStorage, createJSONStorage } from 'jotai/utils'\nimport { storage } from './storage'\nimport type { PrimitiveAtom } from 'jotai'\n\nexport type { PrimitiveAtom } from 'jotai'\n\nexport type AtomGeneratorOptions<T> = {\n  key: string\n  defaultValue: T\n  persist?: boolean\n  storage?: Pick<Storage, 'getItem' | 'setItem' | 'removeItem'>\n}\n\nexport type AtomState<T> = {\n  atom: PrimitiveAtom<T>\n  useValue: () => T\n  useState: () => [T, (value: T) => void]\n  useReset: () => () => void\n}\n\n// Overload per persist = true\nexport function atomStateGenerator<T>(\n  options: AtomGeneratorOptions<T> & { persist: true },\n): AtomState<T>\n\n// Overload per persist = false o undefined\nexport function atomStateGenerator<T>(\n  options: AtomGeneratorOptions<T> & { persist?: false },\n): AtomState<T>\n\n// Implementazione\nexport function atomStateGenerator<T>({\n  key,\n  defaultValue,\n  persist = false,\n  storage: customStorage,\n}: AtomGeneratorOptions<T>): AtomState<T> {\n  const resolvedStorage = customStorage || storage\n\n  // Usa atomWithStorage solo se persist è true, altrimenti atom normale\n  const jotaiAtom = persist\n    ? atomWithStorage<T>(\n        key,\n        defaultValue,\n        createJSONStorage<T>(() => resolvedStorage),\n      )\n    : atom<T>(defaultValue)\n\n  const useValue = () => {\n    const [value] = useAtom(jotaiAtom as PrimitiveAtom<T>)\n    return value\n  }\n\n  const useState = () => {\n    const [value, setValue] = useAtom(jotaiAtom as PrimitiveAtom<T>)\n    return [value, setValue] as [T, (value: T) => void]\n  }\n\n  const useReset = () => {\n    const [, setValue] = useAtom(jotaiAtom as PrimitiveAtom<T>)\n    return () => {\n      setValue(defaultValue)\n      // Rimuovi dallo storage solo se era persistente\n      if (persist) {\n        resolvedStorage.removeItem(key)\n      }\n    }\n  }\n\n  return {\n    atom: jotaiAtom as PrimitiveAtom<T>,\n    useValue,\n    useState,\n    useReset,\n  }\n}\n"],"names":["u8","Uint8Array","u16","Uint16Array","i32","Int32Array","fleb","fdeb","clim","freb","eb","start","b","i","r","j","_a","fl","revfl","_b","fd","revfd","rev","x","hMap","cd","mb","s","length","l","le","co","rvb","sv","r_1","v","m","flt","fdt","flm","flrm","fdm","fdrm","max","a","bits","d","p","o","bits16","shft","slc","e","subarray","ec","err","ind","msg","nt","Error","code","captureStackTrace","inflt","dat","st","buf","dict","sl","dl","f","noBuf","resize","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","wbits","wbits16","hTree","push","t2","slice","et","sort","i0","i1","i2","maxSym","tr","mbt","ln","lft","cst","i2_1","i2_2","i2_3","lc","cl","cli","cln","cls","w","clen","cf","wfblk","out","wblk","syms","lf","df","li","bs","dlt","mlb","ddt","mdb","_c","lclt","nlc","_d","lcdt","ndc","lcfreq","_e","lct","mlcb","nlcc","flen","ftlen","dtlen","ll","llm","lcts","it","clct","len","dst","deo","dflt","lvl","plvl","pre","post","z","ceil","lst","opt","msk_1","prev","head","h","bs1_1","bs2_1","hsh","lc_1","wi","hv","imod","pimod","rem","ch_1","dif","maxn","maxd","ml","nl","mmd","md","ti","pti","lin","din","dopt","dictionary","newDat","level","mem","log","deflateSync","data","opts","inflateSync","te","TextEncoder","td","TextDecoder","decode","stream","dutf8","String","fromCharCode","strToU8","str","latin1","encode","ar","ai","charCodeAt","strFromU8","RAW_PREFIX","DEFLATE_PREFIX","isProbablyJson","value","u8ToBase64","bytes","binary","chunkSize","btoa","base64ToU8","base64","atob","createCompressedStorage","base","options","minSizeToCompress","deflateLevel","writeDebounceMs","pendingWrites","Map","flushTimer","lifecycleHooksInstalled","flush","undefined","key","setItem","input","compressed","error","console","clear","scheduleFlush","window","addEventListener","document","visibilityState","globalThis","setTimeout","getItem","stored","startsWith","b64","decompressed","rawValue","delete","removeItem","stringValue","baseStorage","localStorage","storage","setCustomStorage","newStorage","isPromiseLike","INTERNAL_buildStoreRev2","INTERNAL_registerAbortHandler","atomStateGenerator","defaultValue","persist","customStorage","resolvedStorage","jotaiAtom","atomWithStorage","createJSONStorage","atom","useValue","useAtom","useState","$","setValue","t0","useReset"],"mappings":"yIAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAqBA;AACA,IAAIA,EAAE,GAAGC,UAAU;AAAEC,EAAAA,GAAG,GAAGC,WAAW;AAAEC,EAAAA,GAAG,GAAGC,UAAU;AACxD;AACA,IAAIC,IAAI,GAAG,IAAIN,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,cAAe,CAAC,EAAE,CAAC,kBAAmB,CAAC,CAAC,CAAC;AACjJ;AACA,IAAIO,IAAI,GAAG,IAAIP,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,cAAe,CAAC,EAAE,CAAC,CAAC,CAAC;AACxI;AACA,IAAIQ,IAAI,GAAG,IAAIR,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;AACrF;AACA,IAAIS,IAAI,GAAG,UAAUC,EAAE,EAAEC,KAAK,EAAE;AAC5B,EAAA,IAAIC,CAAC,GAAG,IAAIV,GAAG,CAAC,EAAE,CAAC;EACnB,KAAK,IAAIW,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG,EAAE,EAAE,EAAEA,CAAC,EAAE;AACzBD,IAAAA,CAAC,CAACC,CAAC,CAAC,GAAGF,KAAK,IAAI,CAAC,IAAID,EAAE,CAACG,CAAC,GAAG,CAAC,CAAC;AAClC,EAAA;AACA;EACA,IAAIC,CAAC,GAAG,IAAIV,GAAG,CAACQ,CAAC,CAAC,EAAE,CAAC,CAAC;EACtB,KAAK,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG,EAAE,EAAE,EAAEA,CAAC,EAAE;AACzB,IAAA,KAAK,IAAIE,CAAC,GAAGH,CAAC,CAACC,CAAC,CAAC,EAAEE,CAAC,GAAGH,CAAC,CAACC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAEE,CAAC,EAAE;AAClCD,MAAAA,CAAC,CAACC,CAAC,CAAC,GAAKA,CAAC,GAAGH,CAAC,CAACC,CAAC,CAAC,IAAK,CAAC,GAAIA,CAAC;AAChC,IAAA;AACJ,EAAA;EACA,OAAO;AAAED,IAAAA,CAAC,EAAEA,CAAC;AAAEE,IAAAA,CAAC,EAAEA;GAAG;AACzB,CAAC;AACD,IAAIE,EAAE,GAAGP,IAAI,CAACH,IAAI,EAAE,CAAC,CAAC;EAAEW,EAAE,GAAGD,EAAE,CAACJ,CAAC;EAAEM,KAAK,GAAGF,EAAE,CAACF,CAAC;AAC/C;AACAG,EAAE,CAAC,EAAE,CAAC,GAAG,GAAG,EAAEC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE;AAC7B,IAAIC,EAAE,GAAGV,IAAI,CAACF,IAAI,EAAE,CAAC,CAAC;EAAEa,EAAE,GAAGD,EAAE,CAACP,CAAC;EAAES,KAAK,GAAGF,EAAE,CAACL,CAAC;AAC/C;AACA,IAAIQ,GAAG,GAAG,IAAIpB,GAAG,CAAC,KAAK,CAAC;AACxB,KAAK,IAAIW,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG,KAAK,EAAE,EAAEA,CAAC,EAAE;AAC5B;AACA,EAAA,IAAIU,CAAC,GAAI,CAACV,CAAC,GAAG,MAAM,KAAK,CAAC,GAAK,CAACA,CAAC,GAAG,MAAM,KAAK,CAAE;AACjDU,EAAAA,CAAC,GAAI,CAACA,CAAC,GAAG,MAAM,KAAK,CAAC,GAAK,CAACA,CAAC,GAAG,MAAM,KAAK,CAAE;AAC7CA,EAAAA,CAAC,GAAI,CAACA,CAAC,GAAG,MAAM,KAAK,CAAC,GAAK,CAACA,CAAC,GAAG,MAAM,KAAK,CAAE;AAC7CD,EAAAA,GAAG,CAACT,CAAC,CAAC,GAAG,CAAE,CAACU,CAAC,GAAG,MAAM,KAAK,CAAC,GAAK,CAACA,CAAC,GAAG,MAAM,KAAK,CAAE,KAAK,CAAC;AAC7D;AACA;AACA;AACA;AACA,IAAIC,IAAI,GAAI,UAAUC,EAAE,EAAEC,EAAE,EAAEZ,CAAC,EAAE;AAC7B,EAAA,IAAIa,CAAC,GAAGF,EAAE,CAACG,MAAM;AACjB;EACA,IAAIf,CAAC,GAAG,CAAC;AACT;AACA,EAAA,IAAIgB,CAAC,GAAG,IAAI3B,GAAG,CAACwB,EAAE,CAAC;AACnB;AACA,EAAA,OAAOb,CAAC,GAAGc,CAAC,EAAE,EAAEd,CAAC,EAAE;AACf,IAAA,IAAIY,EAAE,CAACZ,CAAC,CAAC,EACL,EAAEgB,CAAC,CAACJ,EAAE,CAACZ,CAAC,CAAC,GAAG,CAAC,CAAC;AACtB,EAAA;AACA;AACA,EAAA,IAAIiB,EAAE,GAAG,IAAI5B,GAAG,CAACwB,EAAE,CAAC;EACpB,KAAKb,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGa,EAAE,EAAE,EAAEb,CAAC,EAAE;AACrBiB,IAAAA,EAAE,CAACjB,CAAC,CAAC,GAAIiB,EAAE,CAACjB,CAAC,GAAG,CAAC,CAAC,GAAGgB,CAAC,CAAChB,CAAC,GAAG,CAAC,CAAC,IAAK,CAAC;AACvC,EAAA;AACA,EAAA,IAAIkB,EAAE;AACN,EAAA,IAAIjB,CAAC,EAAE;AACH;AACAiB,IAAAA,EAAE,GAAG,IAAI7B,GAAG,CAAC,CAAC,IAAIwB,EAAE,CAAC;AACrB;AACA,IAAA,IAAIM,GAAG,GAAG,EAAE,GAAGN,EAAE;IACjB,KAAKb,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGc,CAAC,EAAE,EAAEd,CAAC,EAAE;AACpB;AACA,MAAA,IAAIY,EAAE,CAACZ,CAAC,CAAC,EAAE;AACP;QACA,IAAIoB,EAAE,GAAIpB,CAAC,IAAI,CAAC,GAAIY,EAAE,CAACZ,CAAC,CAAC;AACzB;AACA,QAAA,IAAIqB,GAAG,GAAGR,EAAE,GAAGD,EAAE,CAACZ,CAAC,CAAC;AACpB;AACA,QAAA,IAAIsB,CAAC,GAAGL,EAAE,CAACL,EAAE,CAACZ,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAIqB,GAAG;AAC9B;AACA,QAAA,KAAK,IAAIE,CAAC,GAAGD,CAAC,GAAI,CAAC,CAAC,IAAID,GAAG,IAAI,CAAE,EAAEC,CAAC,IAAIC,CAAC,EAAE,EAAED,CAAC,EAAE;AAC5C;UACAJ,EAAE,CAACT,GAAG,CAACa,CAAC,CAAC,IAAIH,GAAG,CAAC,GAAGC,EAAE;AAC1B,QAAA;AACJ,MAAA;AACJ,IAAA;AACJ,EAAA,CAAC,MACI;AACDF,IAAAA,EAAE,GAAG,IAAI7B,GAAG,CAACyB,CAAC,CAAC;IACf,KAAKd,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGc,CAAC,EAAE,EAAEd,CAAC,EAAE;AACpB,MAAA,IAAIY,EAAE,CAACZ,CAAC,CAAC,EAAE;QACPkB,EAAE,CAAClB,CAAC,CAAC,GAAGS,GAAG,CAACQ,EAAE,CAACL,EAAE,CAACZ,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,IAAK,EAAE,GAAGY,EAAE,CAACZ,CAAC,CAAE;AAChD,MAAA;AACJ,IAAA;AACJ,EAAA;AACA,EAAA,OAAOkB,EAAE;AACb,CAAE;AACF;AACA,IAAIM,GAAG,GAAG,IAAIrC,EAAE,CAAC,GAAG,CAAC;AACrB,KAAK,IAAIa,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG,GAAG,EAAE,EAAEA,CAAC,EACxBwB,GAAG,CAACxB,CAAC,CAAC,GAAG,CAAC;AACd,KAAK,IAAIA,CAAC,GAAG,GAAG,EAAEA,CAAC,GAAG,GAAG,EAAE,EAAEA,CAAC,EAC1BwB,GAAG,CAACxB,CAAC,CAAC,GAAG,CAAC;AACd,KAAK,IAAIA,CAAC,GAAG,GAAG,EAAEA,CAAC,GAAG,GAAG,EAAE,EAAEA,CAAC,EAC1BwB,GAAG,CAACxB,CAAC,CAAC,GAAG,CAAC;AACd,KAAK,IAAIA,CAAC,GAAG,GAAG,EAAEA,CAAC,GAAG,GAAG,EAAE,EAAEA,CAAC,EAC1BwB,GAAG,CAACxB,CAAC,CAAC,GAAG,CAAC;AACd;AACA,IAAIyB,GAAG,GAAG,IAAItC,EAAE,CAAC,EAAE,CAAC;AACpB,KAAK,IAAIa,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG,EAAE,EAAE,EAAEA,CAAC,EACvByB,GAAG,CAACzB,CAAC,CAAC,GAAG,CAAC;AACd;AACA,IAAI0B,GAAG,gBAAiBf,IAAI,CAACa,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;EAAEG,IAAI,gBAAiBhB,IAAI,CAACa,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;AAC7E;AACA,IAAII,GAAG,gBAAiBjB,IAAI,CAACc,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;EAAEI,IAAI,gBAAiBlB,IAAI,CAACc,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;AAC7E;AACA,IAAIK,GAAG,GAAG,UAAUC,CAAC,EAAE;AACnB,EAAA,IAAIR,CAAC,GAAGQ,CAAC,CAAC,CAAC,CAAC;AACZ,EAAA,KAAK,IAAI/B,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG+B,CAAC,CAAChB,MAAM,EAAE,EAAEf,CAAC,EAAE;AAC/B,IAAA,IAAI+B,CAAC,CAAC/B,CAAC,CAAC,GAAGuB,CAAC,EACRA,CAAC,GAAGQ,CAAC,CAAC/B,CAAC,CAAC;AAChB,EAAA;AACA,EAAA,OAAOuB,CAAC;AACZ,CAAC;AACD;AACA,IAAIS,IAAI,GAAG,UAAUC,CAAC,EAAEC,CAAC,EAAEX,CAAC,EAAE;AAC1B,EAAA,IAAIY,CAAC,GAAID,CAAC,GAAG,CAAC,GAAI,CAAC;EACnB,OAAQ,CAACD,CAAC,CAACE,CAAC,CAAC,GAAIF,CAAC,CAACE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAE,MAAMD,CAAC,GAAG,CAAC,CAAC,GAAIX,CAAC;AACpD,CAAC;AACD;AACA,IAAIa,MAAM,GAAG,UAAUH,CAAC,EAAEC,CAAC,EAAE;AACzB,EAAA,IAAIC,CAAC,GAAID,CAAC,GAAG,CAAC,GAAI,CAAC;EACnB,OAAQ,CAACD,CAAC,CAACE,CAAC,CAAC,GAAIF,CAAC,CAACE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAE,GAAIF,CAAC,CAACE,CAAC,GAAG,CAAC,CAAC,IAAI,EAAG,MAAMD,CAAC,GAAG,CAAC,CAAC;AAClE,CAAC;AACD;AACA,IAAIG,IAAI,GAAG,UAAUH,CAAC,EAAE;AAAE,EAAA,OAAQ,CAACA,CAAC,GAAG,CAAC,IAAI,CAAC,GAAI,CAAC;AAAE,CAAC;AACrD;AACA;AACA,IAAII,GAAG,GAAG,UAAUhB,CAAC,EAAER,CAAC,EAAEyB,CAAC,EAAE;EACzB,IAAIzB,CAAC,IAAI,IAAI,IAAIA,CAAC,GAAG,CAAC,EAClBA,CAAC,GAAG,CAAC;AACT,EAAA,IAAIyB,CAAC,IAAI,IAAI,IAAIA,CAAC,GAAGjB,CAAC,CAACP,MAAM,EACzBwB,CAAC,GAAGjB,CAAC,CAACP,MAAM;AAChB;EACA,OAAO,IAAI5B,EAAE,CAACmC,CAAC,CAACkB,QAAQ,CAAC1B,CAAC,EAAEyB,CAAC,CAAC,CAAC;AACnC,CAAC;AAqBD;AACA,IAAIE,EAAE,GAAG,CACL,gBAAgB,EAChB,oBAAoB,EACpB,wBAAwB,EACxB,kBAAkB,EAClB,iBAAiB,EACjB,mBAAmB,GAEnB,aAAa,EACb,oBAAoB,EACpB,sBAAsB,EACtB,6BAA6B,EAC7B,mBAAmB,EACnB,kBAAkB,EAClB;AACA;AAAA,CACH;AAED,IAAIC,GAAG,GAAG,UAAUC,GAAG,EAAEC,GAAG,EAAEC,EAAE,EAAE;EAC9B,IAAIN,CAAC,GAAG,IAAIO,KAAK,CAACF,GAAG,IAAIH,EAAE,CAACE,GAAG,CAAC,CAAC;EACjCJ,CAAC,CAACQ,IAAI,GAAGJ,GAAG;EACZ,IAAIG,KAAK,CAACE,iBAAiB,EACvBF,KAAK,CAACE,iBAAiB,CAACT,CAAC,EAAEG,GAAG,CAAC;AACnC,EAAA,IAAI,CAACG,EAAE,EACH,MAAMN,CAAC;AACX,EAAA,OAAOA,CAAC;AACZ,CAAC;AACD;AACA,IAAIU,KAAK,GAAG,UAAUC,GAAG,EAAEC,EAAE,EAAEC,GAAG,EAAEC,IAAI,EAAE;AACtC;AACA,EAAA,IAAIC,EAAE,GAAGJ,GAAG,CAACnC,MAAM;AAAEwC,IAAAA,EAAE,GAAwB,CAAC;AAChD,EAAA,IAAI,CAACD,EAAE,IAAIH,EAAE,CAACK,CAAC,IAAI,CAACL,EAAE,CAACnC,CAAC,EACpB,OAAOoC,GAAG,IAAI,IAAIjE,EAAE,CAAC,CAAC,CAAC;EAC3B,IAAIsE,KAAK,GAAG,CAACL,GAAG;AAChB;EACA,IAAIM,MAAM,GAAGD,KAAK,IAAIN,EAAE,CAACnD,CAAC,IAAI,CAAC;AAG/B;EACA,IAAIyD,KAAK,EACLL,GAAG,GAAG,IAAIjE,EAAE,CAACmE,EAAE,GAAG,CAAC,CAAC;AACxB;AACA,EAAA,IAAIK,IAAI,GAAG,UAAU3C,CAAC,EAAE;AACpB,IAAA,IAAI4C,EAAE,GAAGR,GAAG,CAACrC,MAAM;AACnB;IACA,IAAIC,CAAC,GAAG4C,EAAE,EAAE;AACR;AACA,MAAA,IAAIC,IAAI,GAAG,IAAI1E,EAAE,CAAC2E,IAAI,CAAChC,GAAG,CAAC8B,EAAE,GAAG,CAAC,EAAE5C,CAAC,CAAC,CAAC;AACtC6C,MAAAA,IAAI,CAACE,GAAG,CAACX,GAAG,CAAC;AACbA,MAAAA,GAAG,GAAGS,IAAI;AACd,IAAA;EACJ,CAAC;AACD;AACA,EAAA,IAAIG,KAAK,GAAGb,EAAE,CAACK,CAAC,IAAI,CAAC;AAAES,IAAAA,GAAG,GAAGd,EAAE,CAACjB,CAAC,IAAI,CAAC;AAAEgC,IAAAA,EAAE,GAAGf,EAAE,CAACpD,CAAC,IAAI,CAAC;IAAEoE,EAAE,GAAGhB,EAAE,CAACnC,CAAC;IAAEoD,EAAE,GAAGjB,EAAE,CAAClB,CAAC;IAAEoC,GAAG,GAAGlB,EAAE,CAAC5B,CAAC;IAAE+C,GAAG,GAAGnB,EAAE,CAACoB,CAAC;AACpG;AACA,EAAA,IAAIC,IAAI,GAAGlB,EAAE,GAAG,CAAC;EACjB,GAAG;IACC,IAAI,CAACa,EAAE,EAAE;AACL;MACAH,KAAK,GAAGhC,IAAI,CAACkB,GAAG,EAAEe,GAAG,EAAE,CAAC,CAAC;AACzB;MACA,IAAIQ,IAAI,GAAGzC,IAAI,CAACkB,GAAG,EAAEe,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC;AAChCA,MAAAA,GAAG,IAAI,CAAC;MACR,IAAI,CAACQ,IAAI,EAAE;AACP;AACA,QAAA,IAAI3D,CAAC,GAAGuB,IAAI,CAAC4B,GAAG,CAAC,GAAG,CAAC;AAAEjD,UAAAA,CAAC,GAAGkC,GAAG,CAACpC,CAAC,GAAG,CAAC,CAAC,GAAIoC,GAAG,CAACpC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAE;UAAE4D,CAAC,GAAG5D,CAAC,GAAGE,CAAC;QACpE,IAAI0D,CAAC,GAAGpB,EAAE,EAAE;AACR,UACIZ,GAAG,CAAC,CAAC,CAAC;AACV,UAAA;AACJ,QAAA;AACA;AACA,QAAA,IAAIgB,MAAM,EACNC,IAAI,CAACO,EAAE,GAAGlD,CAAC,CAAC;AAChB;AACAoC,QAAAA,GAAG,CAACW,GAAG,CAACb,GAAG,CAACV,QAAQ,CAAC1B,CAAC,EAAE4D,CAAC,CAAC,EAAER,EAAE,CAAC;AAC/B;QACAf,EAAE,CAACpD,CAAC,GAAGmE,EAAE,IAAIlD,CAAC,EAAEmC,EAAE,CAACjB,CAAC,GAAG+B,GAAG,GAAGS,CAAC,GAAG,CAAC,EAAEvB,EAAE,CAACK,CAAC,GAAGQ,KAAK;AAChD,QAAA;MACJ,CAAC,MACI,IAAIS,IAAI,IAAI,CAAC,EACdN,EAAE,GAAGxC,IAAI,EAAEyC,EAAE,GAAGvC,IAAI,EAAEwC,GAAG,GAAG,CAAC,EAAEC,GAAG,GAAG,CAAC,CAAC,KACtC,IAAIG,IAAI,IAAI,CAAC,EAAE;AAChB;QACA,IAAIE,IAAI,GAAG3C,IAAI,CAACkB,GAAG,EAAEe,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG;AAAEW,UAAAA,KAAK,GAAG5C,IAAI,CAACkB,GAAG,EAAEe,GAAG,GAAG,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC;AACxE,QAAA,IAAIY,EAAE,GAAGF,IAAI,GAAG3C,IAAI,CAACkB,GAAG,EAAEe,GAAG,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC;AAC1CA,QAAAA,GAAG,IAAI,EAAE;AACT;AACA,QAAA,IAAIa,GAAG,GAAG,IAAI3F,EAAE,CAAC0F,EAAE,CAAC;AACpB;AACA,QAAA,IAAIE,GAAG,GAAG,IAAI5F,EAAE,CAAC,EAAE,CAAC;QACpB,KAAK,IAAIa,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG4E,KAAK,EAAE,EAAE5E,CAAC,EAAE;AAC5B;AACA+E,UAAAA,GAAG,CAACpF,IAAI,CAACK,CAAC,CAAC,CAAC,GAAGgC,IAAI,CAACkB,GAAG,EAAEe,GAAG,GAAGjE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;AAC5C,QAAA;QACAiE,GAAG,IAAIW,KAAK,GAAG,CAAC;AAChB;AACA,QAAA,IAAII,GAAG,GAAGlD,GAAG,CAACiD,GAAG,CAAC;AAAEE,UAAAA,MAAM,GAAG,CAAC,CAAC,IAAID,GAAG,IAAI,CAAC;AAC3C;QACA,IAAIE,GAAG,GAAGvE,IAAI,CAACoE,GAAG,EAAEC,GAAG,EAAE,CAAC,CAAC;QAC3B,KAAK,IAAIhF,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG6E,EAAE,GAAG;AACrB,UAAA,IAAI5E,CAAC,GAAGiF,GAAG,CAAClD,IAAI,CAACkB,GAAG,EAAEe,GAAG,EAAEgB,MAAM,CAAC,CAAC;AACnC;UACAhB,GAAG,IAAIhE,CAAC,GAAG,EAAE;AACb;AACA,UAAA,IAAIa,CAAC,GAAGb,CAAC,IAAI,CAAC;AACd;UACA,IAAIa,CAAC,GAAG,EAAE,EAAE;AACRgE,YAAAA,GAAG,CAAC9E,CAAC,EAAE,CAAC,GAAGc,CAAC;AAChB,UAAA,CAAC,MACI;AACD;YACA,IAAIqE,CAAC,GAAG,CAAC;AAAEZ,cAAAA,CAAC,GAAG,CAAC;AAChB,YAAA,IAAIzD,CAAC,IAAI,EAAE,EACPyD,CAAC,GAAG,CAAC,GAAGvC,IAAI,CAACkB,GAAG,EAAEe,GAAG,EAAE,CAAC,CAAC,EAAEA,GAAG,IAAI,CAAC,EAAEkB,CAAC,GAAGL,GAAG,CAAC9E,CAAC,GAAG,CAAC,CAAC,CAAC,KACnD,IAAIc,CAAC,IAAI,EAAE,EACZyD,CAAC,GAAG,CAAC,GAAGvC,IAAI,CAACkB,GAAG,EAAEe,GAAG,EAAE,CAAC,CAAC,EAAEA,GAAG,IAAI,CAAC,CAAC,KACnC,IAAInD,CAAC,IAAI,EAAE,EACZyD,CAAC,GAAG,EAAE,GAAGvC,IAAI,CAACkB,GAAG,EAAEe,GAAG,EAAE,GAAG,CAAC,EAAEA,GAAG,IAAI,CAAC;YAC1C,OAAOM,CAAC,EAAE,EACNO,GAAG,CAAC9E,CAAC,EAAE,CAAC,GAAGmF,CAAC;AACpB,UAAA;AACJ,QAAA;AACA;QACA,IAAIC,EAAE,GAAGN,GAAG,CAACtC,QAAQ,CAAC,CAAC,EAAEmC,IAAI,CAAC;AAAEU,UAAAA,EAAE,GAAGP,GAAG,CAACtC,QAAQ,CAACmC,IAAI,CAAC;AACvD;AACAN,QAAAA,GAAG,GAAGvC,GAAG,CAACsD,EAAE,CAAC;AACb;AACAd,QAAAA,GAAG,GAAGxC,GAAG,CAACuD,EAAE,CAAC;QACblB,EAAE,GAAGxD,IAAI,CAACyE,EAAE,EAAEf,GAAG,EAAE,CAAC,CAAC;QACrBD,EAAE,GAAGzD,IAAI,CAAC0E,EAAE,EAAEf,GAAG,EAAE,CAAC,CAAC;AACzB,MAAA,CAAC,MAEG5B,GAAG,CAAC,CAAC,CAAC;MACV,IAAIuB,GAAG,GAAGO,IAAI,EAAE;AACZ,QACI9B,GAAG,CAAC,CAAC,CAAC;AACV,QAAA;AACJ,MAAA;AACJ,IAAA;AACA;AACA;AACA,IAAA,IAAIgB,MAAM,EACNC,IAAI,CAACO,EAAE,GAAG,MAAM,CAAC;AACrB,IAAA,IAAIoB,GAAG,GAAG,CAAC,CAAC,IAAIjB,GAAG,IAAI,CAAC;AAAEkB,MAAAA,GAAG,GAAG,CAAC,CAAC,IAAIjB,GAAG,IAAI,CAAC;IAC9C,IAAIkB,IAAI,GAAGvB,GAAG;IACd,QAAQuB,IAAI,GAAGvB,GAAG,EAAE;AAChB;AACA,MAAA,IAAIkB,CAAC,GAAGhB,EAAE,CAAC/B,MAAM,CAACc,GAAG,EAAEe,GAAG,CAAC,GAAGqB,GAAG,CAAC;QAAEG,GAAG,GAAGN,CAAC,IAAI,CAAC;MAChDlB,GAAG,IAAIkB,CAAC,GAAG,EAAE;MACb,IAAIlB,GAAG,GAAGO,IAAI,EAAE;AACZ,QACI9B,GAAG,CAAC,CAAC,CAAC;AACV,QAAA;AACJ,MAAA;AACA,MAAA,IAAI,CAACyC,CAAC,EACFzC,GAAG,CAAC,CAAC,CAAC;AACV,MAAA,IAAI+C,GAAG,GAAG,GAAG,EACTrC,GAAG,CAACc,EAAE,EAAE,CAAC,GAAGuB,GAAG,CAAC,KACf,IAAIA,GAAG,IAAI,GAAG,EAAE;AACjBD,QAAAA,IAAI,GAAGvB,GAAG,EAAEE,EAAE,GAAG,IAAI;AACrB,QAAA;AACJ,MAAA,CAAC,MACI;AACD,QAAA,IAAIuB,GAAG,GAAGD,GAAG,GAAG,GAAG;AACnB;QACA,IAAIA,GAAG,GAAG,GAAG,EAAE;AACX;AACA,UAAA,IAAIzF,CAAC,GAAGyF,GAAG,GAAG,GAAG;AAAE1F,YAAAA,CAAC,GAAGN,IAAI,CAACO,CAAC,CAAC;AAC9B0F,UAAAA,GAAG,GAAG1D,IAAI,CAACkB,GAAG,EAAEe,GAAG,EAAE,CAAC,CAAC,IAAIlE,CAAC,IAAI,CAAC,CAAC,GAAGK,EAAE,CAACJ,CAAC,CAAC;AAC1CiE,UAAAA,GAAG,IAAIlE,CAAC;AACZ,QAAA;AACA;AACA,QAAA,IAAIkC,CAAC,GAAGmC,EAAE,CAAChC,MAAM,CAACc,GAAG,EAAEe,GAAG,CAAC,GAAGsB,GAAG,CAAC;UAAEI,IAAI,GAAG1D,CAAC,IAAI,CAAC;AACjD,QAAA,IAAI,CAACA,CAAC,EACFS,GAAG,CAAC,CAAC,CAAC;QACVuB,GAAG,IAAIhC,CAAC,GAAG,EAAE;AACb,QAAA,IAAIoD,EAAE,GAAG9E,EAAE,CAACoF,IAAI,CAAC;QACjB,IAAIA,IAAI,GAAG,CAAC,EAAE;AACV,UAAA,IAAI5F,CAAC,GAAGL,IAAI,CAACiG,IAAI,CAAC;AAClBN,UAAAA,EAAE,IAAIjD,MAAM,CAACc,GAAG,EAAEe,GAAG,CAAC,GAAG,CAAC,CAAC,IAAIlE,CAAC,IAAI,CAAC,EAAEkE,GAAG,IAAIlE,CAAC;AACnD,QAAA;QACA,IAAIkE,GAAG,GAAGO,IAAI,EAAE;AACZ,UACI9B,GAAG,CAAC,CAAC,CAAC;AACV,UAAA;AACJ,QAAA;AACA,QAAA,IAAIgB,MAAM,EACNC,IAAI,CAACO,EAAE,GAAG,MAAM,CAAC;AACrB,QAAA,IAAI0B,GAAG,GAAG1B,EAAE,GAAGwB,GAAG;QAClB,IAAIxB,EAAE,GAAGmB,EAAE,EAAE;AACT,UAAA,IAAIQ,KAAK,GAAGtC,EAAE,GAAG8B,EAAE;YAAES,IAAI,GAAGhC,IAAI,CAACiC,GAAG,CAACV,EAAE,EAAEO,GAAG,CAAC;UAC7C,IAAIC,KAAK,GAAG3B,EAAE,GAAG,CAAC,EACdxB,GAAG,CAAC,CAAC,CAAC;AACV,UAAA,OAAOwB,EAAE,GAAG4B,IAAI,EAAE,EAAE5B,EAAE,EAClBd,GAAG,CAACc,EAAE,CAAC,GAAGb,IAAI,CAACwC,KAAK,GAAG3B,EAAE,CAAC;AAClC,QAAA;AACA,QAAA,OAAOA,EAAE,GAAG0B,GAAG,EAAE,EAAE1B,EAAE,EACjBd,GAAG,CAACc,EAAE,CAAC,GAAGd,GAAG,CAACc,EAAE,GAAGmB,EAAE,CAAC;AAC9B,MAAA;AACJ,IAAA;IACAlC,EAAE,CAACnC,CAAC,GAAGmD,EAAE,EAAEhB,EAAE,CAACjB,CAAC,GAAGsD,IAAI,EAAErC,EAAE,CAACpD,CAAC,GAAGmE,EAAE,EAAEf,EAAE,CAACK,CAAC,GAAGQ,KAAK;IAC/C,IAAIG,EAAE,EACFH,KAAK,GAAG,CAAC,EAAEb,EAAE,CAAC5B,CAAC,GAAG8C,GAAG,EAAElB,EAAE,CAAClB,CAAC,GAAGmC,EAAE,EAAEjB,EAAE,CAACoB,CAAC,GAAGD,GAAG;EACpD,CAAC,QAAQ,CAACN,KAAK;AACf;EACA,OAAOE,EAAE,IAAId,GAAG,CAACrC,MAAM,IAAI0C,KAAK,GAAGnB,GAAG,CAACc,GAAG,EAAE,CAAC,EAAEc,EAAE,CAAC,GAAGd,GAAG,CAACZ,QAAQ,CAAC,CAAC,EAAE0B,EAAE,CAAC;AAC5E,CAAC;AACD;AACA,IAAI8B,KAAK,GAAG,UAAU/D,CAAC,EAAEC,CAAC,EAAEZ,CAAC,EAAE;EAC3BA,CAAC,KAAKY,CAAC,GAAG,CAAC;AACX,EAAA,IAAIC,CAAC,GAAID,CAAC,GAAG,CAAC,GAAI,CAAC;AACnBD,EAAAA,CAAC,CAACE,CAAC,CAAC,IAAIb,CAAC;EACTW,CAAC,CAACE,CAAC,GAAG,CAAC,CAAC,IAAIb,CAAC,IAAI,CAAC;AACtB,CAAC;AACD;AACA,IAAI2E,OAAO,GAAG,UAAUhE,CAAC,EAAEC,CAAC,EAAEZ,CAAC,EAAE;EAC7BA,CAAC,KAAKY,CAAC,GAAG,CAAC;AACX,EAAA,IAAIC,CAAC,GAAID,CAAC,GAAG,CAAC,GAAI,CAAC;AACnBD,EAAAA,CAAC,CAACE,CAAC,CAAC,IAAIb,CAAC;EACTW,CAAC,CAACE,CAAC,GAAG,CAAC,CAAC,IAAIb,CAAC,IAAI,CAAC;EAClBW,CAAC,CAACE,CAAC,GAAG,CAAC,CAAC,IAAIb,CAAC,IAAI,EAAE;AACvB,CAAC;AACD;AACA,IAAI4E,KAAK,GAAG,UAAUjE,CAAC,EAAEpB,EAAE,EAAE;AACzB;EACA,IAAI6D,CAAC,GAAG,EAAE;AACV,EAAA,KAAK,IAAI1E,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGiC,CAAC,CAAClB,MAAM,EAAE,EAAEf,CAAC,EAAE;IAC/B,IAAIiC,CAAC,CAACjC,CAAC,CAAC,EACJ0E,CAAC,CAACyB,IAAI,CAAC;AAAErF,MAAAA,CAAC,EAAEd,CAAC;MAAEwD,CAAC,EAAEvB,CAAC,CAACjC,CAAC;AAAE,KAAC,CAAC;AACjC,EAAA;AACA,EAAA,IAAIc,CAAC,GAAG4D,CAAC,CAAC3D,MAAM;AAChB,EAAA,IAAIqF,EAAE,GAAG1B,CAAC,CAAC2B,KAAK,EAAE;EAClB,IAAI,CAACvF,CAAC,EACF,OAAO;AAAE4D,IAAAA,CAAC,EAAE4B,EAAE;AAAEtF,IAAAA,CAAC,EAAE;GAAG;EAC1B,IAAIF,CAAC,IAAI,CAAC,EAAE;AACR,IAAA,IAAIQ,CAAC,GAAG,IAAInC,EAAE,CAACuF,CAAC,CAAC,CAAC,CAAC,CAAC5D,CAAC,GAAG,CAAC,CAAC;IAC1BQ,CAAC,CAACoD,CAAC,CAAC,CAAC,CAAC,CAAC5D,CAAC,CAAC,GAAG,CAAC;IACb,OAAO;AAAE4D,MAAAA,CAAC,EAAEpD,CAAC;AAAEN,MAAAA,CAAC,EAAE;KAAG;AACzB,EAAA;AACA0D,EAAAA,CAAC,CAAC6B,IAAI,CAAC,UAAUxE,CAAC,EAAEhC,CAAC,EAAE;AAAE,IAAA,OAAOgC,CAAC,CAACyB,CAAC,GAAGzD,CAAC,CAACyD,CAAC;AAAE,EAAA,CAAC,CAAC;AAC7C;AACA;EACAkB,CAAC,CAACyB,IAAI,CAAC;IAAErF,CAAC,EAAE,EAAE;AAAE0C,IAAAA,CAAC,EAAE;AAAM,GAAC,CAAC;AAC3B,EAAA,IAAIxC,CAAC,GAAG0D,CAAC,CAAC,CAAC,CAAC;AAAEzE,IAAAA,CAAC,GAAGyE,CAAC,CAAC,CAAC,CAAC;AAAE8B,IAAAA,EAAE,GAAG,CAAC;AAAEC,IAAAA,EAAE,GAAG,CAAC;AAAEC,IAAAA,EAAE,GAAG,CAAC;EAC9ChC,CAAC,CAAC,CAAC,CAAC,GAAG;IAAE5D,CAAC,EAAE,EAAE;AAAE0C,IAAAA,CAAC,EAAExC,CAAC,CAACwC,CAAC,GAAGvD,CAAC,CAACuD,CAAC;AAAExC,IAAAA,CAAC,EAAEA,CAAC;AAAEf,IAAAA,CAAC,EAAEA;GAAG;AAC1C;AACA;AACA;AACA;AACA;AACA,EAAA,OAAOwG,EAAE,IAAI3F,CAAC,GAAG,CAAC,EAAE;IAChBE,CAAC,GAAG0D,CAAC,CAACA,CAAC,CAAC8B,EAAE,CAAC,CAAChD,CAAC,GAAGkB,CAAC,CAACgC,EAAE,CAAC,CAAClD,CAAC,GAAGgD,EAAE,EAAE,GAAGE,EAAE,EAAE,CAAC;IACtCzG,CAAC,GAAGyE,CAAC,CAAC8B,EAAE,IAAIC,EAAE,IAAI/B,CAAC,CAAC8B,EAAE,CAAC,CAAChD,CAAC,GAAGkB,CAAC,CAACgC,EAAE,CAAC,CAAClD,CAAC,GAAGgD,EAAE,EAAE,GAAGE,EAAE,EAAE,CAAC;AAClDhC,IAAAA,CAAC,CAAC+B,EAAE,EAAE,CAAC,GAAG;MAAE3F,CAAC,EAAE,EAAE;AAAE0C,MAAAA,CAAC,EAAExC,CAAC,CAACwC,CAAC,GAAGvD,CAAC,CAACuD,CAAC;AAAExC,MAAAA,CAAC,EAAEA,CAAC;AAAEf,MAAAA,CAAC,EAAEA;KAAG;AACjD,EAAA;AACA,EAAA,IAAI0G,MAAM,GAAGP,EAAE,CAAC,CAAC,CAAC,CAACtF,CAAC;EACpB,KAAK,IAAId,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGc,CAAC,EAAE,EAAEd,CAAC,EAAE;AACxB,IAAA,IAAIoG,EAAE,CAACpG,CAAC,CAAC,CAACc,CAAC,GAAG6F,MAAM,EAChBA,MAAM,GAAGP,EAAE,CAACpG,CAAC,CAAC,CAACc,CAAC;AACxB,EAAA;AACA;EACA,IAAI8F,EAAE,GAAG,IAAIvH,GAAG,CAACsH,MAAM,GAAG,CAAC,CAAC;AAC5B;AACA,EAAA,IAAIE,GAAG,GAAGC,EAAE,CAACpC,CAAC,CAAC+B,EAAE,GAAG,CAAC,CAAC,EAAEG,EAAE,EAAE,CAAC,CAAC;EAC9B,IAAIC,GAAG,GAAGhG,EAAE,EAAE;AACV;AACA;AACA;IACA,IAAIb,CAAC,GAAG,CAAC;AAAEqF,MAAAA,EAAE,GAAG,CAAC;AACjB;AACA,IAAA,IAAI0B,GAAG,GAAGF,GAAG,GAAGhG,EAAE;MAAEmG,GAAG,GAAG,CAAC,IAAID,GAAG;AAClCX,IAAAA,EAAE,CAACG,IAAI,CAAC,UAAUxE,CAAC,EAAEhC,CAAC,EAAE;MAAE,OAAO6G,EAAE,CAAC7G,CAAC,CAACe,CAAC,CAAC,GAAG8F,EAAE,CAAC7E,CAAC,CAACjB,CAAC,CAAC,IAAIiB,CAAC,CAACyB,CAAC,GAAGzD,CAAC,CAACyD,CAAC;AAAE,IAAA,CAAC,CAAC;AACnE,IAAA,OAAOxD,CAAC,GAAGc,CAAC,EAAE,EAAEd,CAAC,EAAE;AACf,MAAA,IAAIiH,IAAI,GAAGb,EAAE,CAACpG,CAAC,CAAC,CAACc,CAAC;AAClB,MAAA,IAAI8F,EAAE,CAACK,IAAI,CAAC,GAAGpG,EAAE,EAAE;QACfwE,EAAE,IAAI2B,GAAG,IAAI,CAAC,IAAKH,GAAG,GAAGD,EAAE,CAACK,IAAI,CAAE,CAAC;AACnCL,QAAAA,EAAE,CAACK,IAAI,CAAC,GAAGpG,EAAE;AACjB,MAAA,CAAC,MAEG;AACR,IAAA;AACAwE,IAAAA,EAAE,KAAK0B,GAAG;IACV,OAAO1B,EAAE,GAAG,CAAC,EAAE;AACX,MAAA,IAAI6B,IAAI,GAAGd,EAAE,CAACpG,CAAC,CAAC,CAACc,CAAC;MAClB,IAAI8F,EAAE,CAACM,IAAI,CAAC,GAAGrG,EAAE,EACbwE,EAAE,IAAI,CAAC,IAAKxE,EAAE,GAAG+F,EAAE,CAACM,IAAI,CAAC,EAAE,GAAG,CAAE,CAAC,KAEjC,EAAElH,CAAC;AACX,IAAA;IACA,OAAOA,CAAC,IAAI,CAAC,IAAIqF,EAAE,EAAE,EAAErF,CAAC,EAAE;AACtB,MAAA,IAAImH,IAAI,GAAGf,EAAE,CAACpG,CAAC,CAAC,CAACc,CAAC;AAClB,MAAA,IAAI8F,EAAE,CAACO,IAAI,CAAC,IAAItG,EAAE,EAAE;QAChB,EAAE+F,EAAE,CAACO,IAAI,CAAC;AACV,QAAA,EAAE9B,EAAE;AACR,MAAA;AACJ,IAAA;AACAwB,IAAAA,GAAG,GAAGhG,EAAE;AACZ,EAAA;EACA,OAAO;AAAE6D,IAAAA,CAAC,EAAE,IAAIvF,EAAE,CAACyH,EAAE,CAAC;AAAE5F,IAAAA,CAAC,EAAE6F;GAAK;AACpC,CAAC;AACD;AACA,IAAIC,EAAE,GAAG,UAAUvC,CAAC,EAAEvD,CAAC,EAAEiB,CAAC,EAAE;EACxB,OAAOsC,CAAC,CAACzD,CAAC,IAAI,EAAE,GACVgD,IAAI,CAAChC,GAAG,CAACgF,EAAE,CAACvC,CAAC,CAACvD,CAAC,EAAEA,CAAC,EAAEiB,CAAC,GAAG,CAAC,CAAC,EAAE6E,EAAE,CAACvC,CAAC,CAACtE,CAAC,EAAEe,CAAC,EAAEiB,CAAC,GAAG,CAAC,CAAC,CAAC,GAC7CjB,CAAC,CAACuD,CAAC,CAACzD,CAAC,CAAC,GAAGmB,CAAE;AACtB,CAAC;AACD;AACA,IAAImF,EAAE,GAAG,UAAUjC,CAAC,EAAE;AAClB,EAAA,IAAIrE,CAAC,GAAGqE,CAAC,CAACpE,MAAM;AAChB;EACA,OAAOD,CAAC,IAAI,CAACqE,CAAC,CAAC,EAAErE,CAAC,CAAC,CACf;AACJ,EAAA,IAAIuG,EAAE,GAAG,IAAIhI,GAAG,CAAC,EAAEyB,CAAC,CAAC;AACrB;EACA,IAAIwG,GAAG,GAAG,CAAC;AAAEC,IAAAA,GAAG,GAAGpC,CAAC,CAAC,CAAC,CAAC;AAAEqC,IAAAA,GAAG,GAAG,CAAC;AAChC,EAAA,IAAIC,CAAC,GAAG,UAAUnG,CAAC,EAAE;AAAE+F,IAAAA,EAAE,CAACC,GAAG,EAAE,CAAC,GAAGhG,CAAC;EAAE,CAAC;EACvC,KAAK,IAAItB,CAAC,GAAG,CAAC,EAAEA,CAAC,IAAIc,CAAC,EAAE,EAAEd,CAAC,EAAE;AACzB,IAAA,IAAImF,CAAC,CAACnF,CAAC,CAAC,IAAIuH,GAAG,IAAIvH,CAAC,IAAIc,CAAC,EACrB,EAAE0G,GAAG,CAAC,KACL;AACD,MAAA,IAAI,CAACD,GAAG,IAAIC,GAAG,GAAG,CAAC,EAAE;QACjB,OAAOA,GAAG,GAAG,GAAG,EAAEA,GAAG,IAAI,GAAG,EACxBC,CAAC,CAAC,KAAK,CAAC;QACZ,IAAID,GAAG,GAAG,CAAC,EAAE;UACTC,CAAC,CAACD,GAAG,GAAG,EAAE,GAAKA,GAAG,GAAG,EAAE,IAAK,CAAC,GAAI,KAAK,GAAKA,GAAG,GAAG,CAAC,IAAK,CAAC,GAAI,KAAK,CAAC;AAClEA,UAAAA,GAAG,GAAG,CAAC;AACX,QAAA;AACJ,MAAA,CAAC,MACI,IAAIA,GAAG,GAAG,CAAC,EAAE;AACdC,QAAAA,CAAC,CAACF,GAAG,CAAC,EAAE,EAAEC,GAAG;QACb,OAAOA,GAAG,GAAG,CAAC,EAAEA,GAAG,IAAI,CAAC,EACpBC,CAAC,CAAC,IAAI,CAAC;AACX,QAAA,IAAID,GAAG,GAAG,CAAC,EACPC,CAAC,CAAGD,GAAG,GAAG,CAAC,IAAK,CAAC,GAAI,IAAI,CAAC,EAAEA,GAAG,GAAG,CAAC;AAC3C,MAAA;AACA,MAAA,OAAOA,GAAG,EAAE,EACRC,CAAC,CAACF,GAAG,CAAC;AACVC,MAAAA,GAAG,GAAG,CAAC;AACPD,MAAAA,GAAG,GAAGpC,CAAC,CAACnF,CAAC,CAAC;AACd,IAAA;AACJ,EAAA;EACA,OAAO;IAAEmF,CAAC,EAAEkC,EAAE,CAAC7E,QAAQ,CAAC,CAAC,EAAE8E,GAAG,CAAC;AAAE/C,IAAAA,CAAC,EAAEzD;GAAG;AAC3C,CAAC;AACD;AACA,IAAI4G,IAAI,GAAG,UAAUC,EAAE,EAAEN,EAAE,EAAE;EACzB,IAAIrG,CAAC,GAAG,CAAC;EACT,KAAK,IAAIhB,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGqH,EAAE,CAACtG,MAAM,EAAE,EAAEf,CAAC,EAC9BgB,CAAC,IAAI2G,EAAE,CAAC3H,CAAC,CAAC,GAAGqH,EAAE,CAACrH,CAAC,CAAC;AACtB,EAAA,OAAOgB,CAAC;AACZ,CAAC;AACD;AACA;AACA,IAAI4G,KAAK,GAAG,UAAUC,GAAG,EAAE5D,GAAG,EAAEf,GAAG,EAAE;AACjC;AACA,EAAA,IAAIpC,CAAC,GAAGoC,GAAG,CAACnC,MAAM;AAClB,EAAA,IAAIoB,CAAC,GAAGE,IAAI,CAAC4B,GAAG,GAAG,CAAC,CAAC;AACrB4D,EAAAA,GAAG,CAAC1F,CAAC,CAAC,GAAGrB,CAAC,GAAG,GAAG;EAChB+G,GAAG,CAAC1F,CAAC,GAAG,CAAC,CAAC,GAAGrB,CAAC,IAAI,CAAC;EACnB+G,GAAG,CAAC1F,CAAC,GAAG,CAAC,CAAC,GAAG0F,GAAG,CAAC1F,CAAC,CAAC,GAAG,GAAG;AACzB0F,EAAAA,GAAG,CAAC1F,CAAC,GAAG,CAAC,CAAC,GAAG0F,GAAG,CAAC1F,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG;EAC7B,KAAK,IAAInC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGc,CAAC,EAAE,EAAEd,CAAC,EACtB6H,GAAG,CAAC1F,CAAC,GAAGnC,CAAC,GAAG,CAAC,CAAC,GAAGkD,GAAG,CAAClD,CAAC,CAAC;AAC3B,EAAA,OAAO,CAACmC,CAAC,GAAG,CAAC,GAAGrB,CAAC,IAAI,CAAC;AAC1B,CAAC;AACD;AACA,IAAIgH,IAAI,GAAG,UAAU5E,GAAG,EAAE2E,GAAG,EAAE7D,KAAK,EAAE+D,IAAI,EAAEC,EAAE,EAAEC,EAAE,EAAEpI,EAAE,EAAEqI,EAAE,EAAEC,EAAE,EAAEvE,EAAE,EAAE1B,CAAC,EAAE;AACnE8D,EAAAA,KAAK,CAAC6B,GAAG,EAAE3F,CAAC,EAAE,EAAE8B,KAAK,CAAC;EACtB,EAAEgE,EAAE,CAAC,GAAG,CAAC;AACT,EAAA,IAAI7H,EAAE,GAAG+F,KAAK,CAAC8B,EAAE,EAAE,EAAE,CAAC;IAAEI,GAAG,GAAGjI,EAAE,CAACuE,CAAC;IAAE2D,GAAG,GAAGlI,EAAE,CAACa,CAAC;AAC9C,EAAA,IAAIV,EAAE,GAAG4F,KAAK,CAAC+B,EAAE,EAAE,EAAE,CAAC;IAAEK,GAAG,GAAGhI,EAAE,CAACoE,CAAC;IAAE6D,GAAG,GAAGjI,EAAE,CAACU,CAAC;AAC9C,EAAA,IAAIwH,EAAE,GAAGpB,EAAE,CAACgB,GAAG,CAAC;IAAEK,IAAI,GAAGD,EAAE,CAACrD,CAAC;IAAEuD,GAAG,GAAGF,EAAE,CAACjE,CAAC;AACzC,EAAA,IAAIoE,EAAE,GAAGvB,EAAE,CAACkB,GAAG,CAAC;IAAEM,IAAI,GAAGD,EAAE,CAACxD,CAAC;IAAE0D,GAAG,GAAGF,EAAE,CAACpE,CAAC;AACzC,EAAA,IAAIuE,MAAM,GAAG,IAAIzJ,GAAG,CAAC,EAAE,CAAC;EACxB,KAAK,IAAIW,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGyI,IAAI,CAAC1H,MAAM,EAAE,EAAEf,CAAC,EAChC,EAAE8I,MAAM,CAACL,IAAI,CAACzI,CAAC,CAAC,GAAG,EAAE,CAAC;EAC1B,KAAK,IAAIA,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG4I,IAAI,CAAC7H,MAAM,EAAE,EAAEf,CAAC,EAChC,EAAE8I,MAAM,CAACF,IAAI,CAAC5I,CAAC,CAAC,GAAG,EAAE,CAAC;AAC1B,EAAA,IAAI+I,EAAE,GAAG7C,KAAK,CAAC4C,MAAM,EAAE,CAAC,CAAC;IAAEE,GAAG,GAAGD,EAAE,CAACrE,CAAC;IAAEuE,IAAI,GAAGF,EAAE,CAAC/H,CAAC;EAClD,IAAIkI,IAAI,GAAG,EAAE;AACb,EAAA,OAAOA,IAAI,GAAG,CAAC,IAAI,CAACF,GAAG,CAACrJ,IAAI,CAACuJ,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,EAAEA,IAAI,CAC3C;AACJ,EAAA,IAAIC,IAAI,GAAIvF,EAAE,GAAG,CAAC,IAAK,CAAC;AACxB,EAAA,IAAIwF,KAAK,GAAG1B,IAAI,CAACM,EAAE,EAAExG,GAAG,CAAC,GAAGkG,IAAI,CAACO,EAAE,EAAExG,GAAG,CAAC,GAAG5B,EAAE;EAC9C,IAAIwJ,KAAK,GAAG3B,IAAI,CAACM,EAAE,EAAEI,GAAG,CAAC,GAAGV,IAAI,CAACO,EAAE,EAAEK,GAAG,CAAC,GAAGzI,EAAE,GAAG,EAAE,GAAG,CAAC,GAAGqJ,IAAI,GAAGxB,IAAI,CAACoB,MAAM,EAAEE,GAAG,CAAC,GAAG,CAAC,GAAGF,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,GAAGA,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,GAAGA,MAAM,CAAC,EAAE,CAAC;AACrI,EAAA,IAAIX,EAAE,IAAI,CAAC,IAAIgB,IAAI,IAAIC,KAAK,IAAID,IAAI,IAAIE,KAAK,EACzC,OAAOzB,KAAK,CAACC,GAAG,EAAE3F,CAAC,EAAEgB,GAAG,CAACV,QAAQ,CAAC2F,EAAE,EAAEA,EAAE,GAAGvE,EAAE,CAAC,CAAC;AACnD,EAAA,IAAIO,EAAE,EAAEmF,EAAE,EAAElF,EAAE,EAAEb,EAAE;AAClByC,EAAAA,KAAK,CAAC6B,GAAG,EAAE3F,CAAC,EAAE,CAAC,IAAImH,KAAK,GAAGD,KAAK,CAAC,CAAC,EAAElH,CAAC,IAAI,CAAC;EAC1C,IAAImH,KAAK,GAAGD,KAAK,EAAE;IACfjF,EAAE,GAAGxD,IAAI,CAACyH,GAAG,EAAEC,GAAG,EAAE,CAAC,CAAC,EAAEiB,EAAE,GAAGlB,GAAG,EAAEhE,EAAE,GAAGzD,IAAI,CAAC2H,GAAG,EAAEC,GAAG,EAAE,CAAC,CAAC,EAAEhF,EAAE,GAAG+E,GAAG;IAClE,IAAIiB,GAAG,GAAG5I,IAAI,CAACqI,GAAG,EAAEC,IAAI,EAAE,CAAC,CAAC;IAC5BjD,KAAK,CAAC6B,GAAG,EAAE3F,CAAC,EAAEwG,GAAG,GAAG,GAAG,CAAC;IACxB1C,KAAK,CAAC6B,GAAG,EAAE3F,CAAC,GAAG,CAAC,EAAE2G,GAAG,GAAG,CAAC,CAAC;IAC1B7C,KAAK,CAAC6B,GAAG,EAAE3F,CAAC,GAAG,EAAE,EAAEgH,IAAI,GAAG,CAAC,CAAC;AAC5BhH,IAAAA,CAAC,IAAI,EAAE;AACP,IAAA,KAAK,IAAIlC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGkJ,IAAI,EAAE,EAAElJ,CAAC,EACzBgG,KAAK,CAAC6B,GAAG,EAAE3F,CAAC,GAAG,CAAC,GAAGlC,CAAC,EAAEgJ,GAAG,CAACrJ,IAAI,CAACK,CAAC,CAAC,CAAC,CAAC;IACvCkC,CAAC,IAAI,CAAC,GAAGgH,IAAI;AACb,IAAA,IAAIM,IAAI,GAAG,CAACf,IAAI,EAAEG,IAAI,CAAC;IACvB,KAAK,IAAIa,EAAE,GAAG,CAAC,EAAEA,EAAE,GAAG,CAAC,EAAE,EAAEA,EAAE,EAAE;AAC3B,MAAA,IAAIC,IAAI,GAAGF,IAAI,CAACC,EAAE,CAAC;AACnB,MAAA,KAAK,IAAIzJ,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG0J,IAAI,CAAC3I,MAAM,EAAE,EAAEf,CAAC,EAAE;AAClC,QAAA,IAAI2J,GAAG,GAAGD,IAAI,CAAC1J,CAAC,CAAC,GAAG,EAAE;AACtBgG,QAAAA,KAAK,CAAC6B,GAAG,EAAE3F,CAAC,EAAEqH,GAAG,CAACI,GAAG,CAAC,CAAC,EAAEzH,CAAC,IAAI8G,GAAG,CAACW,GAAG,CAAC;QACtC,IAAIA,GAAG,GAAG,EAAE,EACR3D,KAAK,CAAC6B,GAAG,EAAE3F,CAAC,EAAGwH,IAAI,CAAC1J,CAAC,CAAC,IAAI,CAAC,GAAI,GAAG,CAAC,EAAEkC,CAAC,IAAIwH,IAAI,CAAC1J,CAAC,CAAC,IAAI,EAAE;AAC/D,MAAA;AACJ,IAAA;AACJ,EAAA,CAAC,MACI;AACDmE,IAAAA,EAAE,GAAGzC,GAAG,EAAE4H,EAAE,GAAG9H,GAAG,EAAE4C,EAAE,GAAGxC,GAAG,EAAE2B,EAAE,GAAG9B,GAAG;AAC1C,EAAA;EACA,KAAK,IAAIzB,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGkI,EAAE,EAAE,EAAElI,CAAC,EAAE;AACzB,IAAA,IAAIyF,GAAG,GAAGsC,IAAI,CAAC/H,CAAC,CAAC;IACjB,IAAIyF,GAAG,GAAG,GAAG,EAAE;AACX,MAAA,IAAIkE,GAAG,GAAIlE,GAAG,IAAI,EAAE,GAAI,EAAE;MAC1BQ,OAAO,CAAC4B,GAAG,EAAE3F,CAAC,EAAEiC,EAAE,CAACwF,GAAG,GAAG,GAAG,CAAC,CAAC,EAAEzH,CAAC,IAAIoH,EAAE,CAACK,GAAG,GAAG,GAAG,CAAC;MAClD,IAAIA,GAAG,GAAG,CAAC,EACP3D,KAAK,CAAC6B,GAAG,EAAE3F,CAAC,EAAGuD,GAAG,IAAI,EAAE,GAAI,EAAE,CAAC,EAAEvD,CAAC,IAAIzC,IAAI,CAACkK,GAAG,CAAC;AACnD,MAAA,IAAIC,GAAG,GAAGnE,GAAG,GAAG,EAAE;AAClBQ,MAAAA,OAAO,CAAC4B,GAAG,EAAE3F,CAAC,EAAEkC,EAAE,CAACwF,GAAG,CAAC,CAAC,EAAE1H,CAAC,IAAIqB,EAAE,CAACqG,GAAG,CAAC;MACtC,IAAIA,GAAG,GAAG,CAAC,EACP3D,OAAO,CAAC4B,GAAG,EAAE3F,CAAC,EAAGuD,GAAG,IAAI,CAAC,GAAI,IAAI,CAAC,EAAEvD,CAAC,IAAIxC,IAAI,CAACkK,GAAG,CAAC;AAC1D,IAAA,CAAC,MACI;AACD3D,MAAAA,OAAO,CAAC4B,GAAG,EAAE3F,CAAC,EAAEiC,EAAE,CAACsB,GAAG,CAAC,CAAC,EAAEvD,CAAC,IAAIoH,EAAE,CAAC7D,GAAG,CAAC;AAC1C,IAAA;AACJ,EAAA;EACAQ,OAAO,CAAC4B,GAAG,EAAE3F,CAAC,EAAEiC,EAAE,CAAC,GAAG,CAAC,CAAC;AACxB,EAAA,OAAOjC,CAAC,GAAGoH,EAAE,CAAC,GAAG,CAAC;AACtB,CAAC;AACD;AACA,IAAIO,GAAG,gBAAiB,IAAItK,GAAG,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;AAC5G;AACA,IAAI+G,EAAE,gBAAiB,IAAInH,EAAE,CAAC,CAAC,CAAC;AAChC;AACA,IAAI2K,IAAI,GAAG,UAAU5G,GAAG,EAAE6G,GAAG,EAAEC,IAAI,EAAEC,GAAG,EAAEC,IAAI,EAAE/G,EAAE,EAAE;EAChD,IAAIrC,CAAC,GAAGqC,EAAE,CAACgH,CAAC,IAAIjH,GAAG,CAACnC,MAAM;EAC1B,IAAIoB,CAAC,GAAG,IAAIhD,EAAE,CAAC8K,GAAG,GAAGnJ,CAAC,GAAG,CAAC,IAAI,CAAC,GAAGgD,IAAI,CAACsG,IAAI,CAACtJ,CAAC,GAAG,IAAI,CAAC,CAAC,GAAGoJ,IAAI,CAAC;AAC9D;AACA,EAAA,IAAIzC,CAAC,GAAGtF,CAAC,CAACK,QAAQ,CAACyH,GAAG,EAAE9H,CAAC,CAACpB,MAAM,GAAGmJ,IAAI,CAAC;AACxC,EAAA,IAAIG,GAAG,GAAGlH,EAAE,CAACnC,CAAC;EACd,IAAIiD,GAAG,GAAG,CAACd,EAAE,CAAClD,CAAC,IAAI,CAAC,IAAI,CAAC;AACzB,EAAA,IAAI8J,GAAG,EAAE;IACL,IAAI9F,GAAG,EACHwD,CAAC,CAAC,CAAC,CAAC,GAAGtE,EAAE,CAAClD,CAAC,IAAI,CAAC;AACpB,IAAA,IAAIqK,GAAG,GAAGT,GAAG,CAACE,GAAG,GAAG,CAAC,CAAC;AACtB,IAAA,IAAIxF,CAAC,GAAG+F,GAAG,IAAI,EAAE;MAAEnF,CAAC,GAAGmF,GAAG,GAAG,IAAI;AACjC,IAAA,IAAIC,KAAK,GAAG,CAAC,CAAC,IAAIP,IAAI,IAAI,CAAC;AAC3B;IACA,IAAIQ,IAAI,GAAGrH,EAAE,CAACjB,CAAC,IAAI,IAAI7C,GAAG,CAAC,KAAK,CAAC;MAAEoL,IAAI,GAAGtH,EAAE,CAACuH,CAAC,IAAI,IAAIrL,GAAG,CAACkL,KAAK,GAAG,CAAC,CAAC;IACpE,IAAII,KAAK,GAAG7G,IAAI,CAACsG,IAAI,CAACJ,IAAI,GAAG,CAAC,CAAC;MAAEY,KAAK,GAAG,CAAC,GAAGD,KAAK;AAClD,IAAA,IAAIE,GAAG,GAAG,UAAU7K,CAAC,EAAE;MAAE,OAAO,CAACkD,GAAG,CAAClD,CAAC,CAAC,GAAIkD,GAAG,CAAClD,CAAC,GAAG,CAAC,CAAC,IAAI2K,KAAM,GAAIzH,GAAG,CAAClD,CAAC,GAAG,CAAC,CAAC,IAAI4K,KAAM,IAAIL,KAAK;IAAE,CAAC;AACnG;AACA;AACA,IAAA,IAAIxC,IAAI,GAAG,IAAIxI,GAAG,CAAC,KAAK,CAAC;AACzB;AACA,IAAA,IAAIyI,EAAE,GAAG,IAAI3I,GAAG,CAAC,GAAG,CAAC;AAAE4I,MAAAA,EAAE,GAAG,IAAI5I,GAAG,CAAC,EAAE,CAAC;AACvC;IACA,IAAIyL,IAAI,GAAG,CAAC;AAAEjL,MAAAA,EAAE,GAAG,CAAC;AAAEG,MAAAA,CAAC,GAAGmD,EAAE,CAACnD,CAAC,IAAI,CAAC;AAAEkI,MAAAA,EAAE,GAAG,CAAC;AAAE6C,MAAAA,EAAE,GAAG5H,EAAE,CAACsE,CAAC,IAAI,CAAC;AAAEU,MAAAA,EAAE,GAAG,CAAC;IACnE,OAAOnI,CAAC,GAAG,CAAC,GAAGc,CAAC,EAAE,EAAEd,CAAC,EAAE;AACnB;AACA,MAAA,IAAIgL,EAAE,GAAGH,GAAG,CAAC7K,CAAC,CAAC;AACf;AACA,MAAA,IAAIiL,IAAI,GAAGjL,CAAC,GAAG,KAAK;AAAEkL,QAAAA,KAAK,GAAGT,IAAI,CAACO,EAAE,CAAC;AACtCR,MAAAA,IAAI,CAACS,IAAI,CAAC,GAAGC,KAAK;AAClBT,MAAAA,IAAI,CAACO,EAAE,CAAC,GAAGC,IAAI;AACf;AACA;MACA,IAAIF,EAAE,IAAI/K,CAAC,EAAE;AACT;AACA,QAAA,IAAImL,GAAG,GAAGrK,CAAC,GAAGd,CAAC;AACf,QAAA,IAAI,CAAC8K,IAAI,GAAG,IAAI,IAAI5C,EAAE,GAAG,KAAK,MAAMiD,GAAG,GAAG,GAAG,IAAI,CAACd,GAAG,CAAC,EAAE;UACpDpG,GAAG,GAAG6D,IAAI,CAAC5E,GAAG,EAAEuE,CAAC,EAAE,CAAC,EAAEM,IAAI,EAAEC,EAAE,EAAEC,EAAE,EAAEpI,EAAE,EAAEqI,EAAE,EAAEC,EAAE,EAAEnI,CAAC,GAAGmI,EAAE,EAAElE,GAAG,CAAC;UAC5DiE,EAAE,GAAG4C,IAAI,GAAGjL,EAAE,GAAG,CAAC,EAAEsI,EAAE,GAAGnI,CAAC;AAC1B,UAAA,KAAK,IAAIE,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG,GAAG,EAAE,EAAEA,CAAC,EACxB8H,EAAE,CAAC9H,CAAC,CAAC,GAAG,CAAC;AACb,UAAA,KAAK,IAAIA,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG,EAAE,EAAE,EAAEA,CAAC,EACvB+H,EAAE,CAAC/H,CAAC,CAAC,GAAG,CAAC;AACjB,QAAA;AACA;QACA,IAAIc,CAAC,GAAG,CAAC;AAAEiB,UAAAA,CAAC,GAAG,CAAC;AAAEmJ,UAAAA,IAAI,GAAGjG,CAAC;AAAEkG,UAAAA,GAAG,GAAGJ,IAAI,GAAGC,KAAK,GAAG,KAAK;AACtD,QAAA,IAAIC,GAAG,GAAG,CAAC,IAAIH,EAAE,IAAIH,GAAG,CAAC7K,CAAC,GAAGqL,GAAG,CAAC,EAAE;UAC/B,IAAIC,IAAI,GAAGxH,IAAI,CAACiC,GAAG,CAACxB,CAAC,EAAE4G,GAAG,CAAC,GAAG,CAAC;UAC/B,IAAII,IAAI,GAAGzH,IAAI,CAACiC,GAAG,CAAC,KAAK,EAAE/F,CAAC,CAAC;AAC7B;AACA;UACA,IAAIwL,EAAE,GAAG1H,IAAI,CAACiC,GAAG,CAAC,GAAG,EAAEoF,GAAG,CAAC;UAC3B,OAAOE,GAAG,IAAIE,IAAI,IAAI,EAAEH,IAAI,IAAIH,IAAI,IAAIC,KAAK,EAAE;AAC3C,YAAA,IAAIhI,GAAG,CAAClD,CAAC,GAAGgB,CAAC,CAAC,IAAIkC,GAAG,CAAClD,CAAC,GAAGgB,CAAC,GAAGqK,GAAG,CAAC,EAAE;cAChC,IAAII,EAAE,GAAG,CAAC;cACV,OAAOA,EAAE,GAAGD,EAAE,IAAItI,GAAG,CAAClD,CAAC,GAAGyL,EAAE,CAAC,IAAIvI,GAAG,CAAClD,CAAC,GAAGyL,EAAE,GAAGJ,GAAG,CAAC,EAAE,EAAEI,EAAE,CACpD;cACJ,IAAIA,EAAE,GAAGzK,CAAC,EAAE;AACRA,gBAAAA,CAAC,GAAGyK,EAAE,EAAExJ,CAAC,GAAGoJ,GAAG;AACf;gBACA,IAAII,EAAE,GAAGH,IAAI,EACT;AACJ;AACA;AACA;gBACA,IAAII,GAAG,GAAG5H,IAAI,CAACiC,GAAG,CAACsF,GAAG,EAAEI,EAAE,GAAG,CAAC,CAAC;gBAC/B,IAAIE,EAAE,GAAG,CAAC;gBACV,KAAK,IAAIzL,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGwL,GAAG,EAAE,EAAExL,CAAC,EAAE;kBAC1B,IAAI0L,EAAE,GAAG5L,CAAC,GAAGqL,GAAG,GAAGnL,CAAC,GAAG,KAAK;AAC5B,kBAAA,IAAI2L,GAAG,GAAGrB,IAAI,CAACoB,EAAE,CAAC;AAClB,kBAAA,IAAIhL,EAAE,GAAGgL,EAAE,GAAGC,GAAG,GAAG,KAAK;kBACzB,IAAIjL,EAAE,GAAG+K,EAAE,EACPA,EAAE,GAAG/K,EAAE,EAAEsK,KAAK,GAAGU,EAAE;AAC3B,gBAAA;AACJ,cAAA;AACJ,YAAA;AACA;YACAX,IAAI,GAAGC,KAAK,EAAEA,KAAK,GAAGV,IAAI,CAACS,IAAI,CAAC;AAChCI,YAAAA,GAAG,IAAIJ,IAAI,GAAGC,KAAK,GAAG,KAAK;AAC/B,UAAA;AACJ,QAAA;AACA;AACA,QAAA,IAAIjJ,CAAC,EAAE;AACH;AACA;AACA8F,UAAAA,IAAI,CAACG,EAAE,EAAE,CAAC,GAAG,SAAS,GAAI7H,KAAK,CAACW,CAAC,CAAC,IAAI,EAAG,GAAGR,KAAK,CAACyB,CAAC,CAAC;AACpD,UAAA,IAAI6J,GAAG,GAAGzL,KAAK,CAACW,CAAC,CAAC,GAAG,EAAE;AAAE+K,YAAAA,GAAG,GAAGvL,KAAK,CAACyB,CAAC,CAAC,GAAG,EAAE;UAC5CpC,EAAE,IAAIJ,IAAI,CAACqM,GAAG,CAAC,GAAGpM,IAAI,CAACqM,GAAG,CAAC;AAC3B,UAAA,EAAE/D,EAAE,CAAC,GAAG,GAAG8D,GAAG,CAAC;UACf,EAAE7D,EAAE,CAAC8D,GAAG,CAAC;UACThB,EAAE,GAAG/K,CAAC,GAAGgB,CAAC;AACV,UAAA,EAAE8J,IAAI;AACV,QAAA,CAAC,MACI;UACD/C,IAAI,CAACG,EAAE,EAAE,CAAC,GAAGhF,GAAG,CAAClD,CAAC,CAAC;AACnB,UAAA,EAAEgI,EAAE,CAAC9E,GAAG,CAAClD,CAAC,CAAC,CAAC;AAChB,QAAA;AACJ,MAAA;AACJ,IAAA;AACA,IAAA,KAAKA,CAAC,GAAG8D,IAAI,CAAChC,GAAG,CAAC9B,CAAC,EAAE+K,EAAE,CAAC,EAAE/K,CAAC,GAAGc,CAAC,EAAE,EAAEd,CAAC,EAAE;MAClC+H,IAAI,CAACG,EAAE,EAAE,CAAC,GAAGhF,GAAG,CAAClD,CAAC,CAAC;AACnB,MAAA,EAAEgI,EAAE,CAAC9E,GAAG,CAAClD,CAAC,CAAC,CAAC;AAChB,IAAA;IACAiE,GAAG,GAAG6D,IAAI,CAAC5E,GAAG,EAAEuE,CAAC,EAAE4C,GAAG,EAAEtC,IAAI,EAAEC,EAAE,EAAEC,EAAE,EAAEpI,EAAE,EAAEqI,EAAE,EAAEC,EAAE,EAAEnI,CAAC,GAAGmI,EAAE,EAAElE,GAAG,CAAC;IAC9D,IAAI,CAACoG,GAAG,EAAE;AACNlH,MAAAA,EAAE,CAAClD,CAAC,GAAIgE,GAAG,GAAG,CAAC,GAAIwD,CAAC,CAAExD,GAAG,GAAG,CAAC,GAAI,CAAC,CAAC,IAAI,CAAC;AACxC;AACAA,MAAAA,GAAG,IAAI,CAAC;MACRd,EAAE,CAACuH,CAAC,GAAGD,IAAI,EAAEtH,EAAE,CAACjB,CAAC,GAAGsI,IAAI,EAAErH,EAAE,CAACnD,CAAC,GAAGA,CAAC,EAAEmD,EAAE,CAACsE,CAAC,GAAGsD,EAAE;AACjD,IAAA;AACJ,EAAA,CAAC,MACI;AACD,IAAA,KAAK,IAAI/K,CAAC,GAAGmD,EAAE,CAACsE,CAAC,IAAI,CAAC,EAAEzH,CAAC,GAAGc,CAAC,GAAGuJ,GAAG,EAAErK,CAAC,IAAI,KAAK,EAAE;AAC7C;AACA,MAAA,IAAIuC,CAAC,GAAGvC,CAAC,GAAG,KAAK;MACjB,IAAIuC,CAAC,IAAIzB,CAAC,EAAE;AACR;QACA2G,CAAC,CAAExD,GAAG,GAAG,CAAC,GAAI,CAAC,CAAC,GAAGoG,GAAG;AACtB9H,QAAAA,CAAC,GAAGzB,CAAC;AACT,MAAA;AACAmD,MAAAA,GAAG,GAAG2D,KAAK,CAACH,CAAC,EAAExD,GAAG,GAAG,CAAC,EAAEf,GAAG,CAACV,QAAQ,CAACxC,CAAC,EAAEuC,CAAC,CAAC,CAAC;AAC/C,IAAA;IACAY,EAAE,CAACnD,CAAC,GAAGc,CAAC;AACZ,EAAA;AACA,EAAA,OAAOwB,GAAG,CAACH,CAAC,EAAE,CAAC,EAAE8H,GAAG,GAAG5H,IAAI,CAAC4B,GAAG,CAAC,GAAGiG,IAAI,CAAC;AAC5C,CAAC;AAiDD;AACA,IAAI8B,IAAI,GAAG,UAAU9I,GAAG,EAAEoH,GAAG,EAAEL,GAAG,EAAEC,IAAI,EAAE/G,EAAE,EAAE;EAC1C,IAAI,CAACA,EAAE,EAAE;AACLA,IAAAA,EAAE,GAAG;AAAEnC,MAAAA,CAAC,EAAE;KAAG;IACb,IAAIsJ,GAAG,CAAC2B,UAAU,EAAE;MAChB,IAAI5I,IAAI,GAAGiH,GAAG,CAAC2B,UAAU,CAACzJ,QAAQ,CAAC,MAAM,CAAC;AAC1C,MAAA,IAAI0J,MAAM,GAAG,IAAI/M,EAAE,CAACkE,IAAI,CAACtC,MAAM,GAAGmC,GAAG,CAACnC,MAAM,CAAC;AAC7CmL,MAAAA,MAAM,CAACnI,GAAG,CAACV,IAAI,CAAC;MAChB6I,MAAM,CAACnI,GAAG,CAACb,GAAG,EAAEG,IAAI,CAACtC,MAAM,CAAC;AAC5BmC,MAAAA,GAAG,GAAGgJ,MAAM;AACZ/I,MAAAA,EAAE,CAACsE,CAAC,GAAGpE,IAAI,CAACtC,MAAM;AACtB,IAAA;AACJ,EAAA;AACA,EAAA,OAAO+I,IAAI,CAAC5G,GAAG,EAAEoH,GAAG,CAAC6B,KAAK,IAAI,IAAI,GAAG,CAAC,GAAG7B,GAAG,CAAC6B,KAAK,EAAE7B,GAAG,CAAC8B,GAAG,IAAI,IAAI,GAAIjJ,EAAE,CAACnC,CAAC,GAAG8C,IAAI,CAACsG,IAAI,CAACtG,IAAI,CAAChC,GAAG,CAAC,CAAC,EAAEgC,IAAI,CAACiC,GAAG,CAAC,EAAE,EAAEjC,IAAI,CAACuI,GAAG,CAACnJ,GAAG,CAACnC,MAAM,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,EAAE,GAAK,EAAE,GAAGuJ,GAAG,CAAC8B,GAAI,EAAEnC,GAAG,EAAEC,IAAI,EAAE/G,EAAE,CAAC;AACzL,CAAC;AAkTD;AACA;AACA;AACA;AACA;AACA;AACO,SAASmJ,WAAWA,CAACC,IAAI,EAAEC,IAAI,EAAE;AACpC,EAAA,OAAOR,IAAI,CAACO,IAAI,EAAEC,IAAI,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;AACvC;AAyEA;AACA;AACA;AACA;AACA;AACA;AACO,SAASC,WAAWA,CAACF,IAAI,EAAEC,IAAI,EAAE;EACpC,OAAOvJ,KAAK,CAACsJ,IAAI,EAAE;AAAEvM,IAAAA,CAAC,EAAE;AAAE,GAAC,EAAEwM,IAAgB,EAAEA,IAAuB,CAAC;AAC3E;AAubA;AACA,IAAIE,EAAE,GAAG,OAAOC,WAAW,IAAI,WAAW,iBAAkB,IAAIA,WAAW,EAAE;AAC7E;AACA,IAAIC,EAAE,GAAG,OAAOC,WAAW,IAAI,WAAW,iBAAkB,IAAIA,WAAW,EAAE;AAG7E,IAAI;AACAD,EAAAA,EAAE,CAACE,MAAM,CAACxG,EAAE,EAAE;AAAEyG,IAAAA,MAAM,EAAE;AAAK,GAAC,CAAC;AAEnC,CAAC,CACD,OAAOxK,CAAC,EAAE,CAAE;AACZ;AACA,IAAIyK,KAAK,GAAG,UAAU/K,CAAC,EAAE;EACrB,KAAK,IAAIhC,CAAC,GAAG,EAAE,EAAED,CAAC,GAAG,CAAC,IAAI;AACtB,IAAA,IAAImF,CAAC,GAAGlD,CAAC,CAACjC,CAAC,EAAE,CAAC;AACd,IAAA,IAAIH,EAAE,GAAG,CAACsF,CAAC,GAAG,GAAG,KAAKA,CAAC,GAAG,GAAG,CAAC,IAAIA,CAAC,GAAG,GAAG,CAAC;IAC1C,IAAInF,CAAC,GAAGH,EAAE,GAAGoC,CAAC,CAAClB,MAAM,EACjB,OAAO;AAAED,MAAAA,CAAC,EAAEb,CAAC;AAAEA,MAAAA,CAAC,EAAEqC,GAAG,CAACL,CAAC,EAAEjC,CAAC,GAAG,CAAC;KAAG;AACrC,IAAA,IAAI,CAACH,EAAE,EACHI,CAAC,IAAIgN,MAAM,CAACC,YAAY,CAAC/H,CAAC,CAAC,CAAC,KAC3B,IAAItF,EAAE,IAAI,CAAC,EAAE;MACdsF,CAAC,GAAG,CAAC,CAACA,CAAC,GAAG,EAAE,KAAK,EAAE,GAAG,CAAClD,CAAC,CAACjC,CAAC,EAAE,CAAC,GAAG,EAAE,KAAK,EAAE,GAAG,CAACiC,CAAC,CAACjC,CAAC,EAAE,CAAC,GAAG,EAAE,KAAK,CAAC,GAAIiC,CAAC,CAACjC,CAAC,EAAE,CAAC,GAAG,EAAG,IAAI,KAAK,EACnFC,CAAC,IAAIgN,MAAM,CAACC,YAAY,CAAC,KAAK,GAAI/H,CAAC,IAAI,EAAG,EAAE,KAAK,GAAIA,CAAC,GAAG,IAAK,CAAC;AACvE,IAAA,CAAC,MACI,IAAItF,EAAE,GAAG,CAAC,EACXI,CAAC,IAAIgN,MAAM,CAACC,YAAY,CAAC,CAAC/H,CAAC,GAAG,EAAE,KAAK,CAAC,GAAIlD,CAAC,CAACjC,CAAC,EAAE,CAAC,GAAG,EAAG,CAAC,CAAC,KAExDC,CAAC,IAAIgN,MAAM,CAACC,YAAY,CAAC,CAAC/H,CAAC,GAAG,EAAE,KAAK,EAAE,GAAG,CAAClD,CAAC,CAACjC,CAAC,EAAE,CAAC,GAAG,EAAE,KAAK,CAAC,GAAIiC,CAAC,CAACjC,CAAC,EAAE,CAAC,GAAG,EAAG,CAAC;AACrF,EAAA;AACJ,CAAC;AA8ED;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASmN,OAAOA,CAACC,GAAG,EAAEC,MAAM,EAAE;AACjC;EAMA,IAAIX,EAAE,EACF,OAAOA,EAAE,CAACY,MAAM,CAACF,GAAG,CAAC;AACzB,EAAA,IAAIpM,CAAC,GAAGoM,GAAG,CAACrM,MAAM;AAClB,EAAA,IAAIwM,EAAE,GAAG,IAAIpO,EAAE,CAACiO,GAAG,CAACrM,MAAM,IAAIqM,GAAG,CAACrM,MAAM,IAAI,CAAC,CAAC,CAAC;EAC/C,IAAIyM,EAAE,GAAG,CAAC;AACV,EAAA,IAAI/F,CAAC,GAAG,UAAUnG,CAAC,EAAE;AAAEiM,IAAAA,EAAE,CAACC,EAAE,EAAE,CAAC,GAAGlM,CAAC;EAAE,CAAC;EACtC,KAAK,IAAItB,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGgB,CAAC,EAAE,EAAEhB,CAAC,EAAE;AACxB,IAAA,IAAIwN,EAAE,GAAG,CAAC,GAAGD,EAAE,CAACxM,MAAM,EAAE;AACpB,MAAA,IAAIwD,CAAC,GAAG,IAAIpF,EAAE,CAACqO,EAAE,GAAG,CAAC,IAAKxM,CAAC,GAAGhB,CAAC,IAAK,CAAC,CAAC,CAAC;AACvCuE,MAAAA,CAAC,CAACR,GAAG,CAACwJ,EAAE,CAAC;AACTA,MAAAA,EAAE,GAAGhJ,CAAC;AACV,IAAA;AACA,IAAA,IAAIY,CAAC,GAAGiI,GAAG,CAACK,UAAU,CAACzN,CAAC,CAAC;AACzB,IAAA,IAAImF,CAAC,GAAG,GAAG,IAAIkI,MAAM,EACjB5F,CAAC,CAACtC,CAAC,CAAC,CAAC,KACJ,IAAIA,CAAC,GAAG,IAAI,EACbsC,CAAC,CAAC,GAAG,GAAItC,CAAC,IAAI,CAAE,CAAC,EAAEsC,CAAC,CAAC,GAAG,GAAItC,CAAC,GAAG,EAAG,CAAC,CAAC,KACpC,IAAIA,CAAC,GAAG,KAAK,IAAIA,CAAC,GAAG,KAAK,EAC3BA,CAAC,GAAG,KAAK,IAAIA,CAAC,GAAG,IAAI,IAAI,EAAE,CAAC,GAAIiI,GAAG,CAACK,UAAU,CAAC,EAAEzN,CAAC,CAAC,GAAG,IAAK,EACvDyH,CAAC,CAAC,GAAG,GAAItC,CAAC,IAAI,EAAG,CAAC,EAAEsC,CAAC,CAAC,GAAG,GAAKtC,CAAC,IAAI,EAAE,GAAI,EAAG,CAAC,EAAEsC,CAAC,CAAC,GAAG,GAAKtC,CAAC,IAAI,CAAC,GAAI,EAAG,CAAC,EAAEsC,CAAC,CAAC,GAAG,GAAItC,CAAC,GAAG,EAAG,CAAC,CAAC,KAE/FsC,CAAC,CAAC,GAAG,GAAItC,CAAC,IAAI,EAAG,CAAC,EAAEsC,CAAC,CAAC,GAAG,GAAKtC,CAAC,IAAI,CAAC,GAAI,EAAG,CAAC,EAAEsC,CAAC,CAAC,GAAG,GAAItC,CAAC,GAAG,EAAG,CAAC;AACvE,EAAA;AACA,EAAA,OAAO7C,GAAG,CAACiL,EAAE,EAAE,CAAC,EAAEC,EAAE,CAAC;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASE,SAASA,CAACxK,GAAG,EAAEmK,MAAM,EAAE;AACnC,SAMK,IAAIT,EAAE,EAAE;AACT,IAAA,OAAOA,EAAE,CAACE,MAAM,CAAC5J,GAAG,CAAC;AACzB,EAAA,CAAC,MACI;AACD,IAAA,IAAI/C,EAAE,GAAG6M,KAAK,CAAC9J,GAAG,CAAC;MAAEpC,CAAC,GAAGX,EAAE,CAACW,CAAC;MAAEb,CAAC,GAAGE,EAAE,CAACF,CAAC;AACvC,IAAA,IAAIA,CAAC,CAACc,MAAM,EACR2B,GAAG,CAAC,CAAC,CAAC;AACV,IAAA,OAAO5B,CAAC;AACZ,EAAA;AACJ,CCnxDA,MAAM6M,UAAU,GAAG,cAAc;AACjC,MAAMC,cAAc,GAAG,qBAAqB;AAE5C,MAAMC,cAAc,GAAIC,KAAa,IAAI;AACvC,EAAA,IAAI,CAACA,KAAK,EAAE,OAAO,KAAK;AACxB,EAAA,MAAM3I,CAAC,GAAG2I,KAAK,CAACL,UAAU,CAAC,CAAC,CAAC;AAC7B;AACA,EAAA,OACEtI,CAAC,KAAK,GAAG,IACTA,CAAC,KAAK,EAAE,IACRA,CAAC,KAAK,EAAE,IACPA,CAAC,IAAI,EAAE,IAAIA,CAAC,IAAI,EAAG,IACpBA,CAAC,KAAK,EAAE,IACRA,CAAC,KAAK,GAAG,IACTA,CAAC,KAAK,GAAG,IACTA,CAAC,KAAK,GAAG;AAEb,CAAC;AAED,MAAM4I,UAAU,GAAIC,KAAiB,IAAI;EACvC,IAAIC,MAAM,GAAG,EAAE;EACf,MAAMC,SAAS,GAAG,MAAM;AACxB,EAAA,KAAK,IAAIlO,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGgO,KAAK,CAACjN,MAAM,EAAEf,CAAC,IAAIkO,SAAS,EAAE;AAChDD,IAAAA,MAAM,IAAIhB,MAAM,CAACC,YAAY,CAAC,GAAGc,KAAK,CAACxL,QAAQ,CAACxC,CAAC,EAAEA,CAAC,GAAGkO,SAAS,CAAC,CAAC;AACpE,EAAA;EACA,OAAOC,IAAI,CAACF,MAAM,CAAC;AACrB,CAAC;AAED,MAAMG,UAAU,GAAIC,MAAc,IAAI;AACpC,EAAA,MAAMJ,MAAM,GAAGK,IAAI,CAACD,MAAM,CAAC;EAC3B,MAAML,KAAK,GAAG,IAAI5O,UAAU,CAAC6O,MAAM,CAAClN,MAAM,CAAC;AAC3C,EAAA,KAAK,IAAIf,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGiO,MAAM,CAAClN,MAAM,EAAEf,CAAC,EAAE,EAAE;IACtCgO,KAAK,CAAChO,CAAC,CAAC,GAAGiO,MAAM,CAACR,UAAU,CAACzN,CAAC,CAAC;AACjC,EAAA;AACA,EAAA,OAAOgO,KAAK;AACd,CAAC;AAQD,MAAMO,uBAAuB,GAAGA,CAC9BC,IAAiB,EACjBC,OAAA,GAAoC,EAAE,KACvB;EACf,MAAM;AACJC,IAAAA,iBAAiB,GAAG,IAAI;AACxBC,IAAAA,YAAY,GAAG,CAAC;AAChBC,IAAAA,eAAe,GAAG;AAAE,GACrB,GAAGH,OAAO;AAEX,EAAA,MAAMI,aAAa,GAAG,IAAIC,GAAG,EAAkB;AAC/C,EAAA,IAAIC,UAA8B;EAClC,IAAIC,uBAAuB,GAAG,KAAK;EAEnC,MAAMC,KAAK,GAAGA,MAAK;AACjBF,IAAAA,UAAU,GAAGG,SAAS;IACtB,KAAK,MAAM,CAACC,GAAG,EAAErB,KAAK,CAAC,IAAIe,aAAa,EAAE;MACxC,IAAI;AACF,QAAA,IAAIf,KAAK,CAAC/M,MAAM,GAAG2N,iBAAiB,EAAE;UACpCF,IAAI,CAACY,OAAO,CAACD,GAAG,EAAExB,UAAU,GAAGG,KAAK,CAAC;AACrC,UAAA;AACF,QAAA;AAEA,QAAA,MAAMuB,KAAK,GAAGlC,OAAO,CAACW,KAAK,CAAC;AAC5B,QAAA,MAAMwB,UAAU,GAAGhD,WAAW,CAAC+C,KAAK,EAAE;AAAElD,UAAAA,KAAK,EAAEwC;AAAY,SAAE,CAAC;QAC9DH,IAAI,CAACY,OAAO,CAACD,GAAG,EAAEvB,cAAc,GAAGG,UAAU,CAACuB,UAAU,CAAC,CAAC;MAC5D,CAAC,CAAC,OAAOC,KAAK,EAAE;AACdC,QAAAA,OAAO,CAACD,KAAK,CAAC,qBAAqB,EAAEA,KAAK,CAAC;QAC3C,IAAI;UACFf,IAAI,CAACY,OAAO,CAACD,GAAG,EAAExB,UAAU,GAAGG,KAAK,CAAC;QACvC,CAAC,CAAC,OAAA3N,EAAA,EAAM;AACN;AAAA,QAAA;AAEJ,MAAA;AACF,IAAA;IACA0O,aAAa,CAACY,KAAK,EAAE;EACvB,CAAC;EAED,MAAMC,aAAa,GAAGA,MAAK;IACzB,IAAIX,UAAU,IAAI,IAAI,EAAE;AACxB,IAAA,IAAI,CAACC,uBAAuB,IAAI,OAAOW,MAAM,KAAK,WAAW,EAAE;AAC7DX,MAAAA,uBAAuB,GAAG,IAAI;AAC9BW,MAAAA,MAAM,CAACC,gBAAgB,CAAC,cAAc,EAAEX,KAAK,CAAC;AAC9CY,MAAAA,QAAQ,CAACD,gBAAgB,CAAC,kBAAkB,EAAE,MAAK;QACjD,IAAIC,QAAQ,CAACC,eAAe,KAAK,QAAQ,EAAEb,KAAK,EAAE;AACpD,MAAA,CAAC,CAAC;AACJ,IAAA;IACAF,UAAU,GAAGgB,UAAU,CAACC,UAAU,CAChCf,KAAK,EACLL,eAAe,CACK;EACxB,CAAC;EAED,OAAO;IACLqB,OAAO,EAAGd,GAAW,IAAmB;MACtC,IAAI;AACF,QAAA,MAAMe,MAAM,GAAG1B,IAAI,CAACyB,OAAO,CAACd,GAAG,CAAC;AAChC,QAAA,IAAI,CAACe,MAAM,EAAE,OAAO,IAAI;AAExB,QAAA,IAAIA,MAAM,CAACC,UAAU,CAACxC,UAAU,CAAC,EAAE;AACjC,UAAA,OAAOuC,MAAM,CAAC7J,KAAK,CAACsH,UAAU,CAAC5M,MAAM,CAAC;AACxC,QAAA;AAEA,QAAA,IAAImP,MAAM,CAACC,UAAU,CAACvC,cAAc,CAAC,EAAE;UACrC,MAAMwC,GAAG,GAAGF,MAAM,CAAC7J,KAAK,CAACuH,cAAc,CAAC7M,MAAM,CAAC;AAC/C,UAAA,MAAMiN,KAAK,GAAGI,UAAU,CAACgC,GAAG,CAAC;AAC7B,UAAA,MAAMC,YAAY,GAAG5D,WAAW,CAACuB,KAAK,CAAC;UACvC,OAAON,SAAS,CAAC2C,YAAY,CAAC;AAChC,QAAA;AAEA;AACA,QAAA,IAAIxC,cAAc,CAACqC,MAAM,CAAC,EAAE,OAAOA,MAAM;AAEzC,QAAA,OAAO,IAAI;MACb,CAAC,CAAC,OAAOX,KAAK,EAAE;AACdC,QAAAA,OAAO,CAACD,KAAK,CAAC,qBAAqB,EAAEA,KAAK,CAAC;AAC3C,QAAA,OAAO,IAAI;AACb,MAAA;IACF,CAAC;AAEDH,IAAAA,OAAO,EAAEA,CAACD,GAAW,EAAErB,KAAa,KAAI;MACtC,IAAI;AACF;QACA,MAAMwC,QAAQ,GAAGxC,KAA6C;QAC9D,IAAIwC,QAAQ,IAAI,IAAI,EAAE;AACpBzB,UAAAA,aAAa,CAAC0B,MAAM,CAACpB,GAAG,CAAC;AACzBX,UAAAA,IAAI,CAACgC,UAAU,CAACrB,GAAG,CAAC;AACpB,UAAA;AACF,QAAA;AAEA,QAAA,MAAMsB,WAAW,GAAG,OAAOH,QAAQ,KAAK,QAAQ,GAAGA,QAAQ,GAAGrD,MAAM,CAACqD,QAAQ,CAAC;AAC9EzB,QAAAA,aAAa,CAAC9K,GAAG,CAACoL,GAAG,EAAEsB,WAAW,CAAC;AACnCf,QAAAA,aAAa,EAAE;MACjB,CAAC,CAAC,OAAOH,KAAK,EAAE;AACdC,QAAAA,OAAO,CAACD,KAAK,CAAC,qBAAqB,EAAEA,KAAK,CAAC;AAC7C,MAAA;IACF,CAAC;IAEDiB,UAAU,EAAGrB,GAAW,IAAI;MAC1B,IAAI;AACFN,QAAAA,aAAa,CAAC0B,MAAM,CAACpB,GAAG,CAAC;AACzBX,QAAAA,IAAI,CAACgC,UAAU,CAACrB,GAAG,CAAC;MACtB,CAAC,CAAC,OAAOI,KAAK,EAAE;AACdC,QAAAA,OAAO,CAACD,KAAK,CAAC,sBAAsB,EAAEA,KAAK,CAAC;AAC9C,MAAA;AACF,IAAA;GACD;AACH,CAAC;AAED,MAAMmB,WAAW,GAAgB;EAC/BT,OAAO,EAAGd,GAAG,IAAI;AACf,IAAA,IAAI,OAAOwB,YAAY,KAAK,WAAW,EAAE,OAAO,IAAI;AACpD,IAAA,OAAOA,YAAY,CAACV,OAAO,CAACd,GAAG,CAAC;EAClC,CAAC;AACDC,EAAAA,OAAO,EAAEA,CAACD,GAAG,EAAErB,KAAK,KAAI;AACtB,IAAA,IAAI,OAAO6C,YAAY,KAAK,WAAW,EAAE;AACzCA,IAAAA,YAAY,CAACvB,OAAO,CAACD,GAAG,EAAErB,KAAK,CAAC;EAClC,CAAC;EACD0C,UAAU,EAAGrB,GAAG,IAAI;AAClB,IAAA,IAAI,OAAOwB,YAAY,KAAK,WAAW,EAAE;AACzCA,IAAAA,YAAY,CAACH,UAAU,CAACrB,GAAG,CAAC;AAC9B,EAAA;CACD;IAEUyB,OAAO,GAAgBrC,uBAAuB,CAACmC,WAAW;AAE9D,MAAMG,gBAAgB,GAAIC,UAAuB,IAAI;AAC1DF,EAAAA,OAAO,GAAGE,UAAU;AACtB,EC/KA,SAAS,eAAe,CAAC,IAAI,EAAE;AAC/B,EAAE,OAAO,MAAM,IAAI,IAAI;AACvB;AACA,SAAS,sBAAsB,CAAC,IAAI,EAAE;AACtC,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK;AACrB;AACA,SAAS,sBAAsB,CAAC,SAAS,EAAE;AAC3C,EAAE,OAAO,GAAG,IAAI,SAAS,IAAI,GAAG,IAAI,SAAS;AAC7C;AACA,SAAS,eAAe,CAAC,SAAS,EAAE;AACpC,EAAE,IAAI,GAAG,IAAI,SAAS,EAAE;AACxB,IAAI,MAAM,SAAS,CAAC,CAAC;AACrB,EAAE;AACF,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,MAAM,MAAM,YAAY,IAAI,EAAE,GAAG,IAAI,SAAS,CAAC,EAAE;AACjG,IAAI,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC;AAC1D,EAAE;AACF,EAAE,OAAO,SAAS,CAAC,CAAC;AACpB;AACA,MAAM,eAAe,mBAAmB,IAAI,OAAO,EAAE;AACrD,SAAS,gBAAgB,CAAC,KAAK,EAAE;AACjC,EAAE,IAAI,EAAE;AACR,EAAE,OAAOC,eAAa,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,GAAG,eAAe,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,IAAI,GAAG,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;AAC/F;AACA,SAAS,YAAY,CAAC,OAAO,EAAE;AAC/B,EAAE,MAAM,YAAY,GAAG,eAAe,CAAC,GAAG,CAAC,OAAO,CAAC;AACnD,EAAE,IAAI,YAAY,IAAI,IAAI,GAAG,MAAM,GAAG,YAAY,CAAC,CAAC,CAAC,EAAE;AACvD,IAAI,YAAY,CAAC,CAAC,CAAC,GAAG,KAAK;AAC3B,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;AACzC,EAAE;AACF;AACA,SAAS,oBAAoB,CAAC,OAAO,EAAE,YAAY,EAAE;AACrD,EAAE,IAAI,YAAY,GAAG,eAAe,CAAC,GAAG,CAAC,OAAO,CAAC;AACjD,EAAE,IAAI,CAAC,YAAY,EAAE;AACrB,IAAI,YAAY,GAAG,CAAC,IAAI,kBAAkB,IAAI,GAAG,EAAE,CAAC;AACpD,IAAI,eAAe,CAAC,GAAG,CAAC,OAAO,EAAE,YAAY,CAAC;AAC9C,IAAI,MAAM,MAAM,GAAG,MAAM;AACzB,MAAM,YAAY,CAAC,CAAC,CAAC,GAAG,KAAK;AAC7B,IAAI,CAAC;AACL,IAAI,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC;AAChC,EAAE;AACF,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,YAAY,CAAC;AACnC;AACA,SAASA,eAAa,CAAC,CAAC,EAAE;AAC1B,EAAE,OAAO,QAAQ,CAAC,IAAI,IAAI,GAAG,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,UAAU;AAC5D;AACA,SAAS,6BAA6B,CAAC,IAAI,EAAE,OAAO,EAAE,mBAAmB,EAAE;AAC3E,EAAE,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;AACxC,IAAI,mBAAmB,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC;AACnC,IAAI,MAAM,OAAO,GAAG,MAAM,mBAAmB,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC;AAC5D,IAAI,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,CAAC;AAClC,EAAE;AACF;AACA,SAAS,6BAA6B,CAAC,IAAI,EAAE,SAAS,EAAE,UAAU,EAAE;AACpE,EAAE,IAAI,EAAE;AACR,EAAE,MAAM,UAAU,mBAAmB,IAAI,GAAG,EAAE;AAC9C,EAAE,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,IAAI,GAAG,MAAM,GAAG,EAAE,CAAC,CAAC,KAAK,EAAE,EAAE;AAC/E,IAAI,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;AAC3B,MAAM,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;AACvB,IAAI;AACJ,EAAE;AACF,EAAE,KAAK,MAAM,sBAAsB,IAAI,SAAS,CAAC,CAAC,EAAE;AACpD,IAAI,UAAU,CAAC,GAAG,CAAC,sBAAsB,CAAC;AAC1C,EAAE;AACF,EAAE,OAAO,UAAU;AACnB;AAuCA,MAAM,QAAQ,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,GAAG,MAAM,KAAK,IAAI,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC;AAClE,MAAM,SAAS,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,GAAG,MAAM,KAAK,IAAI,CAAC,KAAK,CAAC,GAAG,MAAM,CAAC;AACpE,MAAM,UAAU,GAAG,CAAC,KAAK,EAAE,IAAI,KAAK;AACpC,EAAE,IAAI,EAAE;AACR,EAAE,OAAO,CAAC,EAAE,GAAG,IAAI,CAAC,eAAe,KAAK,IAAI,GAAG,MAAM,GAAG,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC;AAC5E,CAAC;AACD,MAAM,WAAW,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,OAAO,KAAK;AAC/C,EAAE,IAAI,EAAE;AACR,EAAE,OAAO,CAAC,EAAE,GAAG,IAAI,CAAC,OAAO,KAAK,IAAI,GAAG,MAAM,GAAG,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC;AACtE,CAAC;AACD,MAAM,eAAe,GAAG,CAAC,KAAK,EAAE,IAAI,KAAK;AACzC,EAAE,MAAM,cAAc,GAAG,yBAAyB,CAAC,KAAK,CAAC;AACzD,EAAE,MAAM,YAAY,GAAG,cAAc,CAAC,CAAC,CAAC;AACxC,EAAE,MAAM,WAAW,GAAG,cAAc,CAAC,CAAC,CAAC;AACvC,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,MAAM,MAAM,YAAY,IAAI,CAAC,IAAI,EAAE;AACnF,IAAI,MAAM,IAAI,KAAK,CAAC,2BAA2B,CAAC;AAChD,EAAE;AACF,EAAE,IAAI,SAAS,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC;AACxC,EAAE,IAAI,CAAC,SAAS,EAAE;AAClB,IAAI,SAAS,GAAG,EAAE,CAAC,kBAAkB,IAAI,GAAG,EAAE,EAAE,CAAC,kBAAkB,IAAI,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE;AACpF,IAAI,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC;AACrC,IAAI,WAAW,IAAI,IAAI,GAAG,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC;AAC3D,EAAE;AACF,EAAE,OAAO,SAAS;AAClB,CAAC;AACD,MAAM,cAAc,GAAG,CAAC,KAAK,KAAK;AAClC,EAAE,MAAM,cAAc,GAAG,yBAAyB,CAAC,KAAK,CAAC;AACzD,EAAE,MAAM,UAAU,GAAG,cAAc,CAAC,CAAC,CAAC;AACtC,EAAE,MAAM,YAAY,GAAG,cAAc,CAAC,CAAC,CAAC;AACxC,EAAE,MAAM,cAAc,GAAG,cAAc,CAAC,CAAC,CAAC;AAC1C,EAAE,MAAM,gBAAgB,GAAG,cAAc,CAAC,CAAC,CAAC;AAC5C,EAAE,MAAM,UAAU,GAAG,cAAc,CAAC,CAAC,CAAC;AACtC,EAAE,MAAM,0BAA0B,GAAG,cAAc,CAAC,EAAE,CAAC;AACvD,EAAE,MAAM,MAAM,GAAG,EAAE;AACnB,EAAE,MAAM,IAAI,GAAG,CAAC,EAAE,KAAK;AACvB,IAAI,IAAI;AACR,MAAM,EAAE,EAAE;AACV,IAAI,CAAC,CAAC,OAAO,CAAC,EAAE;AAChB,MAAM,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;AACpB,IAAI;AACJ,EAAE,CAAC;AACH,EAAE,GAAG;AACL,IAAI,IAAI,UAAU,CAAC,CAAC,EAAE;AACtB,MAAM,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;AACxB,IAAI;AACJ,IAAI,MAAM,SAAS,mBAAmB,IAAI,GAAG,EAAE;AAC/C,IAAI,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC;AAC7C,IAAI,YAAY,CAAC,OAAO,CAAC,CAAC,IAAI,KAAK;AACnC,MAAM,IAAI,EAAE;AACZ,MAAM,OAAO,CAAC,EAAE,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,IAAI,GAAG,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC;AAC7E,IAAI,CAAC,CAAC;AACN,IAAI,YAAY,CAAC,KAAK,EAAE;AACxB,IAAI,gBAAgB,CAAC,OAAO,CAAC,GAAG,CAAC;AACjC,IAAI,gBAAgB,CAAC,KAAK,EAAE;AAC5B,IAAI,cAAc,CAAC,OAAO,CAAC,GAAG,CAAC;AAC/B,IAAI,cAAc,CAAC,KAAK,EAAE;AAC1B,IAAI,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC;AAC3B,IAAI,IAAI,YAAY,CAAC,IAAI,EAAE;AAC3B,MAAM,0BAA0B,CAAC,KAAK,CAAC;AACvC,IAAI;AACJ,EAAE,CAAC,QAAQ,YAAY,CAAC,IAAI,IAAI,gBAAgB,CAAC,IAAI,IAAI,cAAc,CAAC,IAAI;AAC5E,EAAE,IAAI,MAAM,CAAC,MAAM,EAAE;AACrB,IAAI,MAAM,IAAI,cAAc,CAAC,MAAM,CAAC;AACpC,EAAE;AACF,CAAC;AACD,MAAM,yBAAyB,GAAG,CAAC,KAAK,KAAK;AAC7C,EAAE,MAAM,cAAc,GAAG,yBAAyB,CAAC,KAAK,CAAC;AACzD,EAAE,MAAM,UAAU,GAAG,cAAc,CAAC,CAAC,CAAC;AACtC,EAAE,MAAM,gBAAgB,GAAG,cAAc,CAAC,CAAC,CAAC;AAC5C,EAAE,MAAM,YAAY,GAAG,cAAc,CAAC,CAAC,CAAC;AACxC,EAAE,MAAM,gBAAgB,GAAG,cAAc,CAAC,EAAE,CAAC;AAC7C,EAAE,MAAM,cAAc,GAAG,cAAc,CAAC,EAAE,CAAC;AAC3C,EAAE,MAAM,kBAAkB,GAAG,cAAc,CAAC,EAAE,CAAC;AAC/C,EAAE,MAAM,iBAAiB,GAAG,EAAE;AAC9B,EAAE,MAAM,QAAQ,mBAAmB,IAAI,OAAO,EAAE;AAChD,EAAE,MAAM,OAAO,mBAAmB,IAAI,OAAO,EAAE;AAC/C,EAAE,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC;AACxC,EAAE,OAAO,KAAK,CAAC,MAAM,EAAE;AACvB,IAAI,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;AACrC,IAAI,MAAM,MAAM,GAAG,gBAAgB,CAAC,KAAK,EAAE,CAAC,CAAC;AAC7C,IAAI,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;AACxB,MAAM,KAAK,CAAC,GAAG,EAAE;AACjB,MAAM;AACN,IAAI;AACJ,IAAI,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;AACzB,MAAM,IAAI,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,EAAE;AAChD,QAAQ,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;AAC3C,MAAM,CAAC,MAAM,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,MAAM,MAAM,YAAY,IAAI,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;AAChH,QAAQ,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC;AACxD,MAAM;AACN,MAAM,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;AACpB,MAAM,KAAK,CAAC,GAAG,EAAE;AACjB,MAAM;AACN,IAAI;AACJ,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;AACnB,IAAI,KAAK,MAAM,CAAC,IAAI,6BAA6B,CAAC,CAAC,EAAE,MAAM,EAAE,UAAU,CAAC,EAAE;AAC1E,MAAM,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;AAC5B,QAAQ,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;AACrB,MAAM;AACN,IAAI;AACJ,EAAE;AACF,EAAE,KAAK,IAAI,CAAC,GAAG,iBAAiB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE;AAC1D,IAAI,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,GAAG,iBAAiB,CAAC,CAAC,CAAC;AAC5C,IAAI,IAAI,cAAc,GAAG,KAAK;AAC9B,IAAI,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE;AACvC,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;AAC9C,QAAQ,cAAc,GAAG,IAAI;AAC7B,QAAQ;AACR,MAAM;AACN,IAAI;AACJ,IAAI,IAAI,cAAc,EAAE;AACxB,MAAM,cAAc,CAAC,KAAK,EAAE,CAAC,CAAC;AAC9B,MAAM,kBAAkB,CAAC,KAAK,EAAE,CAAC,CAAC;AAClC,IAAI;AACJ,IAAI,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC;AAC9B,EAAE;AACF,CAAC;AACD,MAAM,aAAa,GAAG,CAAC,KAAK,EAAE,IAAI,KAAK;AACvC,EAAE,IAAI,EAAE,EAAE,EAAE;AACZ,EAAE,MAAM,cAAc,GAAG,yBAAyB,CAAC,KAAK,CAAC;AACzD,EAAE,MAAM,UAAU,GAAG,cAAc,CAAC,CAAC,CAAC;AACtC,EAAE,MAAM,gBAAgB,GAAG,cAAc,CAAC,CAAC,CAAC;AAC5C,EAAE,MAAM,YAAY,GAAG,cAAc,CAAC,CAAC,CAAC;AACxC,EAAE,MAAM,UAAU,GAAG,cAAc,CAAC,CAAC,CAAC;AACtC,EAAE,MAAM,SAAS,GAAG,cAAc,CAAC,CAAC,CAAC;AACrC,EAAE,MAAM,gBAAgB,GAAG,cAAc,CAAC,EAAE,CAAC;AAC7C,EAAE,MAAM,eAAe,GAAG,cAAc,CAAC,EAAE,CAAC;AAC5C,EAAE,MAAM,0BAA0B,GAAG,cAAc,CAAC,EAAE,CAAC;AACvD,EAAE,MAAM,cAAc,GAAG,cAAc,CAAC,EAAE,CAAC;AAC3C,EAAE,MAAM,eAAe,GAAG,cAAc,CAAC,EAAE,CAAC;AAC5C,EAAE,MAAM,kBAAkB,GAAG,cAAc,CAAC,EAAE,CAAC;AAC/C,EAAE,MAAM,SAAS,GAAG,gBAAgB,CAAC,KAAK,EAAE,IAAI,CAAC;AACjD,EAAE,IAAI,sBAAsB,CAAC,SAAS,CAAC,EAAE;AACzC,IAAI,IAAI,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,SAAS,CAAC,CAAC,EAAE;AAC5E,MAAM,OAAO,SAAS;AACtB,IAAI;AACJ,IAAI,IAAI,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK;AACrC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AACb;AACA;AACA,QAAQ,cAAc,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK;AACvC;AACA,KAAK,EAAE;AACP,MAAM,OAAO,SAAS;AACtB,IAAI;AACJ,EAAE;AACF,EAAE,SAAS,CAAC,CAAC,CAAC,KAAK,EAAE;AACrB,EAAE,IAAI,MAAM,GAAG,IAAI;AACnB,EAAE,SAAS,wBAAwB,GAAG;AACtC,IAAI,IAAI,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;AAC9B,MAAM,kBAAkB,CAAC,KAAK,EAAE,IAAI,CAAC;AACrC,MAAM,0BAA0B,CAAC,KAAK,CAAC;AACvC,MAAM,eAAe,CAAC,KAAK,CAAC;AAC5B,IAAI;AACJ,EAAE;AACF,EAAE,SAAS,MAAM,CAAC,CAAC,EAAE;AACrB,IAAI,IAAI,GAAG;AACX,IAAI,IAAI,CAAC,KAAK,IAAI,EAAE;AACpB,MAAM,MAAM,OAAO,GAAG,gBAAgB,CAAC,KAAK,EAAE,CAAC,CAAC;AAChD,MAAM,IAAI,CAAC,sBAAsB,CAAC,OAAO,CAAC,EAAE;AAC5C,QAAQ,IAAI,eAAe,CAAC,CAAC,CAAC,EAAE;AAChC,UAAU,0BAA0B,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC;AACtD,QAAQ,CAAC,MAAM;AACf,UAAU,MAAM,IAAI,KAAK,CAAC,cAAc,CAAC;AACzC,QAAQ;AACR,MAAM;AACN,MAAM,OAAO,eAAe,CAAC,OAAO,CAAC;AACrC,IAAI;AACJ,IAAI,MAAM,MAAM,GAAG,cAAc,CAAC,KAAK,EAAE,CAAC,CAAC;AAC3C,IAAI,IAAI;AACR,MAAM,OAAO,eAAe,CAAC,MAAM,CAAC;AACpC,IAAI,CAAC,SAAS;AACd,MAAM,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;AAClC,MAAM,IAAI,gBAAgB,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE;AACzC,QAAQ,6BAA6B,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC;AAChE,MAAM;AACN,MAAM,CAAC,GAAG,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI,GAAG,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC;AAClE,MAAM,IAAI,CAAC,MAAM,EAAE;AACnB,QAAQ,wBAAwB,EAAE;AAClC,MAAM;AACN,IAAI;AACJ,EAAE;AACF,EAAE,IAAI,UAAU;AAChB,EAAE,IAAI,OAAO;AACb,EAAE,MAAM,OAAO,GAAG;AAClB,IAAI,IAAI,MAAM,GAAG;AACjB,MAAM,IAAI,CAAC,UAAU,EAAE;AACvB,QAAQ,UAAU,GAAG,IAAI,eAAe,EAAE;AAC1C,MAAM;AACN,MAAM,OAAO,UAAU,CAAC,MAAM;AAC9B,IAAI,CAAC;AACL,IAAI,IAAI,OAAO,GAAG;AAClB,MAAM,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,MAAM,MAAM,YAAY,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,EAAE;AAC/G,QAAQ,OAAO,CAAC,IAAI,CAAC,qDAAqD,CAAC;AAC3E,MAAM;AACN,MAAM,IAAI,CAAC,OAAO,IAAI,sBAAsB,CAAC,IAAI,CAAC,EAAE;AACpD,QAAQ,OAAO,GAAG,CAAC,GAAG,IAAI,KAAK;AAC/B,UAAU,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,MAAM,MAAM,YAAY,IAAI,MAAM,EAAE;AAC5F,YAAY,OAAO,CAAC,IAAI,CAAC,2CAA2C,CAAC;AACrE,UAAU;AACV,UAAU,IAAI,CAAC,MAAM,EAAE;AACvB,YAAY,IAAI;AAChB,cAAc,OAAO,eAAe,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;AAC1D,YAAY,CAAC,SAAS;AACtB,cAAc,0BAA0B,CAAC,KAAK,CAAC;AAC/C,cAAc,eAAe,CAAC,KAAK,CAAC;AACpC,YAAY;AACZ,UAAU;AACV,QAAQ,CAAC;AACT,MAAM;AACN,MAAM,OAAO,OAAO;AACpB,IAAI;AACJ,GAAG;AACH,EAAE,MAAM,eAAe,GAAG,SAAS,CAAC,CAAC;AACrC,EAAE,IAAI;AACN,IAAI,MAAM,cAAc,GAAG,SAAS,CAAC,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC;AAClE,IAAI,0BAA0B,CAAC,KAAK,EAAE,IAAI,EAAE,cAAc,CAAC;AAC3D,IAAI,IAAIA,eAAa,CAAC,cAAc,CAAC,EAAE;AACvC,MAAM,oBAAoB,CAAC,cAAc,EAAE,MAAM,UAAU,IAAI,IAAI,GAAG,MAAM,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC;AAClG,MAAM,cAAc,CAAC,IAAI,CAAC,wBAAwB,EAAE,wBAAwB,CAAC;AAC7E,IAAI;AACJ,IAAI,CAAC,EAAE,GAAG,UAAU,CAAC,CAAC,KAAK,IAAI,GAAG,MAAM,GAAG,EAAE,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC;AACpE,IAAI,OAAO,SAAS;AACpB,EAAE,CAAC,CAAC,OAAO,KAAK,EAAE;AAClB,IAAI,OAAO,SAAS,CAAC,CAAC;AACtB,IAAI,SAAS,CAAC,CAAC,GAAG,KAAK;AACvB,IAAI,EAAE,SAAS,CAAC,CAAC;AACjB,IAAI,OAAO,SAAS;AACpB,EAAE,CAAC,SAAS;AACZ,IAAI,MAAM,GAAG,KAAK;AAClB,IAAI,IAAI,eAAe,KAAK,SAAS,CAAC,CAAC,IAAI,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,eAAe,EAAE;AAC3F,MAAM,gBAAgB,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC;AAC7C,MAAM,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC;AAC5B,MAAM,CAAC,EAAE,GAAG,UAAU,CAAC,CAAC,KAAK,IAAI,GAAG,MAAM,GAAG,EAAE,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC;AACtE,IAAI;AACJ,EAAE;AACF,CAAC;AACD,MAAM,oBAAoB,GAAG,CAAC,KAAK,EAAE,IAAI,KAAK;AAC9C,EAAE,MAAM,cAAc,GAAG,yBAAyB,CAAC,KAAK,CAAC;AACzD,EAAE,MAAM,UAAU,GAAG,cAAc,CAAC,CAAC,CAAC;AACtC,EAAE,MAAM,gBAAgB,GAAG,cAAc,CAAC,CAAC,CAAC;AAC5C,EAAE,MAAM,gBAAgB,GAAG,cAAc,CAAC,EAAE,CAAC;AAC7C,EAAE,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC;AACtB,EAAE,OAAO,KAAK,CAAC,MAAM,EAAE;AACvB,IAAI,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,EAAE;AACzB,IAAI,MAAM,MAAM,GAAG,gBAAgB,CAAC,KAAK,EAAE,CAAC,CAAC;AAC7C,IAAI,KAAK,MAAM,CAAC,IAAI,6BAA6B,CAAC,CAAC,EAAE,MAAM,EAAE,UAAU,CAAC,EAAE;AAC1E,MAAM,MAAM,MAAM,GAAG,gBAAgB,CAAC,KAAK,EAAE,CAAC,CAAC;AAC/C,MAAM,gBAAgB,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;AACvC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;AACnB,IAAI;AACJ,EAAE;AACF,CAAC;AACD,MAAM,cAAc,GAAG,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,KAAK;AACjD,EAAE,MAAM,cAAc,GAAG,yBAAyB,CAAC,KAAK,CAAC;AACzD,EAAE,MAAM,YAAY,GAAG,cAAc,CAAC,CAAC,CAAC;AACxC,EAAE,MAAM,UAAU,GAAG,cAAc,CAAC,CAAC,CAAC;AACtC,EAAE,MAAM,UAAU,GAAG,cAAc,CAAC,CAAC,CAAC;AACtC,EAAE,MAAM,gBAAgB,GAAG,cAAc,CAAC,EAAE,CAAC;AAC7C,EAAE,MAAM,eAAe,GAAG,cAAc,CAAC,EAAE,CAAC;AAC5C,EAAE,MAAM,0BAA0B,GAAG,cAAc,CAAC,EAAE,CAAC;AACvD,EAAE,MAAM,cAAc,GAAG,cAAc,CAAC,EAAE,CAAC;AAC3C,EAAE,MAAM,qBAAqB,GAAG,cAAc,CAAC,EAAE,CAAC;AAClD,EAAE,MAAM,kBAAkB,GAAG,cAAc,CAAC,EAAE,CAAC;AAC/C,EAAE,IAAI,MAAM,GAAG,IAAI;AACnB,EAAE,MAAM,MAAM,GAAG,CAAC,CAAC,KAAK,eAAe,CAAC,cAAc,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;AACjE,EAAE,MAAM,MAAM,GAAG,CAAC,CAAC,EAAE,GAAG,KAAK,KAAK;AAClC,IAAI,IAAI,EAAE;AACV,IAAI,MAAM,MAAM,GAAG,gBAAgB,CAAC,KAAK,EAAE,CAAC,CAAC;AAC7C,IAAI,IAAI;AACR,MAAM,IAAI,CAAC,KAAK,IAAI,EAAE;AACtB,QAAQ,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE;AACjC,UAAU,MAAM,IAAI,KAAK,CAAC,mBAAmB,CAAC;AAC9C,QAAQ;AACR,QAAQ,MAAM,eAAe,GAAG,MAAM,CAAC,CAAC;AACxC,QAAQ,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;AAC1B,QAAQ,0BAA0B,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;AAC/C,QAAQ,kBAAkB,CAAC,KAAK,EAAE,CAAC,CAAC;AACpC,QAAQ,IAAI,eAAe,KAAK,MAAM,CAAC,CAAC,EAAE;AAC1C,UAAU,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC;AAC7B,UAAU,CAAC,EAAE,GAAG,UAAU,CAAC,CAAC,KAAK,IAAI,GAAG,MAAM,GAAG,EAAE,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC;AACvE,UAAU,qBAAqB,CAAC,KAAK,EAAE,CAAC,CAAC;AACzC,QAAQ;AACR,QAAQ,OAAO,MAAM;AACrB,MAAM,CAAC,MAAM;AACb,QAAQ,OAAO,cAAc,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,KAAK,CAAC;AACjD,MAAM;AACN,IAAI,CAAC,SAAS;AACd,MAAM,IAAI,CAAC,MAAM,EAAE;AACnB,QAAQ,0BAA0B,CAAC,KAAK,CAAC;AACzC,QAAQ,eAAe,CAAC,KAAK,CAAC;AAC9B,MAAM;AACN,IAAI;AACJ,EAAE,CAAC;AACH,EAAE,IAAI;AACN,IAAI,OAAO,UAAU,CAAC,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC;AAC3D,EAAE,CAAC,SAAS;AACZ,IAAI,MAAM,GAAG,KAAK;AAClB,EAAE;AACF,CAAC;AACD,MAAM,iBAAiB,GAAG,CAAC,KAAK,EAAE,IAAI,KAAK;AAC3C,EAAE,IAAI,EAAE;AACR,EAAE,MAAM,cAAc,GAAG,yBAAyB,CAAC,KAAK,CAAC;AACzD,EAAE,MAAM,UAAU,GAAG,cAAc,CAAC,CAAC,CAAC;AACtC,EAAE,MAAM,YAAY,GAAG,cAAc,CAAC,CAAC,CAAC;AACxC,EAAE,MAAM,UAAU,GAAG,cAAc,CAAC,CAAC,CAAC;AACtC,EAAE,MAAM,gBAAgB,GAAG,cAAc,CAAC,EAAE,CAAC;AAC7C,EAAE,MAAM,qBAAqB,GAAG,cAAc,CAAC,EAAE,CAAC;AAClD,EAAE,MAAM,UAAU,GAAG,cAAc,CAAC,EAAE,CAAC;AACvC,EAAE,MAAM,YAAY,GAAG,cAAc,CAAC,EAAE,CAAC;AACzC,EAAE,MAAM,SAAS,GAAG,gBAAgB,CAAC,KAAK,EAAE,IAAI,CAAC;AACjD,EAAE,MAAM,OAAO,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC;AACtC,EAAE,IAAI,OAAO,IAAI,CAAC,gBAAgB,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE;AACjD,IAAI,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,EAAE;AACtC,MAAM,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;AAC7B,QAAQ,MAAM,MAAM,GAAG,gBAAgB,CAAC,KAAK,EAAE,CAAC,CAAC;AACjD,QAAQ,MAAM,QAAQ,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC;AAC7C,QAAQ,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC;AAC5B,QAAQ,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AACxB,QAAQ,IAAI,CAAC,KAAK,MAAM,CAAC,CAAC,EAAE;AAC5B,UAAU,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC;AAC7B,UAAU,CAAC,EAAE,GAAG,UAAU,CAAC,CAAC,KAAK,IAAI,GAAG,MAAM,GAAG,EAAE,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC;AACvE,UAAU,qBAAqB,CAAC,KAAK,EAAE,CAAC,CAAC;AACzC,QAAQ;AACR,MAAM;AACN,IAAI;AACJ,IAAI,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;AACrC,MAAM,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;AAC/B,QAAQ,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;AAC3B,QAAQ,MAAM,QAAQ,GAAG,YAAY,CAAC,KAAK,EAAE,CAAC,CAAC;AAC/C,QAAQ,QAAQ,IAAI,IAAI,GAAG,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC;AAC3D,MAAM;AACN,IAAI;AACJ,EAAE;AACF,CAAC;AACD,MAAM,SAAS,GAAG,CAAC,KAAK,EAAE,IAAI,KAAK;AACnC,EAAE,IAAI,EAAE;AACR,EAAE,MAAM,cAAc,GAAG,yBAAyB,CAAC,KAAK,CAAC;AACzD,EAAE,MAAM,UAAU,GAAG,cAAc,CAAC,CAAC,CAAC;AACtC,EAAE,MAAM,cAAc,GAAG,cAAc,CAAC,CAAC,CAAC;AAC1C,EAAE,MAAM,UAAU,GAAG,cAAc,CAAC,CAAC,CAAC;AACtC,EAAE,MAAM,YAAY,GAAG,cAAc,CAAC,EAAE,CAAC;AACzC,EAAE,MAAM,gBAAgB,GAAG,cAAc,CAAC,EAAE,CAAC;AAC7C,EAAE,MAAM,eAAe,GAAG,cAAc,CAAC,EAAE,CAAC;AAC5C,EAAE,MAAM,0BAA0B,GAAG,cAAc,CAAC,EAAE,CAAC;AACvD,EAAE,MAAM,cAAc,GAAG,cAAc,CAAC,EAAE,CAAC;AAC3C,EAAE,MAAM,eAAe,GAAG,cAAc,CAAC,EAAE,CAAC;AAC5C,EAAE,MAAM,SAAS,GAAG,gBAAgB,CAAC,KAAK,EAAE,IAAI,CAAC;AACjD,EAAE,IAAI,OAAO,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC;AACpC,EAAE,IAAI,CAAC,OAAO,EAAE;AAChB,IAAI,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC;AAC/B,IAAI,KAAK,MAAM,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE;AACxC,MAAM,MAAM,QAAQ,GAAG,SAAS,CAAC,KAAK,EAAE,CAAC,CAAC;AAC1C,MAAM,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC;AAC1B,IAAI;AACJ,IAAI,OAAO,GAAG;AACd,MAAM,CAAC,kBAAkB,IAAI,GAAG,EAAE;AAClC,MAAM,CAAC,EAAE,IAAI,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;AACpC,MAAM,CAAC,kBAAkB,IAAI,GAAG;AAChC,KAAK;AACL,IAAI,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC;AACjC,IAAI,CAAC,EAAE,GAAG,UAAU,CAAC,CAAC,KAAK,IAAI,GAAG,MAAM,GAAG,EAAE,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC;AACpE,IAAI,IAAI,sBAAsB,CAAC,IAAI,CAAC,EAAE;AACtC,MAAM,MAAM,cAAc,GAAG,MAAM;AACnC,QAAQ,IAAI,MAAM,GAAG,IAAI;AACzB,QAAQ,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,KAAK;AACrC,UAAU,IAAI;AACd,YAAY,OAAO,eAAe,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;AACxD,UAAU,CAAC,SAAS;AACpB,YAAY,IAAI,CAAC,MAAM,EAAE;AACzB,cAAc,0BAA0B,CAAC,KAAK,CAAC;AAC/C,cAAc,eAAe,CAAC,KAAK,CAAC;AACpC,YAAY;AACZ,UAAU;AACV,QAAQ,CAAC;AACT,QAAQ,IAAI;AACZ,UAAU,MAAM,SAAS,GAAG,YAAY,CAAC,KAAK,EAAE,IAAI,EAAE,OAAO,CAAC;AAC9D,UAAU,IAAI,SAAS,EAAE;AACzB,YAAY,OAAO,CAAC,CAAC,GAAG,MAAM;AAC9B,cAAc,MAAM,GAAG,IAAI;AAC3B,cAAc,IAAI;AAClB,gBAAgB,SAAS,EAAE;AAC3B,cAAc,CAAC,SAAS;AACxB,gBAAgB,MAAM,GAAG,KAAK;AAC9B,cAAc;AACd,YAAY,CAAC;AACb,UAAU;AACV,QAAQ,CAAC,SAAS;AAClB,UAAU,MAAM,GAAG,KAAK;AACxB,QAAQ;AACR,MAAM,CAAC;AACP,MAAM,cAAc,CAAC,GAAG,CAAC,cAAc,CAAC;AACxC,IAAI;AACJ,EAAE;AACF,EAAE,OAAO,OAAO;AAChB,CAAC;AACD,MAAM,WAAW,GAAG,CAAC,KAAK,EAAE,IAAI,KAAK;AACrC,EAAE,IAAI,EAAE;AACR,EAAE,MAAM,cAAc,GAAG,yBAAyB,CAAC,KAAK,CAAC;AACzD,EAAE,MAAM,UAAU,GAAG,cAAc,CAAC,CAAC,CAAC;AACtC,EAAE,MAAM,gBAAgB,GAAG,cAAc,CAAC,CAAC,CAAC;AAC5C,EAAE,MAAM,UAAU,GAAG,cAAc,CAAC,CAAC,CAAC;AACtC,EAAE,MAAM,gBAAgB,GAAG,cAAc,CAAC,EAAE,CAAC;AAC7C,EAAE,MAAM,YAAY,GAAG,cAAc,CAAC,EAAE,CAAC;AACzC,EAAE,MAAM,SAAS,GAAG,gBAAgB,CAAC,KAAK,EAAE,IAAI,CAAC;AACjD,EAAE,IAAI,OAAO,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC;AACpC,EAAE,IAAI,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK;AACvE,IAAI,IAAI,GAAG;AACX,IAAI,OAAO,CAAC,GAAG,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI,GAAG,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC;AACvE,EAAE,CAAC,CAAC,EAAE;AACN,IAAI,IAAI,OAAO,CAAC,CAAC,EAAE;AACnB,MAAM,gBAAgB,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;AACrC,IAAI;AACJ,IAAI,OAAO,GAAG,MAAM;AACpB,IAAI,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC;AAC3B,IAAI,CAAC,EAAE,GAAG,UAAU,CAAC,CAAC,KAAK,IAAI,GAAG,MAAM,GAAG,EAAE,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC;AACpE,IAAI,KAAK,MAAM,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE;AACxC,MAAM,MAAM,QAAQ,GAAG,YAAY,CAAC,KAAK,EAAE,CAAC,CAAC;AAC7C,MAAM,QAAQ,IAAI,IAAI,GAAG,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC;AACzD,IAAI;AACJ,IAAI,OAAO,MAAM;AACjB,EAAE;AACF,EAAE,OAAO,OAAO;AAChB,CAAC;AACD,MAAM,0BAA0B,GAAG,CAAC,KAAK,EAAE,IAAI,EAAE,cAAc,KAAK;AACpE,EAAE,MAAM,gBAAgB,GAAG,yBAAyB,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;AAC/D,EAAE,MAAM,SAAS,GAAG,gBAAgB,CAAC,KAAK,EAAE,IAAI,CAAC;AACjD,EAAE,MAAM,YAAY,GAAG,GAAG,IAAI,SAAS;AACvC,EAAE,MAAM,SAAS,GAAG,SAAS,CAAC,CAAC;AAC/B,EAAE,IAAIA,eAAa,CAAC,cAAc,CAAC,EAAE;AACrC,IAAI,KAAK,MAAM,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE;AACxC,MAAM,6BAA6B;AACnC,QAAQ,IAAI;AACZ,QAAQ,cAAc;AACtB,QAAQ,gBAAgB,CAAC,KAAK,EAAE,CAAC;AACjC,OAAO;AACP,IAAI;AACJ,EAAE;AACF,EAAE,SAAS,CAAC,CAAC,GAAG,cAAc;AAC9B,EAAE,OAAO,SAAS,CAAC,CAAC;AACpB,EAAE,IAAI,CAAC,YAAY,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE;AAC3D,IAAI,EAAE,SAAS,CAAC,CAAC;AACjB,IAAI,IAAIA,eAAa,CAAC,SAAS,CAAC,EAAE;AAClC,MAAM,YAAY,CAAC,SAAS,CAAC;AAC7B,IAAI;AACJ,EAAE;AACF,CAAC;AACD,MAAM,QAAQ,GAAG,CAAC,KAAK,EAAE,IAAI,KAAK;AAClC,EAAE,MAAM,cAAc,GAAG,yBAAyB,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;AAC7D,EAAE,OAAO,eAAe,CAAC,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;AACrD,CAAC;AACD,MAAM,QAAQ,GAAG,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,KAAK;AAC3C,EAAE,MAAM,cAAc,GAAG,yBAAyB,CAAC,KAAK,CAAC;AACzD,EAAE,MAAM,eAAe,GAAG,cAAc,CAAC,EAAE,CAAC;AAC5C,EAAE,MAAM,0BAA0B,GAAG,cAAc,CAAC,EAAE,CAAC;AACvD,EAAE,MAAM,eAAe,GAAG,cAAc,CAAC,EAAE,CAAC;AAC5C,EAAE,IAAI;AACN,IAAI,OAAO,eAAe,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;AAChD,EAAE,CAAC,SAAS;AACZ,IAAI,0BAA0B,CAAC,KAAK,CAAC;AACrC,IAAI,eAAe,CAAC,KAAK,CAAC;AAC1B,EAAE;AACF,CAAC;AACD,MAAM,QAAQ,GAAG,CAAC,KAAK,EAAE,IAAI,EAAE,QAAQ,KAAK;AAC5C,EAAE,MAAM,cAAc,GAAG,yBAAyB,CAAC,KAAK,CAAC;AACzD,EAAE,MAAM,eAAe,GAAG,cAAc,CAAC,EAAE,CAAC;AAC5C,EAAE,MAAM,UAAU,GAAG,cAAc,CAAC,EAAE,CAAC;AACvC,EAAE,MAAM,YAAY,GAAG,cAAc,CAAC,EAAE,CAAC;AACzC,EAAE,MAAM,OAAO,GAAG,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC;AACzC,EAAE,MAAM,SAAS,GAAG,OAAO,CAAC,CAAC;AAC7B,EAAE,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC;AACzB,EAAE,eAAe,CAAC,KAAK,CAAC;AACxB,EAAE,OAAO,MAAM;AACf,IAAI,SAAS,CAAC,MAAM,CAAC,QAAQ,CAAC;AAC9B,IAAI,YAAY,CAAC,KAAK,EAAE,IAAI,CAAC;AAC7B,IAAI,eAAe,CAAC,KAAK,CAAC;AAC1B,EAAE,CAAC;AACH,CAAC;AACD,MAAM,gBAAgB,mBAAmB,IAAI,OAAO,EAAE;AACtD,MAAM,yBAAyB,GAAG,CAAC,KAAK,KAAK;AAC7C,EAAE,MAAM,cAAc,GAAG,gBAAgB,CAAC,GAAG,CAAC,KAAK,CAAC;AACpD,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,MAAM,MAAM,YAAY,IAAI,CAAC,cAAc,EAAE;AAC7F,IAAI,MAAM,IAAI,KAAK;AACnB,MAAM;AACN,KAAK;AACL,EAAE;AACF,EAAE,OAAO,cAAc;AACvB,CAAC;AASD,SAAS,UAAU,CAAC,GAAG,SAAS,EAAE;AAClC,EAAE,MAAM,KAAK,GAAG;AAChB,IAAI,GAAG,CAAC,IAAI,EAAE;AACd,MAAM,MAAM,SAAS,GAAG,yBAAyB,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;AAC5D,MAAM,OAAO,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC;AACnC,IAAI,CAAC;AACL,IAAI,GAAG,CAAC,IAAI,EAAE,GAAG,IAAI,EAAE;AACvB,MAAM,MAAM,SAAS,GAAG,yBAAyB,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;AAC5D,MAAM,OAAO,SAAS,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;AAC5C,IAAI,CAAC;AACL,IAAI,GAAG,CAAC,IAAI,EAAE,QAAQ,EAAE;AACxB,MAAM,MAAM,SAAS,GAAG,yBAAyB,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;AAC5D,MAAM,OAAO,SAAS,CAAC,KAAK,EAAE,IAAI,EAAE,QAAQ,CAAC;AAC7C,IAAI;AACJ,GAAG;AACH,EAAE,MAAM,cAAc,GAAG;AACzB;AACA,oBAAoB,IAAI,OAAO,EAAE;AACjC;AACA,oBAAoB,IAAI,OAAO,EAAE;AACjC;AACA,oBAAoB,IAAI,OAAO,EAAE;AACjC;AACA,oBAAoB,IAAI,GAAG,EAAE;AAC7B;AACA,oBAAoB,IAAI,GAAG,EAAE;AAC7B;AACA,oBAAoB,IAAI,GAAG,EAAE;AAC7B;AACA,IAAI,EAAE;AACN;AACA;AACA,IAAI,QAAQ;AACZ,IAAI,SAAS;AACb,IAAI,UAAU;AACd,IAAI,WAAW;AACf;AACA,IAAI,eAAe;AACnB,IAAI,cAAc;AAClB,IAAI,yBAAyB;AAC7B,IAAI,aAAa;AACjB,IAAI,oBAAoB;AACxB,IAAI,cAAc;AAClB,IAAI,iBAAiB;AACrB,IAAI,SAAS;AACb,IAAI,WAAW;AACf,IAAI,0BAA0B;AAC9B,IAAI,QAAQ;AACZ,IAAI,QAAQ;AACZ,IAAI,QAAQ;AACZ,IAAI;AACJ,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;AACtC,EAAE,gBAAgB,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC;AAC5D,EAAE,OAAO,KAAK;AACd,CC3oBA,IAAI,QAAQ,GAAG,CAAC;AAChB,SAAS,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE;AAC3B,EAAE,MAAM,GAAG,GAAG,CAAC,IAAI,EAAE,EAAE,QAAQ,CAAC,CAAC;AACjC,EAAE,MAAM,MAAM,GAAG;AACjB,IAAI,QAAQ,GAAG;AACf,MAAM,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,MAAM,MAAM,YAAY,IAAI,IAAI,CAAC,UAAU,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,CAAC,UAAU,GAAG,GAAG;AACtI,IAAI;AACJ,GAAG;AACH,EAAE,IAAI,OAAO,IAAI,KAAK,UAAU,EAAE;AAClC,IAAI,MAAM,CAAC,IAAI,GAAG,IAAI;AACtB,EAAE,CAAC,MAAM;AACT,IAAI,MAAM,CAAC,IAAI,GAAG,IAAI;AACtB,IAAI,MAAM,CAAC,IAAI,GAAG,WAAW;AAC7B,IAAI,MAAM,CAAC,KAAK,GAAG,YAAY;AAC/B,EAAE;AACF,EAAE,IAAI,KAAK,EAAE;AACb,IAAI,MAAM,CAAC,KAAK,GAAG,KAAK;AACxB,EAAE;AACF,EAAE,OAAO,MAAM;AACf;AACA,SAAS,WAAW,CAAC,GAAG,EAAE;AAC1B,EAAE,OAAO,GAAG,CAAC,IAAI,CAAC;AAClB;AACA,SAAS,YAAY,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;AACrC,EAAE,OAAO,GAAG;AACZ,IAAI,IAAI;AACR,IAAI,OAAO,GAAG,KAAK,UAAU,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG;AACjD,GAAG;AACH;AAMA,SAAS,WAAW,GAAG;AAIvB,EAAE,OAAOC,UAAuB,EAAE;AAClC;AACA,IAAI,YAAY;AAChB,SAAS,eAAe,GAAG;AAC3B,EAAE,IAAI,CAAC,YAAY,EAAE;AACrB,IAAI,YAAY,GAAG,WAAW,EAAE;AAChC,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,MAAM,MAAM,YAAY,EAAE;AAC5E,MAAM,UAAU,CAAC,uBAAuB,KAAK,UAAU,CAAC,uBAAuB,GAAG,YAAY,CAAC;AAC/F,MAAM,IAAI,UAAU,CAAC,uBAAuB,KAAK,YAAY,EAAE;AAC/D,QAAQ,OAAO,CAAC,IAAI;AACpB,UAAU;AACV,SAAS;AACT,MAAM;AACN,IAAI;AACJ,EAAE;AACF,EAAE,OAAO,YAAY;AACrB,CCpDA,MAAM,YAAY,GAAG,aAAa;AAClC,EAAE;AACF,CAAC;AACD,SAAS,QAAQ,CAAC,OAAO,EAAE;AAC3B,EAAE,MAAM,KAAK,GAAG,UAAU,CAAC,YAAY,CAAC;AACxC,EAAE,OAAqD,KAAK,IAAI,eAAe,EAAE;AACjF;;AAuBA,MAAM,aAAa,GAAG,CAAC,CAAC,KAAK,QAAQ,CAAC,IAAI,IAAI,GAAG,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,UAAU;AAChF,MAAM,mBAAmB,GAAG,CAAC,OAAO,KAAK;AACzC,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE;AACvB,IAAI,OAAO,CAAC,MAAM,GAAG,SAAS;AAC9B,IAAI,OAAO,CAAC,IAAI;AAChB,MAAM,CAAC,CAAC,KAAK;AACb,QAAQ,OAAO,CAAC,MAAM,GAAG,WAAW;AACpC,QAAQ,OAAO,CAAC,KAAK,GAAG,CAAC;AACzB,MAAM,CAAC;AACP,MAAM,CAAC,CAAC,KAAK;AACb,QAAQ,OAAO,CAAC,MAAM,GAAG,UAAU;AACnC,QAAQ,OAAO,CAAC,MAAM,GAAG,CAAC;AAC1B,MAAM;AACN,KAAK;AACL,EAAE;AACF,CAAC;AACD,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG;AACrB,CAAC,CAAC,OAAO,KAAK;AACd,EAAE,IAAI,OAAO,CAAC,MAAM,KAAK,SAAS,EAAE;AACpC,IAAI,MAAM,OAAO;AACjB,EAAE,CAAC,MAAM,IAAI,OAAO,CAAC,MAAM,KAAK,WAAW,EAAE;AAC7C,IAAI,OAAO,OAAO,CAAC,KAAK;AACxB,EAAE,CAAC,MAAM,IAAI,OAAO,CAAC,MAAM,KAAK,UAAU,EAAE;AAC5C,IAAI,MAAM,OAAO,CAAC,MAAM;AACxB,EAAE,CAAC,MAAM;AACT,IAAI,mBAAmB,CAAC,OAAO,CAAC;AAChC,IAAI,MAAM,OAAO;AACjB,EAAE;AACF,CAAC,CAAC;AACF,MAAM,qBAAqB,mBAAmB,IAAI,OAAO,EAAE;AAC3D,MAAM,wBAAwB,GAAG,CAAC,OAAO,EAAE,QAAQ,KAAK;AACxD,EAAE,IAAI,kBAAkB,GAAG,qBAAqB,CAAC,GAAG,CAAC,OAAO,CAAC;AAC7D,EAAE,IAAI,CAAC,kBAAkB,EAAE;AAC3B,IAAI,kBAAkB,GAAG,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,MAAM,KAAK;AAC1D,MAAM,IAAI,IAAI,GAAG,OAAO;AACxB,MAAM,MAAM,WAAW,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,KAAK;AACzC,QAAQ,IAAI,IAAI,KAAK,EAAE,EAAE;AACzB,UAAU,OAAO,CAAC,CAAC,CAAC;AACpB,QAAQ;AACR,MAAM,CAAC;AACP,MAAM,MAAM,UAAU,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,KAAK;AACxC,QAAQ,IAAI,IAAI,KAAK,EAAE,EAAE;AACzB,UAAU,MAAM,CAAC,CAAC,CAAC;AACnB,QAAQ;AACR,MAAM,CAAC;AACP,MAAM,MAAM,OAAO,GAAG,MAAM;AAC5B,QAAQ,IAAI;AACZ,UAAU,MAAM,SAAS,GAAG,QAAQ,EAAE;AACtC,UAAU,IAAI,aAAa,CAAC,SAAS,CAAC,EAAE;AACxC,YAAY,qBAAqB,CAAC,GAAG,CAAC,SAAS,EAAE,kBAAkB,CAAC;AACpE,YAAY,IAAI,GAAG,SAAS;AAC5B,YAAY,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,EAAE,UAAU,CAAC,SAAS,CAAC,CAAC;AACzE,YAAYC,oBAA6B,CAAC,SAAS,EAAE,OAAO,CAAC;AAC7D,UAAU,CAAC,MAAM;AACjB,YAAY,OAAO,CAAC,SAAS,CAAC;AAC9B,UAAU;AACV,QAAQ,CAAC,CAAC,OAAO,CAAC,EAAE;AACpB,UAAU,MAAM,CAAC,CAAC,CAAC;AACnB,QAAQ;AACR,MAAM,CAAC;AACP,MAAM,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,EAAE,UAAU,CAAC,OAAO,CAAC,CAAC;AAC7D,MAAMA,oBAA6B,CAAC,OAAO,EAAE,OAAO,CAAC;AACrD,IAAI,CAAC,CAAC;AACN,IAAI,qBAAqB,CAAC,GAAG,CAAC,OAAO,EAAE,kBAAkB,CAAC;AAC1D,EAAE;AACF,EAAE,OAAO,kBAAkB;AAC3B,CAAC;AACD,SAAS,YAAY,CAAC,IAAI,EAAE,OAAO,EAAE;AACrC,EAAE,MAAM,EAAE,KAAK,EAAE,sBAAsB,EAAE,aAAa,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,GAAc,EAAE;AACrF,EAAE,MAAM,KAAK,GAAG,QAAQ,CAAQ,CAAC;AACjC,EAAE,MAAM,CAAC,CAAC,gBAAgB,EAAE,gBAAgB,EAAE,eAAe,CAAC,EAAE,QAAQ,CAAC,GAAG,UAAU;AACtF,IAAI,CAAC,IAAI,KAAK;AACd,MAAM,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC;AACvC,MAAM,IAAI,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,KAAK,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE;AAClF,QAAQ,OAAO,IAAI;AACnB,MAAM;AACN,MAAM,OAAO,CAAC,SAAS,EAAE,KAAK,EAAE,IAAI,CAAC;AACrC,IAAI,CAAC;AACL,IAAI,MAAM;AACV,IAAI,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,IAAI;AACvC,GAAG;AACH,EAAE,IAAI,KAAK,GAAG,gBAAgB;AAC9B,EAAE,IAAI,gBAAgB,KAAK,KAAK,IAAI,eAAe,KAAK,IAAI,EAAE;AAC9D,IAAI,QAAQ,EAAE;AACd,IAAI,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC;AAC3B,EAAE;AACF,EAAE,SAAS,CAAC,MAAM;AAClB,IAAI,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM;AACxC,MAAM,IAAI,aAAa,EAAE;AACzB,QAAQ,IAAI;AACZ,UAAU,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC;AACxC,UAAU,IAAI,aAAa,CAAC,MAAM,CAAC,EAAE;AACrC,YAAY,mBAAmB;AAC/B,cAAc,wBAAwB,CAAC,MAAM,EAAE,MAAM,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC;AACpE,aAAa;AACb,UAAU;AACV,QAAQ,CAAC,CAAC,OAAO,CAAC,EAAE;AACpB,QAAQ;AACR,MAAM;AACN,MAAM,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE;AACrC,QAAQ,UAAU,CAAC,QAAQ,EAAE,KAAK,CAAC;AACnC,QAAQ;AACR,MAAM;AACN,MAAM,QAAQ,EAAE;AAChB,IAAI,CAAC,CAAC;AACN,IAAI,QAAQ,EAAE;AACd,IAAI,OAAO,KAAK;AAChB,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,aAAa,CAAC,CAAC;AACzC,EAAE,aAAa,CAAC,KAAK,CAAC;AACtB,EAAE,IAAI,aAAa,CAAC,KAAK,CAAC,EAAE;AAC5B,IAAI,MAAM,OAAO,GAAG,wBAAwB,CAAC,KAAK,EAAE,MAAM,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;AAC1E,IAAI,IAAI,aAAa,EAAE;AACvB,MAAM,mBAAmB,CAAC,OAAO,CAAC;AAClC,IAAI;AACJ,IAAI,OAAO,GAAG,CAAC,OAAO,CAAC;AACvB,EAAE;AACF,EAAE,OAAO,KAAK;AACd;;AAEA,SAAS,UAAU,CAAC,IAAI,EAAE,OAAO,EAAE;AACnC,EAAE,MAAM,KAAK,GAAG,QAAQ,CAAQ,CAAC;AACjC,EAAE,MAAM,OAAO,GAAG,WAAW;AAC7B,IAAI,CAAC,GAAG,IAAI,KAAK;AACjB,MAAM,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,MAAM,MAAM,YAAY,IAAI,EAAE,OAAO,IAAI,IAAI,CAAC,EAAE;AACpG,QAAQ,MAAM,IAAI,KAAK,CAAC,mBAAmB,CAAC;AAC5C,MAAM;AACN,MAAM,OAAO,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC;AACrC,IAAI,CAAC;AACL,IAAI,CAAC,KAAK,EAAE,IAAI;AAChB,GAAG;AACH,EAAE,OAAO,OAAO;AAChB;;AAEA,SAAS,OAAO,CAAC,IAAI,EAAE,OAAO,EAAE;AAChC,EAAE,OAAO;AACT,IAAI,YAAY,CAAC,IAAa,CAAC;AAC/B;AACA,IAAI,UAAU,CAAC,IAAa;AAC5B,GAAG;AACH,CC1KA,MAAM,KAAK,GAAG,MAAM;AACpB,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,MAAM,MAAM,YAAY,GAAG,OAAO,GAAG;AACjF,CAAC;;AA0UD,MAAM,eAAe,GAAG,CAAC,CAAC,KAAK,QAAQ,CAAC,IAAI,IAAI,GAAG,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,UAAU;AAsBlF,SAAS,iBAAiB,CAAC,gBAAgB,GAAG,MAAM;AACpD,EAAE,IAAI;AACN,IAAI,OAAO,MAAM,CAAC,YAAY;AAC9B,EAAE,CAAC,CAAC,OAAO,CAAC,EAAE;AACd,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,MAAM,MAAM,YAAY,EAAE;AAC5E,MAAM,IAAI,OAAO,MAAM,KAAK,WAAW,EAAE;AACzC,QAAQ,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;AACvB,MAAM;AACN,IAAI;AACJ,IAAI,OAAO,MAAM;AACjB,EAAE;AACF,CAAC,EAAE,OAAO,EAAE;AACZ,EAAE,IAAI,EAAE;AACR,EAAE,IAAI,OAAO;AACb,EAAE,IAAI,SAAS;AACf,EAAE,MAAM,OAAO,GAAG;AAClB,IAAI,OAAO,EAAE,CAAC,GAAG,EAAE,YAAY,KAAK;AACpC,MAAM,IAAI,GAAG,EAAE,EAAE;AACjB,MAAM,MAAM,KAAK,GAAG,CAAC,IAAI,KAAK;AAC9B,QAAQ,IAAI,GAAG,IAAI,IAAI,EAAE;AACzB,QAAQ,IAAI,OAAO,KAAK,IAAI,EAAE;AAC9B,UAAU,IAAI;AACd,YAAY,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAoB,MAAM,CAAkB,CAAC;AACpF,UAAU,CAAC,CAAC,OAAO,CAAC,EAAE;AACtB,YAAY,OAAO,YAAY;AAC/B,UAAU;AACV,UAAU,OAAO,GAAG,IAAI;AACxB,QAAQ;AACR,QAAQ,OAAO,SAAS;AACxB,MAAM,CAAC;AACP,MAAM,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,CAAC,GAAG,GAAG,gBAAgB,EAAE,KAAK,IAAI,GAAG,MAAM,GAAG,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,IAAI,GAAG,EAAE,GAAG,IAAI;AAC3G,MAAM,IAAI,eAAe,CAAC,GAAG,CAAC,EAAE;AAChC,QAAQ,OAAO,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC;AAC9B,MAAM;AACN,MAAM,OAAO,KAAK,CAAC,GAAG,CAAC;AACvB,IAAI,CAAC;AACL,IAAI,OAAO,EAAE,CAAC,GAAG,EAAE,QAAQ,KAAK;AAChC,MAAM,IAAI,GAAG;AACb,MAAM,OAAO,CAAC,GAAG,GAAG,gBAAgB,EAAE,KAAK,IAAI,GAAG,MAAM,GAAG,GAAG,CAAC,OAAO;AACtE,QAAQ,GAAG;AACX,QAAQ,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAoB,MAAM,CAAmB;AAC5E,OAAO;AACP,IAAI,CAAC;AACL,IAAI,UAAU,EAAE,CAAC,GAAG,KAAK;AACzB,MAAM,IAAI,GAAG;AACb,MAAM,OAAO,CAAC,GAAG,GAAG,gBAAgB,EAAE,KAAK,IAAI,GAAG,MAAM,GAAG,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC;AAC9E,IAAI;AACJ,GAAG;AACH,EAAE,MAAM,qBAAqB,GAAG,CAAC,WAAW,KAAK,CAAC,GAAG,EAAE,QAAQ,EAAE,YAAY,KAAK,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK;AAC1G,IAAI,IAAI,QAAQ;AAChB,IAAI,IAAI;AACR,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;AACpC,IAAI,CAAC,CAAC,OAAO,CAAC,EAAE;AAChB,MAAM,QAAQ,GAAG,YAAY;AAC7B,IAAI;AACJ,IAAI,QAAQ,CAAC,QAAQ,CAAC;AACtB,EAAE,CAAC,CAAC;AACJ,EAAE,IAAI,UAAU;AAChB,EAAE,IAAI;AACN,IAAI,UAAU,GAAG,CAAC,EAAE,GAAG,gBAAgB,EAAE,KAAK,IAAI,GAAG,MAAM,GAAG,EAAE,CAAC,SAAS;AAC1E,EAAE,CAAC,CAAC,OAAO,CAAC,EAAE;AACd,EAAE;AACF,EAAE,IAAI,CAAC,UAAU,IAAI,OAAO,MAAM,KAAK,WAAW,IAAI,OAAO,MAAM,CAAC,gBAAgB,KAAK,UAAU,IAAI,MAAM,CAAC,OAAO,EAAE;AACvH,IAAI,UAAU,GAAG,CAAC,GAAG,EAAE,QAAQ,KAAK;AACpC,MAAM,IAAI,EAAE,gBAAgB,EAAE,YAAY,MAAM,CAAC,OAAO,CAAC,EAAE;AAC3D,QAAQ,OAAO,MAAM;AACrB,QAAQ,CAAC;AACT,MAAM;AACN,MAAM,MAAM,oBAAoB,GAAG,CAAC,CAAC,KAAK;AAC1C,QAAQ,IAAI,CAAC,CAAC,WAAW,KAAK,gBAAgB,EAAE,IAAI,CAAC,CAAC,GAAG,KAAK,GAAG,EAAE;AACnE,UAAU,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC;AAC9B,QAAQ;AACR,MAAM,CAAC;AACP,MAAM,MAAM,CAAC,gBAAgB,CAAC,SAAS,EAAE,oBAAoB,CAAC;AAC9D,MAAM,OAAO,MAAM;AACnB,QAAQ,MAAM,CAAC,mBAAmB,CAAC,SAAS,EAAE,oBAAoB,CAAC;AACnE,MAAM,CAAC;AACP,IAAI,CAAC;AACL,EAAE;AACF,EAAE,IAAI,UAAU,EAAE;AAClB,IAAI,OAAO,CAAC,SAAS,GAAG,qBAAqB,CAAC,UAAU,CAAC;AACzD,EAAE;AACF,EAAE,OAAO,OAAO;AAChB;AACA,MAAM,cAAc,GAAG,iBAAiB,EAAE;AAC1C,SAAS,eAAe,CAAC,GAAG,EAAE,YAAY,EAAE,OAAO,GAAG,cAAc,EAAE,OAAO,EAAE;AAE/E,EAAE,MAAM,QAAQ,GAAG,IAAI;AACvB,IAAqD;AACrD,GAAG;AACH,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,MAAM,MAAM,YAAY,EAAE;AAC1E,IAAI,QAAQ,CAAC,YAAY,GAAG,IAAI;AAChC,EAAE;AACF,EAAE,QAAQ,CAAC,OAAO,GAAG,CAAC,OAAO,KAAK;AAClC,IAAI,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,EAAE,YAAY,CAAC,CAAC;AAC/C,IAAI,IAAI,KAAK;AACb,IAAI,IAAI,OAAO,CAAC,SAAS,EAAE;AAC3B,MAAM,KAAK,GAAG,OAAO,CAAC,SAAS,CAAC,GAAG,EAAE,OAAO,EAAE,YAAY,CAAC;AAC3D,IAAI;AACJ,IAAI,OAAO,KAAK;AAChB,EAAE,CAAC;AACH,EAAE,MAAM,MAAM,GAAG,IAAI;AACrB,IAAI,CAAC,GAAG,KAAK,GAAG,CAAC,QAAQ,CAAC;AAC1B,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,MAAM,KAAK;AAC1B,MAAM,MAAM,SAAS,GAAG,OAAO,MAAM,KAAK,UAAU,GAAG,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,GAAG,MAAM;AACrF,MAAM,IAAI,SAAS,KAAK,KAAK,EAAE;AAC/B,QAAQ,GAAG,CAAC,QAAQ,EAAE,YAAY,CAAC;AACnC,QAAQ,OAAO,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC;AACtC,MAAM;AACN,MAAM,IAAI,eAAe,CAAC,SAAS,CAAC,EAAE;AACtC,QAAQ,OAAO,SAAS,CAAC,IAAI,CAAC,CAAC,aAAa,KAAK;AACjD,UAAU,GAAG,CAAC,QAAQ,EAAE,aAAa,CAAC;AACtC,UAAU,OAAO,OAAO,CAAC,OAAO,CAAC,GAAG,EAAE,aAAa,CAAC;AACpD,QAAQ,CAAC,CAAC;AACV,MAAM;AACN,MAAM,GAAG,CAAC,QAAQ,EAAE,SAAS,CAAC;AAC9B,MAAM,OAAO,OAAO,CAAC,OAAO,CAAC,GAAG,EAAE,SAAS,CAAC;AAC5C,IAAI;AACJ,GAAG;AACH,EAAE,OAAO,MAAM;AACf,CC7bA;AACM,SAAUC,kBAAkBA,CAAI;EACpC/B,GAAG;EACHgC,YAAY;AACZC,EAAAA,OAAO,GAAG,KAAK;AACfR,EAAAA,OAAO,EAAES;AAAa,CACE,EAAA;AACxB,EAAA,MAAMC,eAAe,GAAGD,aAAa,IAAIT,OAAO;AAEhD;EACA,MAAMW,SAAS,GAAGH,OAAO,GACrBI,eAAe,CACbrC,GAAG,EACHgC,YAAY,EACZM,iBAAiB,CAAI,MAAMH,eAAe,CAAC,CAC5C,GACDI,IAAI,CAAIP,YAAY,CAAC;EAEzB,MAAMQ,QAAQ,GAAGA,MAAA;AACf,IAAA,MAAA,CAAA7D,KAAA,CAAA,GAAgB8D,OAAO,CAACL,SAA6B,CAAC;AAAA,IAAA,OAC/CzD,KAAK;EAAA,CACb;EAED,MAAM+D,QAAQ,GAAGA,MAAA;IAAA,MAAAC,CAAA,GAAAtJ,CAAA,CAAA,CAAA,CAAA;AACf,IAAA,MAAA,CAAAsF,KAAA,EAAAiE,QAAA,IAA0BH,OAAO,CAACL,SAA6B,CAAC;AAAA,IAAA,IAAAS,EAAA;AAAA,IAAA,IAAAF,CAAA,CAAA,CAAA,CAAA,KAAAC,QAAA,IAAAD,CAAA,QAAAhE,KAAA,EAAA;AACzDkE,MAAAA,EAAA,GAAA,CAAClE,KAAK,EAAEiE,QAAQ,CAA4B;AAAAD,MAAAA,CAAA,MAAAC,QAAA;AAAAD,MAAAA,CAAA,MAAAhE,KAAA;AAAAgE,MAAAA,CAAA,MAAAE,EAAA;AAAA,IAAA,CAAA,MAAA;AAAAA,MAAAA,EAAA,GAAAF,CAAA,CAAA,CAAA,CAAA;AAAA,IAAA;AAAA,IAAA,OAA5CE,EAA4C;EAAA,CACpD;EAED,MAAMC,QAAQ,GAAGA,MAAA;IAAA,MAAAH,CAAA,GAAAtJ,CAAA,CAAA,CAAA,CAAA;AACf,IAAA,MAAA,GAAAuJ,QAAA,CAAA,GAAqBH,OAAO,CAACL,SAA6B,CAAC;AAAA,IAAA,IAAAS,EAAA;IAAA,IAAAF,CAAA,QAAAC,QAAA,EAAA;AACpDC,MAAAA,EAAA,GAAAA,MAAA;QACLD,QAAQ,CAACZ,YAAY,CAAC;AAEtB,QAAA,IAAIC,OAAO,EAAA;AACTE,UAAAA,eAAe,CAAAd,UAAW,CAACrB,GAAG,CAAC;AAAA,QAAA;MAChC,CACF;AAAA2C,MAAAA,CAAA,MAAAC,QAAA;AAAAD,MAAAA,CAAA,MAAAE,EAAA;AAAA,IAAA,CAAA,MAAA;AAAAA,MAAAA,EAAA,GAAAF,CAAA,CAAA,CAAA,CAAA;AAAA,IAAA;AAAA,IAAA,OANME,EAMN;EAAA,CACF;EAED,OAAO;AACLN,IAAAA,IAAI,EAAEH,SAA6B;IACnCI,QAAQ;IACRE,QAAQ;AACRI,IAAAA;GACD;AACH","x_google_ignoreList":[0,2,3,4,5]}

package/dist/utiles/index.d.ts

@@ -1 +1,15 @@
-export * from '@gaddario98/utiles';
+import { ClassValue } from 'clsx';
+
+declare function cn(...inputs: Array<ClassValue>): string;
+
+type ExtractorCache<T> = Map<string, T>;
+declare function createExtractor<T extends Record<string, unknown>, K extends keyof T = keyof T>(allData?: T, cache?: ExtractorCache<Partial<T>>, usedKeys?: Array<K>): T;
+
+type PropsAreEqual<P> = (prevProps: Readonly<P>, nextProps: Readonly<P>) => boolean;
+/**
+ * Wrapper per React.memo che preserva i tipi generici
+ */
+declare function withMemo<T extends React.ComponentType<any>>(Component: T, propsAreEqual?: PropsAreEqual<React.ComponentProps<T>>): T;
+
+export { cn, createExtractor, withMemo };
+export type { ExtractorCache };