@mdn/fred 0.1.0 → 0.2.0

package/dist/client/{5557.247c4c4c61d91b4d.js.map → 5557.3923ba7ade67d4c8.js.map}

@@ -1 +1 @@
-{"version":3,"file":"5557.247c4c4c61d91b4d.js","sources":["webpack://@mdn/fred/./node_modules/assignment/assignment.js","webpack://@mdn/fred/./node_modules/css-loader/dist/runtime/api.js","webpack://@mdn/fred/./node_modules/css-loader/dist/runtime/getUrl.js","webpack://@mdn/fred/./node_modules/css-loader/dist/runtime/noSourceMaps.js","webpack://@mdn/fred/./node_modules/fflate/esm/browser.js","webpack://@mdn/fred/./node_modules/insane/attributes.js","webpack://@mdn/fred/./node_modules/insane/defaults.js","webpack://@mdn/fred/./node_modules/insane/elements.js","webpack://@mdn/fred/./node_modules/insane/insane.js","webpack://@mdn/fred/./node_modules/insane/lowercase.js","webpack://@mdn/fred/./node_modules/insane/parser.js","webpack://@mdn/fred/./node_modules/insane/sanitizer.js","webpack://@mdn/fred/./node_modules/insane/she.js","webpack://@mdn/fred/./node_modules/insane/toMap.js","webpack://@mdn/fred/./node_modules/@fluent/bundle/esm/types.js","webpack://@mdn/fred/./node_modules/@fluent/bundle/esm/resolver.js","webpack://@mdn/fred/./node_modules/@fluent/bundle/esm/scope.js","webpack://@mdn/fred/./node_modules/@fluent/bundle/esm/builtins.js","webpack://@mdn/fred/./node_modules/@fluent/bundle/esm/memoizer.js","webpack://@mdn/fred/./node_modules/@fluent/bundle/esm/bundle.js","webpack://@mdn/fred/./node_modules/@fluent/bundle/esm/resource.js","webpack://@mdn/fred/./node_modules/lit-html/private-ssr-support.js","webpack://@mdn/fred/./node_modules/@lit-labs/ssr-client/lib/hydrate-lit-html.js","webpack://@mdn/fred/./node_modules/@lit-labs/ssr-client/lit-element-hydrate-support.js","webpack://@mdn/fred/./node_modules/@lit/reactive-element/css-tag.js","webpack://@mdn/fred/./node_modules/@lit/reactive-element/reactive-element.js","webpack://@mdn/fred/./node_modules/@lit/task/task.js","webpack://@mdn/fred/./node_modules/lit-html/directive-helpers.js","webpack://@mdn/fred/./node_modules/lit-html/directive.js","webpack://@mdn/fred/./node_modules/lit-html/lit-html.js","webpack://@mdn/fred/./node_modules/lit-html/directives/unsafe-html.js","webpack://@mdn/fred/./node_modules/lit-element/lit-element.js"],"sourcesContent":["'use strict';\n\nfunction assignment (result) {\n  var stack = Array.prototype.slice.call(arguments, 1);\n  var item;\n  var key;\n  while (stack.length) {\n    item = stack.shift();\n    for (key in item) {\n      if (item.hasOwnProperty(key)) {\n        if (Object.prototype.toString.call(result[key]) === '[object Object]') {\n          result[key] = assignment(result[key], item[key]);\n        } else {\n          result[key] = item[key];\n        }\n      }\n    }\n  }\n  return result;\n}\n\nmodule.exports = assignment;\n","\"use strict\";\n\n/*\n  MIT License http://www.opensource.org/licenses/mit-license.php\n  Author Tobias Koppers @sokra\n*/\nmodule.exports = function (cssWithMappingToString) {\n  var list = [];\n\n  // return the list of modules as css string\n  list.toString = function toString() {\n    return this.map(function (item) {\n      var content = \"\";\n      var needLayer = typeof item[5] !== \"undefined\";\n      if (item[4]) {\n        content += \"@supports (\".concat(item[4], \") {\");\n      }\n      if (item[2]) {\n        content += \"@media \".concat(item[2], \" {\");\n      }\n      if (needLayer) {\n        content += \"@layer\".concat(item[5].length > 0 ? \" \".concat(item[5]) : \"\", \" {\");\n      }\n      content += cssWithMappingToString(item);\n      if (needLayer) {\n        content += \"}\";\n      }\n      if (item[2]) {\n        content += \"}\";\n      }\n      if (item[4]) {\n        content += \"}\";\n      }\n      return content;\n    }).join(\"\");\n  };\n\n  // import a list of modules into the list\n  list.i = function i(modules, media, dedupe, supports, layer) {\n    if (typeof modules === \"string\") {\n      modules = [[null, modules, undefined]];\n    }\n    var alreadyImportedModules = {};\n    if (dedupe) {\n      for (var k = 0; k < this.length; k++) {\n        var id = this[k][0];\n        if (id != null) {\n          alreadyImportedModules[id] = true;\n        }\n      }\n    }\n    for (var _k = 0; _k < modules.length; _k++) {\n      var item = [].concat(modules[_k]);\n      if (dedupe && alreadyImportedModules[item[0]]) {\n        continue;\n      }\n      if (typeof layer !== \"undefined\") {\n        if (typeof item[5] === \"undefined\") {\n          item[5] = layer;\n        } else {\n          item[1] = \"@layer\".concat(item[5].length > 0 ? \" \".concat(item[5]) : \"\", \" {\").concat(item[1], \"}\");\n          item[5] = layer;\n        }\n      }\n      if (media) {\n        if (!item[2]) {\n          item[2] = media;\n        } else {\n          item[1] = \"@media \".concat(item[2], \" {\").concat(item[1], \"}\");\n          item[2] = media;\n        }\n      }\n      if (supports) {\n        if (!item[4]) {\n          item[4] = \"\".concat(supports);\n        } else {\n          item[1] = \"@supports (\".concat(item[4], \") {\").concat(item[1], \"}\");\n          item[4] = supports;\n        }\n      }\n      list.push(item);\n    }\n  };\n  return list;\n};","\"use strict\";\n\nmodule.exports = function (url, options) {\n  if (!options) {\n    options = {};\n  }\n  if (!url) {\n    return url;\n  }\n  url = String(url.__esModule ? url.default : url);\n\n  // If url is already wrapped in quotes, remove them\n  if (/^['\"].*['\"]$/.test(url)) {\n    url = url.slice(1, -1);\n  }\n  if (options.hash) {\n    url += options.hash;\n  }\n\n  // Should url be wrapped?\n  // See https://drafts.csswg.org/css-values-3/#urls\n  if (/[\"'() \\t\\n]|(%20)/.test(url) || options.needQuotes) {\n    return \"\\\"\".concat(url.replace(/\"/g, '\\\\\"').replace(/\\n/g, \"\\\\n\"), \"\\\"\");\n  }\n  return url;\n};","\"use strict\";\n\nmodule.exports = function (i) {\n  return i[1];\n};","// 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","'use strict';\n\nvar toMap = require('./toMap');\nvar uris = ['background', 'base', 'cite', 'href', 'longdesc', 'src', 'usemap'];\n\nmodule.exports = {\n  uris: toMap(uris) // attributes that have an href and hence need to be sanitized\n};\n","'use strict';\n\nvar defaults = {\n  allowedAttributes: {\n    a: ['href', 'name', 'target', 'title', 'aria-label'],\n    iframe: ['allowfullscreen', 'frameborder', 'src'],\n    img: ['src', 'alt', 'title', 'aria-label']\n  },\n  allowedClasses: {},\n  allowedSchemes: ['http', 'https', 'mailto'],\n  allowedTags: [\n    'a', 'abbr', 'article', 'b', 'blockquote', 'br', 'caption', 'code', 'del', 'details', 'div', 'em',\n    'h1', 'h2', 'h3', 'h4', 'h5', 'h6', 'hr', 'i', 'img', 'ins', 'kbd', 'li', 'main', 'mark',\n    'ol', 'p', 'pre', 'section', 'span', 'strike', 'strong', 'sub', 'summary', 'sup', 'table',\n    'tbody', 'td', 'th', 'thead', 'tr', 'u', 'ul'\n  ],\n  filter: null\n};\n\nmodule.exports = defaults;\n","'use strict';\n\nvar toMap = require('./toMap');\nvar voids = ['area', 'br', 'col', 'hr', 'img', 'wbr', 'input', 'base', 'basefont', 'link', 'meta'];\n\nmodule.exports = {\n  voids: toMap(voids)\n};\n","'use strict';\n\nvar he = require('he');\nvar assign = require('assignment');\nvar parser = require('./parser');\nvar sanitizer = require('./sanitizer');\nvar defaults = require('./defaults');\n\nfunction insane (html, options, strict) {\n  var buffer = [];\n  var configuration = strict === true ? options : assign({}, defaults, options);\n  var handler = sanitizer(buffer, configuration);\n\n  parser(html, handler);\n\n  return buffer.join('');\n}\n\ninsane.defaults = defaults;\nmodule.exports = insane;\n","'use strict';\n\nmodule.exports = function lowercase (string) {\n  return typeof string === 'string' ? string.toLowerCase() : string;\n};\n","'use strict';\n\nvar he = require('he');\nvar lowercase = require('./lowercase');\nvar attributes = require('./attributes');\nvar elements = require('./elements');\nvar rstart = /^<\\s*([\\w:-]+)((?:\\s+[\\w:-]+(?:\\s*=\\s*(?:(?:\"[^\"]*\")|(?:'[^']*')|[^>\\s]+))?)*)\\s*(\\/?)\\s*>/;\nvar rend = /^<\\s*\\/\\s*([\\w:-]+)[^>]*>/;\nvar rattrs = /([\\w:-]+)(?:\\s*=\\s*(?:(?:\"((?:[^\"])*)\")|(?:'((?:[^'])*)')|([^>\\s]+)))?/g;\nvar rtag = /^</;\nvar rtagend = /^<\\s*\\//;\n\nfunction createStack () {\n  var stack = [];\n  stack.lastItem = function lastItem () {\n    return stack[stack.length - 1];\n  };\n  return stack;\n}\n\nfunction parser (html, handler) {\n  var stack = createStack();\n  var last = html;\n  var chars;\n\n  while (html) {\n    parsePart();\n  }\n  parseEndTag(); // clean up any remaining tags\n\n  function parsePart () {\n    chars = true;\n    parseTag();\n\n    var same = html === last;\n    last = html;\n\n    if (same) { // discard, because it's invalid\n      html = '';\n    }\n  }\n\n  function parseTag () {\n    if (html.substr(0, 4) === '<!--') { // comments\n      parseComment();\n    } else if (rtagend.test(html)) {\n      parseEdge(rend, parseEndTag);\n    } else if (rtag.test(html)) {\n      parseEdge(rstart, parseStartTag);\n    }\n    parseTagDecode();\n  }\n\n  function parseEdge (regex, parser) {\n    var match = html.match(regex);\n    if (match) {\n      html = html.substring(match[0].length);\n      match[0].replace(regex, parser);\n      chars = false;\n    }\n  }\n\n  function parseComment () {\n    var index = html.indexOf('-->');\n    if (index >= 0) {\n      if (handler.comment) {\n        handler.comment(html.substring(4, index));\n      }\n      html = html.substring(index + 3);\n      chars = false;\n    }\n  }\n\n  function parseTagDecode () {\n    if (!chars) {\n      return;\n    }\n    var text;\n    var index = html.indexOf('<');\n    if (index >= 0) {\n      text = html.substring(0, index);\n      html = html.substring(index);\n    } else {\n      text = html;\n      html = '';\n    }\n    if (handler.chars) {\n      handler.chars(text);\n    }\n  }\n\n  function parseStartTag (tag, tagName, rest, unary) {\n    var attrs = {};\n    var low = lowercase(tagName);\n    var u = elements.voids[low] || !!unary;\n\n    rest.replace(rattrs, attrReplacer);\n\n    if (!u) {\n      stack.push(low);\n    }\n    if (handler.start) {\n      handler.start(low, attrs, u);\n    }\n\n    function attrReplacer (match, name, doubleQuotedValue, singleQuotedValue, unquotedValue) {\n      if (doubleQuotedValue === void 0 && singleQuotedValue === void 0 && unquotedValue === void 0) {\n        attrs[name] = void 0; // attribute is like <button disabled></button>\n      } else {\n        attrs[name] = he.decode(doubleQuotedValue || singleQuotedValue || unquotedValue || '');\n      }\n    }\n  }\n\n  function parseEndTag (tag, tagName) {\n    var i;\n    var pos = 0;\n    var low = lowercase(tagName);\n    if (low) {\n      for (pos = stack.length - 1; pos >= 0; pos--) {\n        if (stack[pos] === low) {\n          break; // find the closest opened tag of the same type\n        }\n      }\n    }\n    if (pos >= 0) {\n      for (i = stack.length - 1; i >= pos; i--) {\n        if (handler.end) { // close all the open elements, up the stack\n          handler.end(stack[i]);\n        }\n      }\n      stack.length = pos;\n    }\n  }\n}\n\nmodule.exports = parser;\n","'use strict';\n\nvar he = require('he');\nvar lowercase = require('./lowercase');\nvar attributes = require('./attributes');\nvar elements = require('./elements');\n\nfunction sanitizer (buffer, options) {\n  var last;\n  var context;\n  var o = options || {};\n\n  reset();\n\n  return {\n    start: start,\n    end: end,\n    chars: chars\n  };\n\n  function out (value) {\n    buffer.push(value);\n  }\n\n  function start (tag, attrs, unary) {\n    var low = lowercase(tag);\n\n    if (context.ignoring) {\n      ignore(low); return;\n    }\n    if ((o.allowedTags || []).indexOf(low) === -1) {\n      ignore(low); return;\n    }\n    if (o.filter && !o.filter({ tag: low, attrs: attrs })) {\n      ignore(low); return;\n    }\n\n    out('<');\n    out(low);\n    Object.keys(attrs).forEach(parse);\n    out(unary ? '/>' : '>');\n\n    function parse (key) {\n      var value = attrs[key];\n      var classesOk = (o.allowedClasses || {})[low] || [];\n      var attrsOk = (o.allowedAttributes || {})[low] || [];\n      var valid;\n      var lkey = lowercase(key);\n      if (lkey === 'class' && attrsOk.indexOf(lkey) === -1) {\n        value = value.split(' ').filter(isValidClass).join(' ').trim();\n        valid = value.length;\n      } else {\n        valid = attrsOk.indexOf(lkey) !== -1 && (attributes.uris[lkey] !== true || testUrl(value));\n      }\n      if (valid) {\n        out(' ');\n        out(key);\n        if (typeof value === 'string') {\n          out('=\"');\n          out(he.encode(value));\n          out('\"');\n        }\n      }\n      function isValidClass (className) {\n        return classesOk && classesOk.indexOf(className) !== -1;\n      }\n    }\n  }\n\n  function end (tag) {\n    var low = lowercase(tag);\n    var allowed = (o.allowedTags || []).indexOf(low) !== -1;\n    if (allowed) {\n      if (context.ignoring === false) {\n        out('</');\n        out(low);\n        out('>');\n      } else {\n        unignore(low);\n      }\n    } else {\n      unignore(low);\n    }\n  }\n\n  function testUrl (text) {\n    var start = text[0];\n    if (start === '#' || start === '/') {\n      return true;\n    }\n    var colon = text.indexOf(':');\n    if (colon === -1) {\n      return true;\n    }\n    var questionmark = text.indexOf('?');\n    if (questionmark !== -1 && colon > questionmark) {\n      return true;\n    }\n    var hash = text.indexOf('#');\n    if (hash !== -1 && colon > hash) {\n      return true;\n    }\n    return o.allowedSchemes.some(matches);\n\n    function matches (scheme) {\n      return text.indexOf(scheme + ':') === 0;\n    }\n  }\n\n  function chars (text) {\n    if (context.ignoring === false) {\n      out(o.transformText ? o.transformText(text) : text);\n    }\n  }\n\n  function ignore (tag) {\n    if (elements.voids[tag]) {\n      return;\n    }\n    if (context.ignoring === false) {\n      context = { ignoring: tag, depth: 1 };\n    } else if (context.ignoring === tag) {\n      context.depth++;\n    }\n  }\n\n  function unignore (tag) {\n    if (context.ignoring === tag) {\n      if (--context.depth <= 0) {\n        reset();\n      }\n    }\n  }\n\n  function reset () {\n    context = { ignoring: false, depth: 0 };\n  }\n}\n\nmodule.exports = sanitizer;\n","'use strict';\n\nvar escapes = {\n  '&': '&amp;',\n  '<': '&lt;',\n  '>': '&gt;',\n  '\"': '&quot;',\n  \"'\": '&#39;'\n};\nvar unescapes = {\n  '&amp;': '&',\n  '&lt;': '<',\n  '&gt;': '>',\n  '&quot;': '\"',\n  '&#39;': \"'\"\n};\nvar rescaped = /(&amp;|&lt;|&gt;|&quot;|&#39;)/g;\nvar runescaped = /[&<>\"']/g;\n\nfunction escapeHtmlChar (match) {\n  return escapes[match];\n}\nfunction unescapeHtmlChar (match) {\n  return unescapes[match];\n}\n\nfunction escapeHtml (text) {\n  return text == null ? '' : String(text).replace(runescaped, escapeHtmlChar);\n}\n\nfunction unescapeHtml (html) {\n  return html == null ? '' : String(html).replace(rescaped, unescapeHtmlChar);\n}\n\nescapeHtml.options = unescapeHtml.options = {};\n\nmodule.exports = {\n  encode: escapeHtml,\n  escape: escapeHtml,\n  decode: unescapeHtml,\n  unescape: unescapeHtml,\n  version: '1.0.0-browser'\n};\n","'use strict';\n\nfunction toMap (list) {\n  return list.reduce(asKey, {});\n}\n\nfunction asKey (accumulator, item) {\n  accumulator[item] = true;\n  return accumulator;\n}\n\nmodule.exports = toMap;\n","/**\n * The `FluentType` class is the base of Fluent's type system.\n *\n * Fluent types wrap JavaScript values and store additional configuration for\n * them, which can then be used in the `toString` method together with a proper\n * `Intl` formatter.\n */\nexport class FluentType {\n    /**\n     * Create a `FluentType` instance.\n     *\n     * @param value The JavaScript value to wrap.\n     */\n    constructor(value) {\n        this.value = value;\n    }\n    /**\n     * Unwrap the raw value stored by this `FluentType`.\n     */\n    valueOf() {\n        return this.value;\n    }\n}\n/**\n * A {@link FluentType} representing no correct value.\n */\nexport class FluentNone extends FluentType {\n    /**\n     * Create an instance of `FluentNone` with an optional fallback value.\n     * @param value The fallback value of this `FluentNone`.\n     */\n    constructor(value = \"???\") {\n        super(value);\n    }\n    /**\n     * Format this `FluentNone` to the fallback string.\n     */\n    toString(scope) {\n        return `{${this.value}}`;\n    }\n}\n/**\n * A {@link FluentType} representing a number.\n *\n * A `FluentNumber` instance stores the number value of the number it\n * represents. It may also store an option bag of options which will be passed\n * to `Intl.NumerFormat` when the `FluentNumber` is formatted to a string.\n */\nexport class FluentNumber extends FluentType {\n    /**\n     * Create an instance of `FluentNumber` with options to the\n     * `Intl.NumberFormat` constructor.\n     *\n     * @param value The number value of this `FluentNumber`.\n     * @param opts Options which will be passed to `Intl.NumberFormat`.\n     */\n    constructor(value, opts = {}) {\n        super(value);\n        this.opts = opts;\n    }\n    /**\n     * Format this `FluentNumber` to a string.\n     */\n    toString(scope) {\n        if (scope) {\n            try {\n                const nf = scope.memoizeIntlObject(Intl.NumberFormat, this.opts);\n                return nf.format(this.value);\n            }\n            catch (err) {\n                scope.reportError(err);\n            }\n        }\n        return this.value.toString(10);\n    }\n}\n/**\n * A {@link FluentType} representing a date and time.\n *\n * A `FluentDateTime` instance stores a Date object, Temporal object, or a number\n * as a numerical timestamp in milliseconds. It may also store an\n * option bag of options which will be passed to `Intl.DateTimeFormat` when the\n * `FluentDateTime` is formatted to a string.\n */\nexport class FluentDateTime extends FluentType {\n    static supportsValue(value) {\n        if (typeof value === \"number\")\n            return true;\n        if (value instanceof Date)\n            return true;\n        if (value instanceof FluentType)\n            return FluentDateTime.supportsValue(value.valueOf());\n        // Temporary workaround to support environments without Temporal\n        if (\"Temporal\" in globalThis) {\n            // for TypeScript, which doesn't know about Temporal yet\n            const _Temporal = globalThis.Temporal;\n            if (value instanceof _Temporal.Instant ||\n                value instanceof _Temporal.PlainDateTime ||\n                value instanceof _Temporal.PlainDate ||\n                value instanceof _Temporal.PlainMonthDay ||\n                value instanceof _Temporal.PlainTime ||\n                value instanceof _Temporal.PlainYearMonth) {\n                return true;\n            }\n        }\n        return false;\n    }\n    /**\n     * Create an instance of `FluentDateTime` with options to the\n     * `Intl.DateTimeFormat` constructor.\n     *\n     * @param value The number value of this `FluentDateTime`, in milliseconds.\n     * @param opts Options which will be passed to `Intl.DateTimeFormat`.\n     */\n    constructor(value, opts = {}) {\n        // unwrap any FluentType value, but only retain the opts from FluentDateTime\n        if (value instanceof FluentDateTime) {\n            opts = { ...value.opts, ...opts };\n            value = value.value;\n        }\n        else if (value instanceof FluentType) {\n            value = value.valueOf();\n        }\n        // Intl.DateTimeFormat defaults to gregorian calendar, but Temporal defaults to iso8601\n        if (typeof value === \"object\" &&\n            \"calendarId\" in value &&\n            opts.calendar === undefined) {\n            opts = { ...opts, calendar: value.calendarId };\n        }\n        super(value);\n        this.opts = opts;\n    }\n    [Symbol.toPrimitive](hint) {\n        return hint === \"string\" ? this.toString() : this.toNumber();\n    }\n    /**\n     * Convert this `FluentDateTime` to a number.\n     * Note that this isn't always possible due to the nature of Temporal objects.\n     * In such cases, a TypeError will be thrown.\n     */\n    toNumber() {\n        const value = this.value;\n        if (typeof value === \"number\")\n            return value;\n        if (value instanceof Date)\n            return value.getTime();\n        if (\"epochMilliseconds\" in value) {\n            return value.epochMilliseconds;\n        }\n        if (\"toZonedDateTime\" in value) {\n            return value.toZonedDateTime(\"UTC\").epochMilliseconds;\n        }\n        throw new TypeError(\"Unwrapping a non-number value as a number\");\n    }\n    /**\n     * Format this `FluentDateTime` to a string.\n     */\n    toString(scope) {\n        if (scope) {\n            try {\n                const dtf = scope.memoizeIntlObject(Intl.DateTimeFormat, this.opts);\n                return dtf.format(this.value);\n            }\n            catch (err) {\n                scope.reportError(err);\n            }\n        }\n        if (typeof this.value === \"number\" || this.value instanceof Date) {\n            return new Date(this.value).toISOString();\n        }\n        return this.value.toString();\n    }\n}\n","/**\n * The role of the Fluent resolver is to format a `Pattern` to an instance of\n * `FluentValue`. For performance reasons, primitive strings are considered\n * such instances, too.\n *\n * Translations can contain references to other messages or variables,\n * conditional logic in form of select expressions, traits which describe their\n * grammatical features, and can use Fluent builtins which make use of the\n * `Intl` formatters to format numbers and dates into the bundle's languages.\n * See the documentation of the Fluent syntax for more information.\n *\n * In case of errors the resolver will try to salvage as much of the\n * translation as possible. In rare situations where the resolver didn't know\n * how to recover from an error it will return an instance of `FluentNone`.\n *\n * All expressions resolve to an instance of `FluentValue`. The caller should\n * use the `toString` method to convert the instance to a native value.\n *\n * Functions in this file pass around an instance of the `Scope` class, which\n * stores the data required for successful resolution and error recovery.\n */\nimport { FluentType, FluentNone, FluentNumber, FluentDateTime, } from \"./types.js\";\n/**\n * The maximum number of placeables which can be expanded in a single call to\n * `formatPattern`. The limit protects against the Billion Laughs and Quadratic\n * Blowup attacks. See https://msdn.microsoft.com/en-us/magazine/ee335713.aspx.\n */\nconst MAX_PLACEABLES = 100;\n/** Unicode bidi isolation characters. */\nconst FSI = \"\\u2068\";\nconst PDI = \"\\u2069\";\n/** Helper: match a variant key to the given selector. */\nfunction match(scope, selector, key) {\n    if (key === selector) {\n        // Both are strings.\n        return true;\n    }\n    // XXX Consider comparing options too, e.g. minimumFractionDigits.\n    if (key instanceof FluentNumber &&\n        selector instanceof FluentNumber &&\n        key.value === selector.value) {\n        return true;\n    }\n    if (selector instanceof FluentNumber && typeof key === \"string\") {\n        let category = scope\n            .memoizeIntlObject(Intl.PluralRules, selector.opts)\n            .select(selector.value);\n        if (key === category) {\n            return true;\n        }\n    }\n    return false;\n}\n/** Helper: resolve the default variant from a list of variants. */\nfunction getDefault(scope, variants, star) {\n    if (variants[star]) {\n        return resolvePattern(scope, variants[star].value);\n    }\n    scope.reportError(new RangeError(\"No default\"));\n    return new FluentNone();\n}\n/** Helper: resolve arguments to a call expression. */\nfunction getArguments(scope, args) {\n    const positional = [];\n    const named = Object.create(null);\n    for (const arg of args) {\n        if (arg.type === \"narg\") {\n            named[arg.name] = resolveExpression(scope, arg.value);\n        }\n        else {\n            positional.push(resolveExpression(scope, arg));\n        }\n    }\n    return { positional, named };\n}\n/** Resolve an expression to a Fluent type. */\nfunction resolveExpression(scope, expr) {\n    switch (expr.type) {\n        case \"str\":\n            return expr.value;\n        case \"num\":\n            return new FluentNumber(expr.value, {\n                minimumFractionDigits: expr.precision,\n            });\n        case \"var\":\n            return resolveVariableReference(scope, expr);\n        case \"mesg\":\n            return resolveMessageReference(scope, expr);\n        case \"term\":\n            return resolveTermReference(scope, expr);\n        case \"func\":\n            return resolveFunctionReference(scope, expr);\n        case \"select\":\n            return resolveSelectExpression(scope, expr);\n        default:\n            return new FluentNone();\n    }\n}\n/** Resolve a reference to a variable. */\nfunction resolveVariableReference(scope, { name }) {\n    let arg;\n    if (scope.params) {\n        // We're inside a TermReference. It's OK to reference undefined parameters.\n        if (Object.prototype.hasOwnProperty.call(scope.params, name)) {\n            arg = scope.params[name];\n        }\n        else {\n            return new FluentNone(`$${name}`);\n        }\n    }\n    else if (scope.args &&\n        Object.prototype.hasOwnProperty.call(scope.args, name)) {\n        // We're in the top-level Pattern or inside a MessageReference. Missing\n        // variables references produce ReferenceErrors.\n        arg = scope.args[name];\n    }\n    else {\n        scope.reportError(new ReferenceError(`Unknown variable: $${name}`));\n        return new FluentNone(`$${name}`);\n    }\n    // Return early if the argument already is an instance of FluentType.\n    if (arg instanceof FluentType) {\n        return arg;\n    }\n    // Convert the argument to a Fluent type.\n    switch (typeof arg) {\n        case \"string\":\n            return arg;\n        case \"number\":\n            return new FluentNumber(arg);\n        case \"object\":\n            if (FluentDateTime.supportsValue(arg)) {\n                return new FluentDateTime(arg);\n            }\n        // eslint-disable-next-line no-fallthrough\n        default:\n            scope.reportError(new TypeError(`Variable type not supported: $${name}, ${typeof arg}`));\n            return new FluentNone(`$${name}`);\n    }\n}\n/** Resolve a reference to another message. */\nfunction resolveMessageReference(scope, { name, attr }) {\n    const message = scope.bundle._messages.get(name);\n    if (!message) {\n        scope.reportError(new ReferenceError(`Unknown message: ${name}`));\n        return new FluentNone(name);\n    }\n    if (attr) {\n        const attribute = message.attributes[attr];\n        if (attribute) {\n            return resolvePattern(scope, attribute);\n        }\n        scope.reportError(new ReferenceError(`Unknown attribute: ${attr}`));\n        return new FluentNone(`${name}.${attr}`);\n    }\n    if (message.value) {\n        return resolvePattern(scope, message.value);\n    }\n    scope.reportError(new ReferenceError(`No value: ${name}`));\n    return new FluentNone(name);\n}\n/** Resolve a call to a Term with key-value arguments. */\nfunction resolveTermReference(scope, { name, attr, args }) {\n    const id = `-${name}`;\n    const term = scope.bundle._terms.get(id);\n    if (!term) {\n        scope.reportError(new ReferenceError(`Unknown term: ${id}`));\n        return new FluentNone(id);\n    }\n    if (attr) {\n        const attribute = term.attributes[attr];\n        if (attribute) {\n            // Every TermReference has its own variables.\n            scope.params = getArguments(scope, args).named;\n            const resolved = resolvePattern(scope, attribute);\n            scope.params = null;\n            return resolved;\n        }\n        scope.reportError(new ReferenceError(`Unknown attribute: ${attr}`));\n        return new FluentNone(`${id}.${attr}`);\n    }\n    scope.params = getArguments(scope, args).named;\n    const resolved = resolvePattern(scope, term.value);\n    scope.params = null;\n    return resolved;\n}\n/** Resolve a call to a Function with positional and key-value arguments. */\nfunction resolveFunctionReference(scope, { name, args }) {\n    // Some functions are built-in. Others may be provided by the runtime via\n    // the `FluentBundle` constructor.\n    let func = scope.bundle._functions[name];\n    if (!func) {\n        scope.reportError(new ReferenceError(`Unknown function: ${name}()`));\n        return new FluentNone(`${name}()`);\n    }\n    if (typeof func !== \"function\") {\n        scope.reportError(new TypeError(`Function ${name}() is not callable`));\n        return new FluentNone(`${name}()`);\n    }\n    try {\n        let resolved = getArguments(scope, args);\n        return func(resolved.positional, resolved.named);\n    }\n    catch (err) {\n        scope.reportError(err);\n        return new FluentNone(`${name}()`);\n    }\n}\n/** Resolve a select expression to the member object. */\nfunction resolveSelectExpression(scope, { selector, variants, star }) {\n    let sel = resolveExpression(scope, selector);\n    if (sel instanceof FluentNone) {\n        return getDefault(scope, variants, star);\n    }\n    // Match the selector against keys of each variant, in order.\n    for (const variant of variants) {\n        const key = resolveExpression(scope, variant.key);\n        if (match(scope, sel, key)) {\n            return resolvePattern(scope, variant.value);\n        }\n    }\n    return getDefault(scope, variants, star);\n}\n/** Resolve a pattern (a complex string with placeables). */\nexport function resolveComplexPattern(scope, ptn) {\n    if (scope.dirty.has(ptn)) {\n        scope.reportError(new RangeError(\"Cyclic reference\"));\n        return new FluentNone();\n    }\n    // Tag the pattern as dirty for the purpose of the current resolution.\n    scope.dirty.add(ptn);\n    const result = [];\n    // Wrap interpolations with Directional Isolate Formatting characters\n    // only when the pattern has more than one element.\n    const useIsolating = scope.bundle._useIsolating && ptn.length > 1;\n    for (const elem of ptn) {\n        if (typeof elem === \"string\") {\n            result.push(scope.bundle._transform(elem));\n            continue;\n        }\n        scope.placeables++;\n        if (scope.placeables > MAX_PLACEABLES) {\n            scope.dirty.delete(ptn);\n            // This is a fatal error which causes the resolver to instantly bail out\n            // on this pattern. The length check protects against excessive memory\n            // usage, and throwing protects against eating up the CPU when long\n            // placeables are deeply nested.\n            throw new RangeError(`Too many placeables expanded: ${scope.placeables}, ` +\n                `max allowed is ${MAX_PLACEABLES}`);\n        }\n        if (useIsolating) {\n            result.push(FSI);\n        }\n        result.push(resolveExpression(scope, elem).toString(scope));\n        if (useIsolating) {\n            result.push(PDI);\n        }\n    }\n    scope.dirty.delete(ptn);\n    return result.join(\"\");\n}\n/**\n * Resolve a simple or a complex Pattern to a FluentString\n * (which is really the string primitive).\n */\nfunction resolvePattern(scope, value) {\n    // Resolve a simple pattern.\n    if (typeof value === \"string\") {\n        return scope.bundle._transform(value);\n    }\n    return resolveComplexPattern(scope, value);\n}\n","export class Scope {\n    constructor(bundle, errors, args) {\n        /**\n         * The Set of patterns already encountered during this resolution.\n         * Used to detect and prevent cyclic resolutions.\n         * @ignore\n         */\n        this.dirty = new WeakSet();\n        /** A dict of parameters passed to a TermReference. */\n        this.params = null;\n        /**\n         * The running count of placeables resolved so far.\n         * Used to detect the Billion Laughs and Quadratic Blowup attacks.\n         * @ignore\n         */\n        this.placeables = 0;\n        this.bundle = bundle;\n        this.errors = errors;\n        this.args = args;\n    }\n    reportError(error) {\n        if (!this.errors || !(error instanceof Error)) {\n            throw error;\n        }\n        this.errors.push(error);\n    }\n    memoizeIntlObject(ctor, opts) {\n        let cache = this.bundle._intls.get(ctor);\n        if (!cache) {\n            cache = {};\n            this.bundle._intls.set(ctor, cache);\n        }\n        let id = JSON.stringify(opts);\n        if (!cache[id]) {\n            // @ts-expect-error This is fine.\n            // eslint-disable-next-line @typescript-eslint/no-unsafe-assignment\n            cache[id] = new ctor(this.bundle.locales, opts);\n        }\n        return cache[id];\n    }\n}\n","/**\n * @overview\n *\n * The FTL resolver ships with a number of functions built-in.\n *\n * Each function take two arguments:\n *   - args - an array of positional args\n *   - opts - an object of key-value args\n *\n * Arguments to functions are guaranteed to already be instances of\n * `FluentValue`.  Functions must return `FluentValues` as well.\n */\nimport { FluentNone, FluentNumber, FluentDateTime, } from \"./types.js\";\nfunction values(opts, allowed) {\n    const unwrapped = Object.create(null);\n    for (const [name, opt] of Object.entries(opts)) {\n        if (allowed.includes(name)) {\n            unwrapped[name] = opt.valueOf();\n        }\n    }\n    return unwrapped;\n}\nconst NUMBER_ALLOWED = [\n    \"unitDisplay\",\n    \"currencyDisplay\",\n    \"useGrouping\",\n    \"minimumIntegerDigits\",\n    \"minimumFractionDigits\",\n    \"maximumFractionDigits\",\n    \"minimumSignificantDigits\",\n    \"maximumSignificantDigits\",\n];\n/**\n * The implementation of the `NUMBER()` builtin available to translations.\n *\n * Translations may call the `NUMBER()` builtin in order to specify formatting\n * options of a number. For example:\n *\n *     pi = The value of π is {NUMBER($pi, maximumFractionDigits: 2)}.\n *\n * The implementation expects an array of {@link FluentValue | FluentValues} representing the\n * positional arguments, and an object of named {@link FluentValue | FluentValues} representing the\n * named parameters.\n *\n * The following options are recognized:\n *\n *     unitDisplay\n *     currencyDisplay\n *     useGrouping\n *     minimumIntegerDigits\n *     minimumFractionDigits\n *     maximumFractionDigits\n *     minimumSignificantDigits\n *     maximumSignificantDigits\n *\n * Other options are ignored.\n *\n * @param args The positional arguments passed to this `NUMBER()`.\n * @param opts The named argments passed to this `NUMBER()`.\n */\nexport function NUMBER(args, opts) {\n    let arg = args[0];\n    if (arg instanceof FluentNone) {\n        return new FluentNone(`NUMBER(${arg.valueOf()})`);\n    }\n    if (arg instanceof FluentNumber) {\n        return new FluentNumber(arg.valueOf(), {\n            ...arg.opts,\n            ...values(opts, NUMBER_ALLOWED),\n        });\n    }\n    if (arg instanceof FluentDateTime) {\n        return new FluentNumber(arg.toNumber(), {\n            ...values(opts, NUMBER_ALLOWED),\n        });\n    }\n    throw new TypeError(\"Invalid argument to NUMBER\");\n}\nconst DATETIME_ALLOWED = [\n    \"dateStyle\",\n    \"timeStyle\",\n    \"fractionalSecondDigits\",\n    \"dayPeriod\",\n    \"hour12\",\n    \"weekday\",\n    \"era\",\n    \"year\",\n    \"month\",\n    \"day\",\n    \"hour\",\n    \"minute\",\n    \"second\",\n    \"timeZoneName\",\n];\n/**\n * The implementation of the `DATETIME()` builtin available to translations.\n *\n * Translations may call the `DATETIME()` builtin in order to specify\n * formatting options of a number. For example:\n *\n *     now = It's {DATETIME($today, month: \"long\")}.\n *\n * The implementation expects an array of {@link FluentValue | FluentValues} representing the\n * positional arguments, and an object of named {@link FluentValue | FluentValues} representing the\n * named parameters.\n *\n * The following options are recognized:\n *\n *     dateStyle\n *     timeStyle\n *     fractionalSecondDigits\n *     dayPeriod\n *     hour12\n *     weekday\n *     era\n *     year\n *     month\n *     day\n *     hour\n *     minute\n *     second\n *     timeZoneName\n *\n * Other options are ignored.\n *\n * @param args The positional arguments passed to this `DATETIME()`.\n * @param opts The named argments passed to this `DATETIME()`.\n */\nexport function DATETIME(args, opts) {\n    let arg = args[0];\n    if (arg instanceof FluentNone) {\n        return new FluentNone(`DATETIME(${arg.valueOf()})`);\n    }\n    if (arg instanceof FluentDateTime || arg instanceof FluentNumber) {\n        return new FluentDateTime(arg, values(opts, DATETIME_ALLOWED));\n    }\n    throw new TypeError(\"Invalid argument to DATETIME\");\n}\n","const cache = new Map();\nexport function getMemoizerForLocale(locales) {\n    const stringLocale = Array.isArray(locales) ? locales.join(\" \") : locales;\n    let memoizer = cache.get(stringLocale);\n    if (memoizer === undefined) {\n        memoizer = new Map();\n        cache.set(stringLocale, memoizer);\n    }\n    return memoizer;\n}\n","import { resolveComplexPattern } from \"./resolver.js\";\nimport { Scope } from \"./scope.js\";\nimport { FluentNone } from \"./types.js\";\nimport { NUMBER, DATETIME } from \"./builtins.js\";\nimport { getMemoizerForLocale } from \"./memoizer.js\";\n/**\n * Message bundles are single-language stores of translation resources. They are\n * responsible for formatting message values and attributes to strings.\n */\nexport class FluentBundle {\n    /**\n     * Create an instance of `FluentBundle`.\n     *\n     * @example\n     * ```js\n     * let bundle = new FluentBundle([\"en-US\", \"en\"]);\n     *\n     * let bundle = new FluentBundle(locales, {useIsolating: false});\n     *\n     * let bundle = new FluentBundle(locales, {\n     *   useIsolating: true,\n     *   functions: {\n     *     NODE_ENV: () => process.env.NODE_ENV\n     *   }\n     * });\n     * ```\n     *\n     * @param locales - Used to instantiate `Intl` formatters used by translations.\n     * @param options - Optional configuration for the bundle.\n     */\n    constructor(locales, { functions, useIsolating = true, transform = (v) => v, } = {}) {\n        /** @ignore */\n        this._terms = new Map();\n        /** @ignore */\n        this._messages = new Map();\n        this.locales = Array.isArray(locales) ? locales : [locales];\n        this._functions = {\n            NUMBER,\n            DATETIME,\n            ...functions,\n        };\n        this._useIsolating = useIsolating;\n        this._transform = transform;\n        this._intls = getMemoizerForLocale(locales);\n    }\n    /**\n     * Check if a message is present in the bundle.\n     *\n     * @param id - The identifier of the message to check.\n     */\n    hasMessage(id) {\n        return this._messages.has(id);\n    }\n    /**\n     * Return a raw unformatted message object from the bundle.\n     *\n     * Raw messages are `{value, attributes}` shapes containing translation units\n     * called `Patterns`. `Patterns` are implementation-specific; they should be\n     * treated as black boxes and formatted with `FluentBundle.formatPattern`.\n     *\n     * @param id - The identifier of the message to check.\n     */\n    getMessage(id) {\n        return this._messages.get(id);\n    }\n    /**\n     * Add a translation resource to the bundle.\n     *\n     * @example\n     * ```js\n     * let res = new FluentResource(\"foo = Foo\");\n     * bundle.addResource(res);\n     * bundle.getMessage(\"foo\");\n     * // → {value: .., attributes: {..}}\n     * ```\n     *\n     * @param res\n     * @param options\n     */\n    addResource(res, { allowOverrides = false, } = {}) {\n        const errors = [];\n        for (let i = 0; i < res.body.length; i++) {\n            let entry = res.body[i];\n            if (entry.id.startsWith(\"-\")) {\n                // Identifiers starting with a dash (-) define terms. Terms are private\n                // and cannot be retrieved from FluentBundle.\n                if (allowOverrides === false && this._terms.has(entry.id)) {\n                    errors.push(new Error(`Attempt to override an existing term: \"${entry.id}\"`));\n                    continue;\n                }\n                this._terms.set(entry.id, entry);\n            }\n            else {\n                if (allowOverrides === false && this._messages.has(entry.id)) {\n                    errors.push(new Error(`Attempt to override an existing message: \"${entry.id}\"`));\n                    continue;\n                }\n                this._messages.set(entry.id, entry);\n            }\n        }\n        return errors;\n    }\n    /**\n     * Format a `Pattern` to a string.\n     *\n     * Format a raw `Pattern` into a string. `args` will be used to resolve\n     * references to variables passed as arguments to the translation.\n     *\n     * In case of errors `formatPattern` will try to salvage as much of the\n     * translation as possible and will still return a string. For performance\n     * reasons, the encountered errors are not returned but instead are appended\n     * to the `errors` array passed as the third argument.\n     *\n     * If `errors` is omitted, the first encountered error will be thrown.\n     *\n     * @example\n     * ```js\n     * let errors = [];\n     * bundle.addResource(\n     *     new FluentResource(\"hello = Hello, {$name}!\"));\n     *\n     * let hello = bundle.getMessage(\"hello\");\n     * if (hello.value) {\n     *     bundle.formatPattern(hello.value, {name: \"Jane\"}, errors);\n     *     // Returns \"Hello, Jane!\" and `errors` is empty.\n     *\n     *     bundle.formatPattern(hello.value, undefined, errors);\n     *     // Returns \"Hello, {$name}!\" and `errors` is now:\n     *     // [<ReferenceError: Unknown variable: name>]\n     * }\n     * ```\n     */\n    formatPattern(pattern, args = null, errors = null) {\n        // Resolve a simple pattern without creating a scope. No error handling is\n        // required; by definition simple patterns don't have placeables.\n        if (typeof pattern === \"string\") {\n            return this._transform(pattern);\n        }\n        // Resolve a complex pattern.\n        let scope = new Scope(this, errors, args);\n        try {\n            let value = resolveComplexPattern(scope, pattern);\n            return value.toString(scope);\n        }\n        catch (err) {\n            if (scope.errors && err instanceof Error) {\n                scope.errors.push(err);\n                return new FluentNone().toString(scope);\n            }\n            throw err;\n        }\n    }\n}\n","// This regex is used to iterate through the beginnings of messages and terms.\n// With the /m flag, the ^ matches at the beginning of every line.\nconst RE_MESSAGE_START = /^(-?[a-zA-Z][\\w-]*) *= */gm;\n// Both Attributes and Variants are parsed in while loops. These regexes are\n// used to break out of them.\nconst RE_ATTRIBUTE_START = /\\.([a-zA-Z][\\w-]*) *= */y;\nconst RE_VARIANT_START = /\\*?\\[/y;\nconst RE_NUMBER_LITERAL = /(-?[0-9]+(?:\\.([0-9]+))?)/y;\nconst RE_IDENTIFIER = /([a-zA-Z][\\w-]*)/y;\nconst RE_REFERENCE = /([$-])?([a-zA-Z][\\w-]*)(?:\\.([a-zA-Z][\\w-]*))?/y;\nconst RE_FUNCTION_NAME = /^[A-Z][A-Z0-9_-]*$/;\n// A \"run\" is a sequence of text or string literal characters which don't\n// require any special handling. For TextElements such special characters are: {\n// (starts a placeable), and line breaks which require additional logic to check\n// if the next line is indented. For StringLiterals they are: \\ (starts an\n// escape sequence), \" (ends the literal), and line breaks which are not allowed\n// in StringLiterals. Note that string runs may be empty; text runs may not.\nconst RE_TEXT_RUN = /([^{}\\n\\r]+)/y;\nconst RE_STRING_RUN = /([^\\\\\"\\n\\r]*)/y;\n// Escape sequences.\nconst RE_STRING_ESCAPE = /\\\\([\\\\\"])/y;\nconst RE_UNICODE_ESCAPE = /\\\\u([a-fA-F0-9]{4})|\\\\U([a-fA-F0-9]{6})/y;\n// Used for trimming TextElements and indents.\nconst RE_LEADING_NEWLINES = /^\\n+/;\nconst RE_TRAILING_SPACES = / +$/;\n// Used in makeIndent to strip spaces from blank lines and normalize CRLF to LF.\nconst RE_BLANK_LINES = / *\\r?\\n/g;\n// Used in makeIndent to measure the indentation.\nconst RE_INDENT = /( *)$/;\n// Common tokens.\nconst TOKEN_BRACE_OPEN = /{\\s*/y;\nconst TOKEN_BRACE_CLOSE = /\\s*}/y;\nconst TOKEN_BRACKET_OPEN = /\\[\\s*/y;\nconst TOKEN_BRACKET_CLOSE = /\\s*] */y;\nconst TOKEN_PAREN_OPEN = /\\s*\\(\\s*/y;\nconst TOKEN_ARROW = /\\s*->\\s*/y;\nconst TOKEN_COLON = /\\s*:\\s*/y;\n// Note the optional comma. As a deviation from the Fluent EBNF, the parser\n// doesn't enforce commas between call arguments.\nconst TOKEN_COMMA = /\\s*,?\\s*/y;\nconst TOKEN_BLANK = /\\s+/y;\n/**\n * Fluent Resource is a structure storing parsed localization entries.\n */\nexport class FluentResource {\n    constructor(source) {\n        this.body = [];\n        RE_MESSAGE_START.lastIndex = 0;\n        let cursor = 0;\n        // Iterate over the beginnings of messages and terms to efficiently skip\n        // comments and recover from errors.\n        while (true) {\n            let next = RE_MESSAGE_START.exec(source);\n            if (next === null) {\n                break;\n            }\n            cursor = RE_MESSAGE_START.lastIndex;\n            try {\n                this.body.push(parseMessage(next[1]));\n            }\n            catch (err) {\n                if (err instanceof SyntaxError) {\n                    // Don't report any Fluent syntax errors. Skip directly to the\n                    // beginning of the next message or term.\n                    continue;\n                }\n                throw err;\n            }\n        }\n        // The parser implementation is inlined below for performance reasons,\n        // as well as for convenience of accessing `source` and `cursor`.\n        // The parser focuses on minimizing the number of false negatives at the\n        // expense of increasing the risk of false positives. In other words, it\n        // aims at parsing valid Fluent messages with a success rate of 100%, but it\n        // may also parse a few invalid messages which the reference parser would\n        // reject. The parser doesn't perform any validation and may produce entries\n        // which wouldn't make sense in the real world. For best results users are\n        // advised to validate translations with the fluent-syntax parser\n        // pre-runtime.\n        // The parser makes an extensive use of sticky regexes which can be anchored\n        // to any offset of the source string without slicing it. Errors are thrown\n        // to bail out of parsing of ill-formed messages.\n        function test(re) {\n            re.lastIndex = cursor;\n            return re.test(source);\n        }\n        // Advance the cursor by the char if it matches. May be used as a predicate\n        // (was the match found?) or, if errorClass is passed, as an assertion.\n        function consumeChar(char, errorClass) {\n            if (source[cursor] === char) {\n                cursor++;\n                return true;\n            }\n            if (errorClass) {\n                throw new errorClass(`Expected ${char}`);\n            }\n            return false;\n        }\n        // Advance the cursor by the token if it matches. May be used as a predicate\n        // (was the match found?) or, if errorClass is passed, as an assertion.\n        function consumeToken(re, errorClass) {\n            if (test(re)) {\n                cursor = re.lastIndex;\n                return true;\n            }\n            if (errorClass) {\n                throw new errorClass(`Expected ${re.toString()}`);\n            }\n            return false;\n        }\n        // Execute a regex, advance the cursor, and return all capture groups.\n        function match(re) {\n            re.lastIndex = cursor;\n            let result = re.exec(source);\n            if (result === null) {\n                throw new SyntaxError(`Expected ${re.toString()}`);\n            }\n            cursor = re.lastIndex;\n            return result;\n        }\n        // Execute a regex, advance the cursor, and return the capture group.\n        function match1(re) {\n            return match(re)[1];\n        }\n        function parseMessage(id) {\n            let value = parsePattern();\n            let attributes = parseAttributes();\n            if (value === null && Object.keys(attributes).length === 0) {\n                throw new SyntaxError(\"Expected message value or attributes\");\n            }\n            return { id, value, attributes };\n        }\n        function parseAttributes() {\n            let attrs = Object.create(null);\n            while (test(RE_ATTRIBUTE_START)) {\n                let name = match1(RE_ATTRIBUTE_START);\n                let value = parsePattern();\n                if (value === null) {\n                    throw new SyntaxError(\"Expected attribute value\");\n                }\n                attrs[name] = value;\n            }\n            return attrs;\n        }\n        function parsePattern() {\n            let first;\n            // First try to parse any simple text on the same line as the id.\n            if (test(RE_TEXT_RUN)) {\n                first = match1(RE_TEXT_RUN);\n            }\n            // If there's a placeable on the first line, parse a complex pattern.\n            if (source[cursor] === \"{\" || source[cursor] === \"}\") {\n                // Re-use the text parsed above, if possible.\n                return parsePatternElements(first ? [first] : [], Infinity);\n            }\n            // RE_TEXT_VALUE stops at newlines. Only continue parsing the pattern if\n            // what comes after the newline is indented.\n            let indent = parseIndent();\n            if (indent) {\n                if (first) {\n                    // If there's text on the first line, the blank block is part of the\n                    // translation content in its entirety.\n                    return parsePatternElements([first, indent], indent.length);\n                }\n                // Otherwise, we're dealing with a block pattern, i.e. a pattern which\n                // starts on a new line. Discrad the leading newlines but keep the\n                // inline indent; it will be used by the dedentation logic.\n                indent.value = trim(indent.value, RE_LEADING_NEWLINES);\n                return parsePatternElements([indent], indent.length);\n            }\n            if (first) {\n                // It was just a simple inline text after all.\n                return trim(first, RE_TRAILING_SPACES);\n            }\n            return null;\n        }\n        // Parse a complex pattern as an array of elements.\n        function parsePatternElements(elements = [], commonIndent) {\n            while (true) {\n                if (test(RE_TEXT_RUN)) {\n                    elements.push(match1(RE_TEXT_RUN));\n                    continue;\n                }\n                if (source[cursor] === \"{\") {\n                    elements.push(parsePlaceable());\n                    continue;\n                }\n                if (source[cursor] === \"}\") {\n                    throw new SyntaxError(\"Unbalanced closing brace\");\n                }\n                let indent = parseIndent();\n                if (indent) {\n                    elements.push(indent);\n                    commonIndent = Math.min(commonIndent, indent.length);\n                    continue;\n                }\n                break;\n            }\n            let lastIndex = elements.length - 1;\n            let lastElement = elements[lastIndex];\n            // Trim the trailing spaces in the last element if it's a TextElement.\n            if (typeof lastElement === \"string\") {\n                elements[lastIndex] = trim(lastElement, RE_TRAILING_SPACES);\n            }\n            let baked = [];\n            for (let element of elements) {\n                if (element instanceof Indent) {\n                    // Dedent indented lines by the maximum common indent.\n                    element = element.value.slice(0, element.value.length - commonIndent);\n                }\n                if (element) {\n                    baked.push(element);\n                }\n            }\n            return baked;\n        }\n        function parsePlaceable() {\n            consumeToken(TOKEN_BRACE_OPEN, SyntaxError);\n            let selector = parseInlineExpression();\n            if (consumeToken(TOKEN_BRACE_CLOSE)) {\n                return selector;\n            }\n            if (consumeToken(TOKEN_ARROW)) {\n                let variants = parseVariants();\n                consumeToken(TOKEN_BRACE_CLOSE, SyntaxError);\n                return {\n                    type: \"select\",\n                    selector,\n                    ...variants,\n                };\n            }\n            throw new SyntaxError(\"Unclosed placeable\");\n        }\n        function parseInlineExpression() {\n            if (source[cursor] === \"{\") {\n                // It's a nested placeable.\n                return parsePlaceable();\n            }\n            if (test(RE_REFERENCE)) {\n                let [, sigil, name, attr = null] = match(RE_REFERENCE);\n                if (sigil === \"$\") {\n                    return { type: \"var\", name };\n                }\n                if (consumeToken(TOKEN_PAREN_OPEN)) {\n                    let args = parseArguments();\n                    if (sigil === \"-\") {\n                        // A parameterized term: -term(...).\n                        return { type: \"term\", name, attr, args };\n                    }\n                    if (RE_FUNCTION_NAME.test(name)) {\n                        return { type: \"func\", name, args };\n                    }\n                    throw new SyntaxError(\"Function names must be all upper-case\");\n                }\n                if (sigil === \"-\") {\n                    // A non-parameterized term: -term.\n                    return {\n                        type: \"term\",\n                        name,\n                        attr,\n                        args: [],\n                    };\n                }\n                return { type: \"mesg\", name, attr };\n            }\n            return parseLiteral();\n        }\n        function parseArguments() {\n            let args = [];\n            while (true) {\n                switch (source[cursor]) {\n                    case \")\": // End of the argument list.\n                        cursor++;\n                        return args;\n                    case undefined: // EOF\n                        throw new SyntaxError(\"Unclosed argument list\");\n                }\n                args.push(parseArgument());\n                // Commas between arguments are treated as whitespace.\n                consumeToken(TOKEN_COMMA);\n            }\n        }\n        function parseArgument() {\n            let expr = parseInlineExpression();\n            if (expr.type !== \"mesg\") {\n                return expr;\n            }\n            if (consumeToken(TOKEN_COLON)) {\n                // The reference is the beginning of a named argument.\n                return {\n                    type: \"narg\",\n                    name: expr.name,\n                    value: parseLiteral(),\n                };\n            }\n            // It's a regular message reference.\n            return expr;\n        }\n        function parseVariants() {\n            let variants = [];\n            let count = 0;\n            let star;\n            while (test(RE_VARIANT_START)) {\n                if (consumeChar(\"*\")) {\n                    star = count;\n                }\n                let key = parseVariantKey();\n                let value = parsePattern();\n                if (value === null) {\n                    throw new SyntaxError(\"Expected variant value\");\n                }\n                variants[count++] = { key, value };\n            }\n            if (count === 0) {\n                return null;\n            }\n            if (star === undefined) {\n                throw new SyntaxError(\"Expected default variant\");\n            }\n            return { variants, star };\n        }\n        function parseVariantKey() {\n            consumeToken(TOKEN_BRACKET_OPEN, SyntaxError);\n            let key;\n            if (test(RE_NUMBER_LITERAL)) {\n                key = parseNumberLiteral();\n            }\n            else {\n                key = {\n                    type: \"str\",\n                    value: match1(RE_IDENTIFIER),\n                };\n            }\n            consumeToken(TOKEN_BRACKET_CLOSE, SyntaxError);\n            return key;\n        }\n        function parseLiteral() {\n            if (test(RE_NUMBER_LITERAL)) {\n                return parseNumberLiteral();\n            }\n            if (source[cursor] === '\"') {\n                return parseStringLiteral();\n            }\n            throw new SyntaxError(\"Invalid expression\");\n        }\n        function parseNumberLiteral() {\n            let [, value, fraction = \"\"] = match(RE_NUMBER_LITERAL);\n            let precision = fraction.length;\n            return {\n                type: \"num\",\n                value: parseFloat(value),\n                precision,\n            };\n        }\n        function parseStringLiteral() {\n            consumeChar('\"', SyntaxError);\n            let value = \"\";\n            while (true) {\n                value += match1(RE_STRING_RUN);\n                if (source[cursor] === \"\\\\\") {\n                    value += parseEscapeSequence();\n                    continue;\n                }\n                if (consumeChar('\"')) {\n                    return { type: \"str\", value };\n                }\n                // We've reached an EOL of EOF.\n                throw new SyntaxError(\"Unclosed string literal\");\n            }\n        }\n        // Unescape known escape sequences.\n        function parseEscapeSequence() {\n            if (test(RE_STRING_ESCAPE)) {\n                return match1(RE_STRING_ESCAPE);\n            }\n            if (test(RE_UNICODE_ESCAPE)) {\n                let [, codepoint4, codepoint6] = match(RE_UNICODE_ESCAPE);\n                let codepoint = parseInt(codepoint4 || codepoint6, 16);\n                return codepoint <= 0xd7ff || 0xe000 <= codepoint\n                    ? // It's a Unicode scalar value.\n                        String.fromCodePoint(codepoint)\n                    : // Lonely surrogates can cause trouble when the parsing result is\n                        // saved using UTF-8. Use U+FFFD REPLACEMENT CHARACTER instead.\n                        \"�\";\n            }\n            throw new SyntaxError(\"Unknown escape sequence\");\n        }\n        // Parse blank space. Return it if it looks like indent before a pattern\n        // line. Skip it othwerwise.\n        function parseIndent() {\n            let start = cursor;\n            consumeToken(TOKEN_BLANK);\n            // Check the first non-blank character after the indent.\n            switch (source[cursor]) {\n                case \".\":\n                case \"[\":\n                case \"*\":\n                case \"}\":\n                case undefined: // EOF\n                    // A special character. End the Pattern.\n                    return false;\n                case \"{\":\n                    // Placeables don't require indentation (in EBNF: block-placeable).\n                    // Continue the Pattern.\n                    return makeIndent(source.slice(start, cursor));\n            }\n            // If the first character on the line is not one of the special characters\n            // listed above, it's a regular text character. Check if there's at least\n            // one space of indent before it.\n            if (source[cursor - 1] === \" \") {\n                // It's an indented text character (in EBNF: indented-char). Continue\n                // the Pattern.\n                return makeIndent(source.slice(start, cursor));\n            }\n            // A not-indented text character is likely the identifier of the next\n            // message. End the Pattern.\n            return false;\n        }\n        // Trim blanks in text according to the given regex.\n        function trim(text, re) {\n            return text.replace(re, \"\");\n        }\n        // Normalize a blank block and extract the indent details.\n        function makeIndent(blank) {\n            let value = blank.replace(RE_BLANK_LINES, \"\\n\");\n            let length = RE_INDENT.exec(blank)[1].length;\n            return new Indent(value, length);\n        }\n    }\n}\nclass Indent {\n    constructor(value, length) {\n        this.value = value;\n        this.length = length;\n    }\n}\n","import{_$LH as e,noChange as t}from\"./lit-html.js\";\n/**\n * @license\n * Copyright 2019 Google LLC\n * SPDX-License-Identifier: BSD-3-Clause\n */\nlet r=null;const i={boundAttributeSuffix:e.M,marker:e.P,markerMatch:e.A,HTML_RESULT:e.C,getTemplateHtml:e.L,overrideDirectiveResolve:(e,t)=>class extends e{_$AS(e,r){return t(this,r)}},patchDirectiveResolve:(e,t)=>{if(e.prototype._$AS!==t){r??=e.prototype._$AS.name;for(let i=e.prototype;i!==Object.prototype;i=Object.getPrototypeOf(i))if(i.hasOwnProperty(r))return void(i[r]=t);throw Error(\"Internal error: It is possible that both dev mode and production mode Lit was mixed together during SSR. Please comment on the issue: https://github.com/lit/lit/issues/4527\")}},setDirectiveClass(e,t){e._$litDirective$=t},getAttributePartCommittedValue:(e,r,i)=>{let o=t;return e.j=e=>o=e,e._$AI(r,e,i),o},connectedDisconnectable:e=>({...e,_$AU:!0}),resolveDirective:e.V,AttributePart:e.H,PropertyPart:e.B,BooleanAttributePart:e.N,EventPart:e.U,ElementPart:e.F,TemplateInstance:e.R,isIterable:e.D,ChildPart:e.I};export{i as _$LH};\n//# sourceMappingURL=private-ssr-support.js.map\n","import{noChange as e}from\"lit-html\";import{_$LH as t}from\"lit-html/private-ssr-support.js\";import{PartType as r}from\"lit-html/directive.js\";import{isPrimitive as n,isTemplateResult as o,isCompiledTemplateResult as i,isSingleExpression as a}from\"lit-html/directive-helpers.js\";\n/**\n * @license\n * Copyright 2019 Google LLC\n * SPDX-License-Identifier: BSD-3-Clause\n */const{TemplateInstance:l,isIterable:s,resolveDirective:d,ChildPart:c,ElementPart:p}=t,f=(e,t,r={})=>{if(void 0!==t._$litPart$)throw Error(\"container already contains a live render\");let n,o,i;const a=[],l=document.createTreeWalker(t,NodeFilter.SHOW_COMMENT);let s;for(;null!==(s=l.nextNode());){const t=s.data;if(t.startsWith(\"lit-part\")){if(0===a.length&&void 0!==n)throw Error(`There must be only one root part per container. Found a part marker (${s}) when we already have a root part marker (${o})`);i=m(e,s,a,r),void 0===n&&(n=i),o??=s}else if(t.startsWith(\"lit-node\"))u(s,a,r);else if(t.startsWith(\"/lit-part\")){if(1===a.length&&i!==n)throw Error(\"internal error\");i=h(s,i,a)}}if(void 0===n){const e=t instanceof ShadowRoot?\"{container.host.localName}'s shadow root\":t instanceof DocumentFragment?\"DocumentFragment\":t.localName;console.error(`There should be exactly one root part in a render container, but we didn't find any in ${e}.`)}t._$litPart$=n},m=(t,r,a,p)=>{let f,m;if(0===a.length)m=new c(r,null,void 0,p),f=t;else{const e=a[a.length-1];if(\"template-instance\"===e.type)m=new c(r,null,e.instance,p),e.instance._$AV.push(m),f=e.result.values[e.instancePartIndex++],e.templatePartIndex++;else if(\"iterable\"===e.type){m=new c(r,null,e.part,p);const t=e.iterator.next();if(t.done)throw f=void 0,e.done=!0,Error(\"Unhandled shorter than expected iterable\");f=t.value,e.part._$AH.push(m)}else m=new c(r,null,e.part,p)}if(f=d(m,f),f===e)a.push({part:m,type:\"leaf\"});else if(n(f))a.push({part:m,type:\"leaf\"}),m._$AH=f;else if(o(f)){if(i(f))throw Error(\"compiled templates are not supported\");const e=\"lit-part \"+w(f);if(r.data!==e)throw Error(\"Hydration value mismatch: Unexpected TemplateResult rendered to part\");{const e=c.prototype._$AC(f),t=new l(e,m);a.push({type:\"template-instance\",instance:t,part:m,templatePartIndex:0,instancePartIndex:0,result:f}),m._$AH=t}}else s(f)?(a.push({part:m,type:\"iterable\",value:f,iterator:f[Symbol.iterator](),done:!1}),m._$AH=[]):(a.push({part:m,type:\"leaf\"}),m._$AH=f??\"\");return m},h=(e,t,r)=>{if(void 0===t)throw Error(\"unbalanced part marker\");t._$AB=e;const n=r.pop();if(\"iterable\"===n.type&&!n.iterator.next().done)throw Error(\"unexpected longer than expected iterable\");if(r.length>0)return r[r.length-1].part},u=(e,t,n)=>{const o=/lit-node (\\d+)/.exec(e.data),i=parseInt(o[1]),l=e.nextElementSibling;if(null===l)throw Error(\"could not find node for attribute parts\");l.removeAttribute(\"defer-hydration\");const s=t[t.length-1];if(\"template-instance\"!==s.type)throw Error(\"Hydration value mismatch: Primitive found where TemplateResult expected. This usually occurs due to conditional rendering that resulted in a different value or template being rendered between the server and client.\");{const e=s.instance;for(;;){const t=e._$AD.parts[s.templatePartIndex];if(void 0===t||t.type!==r.ATTRIBUTE&&t.type!==r.ELEMENT||t.index!==i)break;if(t.type===r.ATTRIBUTE){const o=new t.ctor(l,t.name,t.strings,s.instance,n),i=a(o)?s.result.values[s.instancePartIndex]:s.result.values,d=!(o.type===r.EVENT||o.type===r.PROPERTY);o._$AI(i,o,s.instancePartIndex,d),s.instancePartIndex+=t.strings.length-1,e._$AV.push(o)}else{const t=new p(l,s.instance,n);d(t,s.result.values[s.instancePartIndex++]),e._$AV.push(t)}s.templatePartIndex++}}},w=e=>{const t=new Uint32Array(2).fill(5381);for(const r of e.strings)for(let e=0;e<r.length;e++)t[e%2]=33*t[e%2]^r.charCodeAt(e);const r=String.fromCharCode(...new Uint8Array(t.buffer));return btoa(r)};export{w as digestForTemplateResult,f as hydrate};\n//# sourceMappingURL=hydrate-lit-html.js.map\n","import{render as t}from\"lit-html\";import{hydrate as i}from\"./lib/hydrate-lit-html.js\";globalThis.litElementHydrateSupport=({LitElement:s})=>{const h=Object.getOwnPropertyDescriptor(Object.getPrototypeOf(s),\"observedAttributes\").get;Object.defineProperty(s,\"observedAttributes\",{get(){return[...h.call(this),\"defer-hydration\"]}});const e=s.prototype.attributeChangedCallback;s.prototype.attributeChangedCallback=function(t,i,s){\"defer-hydration\"===t&&null===s&&n.call(this),e.call(this,t,i,s)};const n=s.prototype.connectedCallback;s.prototype.connectedCallback=function(){this.hasAttribute(\"defer-hydration\")||n.call(this)};const o=s.prototype.createRenderRoot;s.prototype.createRenderRoot=function(){return this.shadowRoot?(this._$AG=!0,this.shadowRoot):o.call(this)};const r=Object.getPrototypeOf(s.prototype).update;s.prototype.update=function(s){const h=this.render();if(r.call(this,s),this._$AG){this._$AG=!1;for(let t=0;t<this.attributes.length;t++){const i=this.attributes[t];if(i.name.startsWith(\"hydrate-internals-\")){const t=i.name.slice(18);this.removeAttribute(t),this.removeAttribute(i.name)}}i(h,this.renderRoot,this.renderOptions)}else t(h,this.renderRoot,this.renderOptions)}};\n//# sourceMappingURL=lit-element-hydrate-support.js.map\n","/**\n * @license\n * Copyright 2019 Google LLC\n * SPDX-License-Identifier: BSD-3-Clause\n */\nconst t=globalThis,e=t.ShadowRoot&&(void 0===t.ShadyCSS||t.ShadyCSS.nativeShadow)&&\"adoptedStyleSheets\"in Document.prototype&&\"replace\"in CSSStyleSheet.prototype,s=Symbol(),o=new WeakMap;class n{constructor(t,e,o){if(this._$cssResult$=!0,o!==s)throw Error(\"CSSResult is not constructable. Use `unsafeCSS` or `css` instead.\");this.cssText=t,this.t=e}get styleSheet(){let t=this.o;const s=this.t;if(e&&void 0===t){const e=void 0!==s&&1===s.length;e&&(t=o.get(s)),void 0===t&&((this.o=t=new CSSStyleSheet).replaceSync(this.cssText),e&&o.set(s,t))}return t}toString(){return this.cssText}}const r=t=>new n(\"string\"==typeof t?t:t+\"\",void 0,s),i=(t,...e)=>{const o=1===t.length?t[0]:e.reduce(((e,s,o)=>e+(t=>{if(!0===t._$cssResult$)return t.cssText;if(\"number\"==typeof t)return t;throw Error(\"Value passed to 'css' function must be a 'css' function result: \"+t+\". Use 'unsafeCSS' to pass non-literal values, but take care to ensure page security.\")})(s)+t[o+1]),t[0]);return new n(o,t,s)},S=(s,o)=>{if(e)s.adoptedStyleSheets=o.map((t=>t instanceof CSSStyleSheet?t:t.styleSheet));else for(const e of o){const o=document.createElement(\"style\"),n=t.litNonce;void 0!==n&&o.setAttribute(\"nonce\",n),o.textContent=e.cssText,s.appendChild(o)}},c=e?t=>t:t=>t instanceof CSSStyleSheet?(t=>{let e=\"\";for(const s of t.cssRules)e+=s.cssText;return r(e)})(t):t;export{n as CSSResult,S as adoptStyles,i as css,c as getCompatibleStyle,e as supportsAdoptingStyleSheets,r as unsafeCSS};\n//# sourceMappingURL=css-tag.js.map\n","import{getCompatibleStyle as t,adoptStyles as s}from\"./css-tag.js\";export{CSSResult,css,supportsAdoptingStyleSheets,unsafeCSS}from\"./css-tag.js\";\n/**\n * @license\n * Copyright 2017 Google LLC\n * SPDX-License-Identifier: BSD-3-Clause\n */const{is:i,defineProperty:e,getOwnPropertyDescriptor:h,getOwnPropertyNames:r,getOwnPropertySymbols:o,getPrototypeOf:n}=Object,a=globalThis,c=a.trustedTypes,l=c?c.emptyScript:\"\",p=a.reactiveElementPolyfillSupport,d=(t,s)=>t,u={toAttribute(t,s){switch(s){case Boolean:t=t?l:null;break;case Object:case Array:t=null==t?t:JSON.stringify(t)}return t},fromAttribute(t,s){let i=t;switch(s){case Boolean:i=null!==t;break;case Number:i=null===t?null:Number(t);break;case Object:case Array:try{i=JSON.parse(t)}catch(t){i=null}}return i}},f=(t,s)=>!i(t,s),b={attribute:!0,type:String,converter:u,reflect:!1,useDefault:!1,hasChanged:f};Symbol.metadata??=Symbol(\"metadata\"),a.litPropertyMetadata??=new WeakMap;class y extends HTMLElement{static addInitializer(t){this._$Ei(),(this.l??=[]).push(t)}static get observedAttributes(){return this.finalize(),this._$Eh&&[...this._$Eh.keys()]}static createProperty(t,s=b){if(s.state&&(s.attribute=!1),this._$Ei(),this.prototype.hasOwnProperty(t)&&((s=Object.create(s)).wrapped=!0),this.elementProperties.set(t,s),!s.noAccessor){const i=Symbol(),h=this.getPropertyDescriptor(t,i,s);void 0!==h&&e(this.prototype,t,h)}}static getPropertyDescriptor(t,s,i){const{get:e,set:r}=h(this.prototype,t)??{get(){return this[s]},set(t){this[s]=t}};return{get:e,set(s){const h=e?.call(this);r?.call(this,s),this.requestUpdate(t,h,i)},configurable:!0,enumerable:!0}}static getPropertyOptions(t){return this.elementProperties.get(t)??b}static _$Ei(){if(this.hasOwnProperty(d(\"elementProperties\")))return;const t=n(this);t.finalize(),void 0!==t.l&&(this.l=[...t.l]),this.elementProperties=new Map(t.elementProperties)}static finalize(){if(this.hasOwnProperty(d(\"finalized\")))return;if(this.finalized=!0,this._$Ei(),this.hasOwnProperty(d(\"properties\"))){const t=this.properties,s=[...r(t),...o(t)];for(const i of s)this.createProperty(i,t[i])}const t=this[Symbol.metadata];if(null!==t){const s=litPropertyMetadata.get(t);if(void 0!==s)for(const[t,i]of s)this.elementProperties.set(t,i)}this._$Eh=new Map;for(const[t,s]of this.elementProperties){const i=this._$Eu(t,s);void 0!==i&&this._$Eh.set(i,t)}this.elementStyles=this.finalizeStyles(this.styles)}static finalizeStyles(s){const i=[];if(Array.isArray(s)){const e=new Set(s.flat(1/0).reverse());for(const s of e)i.unshift(t(s))}else void 0!==s&&i.push(t(s));return i}static _$Eu(t,s){const i=s.attribute;return!1===i?void 0:\"string\"==typeof i?i:\"string\"==typeof t?t.toLowerCase():void 0}constructor(){super(),this._$Ep=void 0,this.isUpdatePending=!1,this.hasUpdated=!1,this._$Em=null,this._$Ev()}_$Ev(){this._$ES=new Promise((t=>this.enableUpdating=t)),this._$AL=new Map,this._$E_(),this.requestUpdate(),this.constructor.l?.forEach((t=>t(this)))}addController(t){(this._$EO??=new Set).add(t),void 0!==this.renderRoot&&this.isConnected&&t.hostConnected?.()}removeController(t){this._$EO?.delete(t)}_$E_(){const t=new Map,s=this.constructor.elementProperties;for(const i of s.keys())this.hasOwnProperty(i)&&(t.set(i,this[i]),delete this[i]);t.size>0&&(this._$Ep=t)}createRenderRoot(){const t=this.shadowRoot??this.attachShadow(this.constructor.shadowRootOptions);return s(t,this.constructor.elementStyles),t}connectedCallback(){this.renderRoot??=this.createRenderRoot(),this.enableUpdating(!0),this._$EO?.forEach((t=>t.hostConnected?.()))}enableUpdating(t){}disconnectedCallback(){this._$EO?.forEach((t=>t.hostDisconnected?.()))}attributeChangedCallback(t,s,i){this._$AK(t,i)}_$ET(t,s){const i=this.constructor.elementProperties.get(t),e=this.constructor._$Eu(t,i);if(void 0!==e&&!0===i.reflect){const h=(void 0!==i.converter?.toAttribute?i.converter:u).toAttribute(s,i.type);this._$Em=t,null==h?this.removeAttribute(e):this.setAttribute(e,h),this._$Em=null}}_$AK(t,s){const i=this.constructor,e=i._$Eh.get(t);if(void 0!==e&&this._$Em!==e){const t=i.getPropertyOptions(e),h=\"function\"==typeof t.converter?{fromAttribute:t.converter}:void 0!==t.converter?.fromAttribute?t.converter:u;this._$Em=e,this[e]=h.fromAttribute(s,t.type)??this._$Ej?.get(e)??null,this._$Em=null}}requestUpdate(t,s,i){if(void 0!==t){const e=this.constructor,h=this[t];if(i??=e.getPropertyOptions(t),!((i.hasChanged??f)(h,s)||i.useDefault&&i.reflect&&h===this._$Ej?.get(t)&&!this.hasAttribute(e._$Eu(t,i))))return;this.C(t,s,i)}!1===this.isUpdatePending&&(this._$ES=this._$EP())}C(t,s,{useDefault:i,reflect:e,wrapped:h},r){i&&!(this._$Ej??=new Map).has(t)&&(this._$Ej.set(t,r??s??this[t]),!0!==h||void 0!==r)||(this._$AL.has(t)||(this.hasUpdated||i||(s=void 0),this._$AL.set(t,s)),!0===e&&this._$Em!==t&&(this._$Eq??=new Set).add(t))}async _$EP(){this.isUpdatePending=!0;try{await this._$ES}catch(t){Promise.reject(t)}const t=this.scheduleUpdate();return null!=t&&await t,!this.isUpdatePending}scheduleUpdate(){return this.performUpdate()}performUpdate(){if(!this.isUpdatePending)return;if(!this.hasUpdated){if(this.renderRoot??=this.createRenderRoot(),this._$Ep){for(const[t,s]of this._$Ep)this[t]=s;this._$Ep=void 0}const t=this.constructor.elementProperties;if(t.size>0)for(const[s,i]of t){const{wrapped:t}=i,e=this[s];!0!==t||this._$AL.has(s)||void 0===e||this.C(s,void 0,i,e)}}let t=!1;const s=this._$AL;try{t=this.shouldUpdate(s),t?(this.willUpdate(s),this._$EO?.forEach((t=>t.hostUpdate?.())),this.update(s)):this._$EM()}catch(s){throw t=!1,this._$EM(),s}t&&this._$AE(s)}willUpdate(t){}_$AE(t){this._$EO?.forEach((t=>t.hostUpdated?.())),this.hasUpdated||(this.hasUpdated=!0,this.firstUpdated(t)),this.updated(t)}_$EM(){this._$AL=new Map,this.isUpdatePending=!1}get updateComplete(){return this.getUpdateComplete()}getUpdateComplete(){return this._$ES}shouldUpdate(t){return!0}update(t){this._$Eq&&=this._$Eq.forEach((t=>this._$ET(t,this[t]))),this._$EM()}updated(t){}firstUpdated(t){}}y.elementStyles=[],y.shadowRootOptions={mode:\"open\"},y[d(\"elementProperties\")]=new Map,y[d(\"finalized\")]=new Map,p?.({ReactiveElement:y}),(a.reactiveElementVersions??=[]).push(\"2.1.0\");export{y as ReactiveElement,s as adoptStyles,u as defaultConverter,t as getCompatibleStyle,f as notEqual};\n//# sourceMappingURL=reactive-element.js.map\n","import{notEqual as t}from\"@lit/reactive-element\";\n/**\n * @license\n * Copyright 2017 Google LLC\n * SPDX-License-Identifier: BSD-3-Clause\n */const s={INITIAL:0,PENDING:1,COMPLETE:2,ERROR:3},i=Symbol();class h{get taskComplete(){return this.t||(1===this.i?this.t=new Promise(((t,s)=>{this.o=t,this.h=s})):3===this.i?this.t=Promise.reject(this.l):this.t=Promise.resolve(this.u)),this.t}constructor(t,s,i){this.p=0,this.i=0,(this._=t).addController(this);const h=\"object\"==typeof s?s:{task:s,args:i};this.v=h.task,this.j=h.args,this.m=h.argsEqual??r,this.k=h.onComplete,this.A=h.onError,this.autoRun=h.autoRun??!0,\"initialValue\"in h&&(this.u=h.initialValue,this.i=2,this.O=this.T?.())}hostUpdate(){!0===this.autoRun&&this.S()}hostUpdated(){\"afterUpdate\"===this.autoRun&&this.S()}T(){if(void 0===this.j)return;const t=this.j();if(!Array.isArray(t))throw Error(\"The args function must return an array\");return t}async S(){const t=this.T(),s=this.O;this.O=t,t===s||void 0===t||void 0!==s&&this.m(s,t)||await this.run(t)}async run(t){let s,h;t??=this.T(),this.O=t,1===this.i?this.q?.abort():(this.t=void 0,this.o=void 0,this.h=void 0),this.i=1,\"afterUpdate\"===this.autoRun?queueMicrotask((()=>this._.requestUpdate())):this._.requestUpdate();const r=++this.p;this.q=new AbortController;let e=!1;try{s=await this.v(t,{signal:this.q.signal})}catch(t){e=!0,h=t}if(this.p===r){if(s===i)this.i=0;else{if(!1===e){try{this.k?.(s)}catch{}this.i=2,this.o?.(s)}else{try{this.A?.(h)}catch{}this.i=3,this.h?.(h)}this.u=s,this.l=h}this._.requestUpdate()}}abort(t){1===this.i&&this.q?.abort(t)}get value(){return this.u}get error(){return this.l}get status(){return this.i}render(t){switch(this.i){case 0:return t.initial?.();case 1:return t.pending?.();case 2:return t.complete?.(this.value);case 3:return t.error?.(this.error);default:throw Error(\"Unexpected status: \"+this.i)}}}const r=(s,i)=>s===i||s.length===i.length&&s.every(((s,h)=>!t(s,i[h])));export{h as Task,s as TaskStatus,i as initialState,r as shallowArrayEquals};\n//# sourceMappingURL=task.js.map\n","import{_$LH as o}from\"./lit-html.js\";\n/**\n * @license\n * Copyright 2020 Google LLC\n * SPDX-License-Identifier: BSD-3-Clause\n */const{I:t}=o,i=o=>null===o||\"object\"!=typeof o&&\"function\"!=typeof o,n={HTML:1,SVG:2,MATHML:3},e=(o,t)=>void 0===t?void 0!==o?._$litType$:o?._$litType$===t,l=o=>null!=o?._$litType$?.h,c=o=>void 0!==o?._$litDirective$,d=o=>o?._$litDirective$,f=o=>void 0===o.strings,s=()=>document.createComment(\"\"),r=(o,i,n)=>{const e=o._$AA.parentNode,l=void 0===i?o._$AB:i._$AA;if(void 0===n){const i=e.insertBefore(s(),l),c=e.insertBefore(s(),l);n=new t(i,c,o,o.options)}else{const t=n._$AB.nextSibling,i=n._$AM,c=i!==o;if(c){let t;n._$AQ?.(o),n._$AM=o,void 0!==n._$AP&&(t=o._$AU)!==i._$AU&&n._$AP(t)}if(t!==l||c){let o=n._$AA;for(;o!==t;){const t=o.nextSibling;e.insertBefore(o,l),o=t}}}return n},v=(o,t,i=o)=>(o._$AI(t,i),o),u={},m=(o,t=u)=>o._$AH=t,p=o=>o._$AH,M=o=>{o._$AP?.(!1,!0);let t=o._$AA;const i=o._$AB.nextSibling;for(;t!==i;){const o=t.nextSibling;t.remove(),t=o}},h=o=>{o._$AR()};export{n as TemplateResultType,h as clearPart,p as getCommittedValue,d as getDirectiveClass,r as insertPart,l as isCompiledTemplateResult,c as isDirectiveResult,i as isPrimitive,f as isSingleExpression,e as isTemplateResult,M as removePart,v as setChildPartValue,m as setCommittedValue};\n//# sourceMappingURL=directive-helpers.js.map\n","/**\n * @license\n * Copyright 2017 Google LLC\n * SPDX-License-Identifier: BSD-3-Clause\n */\nconst t={ATTRIBUTE:1,CHILD:2,PROPERTY:3,BOOLEAN_ATTRIBUTE:4,EVENT:5,ELEMENT:6},e=t=>(...e)=>({_$litDirective$:t,values:e});class i{constructor(t){}get _$AU(){return this._$AM._$AU}_$AT(t,e,i){this._$Ct=t,this._$AM=e,this._$Ci=i}_$AS(t,e){return this.update(t,e)}update(t,e){return this.render(...e)}}export{i as Directive,t as PartType,e as directive};\n//# sourceMappingURL=directive.js.map\n","/**\n * @license\n * Copyright 2017 Google LLC\n * SPDX-License-Identifier: BSD-3-Clause\n */\nconst t=globalThis,i=t.trustedTypes,s=i?i.createPolicy(\"lit-html\",{createHTML:t=>t}):void 0,e=\"$lit$\",h=`lit$${Math.random().toFixed(9).slice(2)}$`,o=\"?\"+h,n=`<${o}>`,r=document,l=()=>r.createComment(\"\"),c=t=>null===t||\"object\"!=typeof t&&\"function\"!=typeof t,a=Array.isArray,u=t=>a(t)||\"function\"==typeof t?.[Symbol.iterator],d=\"[ \\t\\n\\f\\r]\",f=/<(?:(!--|\\/[^a-zA-Z])|(\\/?[a-zA-Z][^>\\s]*)|(\\/?$))/g,v=/-->/g,_=/>/g,m=RegExp(`>|${d}(?:([^\\\\s\"'>=/]+)(${d}*=${d}*(?:[^ \\t\\n\\f\\r\"'\\`<>=]|(\"|')|))|$)`,\"g\"),p=/'/g,g=/\"/g,$=/^(?:script|style|textarea|title)$/i,y=t=>(i,...s)=>({_$litType$:t,strings:i,values:s}),x=y(1),b=y(2),w=y(3),T=Symbol.for(\"lit-noChange\"),E=Symbol.for(\"lit-nothing\"),A=new WeakMap,C=r.createTreeWalker(r,129);function P(t,i){if(!a(t)||!t.hasOwnProperty(\"raw\"))throw Error(\"invalid template strings array\");return void 0!==s?s.createHTML(i):i}const V=(t,i)=>{const s=t.length-1,o=[];let r,l=2===i?\"<svg>\":3===i?\"<math>\":\"\",c=f;for(let i=0;i<s;i++){const s=t[i];let a,u,d=-1,y=0;for(;y<s.length&&(c.lastIndex=y,u=c.exec(s),null!==u);)y=c.lastIndex,c===f?\"!--\"===u[1]?c=v:void 0!==u[1]?c=_:void 0!==u[2]?($.test(u[2])&&(r=RegExp(\"</\"+u[2],\"g\")),c=m):void 0!==u[3]&&(c=m):c===m?\">\"===u[0]?(c=r??f,d=-1):void 0===u[1]?d=-2:(d=c.lastIndex-u[2].length,a=u[1],c=void 0===u[3]?m:'\"'===u[3]?g:p):c===g||c===p?c=m:c===v||c===_?c=f:(c=m,r=void 0);const x=c===m&&t[i+1].startsWith(\"/>\")?\" \":\"\";l+=c===f?s+n:d>=0?(o.push(a),s.slice(0,d)+e+s.slice(d)+h+x):s+h+(-2===d?i:x)}return[P(t,l+(t[s]||\"<?>\")+(2===i?\"</svg>\":3===i?\"</math>\":\"\")),o]};class N{constructor({strings:t,_$litType$:s},n){let r;this.parts=[];let c=0,a=0;const u=t.length-1,d=this.parts,[f,v]=V(t,s);if(this.el=N.createElement(f,n),C.currentNode=this.el.content,2===s||3===s){const t=this.el.content.firstChild;t.replaceWith(...t.childNodes)}for(;null!==(r=C.nextNode())&&d.length<u;){if(1===r.nodeType){if(r.hasAttributes())for(const t of r.getAttributeNames())if(t.endsWith(e)){const i=v[a++],s=r.getAttribute(t).split(h),e=/([.?@])?(.*)/.exec(i);d.push({type:1,index:c,name:e[2],strings:s,ctor:\".\"===e[1]?H:\"?\"===e[1]?I:\"@\"===e[1]?L:k}),r.removeAttribute(t)}else t.startsWith(h)&&(d.push({type:6,index:c}),r.removeAttribute(t));if($.test(r.tagName)){const t=r.textContent.split(h),s=t.length-1;if(s>0){r.textContent=i?i.emptyScript:\"\";for(let i=0;i<s;i++)r.append(t[i],l()),C.nextNode(),d.push({type:2,index:++c});r.append(t[s],l())}}}else if(8===r.nodeType)if(r.data===o)d.push({type:2,index:c});else{let t=-1;for(;-1!==(t=r.data.indexOf(h,t+1));)d.push({type:7,index:c}),t+=h.length-1}c++}}static createElement(t,i){const s=r.createElement(\"template\");return s.innerHTML=t,s}}function S(t,i,s=t,e){if(i===T)return i;let h=void 0!==e?s._$Co?.[e]:s._$Cl;const o=c(i)?void 0:i._$litDirective$;return h?.constructor!==o&&(h?._$AO?.(!1),void 0===o?h=void 0:(h=new o(t),h._$AT(t,s,e)),void 0!==e?(s._$Co??=[])[e]=h:s._$Cl=h),void 0!==h&&(i=S(t,h._$AS(t,i.values),h,e)),i}class M{constructor(t,i){this._$AV=[],this._$AN=void 0,this._$AD=t,this._$AM=i}get parentNode(){return this._$AM.parentNode}get _$AU(){return this._$AM._$AU}u(t){const{el:{content:i},parts:s}=this._$AD,e=(t?.creationScope??r).importNode(i,!0);C.currentNode=e;let h=C.nextNode(),o=0,n=0,l=s[0];for(;void 0!==l;){if(o===l.index){let i;2===l.type?i=new R(h,h.nextSibling,this,t):1===l.type?i=new l.ctor(h,l.name,l.strings,this,t):6===l.type&&(i=new z(h,this,t)),this._$AV.push(i),l=s[++n]}o!==l?.index&&(h=C.nextNode(),o++)}return C.currentNode=r,e}p(t){let i=0;for(const s of this._$AV)void 0!==s&&(void 0!==s.strings?(s._$AI(t,s,i),i+=s.strings.length-2):s._$AI(t[i])),i++}}class R{get _$AU(){return this._$AM?._$AU??this._$Cv}constructor(t,i,s,e){this.type=2,this._$AH=E,this._$AN=void 0,this._$AA=t,this._$AB=i,this._$AM=s,this.options=e,this._$Cv=e?.isConnected??!0}get parentNode(){let t=this._$AA.parentNode;const i=this._$AM;return void 0!==i&&11===t?.nodeType&&(t=i.parentNode),t}get startNode(){return this._$AA}get endNode(){return this._$AB}_$AI(t,i=this){t=S(this,t,i),c(t)?t===E||null==t||\"\"===t?(this._$AH!==E&&this._$AR(),this._$AH=E):t!==this._$AH&&t!==T&&this._(t):void 0!==t._$litType$?this.$(t):void 0!==t.nodeType?this.T(t):u(t)?this.k(t):this._(t)}O(t){return this._$AA.parentNode.insertBefore(t,this._$AB)}T(t){this._$AH!==t&&(this._$AR(),this._$AH=this.O(t))}_(t){this._$AH!==E&&c(this._$AH)?this._$AA.nextSibling.data=t:this.T(r.createTextNode(t)),this._$AH=t}$(t){const{values:i,_$litType$:s}=t,e=\"number\"==typeof s?this._$AC(t):(void 0===s.el&&(s.el=N.createElement(P(s.h,s.h[0]),this.options)),s);if(this._$AH?._$AD===e)this._$AH.p(i);else{const t=new M(e,this),s=t.u(this.options);t.p(i),this.T(s),this._$AH=t}}_$AC(t){let i=A.get(t.strings);return void 0===i&&A.set(t.strings,i=new N(t)),i}k(t){a(this._$AH)||(this._$AH=[],this._$AR());const i=this._$AH;let s,e=0;for(const h of t)e===i.length?i.push(s=new R(this.O(l()),this.O(l()),this,this.options)):s=i[e],s._$AI(h),e++;e<i.length&&(this._$AR(s&&s._$AB.nextSibling,e),i.length=e)}_$AR(t=this._$AA.nextSibling,i){for(this._$AP?.(!1,!0,i);t&&t!==this._$AB;){const i=t.nextSibling;t.remove(),t=i}}setConnected(t){void 0===this._$AM&&(this._$Cv=t,this._$AP?.(t))}}class k{get tagName(){return this.element.tagName}get _$AU(){return this._$AM._$AU}constructor(t,i,s,e,h){this.type=1,this._$AH=E,this._$AN=void 0,this.element=t,this.name=i,this._$AM=e,this.options=h,s.length>2||\"\"!==s[0]||\"\"!==s[1]?(this._$AH=Array(s.length-1).fill(new String),this.strings=s):this._$AH=E}_$AI(t,i=this,s,e){const h=this.strings;let o=!1;if(void 0===h)t=S(this,t,i,0),o=!c(t)||t!==this._$AH&&t!==T,o&&(this._$AH=t);else{const e=t;let n,r;for(t=h[0],n=0;n<h.length-1;n++)r=S(this,e[s+n],i,n),r===T&&(r=this._$AH[n]),o||=!c(r)||r!==this._$AH[n],r===E?t=E:t!==E&&(t+=(r??\"\")+h[n+1]),this._$AH[n]=r}o&&!e&&this.j(t)}j(t){t===E?this.element.removeAttribute(this.name):this.element.setAttribute(this.name,t??\"\")}}class H extends k{constructor(){super(...arguments),this.type=3}j(t){this.element[this.name]=t===E?void 0:t}}class I extends k{constructor(){super(...arguments),this.type=4}j(t){this.element.toggleAttribute(this.name,!!t&&t!==E)}}class L extends k{constructor(t,i,s,e,h){super(t,i,s,e,h),this.type=5}_$AI(t,i=this){if((t=S(this,t,i,0)??E)===T)return;const s=this._$AH,e=t===E&&s!==E||t.capture!==s.capture||t.once!==s.once||t.passive!==s.passive,h=t!==E&&(s===E||e);e&&this.element.removeEventListener(this.name,this,s),h&&this.element.addEventListener(this.name,this,t),this._$AH=t}handleEvent(t){\"function\"==typeof this._$AH?this._$AH.call(this.options?.host??this.element,t):this._$AH.handleEvent(t)}}class z{constructor(t,i,s){this.element=t,this.type=6,this._$AN=void 0,this._$AM=i,this.options=s}get _$AU(){return this._$AM._$AU}_$AI(t){S(this,t)}}const Z={M:e,P:h,A:o,C:1,L:V,R:M,D:u,V:S,I:R,H:k,N:I,U:L,B:H,F:z},j=t.litHtmlPolyfillSupport;j?.(N,R),(t.litHtmlVersions??=[]).push(\"3.3.0\");const B=(t,i,s)=>{const e=s?.renderBefore??i;let h=e._$litPart$;if(void 0===h){const t=s?.renderBefore??null;e._$litPart$=h=new R(i.insertBefore(l(),t),t,void 0,s??{})}return h._$AI(t),h};export{Z as _$LH,x as html,w as mathml,T as noChange,E as nothing,B as render,b as svg};\n//# sourceMappingURL=lit-html.js.map\n","import{nothing as t,noChange as i}from\"../lit-html.js\";import{Directive as r,PartType as s,directive as n}from\"../directive.js\";\n/**\n * @license\n * Copyright 2017 Google LLC\n * SPDX-License-Identifier: BSD-3-Clause\n */class e extends r{constructor(i){if(super(i),this.it=t,i.type!==s.CHILD)throw Error(this.constructor.directiveName+\"() can only be used in child bindings\")}render(r){if(r===t||null==r)return this._t=void 0,this.it=r;if(r===i)return r;if(\"string\"!=typeof r)throw Error(this.constructor.directiveName+\"() called with a non-string value\");if(r===this.it)return this._t;this.it=r;const s=[r];return s.raw=s,this._t={_$litType$:this.constructor.resultType,strings:s,values:[]}}}e.directiveName=\"unsafeHTML\",e.resultType=1;const o=n(e);export{e as UnsafeHTMLDirective,o as unsafeHTML};\n//# sourceMappingURL=unsafe-html.js.map\n","import{ReactiveElement as t}from\"@lit/reactive-element\";export*from\"@lit/reactive-element\";import{render as e,noChange as r}from\"lit-html\";export*from\"lit-html\";\n/**\n * @license\n * Copyright 2017 Google LLC\n * SPDX-License-Identifier: BSD-3-Clause\n */const s=globalThis;class i extends t{constructor(){super(...arguments),this.renderOptions={host:this},this._$Do=void 0}createRenderRoot(){const t=super.createRenderRoot();return this.renderOptions.renderBefore??=t.firstChild,t}update(t){const r=this.render();this.hasUpdated||(this.renderOptions.isConnected=this.isConnected),super.update(t),this._$Do=e(r,this.renderRoot,this.renderOptions)}connectedCallback(){super.connectedCallback(),this._$Do?.setConnected(!0)}disconnectedCallback(){super.disconnectedCallback(),this._$Do?.setConnected(!1)}render(){return r}}i._$litElement$=!0,i[\"finalized\"]=!0,s.litElementHydrateSupport?.({LitElement:i});const o=s.litElementPolyfillSupport;o?.({LitElement:i});const n={_$AK:(t,e,r)=>{t._$AK(e,r)},_$AL:t=>t._$AL};(s.litElementVersions??=[]).push(\"4.2.0\");export{i as LitElement,n as _$LE};\n//# sourceMappingURL=lit-element.js.map\n"],"names":["r","Array","arguments","Object","String","Uint8Array","Uint16Array","Int32Array","m","Math","s","o","t","Date","TextEncoder","TextDecoder","queueMicrotask","u","l","a","FluentType","FluentNone","FluentNumber","Intl","FluentDateTime","globalThis","Symbol","TypeError","RangeError","ReferenceError","Scope","WeakSet","Error","JSON","Map","FluentBundle","FluentResource","SyntaxError","p","Indent","parseInt","parseFloat","n","Uint32Array","btoa","document","NodeFilter","ShadowRoot","DocumentFragment","console","Document","CSSStyleSheet","WeakMap","Boolean","Number","y","HTMLElement","litPropertyMetadata","Set","Promise","AbortController","i","RegExp","N","v","H","I","L","k","M","R","z","e"],"mappings":";0FAqBA,EAAO,OAAO,CAnBd,SAAS,EAAYA,CAAM,EAIzB,IAHA,IACI,EACA,EAFA,EAAQC,MAAM,SAAS,CAAC,KAAK,CAAC,IAAI,CAACC,UAAW,GAG3C,EAAM,MAAM,EAEjB,IAAK,KADL,EAAO,EAAM,KAAK,GAEZ,EAAK,cAAc,CAAC,KAClBC,AAAgD,oBAAhDA,OAAO,SAAS,CAAC,QAAQ,CAAC,IAAI,CAACH,CAAM,CAAC,EAAI,EAC5CA,CAAM,CAAC,EAAI,CAAG,EAAWA,CAAM,CAAC,EAAI,CAAE,CAAI,CAAC,EAAI,EAE/CA,CAAM,CAAC,EAAI,CAAG,CAAI,CAAC,EAAI,EAK/B,OAAOA,CACT,qBCbA,EAAO,OAAO,CAAG,SAAU,CAAsB,EAC/C,IAAI,EAAO,EAAE,CA4Eb,OAzEA,EAAK,QAAQ,CAAG,WACd,OAAO,IAAI,CAAC,GAAG,CAAC,SAAU,CAAI,EAC5B,IAAI,EAAU,GACV,EAAY,AAAmB,SAAZ,CAAI,CAAC,EAAE,CAoB9B,OAnBI,CAAI,CAAC,EAAE,EACT,IAAW,cAAc,MAAM,CAAC,CAAI,CAAC,EAAE,CAAE,MAAK,EAE5C,CAAI,CAAC,EAAE,EACT,IAAW,UAAU,MAAM,CAAC,CAAI,CAAC,EAAE,CAAE,KAAI,EAEvC,GACF,IAAW,SAAS,MAAM,CAAC,CAAI,CAAC,EAAE,CAAC,MAAM,CAAG,EAAI,IAAI,MAAM,CAAC,CAAI,CAAC,EAAE,EAAI,GAAI,KAAI,EAEhF,GAAW,EAAuB,GAC9B,GACF,IAAW,GAAE,EAEX,CAAI,CAAC,EAAE,EACT,IAAW,GAAE,EAEX,CAAI,CAAC,EAAE,EACT,IAAW,GAAE,EAER,CACT,GAAG,IAAI,CAAC,GACV,EAGA,EAAK,CAAC,CAAG,SAAW,CAAO,CAAE,CAAK,CAAE,CAAM,CAAE,CAAQ,CAAE,CAAK,EACrD,AAAmB,UAAnB,OAAO,GACT,GAAU,CAAC,CAAC,KAAM,EAAS,OAAU,CAAC,AAAD,EAEvC,IAAI,EAAyB,CAAC,EAC9B,GAAI,EACF,IAAK,IAAI,EAAI,EAAG,EAAI,IAAI,CAAC,MAAM,CAAE,IAAK,CACpC,IAAI,EAAK,IAAI,CAAC,EAAE,CAAC,EAAE,AACf,AAAM,OAAN,GACF,EAAsB,CAAC,EAAG,CAAG,EAAG,CAEpC,CAEF,IAAK,IAAI,EAAK,EAAG,EAAK,EAAQ,MAAM,CAAE,IAAM,CAC1C,IAAI,EAAO,EAAE,CAAC,MAAM,CAAC,CAAO,CAAC,EAAG,EAC5B,GAAU,CAAsB,CAAC,CAAI,CAAC,EAAE,CAAC,GAGxB,SAAV,IACc,SAAZ,CAAI,CAAC,EAAE,EAGhB,EAAI,CAAC,EAAE,CAAG,SAAS,MAAM,CAAC,CAAI,CAAC,EAAE,CAAC,MAAM,CAAG,EAAI,IAAI,MAAM,CAAC,CAAI,CAAC,EAAE,EAAI,GAAI,MAAM,MAAM,CAAC,CAAI,CAAC,EAAE,CAAE,IAAG,EAFlG,CAAI,CAAC,EAAE,CAAG,GAMV,IACG,CAAI,CAAC,EAAE,EAGV,EAAI,CAAC,EAAE,CAAG,UAAU,MAAM,CAAC,CAAI,CAAC,EAAE,CAAE,MAAM,MAAM,CAAC,CAAI,CAAC,EAAE,CAAE,IAAG,EAF7D,CAAI,CAAC,EAAE,CAAG,GAMV,IACG,CAAI,CAAC,EAAE,EAGV,CAAI,CAAC,EAAE,CAAG,cAAc,MAAM,CAAC,CAAI,CAAC,EAAE,CAAE,OAAO,MAAM,CAAC,CAAI,CAAC,EAAE,CAAE,KAC/D,CAAI,CAAC,EAAE,CAAG,GAHV,CAAI,CAAC,EAAE,CAAG,GAAG,MAAM,CAAC,IAMxB,EAAK,IAAI,CAAC,GACZ,CACF,EACO,CACT,qBClFA,EAAO,OAAO,CAAG,SAAU,CAAG,CAAE,CAAO,SACjC,AAAC,GACH,GAAU,CAAC,GAER,IAGL,EAAMI,OAAO,EAAI,UAAU,CAAG,EAAI,OAAO,CAAG,GAGxC,eAAe,IAAI,CAAC,IACtB,GAAM,EAAI,KAAK,CAAC,EAAG,GAAE,EAEnB,EAAQ,IAAI,EACd,IAAO,EAAQ,IAAI,AAAD,EAKhB,oBAAoB,IAAI,CAAC,IAAQ,EAAQ,UAAU,GAC9C,IAAK,MAAM,CAAC,EAAI,OAAO,CAAC,KAAM,OAAO,OAAO,CAAC,MAAO,OAAQ,KAE9D,CACT,oBCvBA,EAAO,OAAO,CAAG,SAAU,CAAC,EAC1B,OAAO,CAAC,CAAC,EAAE,AACb,qDC0BA,IAAI,EAAKC,WAAY,EAAMC,YAAa,EAAMC,WAE1C,EAAO,IAAI,EAAG,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAgB,EAAG,EAAoB,EAAE,EAE5I,EAAO,IAAI,EAAG,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAiB,EAAG,EAAE,EAEnI,EAAO,IAAI,EAAG,CAAC,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAG,EAEhF,EAAO,SAAU,CAAE,CAAE,CAAK,EAE1B,IAAK,IADD,EAAI,IAAI,EAAI,IACP,EAAI,EAAG,EAAI,GAAI,EAAE,EACtB,CAAC,CAAC,EAAE,CAAG,GAAS,GAAK,CAAE,CAAC,EAAI,EAAE,CAIlC,IAAK,IADD,EAAI,IAAI,EAAI,CAAC,CAAC,GAAG,EACZ,EAAI,EAAG,EAAI,GAAI,EAAE,EACtB,IAAK,IAAI,EAAI,CAAC,CAAC,EAAE,CAAE,EAAI,CAAC,CAAC,EAAI,EAAE,CAAE,EAAE,EAC/B,CAAC,CAAC,EAAE,CAAG,AAAE,EAAI,CAAC,CAAC,EAAE,EAAK,EAAK,EAGnC,MAAO,CAAE,EAAG,EAAG,EAAG,CAAE,CACxB,EACI,EAAK,EAAK,EAAM,GAAI,EAAK,EAAG,CAAC,CAAE,EAAQ,EAAG,CAAC,AAE/C,EAAE,CAAC,GAAG,CAAG,IAAK,CAAK,CAAC,IAAI,CAAG,GAI3B,IAAK,IAHD,EAAK,EAAK,EAAM,GAAe,GAAN,EAAG,CAAC,CAAU,EAAG,CAAC,EAE3C,EAAM,IAAI,EAAI,OACT,EAAI,EAAG,EAAI,MAAO,EAAE,EAAG,CAE5B,IAAI,EAAI,AAAE,CAAI,MAAJ,CAAS,GAAM,EAAM,AAAC,CAAI,MAAJ,CAAS,GAAM,EAE/C,EAAI,AAAE,CAAI,MADV,GAAI,AAAE,CAAI,MAAJ,CAAS,GAAM,EAAM,AAAC,CAAI,MAAJ,CAAS,GAAM,CAAC,CAC7B,GAAM,EAAM,AAAC,CAAI,KAAJ,CAAS,GAAM,EAC3C,CAAG,CAAC,EAAE,CAAG,AAAC,CAAE,CAAI,MAAJ,CAAS,GAAM,EAAM,AAAC,CAAI,IAAJ,CAAS,GAAM,CAAC,GAAM,CAC5D,CAuDA,IAAK,IAnDD,EAAQ,SAAU,CAAE,CAAE,CAAE,CAAE,CAAC,EAO3B,IANA,IAeI,EAfA,EAAI,EAAG,MAAM,CAEb,EAAI,EAEJ,EAAI,IAAI,EAAI,GAET,EAAI,EAAG,EAAE,EACR,CAAE,CAAC,EAAE,EACL,EAAE,CAAC,CAAC,CAAE,CAAC,EAAE,CAAG,EAAE,CAGtB,IAAI,EAAK,IAAI,EAAI,GACjB,IAAK,EAAI,EAAG,EAAI,EAAI,EAAE,EAClB,CAAE,CAAC,EAAE,CAAG,AAAC,CAAE,CAAC,EAAI,EAAE,CAAG,CAAC,CAAC,EAAI,EAAE,EAAK,EAGtC,GAAI,EAAG,CAEH,EAAK,IAAI,EAAI,GAAK,GAElB,IAAI,EAAM,GAAK,EACf,IAAK,EAAI,EAAG,EAAI,EAAG,EAAE,EAEjB,GAAI,CAAE,CAAC,EAAE,CAQL,IAAK,IAND,EAAK,AAAC,GAAK,EAAK,CAAE,CAAC,EAAE,CAErB,EAAM,EAAK,CAAE,CAAC,EAAE,CAEhB,EAAI,CAAE,CAAC,CAAE,CAAC,EAAE,CAAG,EAAE,IAAM,EAElBC,EAAI,EAAK,AAAC,IAAK,CAAE,EAAK,EAAI,GAAKA,EAAG,EAAE,EAEzC,CAAE,CAAC,CAAG,CAAC,EAAE,EAAI,EAAI,CAAG,CAIpC,MAGI,IAAK,EAAI,EADT,EAAK,IAAI,EAAI,GACD,EAAI,EAAG,EAAE,EACb,CAAE,CAAC,EAAE,EACL,EAAE,CAAC,EAAE,CAAG,CAAG,CAAC,CAAE,CAAC,CAAE,CAAC,EAAE,CAAG,EAAE,GAAG,EAAK,GAAK,CAAE,CAAC,EAAE,EAIvD,OAAO,CACX,EAEI,EAAM,IAAI,EAAG,KACR,EAAI,EAAG,EAAI,IAAK,EAAE,EACvB,CAAG,CAAC,EAAE,CAAG,EACb,IAAK,IAAI,EAAI,IAAK,EAAI,IAAK,EAAE,EACzB,CAAG,CAAC,EAAE,CAAG,EACb,IAAK,IAAI,EAAI,IAAK,EAAI,IAAK,EAAE,EACzB,CAAG,CAAC,EAAE,CAAG,EACb,IAAK,IAAI,EAAI,IAAK,EAAI,IAAK,EAAE,EACzB,CAAG,CAAC,EAAE,CAAG,EAGb,IAAK,IADD,EAAM,IAAI,EAAG,IACR,EAAI,EAAG,EAAI,GAAI,EAAE,EACtB,CAAG,CAAC,EAAE,CAAG,EA3Eb,IA6EI,EAAoB,EAAK,EAAK,EAAG,GAEjC,EAAoB,EAAK,EAAK,EAAG,GAqBjC,EAAO,SAAU,CAAC,EAAI,MAAO,AAAE,GAAI,GAAK,EAAK,CAAG,EAGhD,EAAM,SAAU,CAAC,CAAE,CAAC,CAAE,CAAC,EAMvB,MALI,CAAK,MAAL,GAAa,EAAI,IACjB,GAAI,GACJ,CAAK,MAAL,GAAa,EAAI,EAAE,MAAM,AAAD,GACxB,GAAI,EAAE,MAAM,AAAD,EAER,IAAI,EAAG,EAAE,QAAQ,CAAC,EAAG,GAChC,EAuOI,EAAQ,SAAU,CAAC,CAAE,CAAC,CAAE,CAAC,EACzB,IAAM,AAAI,EAAJ,EACN,IAAI,EAAI,AAAC,EAAI,EAAK,CAClB,EAAC,CAAC,EAAE,EAAI,EACR,CAAC,CAAC,EAAI,EAAE,EAAI,GAAK,CACrB,EAEI,EAAU,SAAU,CAAC,CAAE,CAAC,CAAE,CAAC,EAC3B,IAAM,AAAI,EAAJ,EACN,IAAI,EAAI,AAAC,EAAI,EAAK,CAClB,EAAC,CAAC,EAAE,EAAI,EACR,CAAC,CAAC,EAAI,EAAE,EAAI,GAAK,EACjB,CAAC,CAAC,EAAI,EAAE,EAAI,GAAK,EACrB,EAEI,EAAQ,SAAU,CAAC,CAAE,CAAE,EAGvB,IAAK,IADD,EAAI,EAAE,CACD,EAAI,EAAG,EAAI,EAAE,MAAM,CAAE,EAAE,EACxB,CAAC,CAAC,EAAE,EACJ,EAAE,IAAI,CAAC,CAAE,EAAG,EAAG,EAAG,CAAC,CAAC,EAAE,AAAC,GAH/B,IAKI,EAAI,EAAE,MAAM,CACZ,EAAK,EAAE,KAAK,GAChB,GAAI,CAAC,EACD,MAAO,CAAE,EAAG,EAAI,EAAG,CAAE,EACzB,GAAI,AAAK,GAAL,EAAQ,CACR,IAAI,EAAI,IAAI,EAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAG,GAExB,OADA,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAG,EACL,CAAE,EAAG,EAAG,EAAG,CAAE,CACxB,CACA,EAAE,IAAI,CAAC,SAAU,CAAC,CAAE,CAAC,EAAI,OAAO,EAAE,CAAC,CAAG,EAAE,CAAC,AAAE,GAG3C,EAAE,IAAI,CAAC,CAAE,EAAG,GAAI,EAAG,KAAM,GACzB,IAAI,EAAI,CAAC,CAAC,EAAE,CAAE,EAAI,CAAC,CAAC,EAAE,CAAE,EAAK,EAAG,EAAK,EAAG,EAAK,EAO7C,IANA,CAAC,CAAC,EAAE,CAAG,CAAE,EAAG,GAAI,EAAG,EAAE,CAAC,CAAG,EAAE,CAAC,CAAE,EAAG,EAAG,EAAG,CAAE,EAMlC,GAAM,EAAI,GACb,EAAI,CAAC,CAAC,CAAC,CAAC,EAAG,CAAC,CAAC,CAAG,CAAC,CAAC,EAAG,CAAC,CAAC,CAAG,IAAO,IAAK,CACtC,EAAI,CAAC,CAAC,GAAM,GAAM,CAAC,CAAC,EAAG,CAAC,CAAC,CAAG,CAAC,CAAC,EAAG,CAAC,CAAC,CAAG,IAAO,IAAK,CAClD,CAAC,CAAC,IAAK,CAAG,CAAE,EAAG,GAAI,EAAG,EAAE,CAAC,CAAG,EAAE,CAAC,CAAE,EAAG,EAAG,EAAG,CAAE,EAGhD,IAAK,IADD,EAAS,CAAE,CAAC,EAAE,CAAC,CAAC,CACX,EAAI,EAAG,EAAI,EAAG,EAAE,EACjB,CAAE,CAAC,EAAE,CAAC,CAAC,CAAG,GACV,GAAS,CAAE,CAAC,EAAE,CAAC,CAAC,AAAD,EAHvB,IAMI,EAAK,IAAI,EAAI,EAAS,GAEtB,EAAM,EAAG,CAAC,CAAC,EAAK,EAAE,CAAE,EAAI,GAC5B,GAAI,EAAM,EAAI,CAIV,IAAI,EAAI,EAAG,EAAK,EAEZ,EAAM,EAAM,EAAI,EAAM,GAAK,EAE/B,IADA,EAAG,IAAI,CAAC,SAAU,CAAC,CAAE,CAAC,EAAI,OAAO,CAAE,CAAC,EAAE,CAAC,CAAC,CAAG,CAAE,CAAC,EAAE,CAAC,CAAC,EAAI,EAAE,CAAC,CAAG,EAAE,CAAC,AAAE,GAC1D,EAAI,EAAG,EAAE,EAAG,CACf,IAAI,EAAO,CAAE,CAAC,EAAE,CAAC,CAAC,CAClB,GAAI,CAAE,CAAC,EAAK,CAAG,EACX,GAAM,EAAO,IAAM,EAAM,CAAE,CAAC,EAAK,EACjC,CAAE,CAAC,EAAK,CAAG,OAGX,KACR,CAEA,IADA,IAAO,EACA,EAAK,GAAG,CACX,IAAI,EAAO,CAAE,CAAC,EAAE,CAAC,CAAC,AACd,EAAE,CAAC,EAAK,CAAG,EACX,GAAM,GAAM,EAAK,CAAE,CAAC,EAAK,GAAK,EAE9B,EAAE,CACV,CACA,KAAO,GAAK,GAAK,EAAI,EAAE,EAAG,CACtB,IAAI,EAAO,CAAE,CAAC,EAAE,CAAC,CAAC,AACd,EAAE,CAAC,EAAK,EAAI,IACZ,EAAE,CAAE,CAAC,EAAK,CACV,EAAE,EAEV,CACA,EAAM,CACV,CACA,MAAO,CAAE,EAAG,IAAI,EAAG,GAAK,EAAG,CAAI,CACnC,EAEI,EAAK,SAAU,CAAC,CAAE,CAAC,CAAE,CAAC,EACtB,OAAO,AAAO,IAAP,EAAE,CAAC,CACJC,KAAK,GAAG,CAAC,EAAG,EAAE,CAAC,CAAE,EAAG,EAAI,GAAI,EAAG,EAAE,CAAC,CAAE,EAAG,EAAI,IAC1C,CAAC,CAAC,EAAE,CAAC,CAAC,CAAG,CACpB,EAEI,EAAK,SAAU,CAAC,EAGhB,IAFA,IAAI,EAAI,EAAE,MAAM,CAET,GAAK,CAAC,CAAC,CAAC,EAAE,EAAE,GAMnB,IAAK,IAJD,EAAK,IAAI,EAAI,EAAE,GAEf,EAAM,EAAG,EAAM,CAAC,CAAC,EAAE,CAAE,EAAM,EAC3B,EAAI,SAAU,CAAC,EAAI,CAAE,CAAC,IAAM,CAAG,CAAG,EAC7B,EAAI,EAAG,GAAK,EAAG,EAAE,EACtB,GAAI,CAAC,CAAC,EAAE,EAAI,GAAO,GAAK,EACpB,EAAE,MACD,CACD,GAAI,CAAC,GAAO,EAAM,EAAG,CACjB,KAAO,EAAM,IAAK,GAAO,IACrB,EAAE,OACF,EAAM,IACN,EAAE,EAAM,GAAK,AAAE,EAAM,IAAO,EAAK,MAAQ,AAAE,EAAM,GAAM,EAAK,OAC5D,EAAM,EAEd,MACK,GAAI,EAAM,EAAG,CAEd,IADA,EAAE,GAAM,EAAE,EACH,EAAM,EAAG,GAAO,EACnB,EAAE,KACF,GAAM,GACN,GAAE,AAAE,EAAM,GAAM,EAAK,MAAO,EAAM,EAC1C,CACA,KAAO,KACH,EAAE,GACN,EAAM,EACN,EAAM,CAAC,CAAC,EAAE,AACd,CAEJ,MAAO,CAAE,EAAG,EAAG,QAAQ,CAAC,EAAG,GAAM,EAAG,CAAE,CAC1C,EAEI,EAAO,SAAU,CAAE,CAAE,CAAE,EAEvB,IAAK,IADD,EAAI,EACC,EAAI,EAAG,EAAI,EAAG,MAAM,CAAE,EAAE,EAC7B,GAAK,CAAE,CAAC,EAAE,CAAG,CAAE,CAAC,EAAE,CACtB,OAAO,CACX,EAGI,EAAQ,SAAU,CAAG,CAAE,CAAG,CAAE,CAAG,EAE/B,IAAIC,EAAI,EAAI,MAAM,CACdC,EAAI,EAAK,EAAM,EACnB,EAAG,CAACA,EAAE,CAAGD,AAAI,IAAJA,EACT,CAAG,CAACC,EAAI,EAAE,CAAGD,GAAK,EAClB,CAAG,CAACC,EAAI,EAAE,CAAG,AAAS,IAAT,CAAG,CAACA,EAAE,CACnB,CAAG,CAACA,EAAI,EAAE,CAAG,AAAa,IAAb,CAAG,CAACA,EAAI,EAAE,CACvB,IAAK,IAAI,EAAI,EAAG,EAAID,EAAG,EAAE,EACrB,CAAG,CAACC,EAAI,EAAI,EAAE,CAAG,CAAG,CAAC,EAAE,CAC3B,MAAO,AAACA,CAAAA,EAAI,EAAID,CAAAA,EAAK,CACzB,EAEI,EAAO,SAAU,CAAG,CAAE,CAAG,CAAE,CAAK,CAAEA,CAAI,CAAE,CAAE,CAAE,CAAE,CAAE,CAAE,CAAE,CAAE,CAAE,CAAE,CAAE,CAAE,CAAE,CAAC,EACjE,EAAM,EAAK,IAAK,GAChB,EAAE,CAAE,CAAC,IAAI,CAMT,IAAK,IAaD,EAAI,EAAI,EAAI,EAlBZ,EAAK,EAAM,EAAI,IAAK,EAAM,EAAG,CAAC,CAAE,EAAM,EAAG,CAAC,CAC1C,EAAK,EAAM,EAAI,IAAK,EAAM,EAAG,CAAC,CAAE,EAAM,EAAG,CAAC,CAC1C,EAAK,EAAG,GAAM,EAAO,EAAG,CAAC,CAAE,EAAM,EAAG,CAAC,CACrC,EAAK,EAAG,GAAM,EAAO,EAAG,CAAC,CAAE,EAAM,EAAG,CAAC,CACrC,EAAS,IAAI,EAAI,IACZ,GAAI,EAAG,GAAI,EAAK,MAAM,CAAE,EAAE,GAC/B,EAAE,CAAM,CAAC,AAAU,GAAV,CAAI,CAAC,GAAE,CAAM,CAC1B,IAAK,IAAI,GAAI,EAAG,GAAI,EAAK,MAAM,CAAE,EAAE,GAC/B,EAAE,CAAM,CAAC,AAAU,GAAV,CAAI,CAAC,GAAE,CAAM,CAG1B,IAXA,IASI,GAAK,EAAM,EAAQ,GAAI,GAAM,GAAG,CAAC,CAAE,GAAO,GAAG,CAAC,CAC9C,GAAO,GACJ,GAAO,GAAK,CAAC,EAAG,CAAC,CAAI,CAAC,GAAO,EAAE,CAAC,CAAE,EAAE,IAE3C,IAAI,GAAO,AAAC,EAAK,GAAM,EACnB,GAAQ,EAAK,EAAI,GAAO,EAAK,EAAI,GAAO,EACxC,GAAQ,EAAK,EAAI,GAAO,EAAK,EAAI,GAAO,EAAK,GAAK,EAAI,GAAO,EAAK,EAAQ,IAAO,EAAI,CAAM,CAAC,GAAG,CAAG,EAAI,CAAM,CAAC,GAAG,CAAG,EAAI,CAAM,CAAC,GAAG,CACrI,GAAI,GAAM,GAAK,IAAQ,IAAS,IAAQ,GACpC,OAAO,EAAM,EAAK,EAAG,EAAI,QAAQ,CAAC,EAAI,EAAK,IAG/C,GADA,EAAM,EAAK,EAAG,EAAK,IAAQ,EAAI,GAAK,GAAK,EACrC,GAAQ,GAAO,CACf,EAAK,EAAK,EAAK,EAAK,GAAI,EAAK,EAAK,EAAK,EAAK,EAAK,EAAK,GAAI,EAAK,EAC/D,IAAI,GAAM,EAAK,GAAK,GAAM,GAC1B,EAAM,EAAK,EAAG,EAAM,KACpB,EAAM,EAAK,EAAI,EAAG,EAAM,GACxB,EAAM,EAAK,EAAI,GAAI,GAAO,GAC1B,GAAK,GACL,IAAK,IAAI,GAAI,EAAG,GAAI,GAAM,EAAE,GACxB,EAAM,EAAK,EAAI,EAAI,GAAG,EAAG,CAAC,CAAI,CAAC,GAAE,CAAC,EACtC,GAAK,EAAI,GAET,IAAK,IADD,GAAO,CAAC,EAAM,EAAK,CACd,GAAK,EAAG,GAAK,EAAG,EAAE,GAEvB,IAAK,IADD,GAAO,EAAI,CAAC,GAAG,CACV,GAAI,EAAG,GAAI,GAAK,MAAM,CAAE,EAAE,GAAG,CAClC,IAAI,GAAM,AAAU,GAAV,EAAI,CAAC,GAAE,CACjB,EAAM,EAAK,EAAG,EAAG,CAAC,GAAI,EAAG,GAAK,EAAG,CAAC,GAAI,CAClC,GAAM,IACN,GAAM,EAAK,EAAG,AAAC,EAAI,CAAC,GAAE,EAAI,EAAK,KAAM,GAAK,EAAI,CAAC,GAAE,EAAI,EAAC,CAC9D,CAER,MAEI,EAAK,EAAK,EAAK,EAAK,EAAK,EAAK,EAAK,EAEvC,IAAK,IAAI,GAAI,EAAG,GAAI,EAAI,EAAE,GAAG,CACzB,IAAI,GAAMA,CAAI,CAAC,GAAE,CACjB,GAAI,GAAM,IAAK,CACX,IAAI,GAAM,AAAC,IAAO,GAAM,GACxB,EAAQ,EAAK,EAAG,CAAE,CAAC,GAAM,IAAI,EAAG,GAAK,CAAE,CAAC,GAAM,IAAI,CAC9C,GAAM,GACN,GAAM,EAAK,EAAG,AAAC,IAAO,GAAM,IAAK,GAAK,CAAI,CAAC,GAAI,AAAD,EAClD,IAAI,GAAM,AAAM,GAAN,GACV,EAAQ,EAAK,EAAG,CAAE,CAAC,GAAI,EAAG,GAAK,CAAE,CAAC,GAAI,CAClC,GAAM,GACN,GAAQ,EAAK,EAAG,AAAC,IAAO,EAAK,MAAO,GAAK,CAAI,CAAC,GAAI,AAAD,CACzD,MAEI,EAAQ,EAAK,EAAG,CAAE,CAAC,GAAI,EAAG,GAAK,CAAE,CAAC,GAAI,AAE9C,CAEA,OADA,EAAQ,EAAK,EAAG,CAAE,CAAC,IAAI,EAChB,EAAI,CAAE,CAAC,IAAI,AACtB,EAEI,EAAoB,IAAI,EAAI,CAAC,MAAO,OAAQ,OAAQ,OAAQ,OAAQ,QAAS,QAAS,QAAS,QAAQ,EAEvG,EAAmB,IAAI,EAAG,GAE1B,EAAO,SAAU,CAAG,CAAE,CAAG,CAAE,CAAI,CAAE,CAAG,CAAE,CAAI,CAAE,CAAE,EAC9C,IAAI,EAAI,EAAG,CAAC,EAAI,EAAI,MAAM,CACtB,EAAI,IAAI,EAAG,EAAM,EAAI,EAAK,GAAID,KAAK,IAAI,CAAC,EAAI,IAAI,EAAK,GAErD,EAAI,EAAE,QAAQ,CAAC,EAAK,EAAE,MAAM,CAAG,GAC/B,EAAM,EAAG,CAAC,CACV,EAAM,AAAc,EAAb,GAAG,CAAC,EAAI,GACnB,GAAI,EAAK,CACD,GACA,EAAC,CAAC,EAAE,CAAG,EAAG,CAAC,EAAI,GAenB,IAdA,IAAI,EAAM,CAAG,CAAC,EAAM,EAAE,CAClB,EAAI,GAAO,GAAI,EAAI,AAAM,KAAN,EACnB,EAAQ,AAAC,IAAK,CAAG,EAAK,EAEtB,EAAO,EAAG,CAAC,EAAI,IAAI,EAAI,OAAQ,EAAO,EAAG,CAAC,EAAI,IAAI,EAAI,EAAQ,GAC9D,EAAQA,KAAK,IAAI,CAAC,EAAO,GAAI,EAAQ,EAAI,EACzC,EAAM,SAAU,CAAC,EAAI,MAAO,AAAC,EAAG,CAAC,EAAE,CAAI,CAAG,CAAC,EAAI,EAAE,EAAI,EAAU,CAAG,CAAC,EAAI,EAAE,EAAI,CAAK,EAAK,CAAO,EAG9F,EAAO,IAAI,EAAI,MAEf,EAAK,IAAI,EAAI,KAAM,EAAK,IAAI,EAAI,IAEhC,EAAO,EAAG,EAAK,EAAG,EAAI,EAAG,CAAC,EAAI,EAAG,EAAK,EAAG,EAAK,EAAG,CAAC,EAAI,EAAG,EAAK,EAC3D,EAAI,EAAI,EAAG,EAAE,EAAG,CAEnB,IAAI,EAAK,EAAI,GAET,EAAO,AAAI,MAAJ,EAAW,GAAQ,CAAI,CAAC,EAAG,CAKtC,GAJA,CAAI,CAAC,EAAK,CAAG,GACb,CAAI,CAAC,EAAG,CAAG,EAGP,GAAM,EAAG,CAET,IAAI,GAAM,EAAI,EACd,GAAI,AAAC,GAAO,KAAQ,EAAK,KAAI,GAAO,IAAM,KAAO,CAAC,CAAE,EAAI,CACpD,EAAM,EAAK,EAAK,EAAG,EAAG,EAAM,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,GACxD,EAAK,EAAO,EAAK,EAAG,EAAK,EACzB,IAAK,IAAI,GAAI,EAAG,GAAI,IAAK,EAAE,GACvB,CAAE,CAAC,GAAE,CAAG,EACZ,IAAK,IAAI,GAAI,EAAG,GAAI,GAAI,EAAE,GACtB,CAAE,CAAC,GAAE,CAAG,CAChB,CAEA,IAAI,GAAI,EAAG,GAAI,EAAG,GAAO,EAAG,GAAM,EAAO,GAAQ,MACjD,GAAI,GAAM,GAAK,GAAM,EAAI,EAAI,IAMzB,IALA,IAAI,GAAOA,KAAK,GAAG,CAAC,EAAG,IAAO,EAC1B,GAAOA,KAAK,GAAG,CAAC,MAAO,GAGvB,GAAKA,KAAK,GAAG,CAAC,IAAK,IAChB,IAAO,IAAQ,EAAE,IAAQ,GAAQ,IAAO,CAC3C,GAAI,CAAG,CAAC,EAAI,GAAE,EAAI,CAAG,CAAC,EAAI,GAAI,GAAI,CAAE,CAEhC,IADA,IAAI,GAAK,EACF,GAAK,IAAM,CAAG,CAAC,EAAI,GAAG,EAAI,CAAG,CAAC,EAAI,GAAK,GAAI,CAAE,EAAE,IAEtD,GAAI,GAAK,GAAG,CAGR,GAFA,GAAI,GAAI,GAAI,GAER,GAAK,GACL,MAMJ,IAAK,IAFD,GAAMA,KAAK,GAAG,CAAC,GAAK,GAAK,GACzB,GAAK,EACA,GAAI,EAAG,GAAI,GAAK,EAAE,GAAG,CAC1B,IAAI,GAAK,EAAI,GAAM,GAAI,MACnB,GAAM,CAAI,CAAC,GAAG,CACd,GAAK,GAAK,GAAM,KAChB,IAAK,IACL,IAAK,GAAI,GAAQ,EAAC,CAC1B,CACJ,CACJ,CAEc,GAAQ,CAAI,CAA1B,EAAO,GAAyB,CAChC,IAAO,EAAO,GAAQ,KAC1B,CAGJ,GAAI,GAAG,CAGH,CAAI,CAAC,IAAK,CAAG,WAAa,CAAK,CAAC,GAAE,EAAI,GAAM,CAAK,CAAC,GAAE,CACpD,IAAI,GAAM,AAAW,GAAX,CAAK,CAAC,GAAE,CAAO,GAAM,AAAW,GAAX,CAAK,CAAC,GAAE,CACvC,GAAM,CAAI,CAAC,GAAI,CAAG,CAAI,CAAC,GAAI,CAC3B,EAAE,CAAE,CAAC,IAAM,GAAI,CACf,EAAE,CAAE,CAAC,GAAI,CACT,EAAK,EAAI,GACT,EAAE,CACN,MAEI,CAAI,CAAC,IAAK,CAAG,CAAG,CAAC,EAAE,CACnB,EAAE,CAAE,CAAC,CAAG,CAAC,EAAE,CAAC,AAEpB,CACJ,CACA,IAAK,EAAIA,KAAK,GAAG,CAAC,EAAG,GAAK,EAAI,EAAG,EAAE,EAC/B,CAAI,CAAC,IAAK,CAAG,CAAG,CAAC,EAAE,CACnB,EAAE,CAAE,CAAC,CAAG,CAAC,EAAE,CAAC,CAEhB,EAAM,EAAK,EAAK,EAAG,EAAK,EAAM,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,GACrD,IACD,EAAG,CAAC,CAAG,AAAO,EAAN,EAAW,CAAC,CAAC,AAAC,EAAM,EAAK,EAAE,EAAI,EAEvC,GAAO,EACP,EAAG,CAAC,CAAG,EAAM,EAAG,CAAC,CAAG,EAAM,EAAG,CAAC,CAAG,EAAG,EAAG,CAAC,CAAG,EAEnD,KACK,CACD,IAAK,IAAI,EAAI,EAAG,CAAC,EAAI,EAAG,EAAI,EAAI,EAAK,GAAK,MAAO,CAE7C,IAAI,GAAI,EAAI,MACR,IAAK,IAEL,CAAC,CAAC,AAAC,EAAM,EAAK,EAAE,CAAG,EACnB,GAAI,GAER,EAAM,EAAM,EAAG,EAAM,EAAG,EAAI,QAAQ,CAAC,EAAG,IAC5C,CACA,EAAG,CAAC,CAAG,CACX,CACA,OAAO,EAAI,EAAG,EAAG,EAAM,EAAK,GAAO,EACvC,EAEI,EAAqB,AAAC,WAEtB,IAAK,IADDG,EAAI,IAAIL,WAAW,KACd,EAAI,EAAG,EAAI,IAAK,EAAE,EAAG,CAE1B,IADA,IAAI,EAAI,EAAG,EAAI,EACR,EAAE,GACL,EAAI,AAAC,CAAK,EAAJ,GAAU,WAAS,EAAM,IAAM,CACzCK,CAAAA,CAAC,CAAC,EAAE,CAAG,CACX,CACA,OAAOA,CACX,IAEI,EAAM,WACN,IAAI,EAAI,GACR,MAAO,CACH,EAAG,SAAU,CAAC,EAGV,IAAK,IADD,EAAK,EACA,EAAI,EAAG,EAAI,EAAE,MAAM,CAAE,EAAE,EAC5B,EAAK,CAAI,CAAC,AAAM,IAAL,EAAY,CAAC,CAAC,EAAE,CAAC,CAAI,IAAO,EAC3C,EAAI,CACR,EACA,EAAG,WAAc,MAAO,CAAC,CAAG,CAChC,CACJ,EAyBI,EAAO,SAAU,CAAG,CAAE,CAAG,CAAE,CAAG,CAAE,CAAI,CAAE,CAAE,EACxC,GAAI,CAAC,IACD,EAAK,CAAE,EAAG,CAAE,EACR,EAAI,UAAU,EAAE,CAChB,IAAI,EAAO,EAAI,UAAU,CAAC,QAAQ,CAAC,QAC/B,EAAS,IAAI,EAAG,EAAK,MAAM,CAAG,EAAI,MAAM,EAC5C,EAAO,GAAG,CAAC,GACX,EAAO,GAAG,CAAC,EAAK,EAAK,MAAM,EAC3B,EAAM,EACN,EAAG,CAAC,CAAG,EAAK,MAAM,AACtB,CAEJ,OAAO,EAAK,EAAK,AAAa,MAAb,EAAI,KAAK,CAAW,EAAI,EAAI,KAAK,CAAE,AAAW,MAAX,EAAI,GAAG,CAAY,EAAG,CAAC,CAAGH,KAAK,IAAI,CAACA,AAAkD,IAAlDA,KAAK,GAAG,CAAC,EAAGA,KAAK,GAAG,CAAC,GAAIA,KAAK,GAAG,CAAC,EAAI,MAAM,KAAa,GAAO,GAAK,EAAI,GAAG,CAAG,EAAK,EAAM,EACtL,EAmJI,EAAS,SAAU,CAAC,CAAE,CAAC,CAAE,CAAC,EAC1B,KAAO,EAAG,EAAE,EACR,CAAC,CAAC,EAAE,CAAG,EAAG,KAAO,CACzB,EAEI,EAAM,SAAU,CAAC,CAAE,CAAC,EACpB,IAAI,EAAK,EAAE,QAAQ,CAInB,GAHA,CAAC,CAAC,EAAE,CAAG,GAAI,CAAC,CAAC,EAAE,CAAG,IAAK,CAAC,CAAC,EAAE,CAAG,EAAG,CAAC,CAAC,EAAE,CAAG,EAAE,KAAK,CAAG,EAAI,EAAI,AAAe,EAAf,CAAW,GAAX,EAAE,KAAK,AAAI,EAAW,CAAC,CAAC,EAAE,CAAG,EACnF,AAAW,GAAX,EAAE,KAAK,EACP,EAAO,EAAG,EAAGA,KAAK,KAAK,CAAC,IAAII,KAAK,EAAE,KAAK,EAAIA,KAAK,GAAG,IAAM,MAC1D,EAAI,CACJ,CAAC,CAAC,EAAE,CAAG,EACP,IAAK,IAAI,EAAI,EAAG,GAAK,EAAG,MAAM,CAAE,EAAE,EAC9B,CAAC,CAAC,EAAI,GAAG,CAAG,EAAG,UAAU,CAAC,EAClC,CACJ,EAmTO,SAAS,EAAS,CAAI,CAAE,CAAI,EAC3B,AAAC,GACD,GAAO,CAAC,GACZ,IAlSiB,EAkSb,EAAI,IAAO,EAAI,EAAK,MAAM,CAC9B,EAAE,CAAC,CAAC,GACJ,IAAI,EAAI,EAAK,EAAM,EApSU,GAAM,EAAlB,EAoSa,GApSO,QAAQ,CAAG,EAAE,QAAQ,CAAC,MAAM,CAAG,EAAI,GAoSnC,GAAI,EAAI,EAAE,MAAM,CACrD,OAAO,EAAI,EAAG,GAAO,EAAO,EAAG,EAAI,EAAG,EAAE,CAAC,IAAK,EAAO,EAAG,EAAI,EAAG,GAAI,CACvE,CAuWA,IAAI,EAAK,AAAsB,aAAtB,OAAOC,aAA4C,IAAIA,YAE5D,GAAK,AAAsB,aAAtB,OAAOC,aAA4C,IAAIA,YAGhE,GAAI,CACA,GAAG,MAAM,CAAC,EAAI,CAAE,OAAQ,EAAK,EAEjC,CACA,MAAO,EAAG,CAAE,CAwGL,SAAS,GAAQ,CAAG,CAAE,CAAM,EAC/B,GAAI,EAAQ,CAER,IAAK,IADD,EAAO,IAAI,EAAG,EAAI,MAAM,EACnB,EAAI,EAAG,EAAI,EAAI,MAAM,CAAE,EAAE,EAC9B,CAAI,CAAC,EAAE,CAAG,EAAI,UAAU,CAAC,GAC7B,OAAO,CACX,CACA,GAAI,EACA,OAAO,EAAG,MAAM,CAAC,GAKrB,IAAK,IAJD,EAAI,EAAI,MAAM,CACd,EAAK,IAAI,EAAG,EAAI,MAAM,CAAI,GAAI,MAAM,EAAI,IACxC,EAAK,EACL,EAAI,SAAU,CAAC,EAAI,CAAE,CAAC,IAAK,CAAG,CAAG,EAC5B,EAAI,EAAG,EAAI,EAAG,EAAE,EAAG,CACxB,GAAI,EAAK,EAAI,EAAG,MAAM,CAAE,CACpB,IAAI,EAAI,IAAI,EAAG,EAAK,EAAK,CAAC,EAAI,GAAM,IACpC,EAAE,GAAG,CAAC,GACN,EAAK,CACT,CACA,IAAI,EAAI,EAAI,UAAU,CAAC,EACnB,GAAI,KAAO,EACX,EAAE,IACG,EAAI,KACT,EAAE,IAAO,GAAK,IACT,EAAI,OAAS,EAAI,MACtB,CACI,EAAE,IAAO,AADb,GAAI,MAAS,CAAI,QAAJ,CAAa,EAAM,AAAsB,KAAtB,EAAI,UAAU,CAAC,EAAE,EAAS,GACxC,IAAM,EAAE,IAAO,AAAC,GAAK,GAAM,GAAgD,EAE7F,EAAE,IAAO,GAAK,IAAM,EAAE,IAAO,AAAC,GAAK,EAAK,KAAM,EAAE,IAAO,AAAI,GAAJ,GAC/D,CACA,OAAO,EAAI,EAAI,EAAG,EACtB,CAiuBS,AAAyB,YAAzB,OAAOC,gBAA+BA,sCC39E/C,EAAO,OAAO,CAAG,CACf,KAAM,AAJI,EAAQ,OACT,CAAC,aAAc,OAAQ,OAAQ,OAAQ,WAAY,MAAO,SAAS,CAI9E,oBCYA,EAAO,OAAO,CAjBC,CACb,kBAAmB,CACjB,EAAG,CAAC,OAAQ,OAAQ,SAAU,QAAS,aAAa,CACpD,OAAQ,CAAC,kBAAmB,cAAe,MAAM,CACjD,IAAK,CAAC,MAAO,MAAO,QAAS,aAAa,AAC5C,EACA,eAAgB,CAAC,EACjB,eAAgB,CAAC,OAAQ,QAAS,SAAS,CAC3C,YAAa,CACX,IAAK,OAAQ,UAAW,IAAK,aAAc,KAAM,UAAW,OAAQ,MAAO,UAAW,MAAO,KAC7F,KAAM,KAAM,KAAM,KAAM,KAAM,KAAM,KAAM,IAAK,MAAO,MAAO,MAAO,KAAM,OAAQ,OAClF,KAAM,IAAK,MAAO,UAAW,OAAQ,SAAU,SAAU,MAAO,UAAW,MAAO,QAClF,QAAS,KAAM,KAAM,QAAS,KAAM,IAAK,KAC1C,CACD,OAAQ,IACV,yBCZA,EAAO,OAAO,CAAG,CACf,MAAO,AAJG,EAAQ,OACR,CAAC,OAAQ,KAAM,MAAO,KAAM,MAAO,MAAO,QAAS,OAAQ,WAAY,OAAQ,OAAO,CAIlG,yBCLS,EAAQ,OACjB,IAAI,EAAS,EAAQ,OACjB,EAAS,EAAQ,OACjB,EAAY,EAAQ,MACpB,EAAW,EAAQ,MAEvB,SAAS,EAAQ,CAAI,CAAE,CAAO,CAAE,CAAM,EACpC,IAAI,EAAS,EAAE,CAMf,OAFA,EAAO,EAFO,EAAU,EADJ,AAAW,KAAX,EAAkB,EAAU,EAAO,CAAC,EAAG,EAAU,KAK9D,EAAO,IAAI,CAAC,GACrB,CAEA,EAAO,QAAQ,CAAG,EAClB,EAAO,OAAO,CAAG,qBCjBjB,EAAO,OAAO,CAAG,SAAoB,CAAM,EACzC,MAAO,AAAkB,UAAlB,OAAO,EAAsB,EAAO,WAAW,GAAK,CAC7D,yBCFA,IAAI,EAAK,EAAQ,OACb,EAAY,EAAQ,OACP,EAAQ,OACzB,IAAI,EAAW,EAAQ,OACnB,EAAS,6FACT,EAAO,4BACP,EAAS,0EACT,EAAO,KACP,EAAU,SA8Hd,GAAO,OAAO,CApHd,SAAiB,CAAI,CAAE,CAAO,EAK5B,IAJA,IARI,EAUA,EAFA,GAPJ,CADI,EAAQ,EAAE,EACR,QAAQ,CAAG,WACf,OAAO,CAAK,CAAC,EAAM,MAAM,CAAG,EAAE,AAChC,EACO,GAKH,EAAO,EAGJ,IACL,AAIF,WACE,EAAQ,GAYJ,AAAsB,YAAtB,EAAK,MAAM,CAAC,EAAG,GACjB,AAkBJ,WACE,IAAI,EAAQ,EAAK,OAAO,CAAC,UACrB,GAAS,IACP,EAAQ,OAAO,EACjB,EAAQ,OAAO,CAAC,EAAK,SAAS,CAAC,EAAG,IAEpC,EAAO,EAAK,SAAS,CAAC,EAAQ,GAC9B,EAAQ,GAEZ,IA1Ba,EAAQ,IAAI,CAAC,GACtB,EAAU,EAAM,GACP,EAAK,IAAI,CAAC,IACnB,EAAU,EAAQ,GAEpB,AAuBF,WACE,GAAK,GAIL,IADI,EACA,EAAQ,EAAK,OAAO,CAAC,IACrB,IAAS,GACX,EAAO,EAAK,SAAS,CAAC,EAAG,GACzB,EAAO,EAAK,SAAS,CAAC,KAEtB,EAAO,EACP,EAAO,IAEL,EAAQ,KAAK,EACf,EAAQ,KAAK,CAAC,GAElB,IAvDE,IAAI,EAAO,IAAS,EACpB,EAAO,EAEH,GACF,GAAO,EAAC,CAEZ,IAaA,SAAS,EAAWhB,CAAK,CAAE,CAAM,EAC/B,IAAI,EAAQ,EAAK,KAAK,CAACA,GACnB,IACF,EAAO,EAAK,SAAS,CAAC,CAAK,CAAC,EAAE,CAAC,MAAM,EACrC,CAAK,CAAC,EAAE,CAAC,OAAO,CAACA,EAAO,GACxB,EAAQ,GAEZ,CA+BA,SAAS,EAAeY,CAAG,CAAE,CAAO,CAAE,CAAI,CAAEK,CAAK,EAC/C,IAAI,EAAQ,CAAC,EACT,EAAM,EAAU,GAChB,EAAI,EAAS,KAAK,CAAC,EAAI,EAAI,CAAC,CAACA,EAEjC,EAAK,OAAO,CAAC,EASb,SAAuB,CAAK,CAAE,CAAI,CAAE,CAAiB,CAAE,CAAiB,CAAE,CAAa,EACjF,AAAsB,KAAK,IAA3B,GAAgC,AAAsB,KAAK,IAA3B,GAAgC,AAAkB,KAAK,IAAvB,EAClE,CAAK,CAAC,EAAK,CAAG,KAAK,EAEnB,CAAK,CAAC,EAAK,CAAG,EAAG,MAAM,CAAC,GAAqB,GAAqB,GAAiB,GAEvF,GAbI,AAAC,GACH,EAAM,IAAI,CAAC,GAET,EAAQ,KAAK,EACf,EAAQ,KAAK,CAAC,EAAK,EAAO,EAU9B,CAEA,SAAS,EAAaL,CAAG,CAAE,CAAO,EAEhC,IADI,EACA,EAAM,EACNM,EAAM,EAAU,GACpB,GAAIA,EACF,IAAK,EAAM,EAAM,MAAM,CAAG,EAAG,GAAO,GAC9B,CAAK,CAAC,EAAI,GAAKA,EADkB,KAMzC,GAAI,GAAO,EAAG,CACZ,IAAK,EAAI,EAAM,MAAM,CAAG,EAAG,GAAK,EAAK,IAC/B,EAAQ,GAAG,EACb,EAAQ,GAAG,CAAC,CAAK,CAAC,EAAE,CAGxB,GAAM,MAAM,CAAG,CACjB,CACF,CAzGA,GA0GF,wBCpIA,IAAI,EAAK,EAAQ,OACb,EAAY,EAAQ,OACpBC,EAAa,EAAQ,OACrB,EAAW,EAAQ,MAsIvB,GAAO,OAAO,CApId,SAAoB,CAAM,CAAE,CAAO,EAGjC,IADI,EACA,EAAI,GAAW,CAAC,EAIpB,OAFA,IAEO,CACL,MASF,SAAgBP,CAAG,CAAE,CAAK,CAAE,CAAK,EAC/B,IAAI,EAAM,EAAUA,GAEpB,GAAI,EAAQ,QAAQ,EAGhB,AAAuC,KAAvC,AAAC,GAAE,WAAW,EAAI,EAAE,AAAD,EAAG,OAAO,CAAC,IAG9B,EAAE,MAAM,EAAI,CAAC,EAAE,MAAM,CAAC,CAAE,IAAK,EAAK,MAAO,CAAM,GAN7B,YACpB,AAuFJ,SAAiBA,CAAG,GACd,EAAS,KAAK,CAACA,EAAI,GAGnB,AAAqB,KAArB,EAAQ,QAAQ,CAClB,EAAU,CAAE,SAAUA,EAAK,MAAO,CAAE,EAC3B,EAAQ,QAAQ,GAAKA,GAC9B,EAAQ,KAAK,GAEjB,EAhGW,GAST,EAAI,KACJ,EAAI,GACJT,OAAO,IAAI,CAAC,GAAO,OAAO,CAG1B,SAAgB,CAAG,EACjB,IAAI,EAAQ,CAAK,CAAC,EAAI,CAClB,EAAY,AAAC,GAAE,cAAc,EAAI,CAAC,EAAE,CAAC,EAAI,EAAI,EAAE,CAC/C,EAAU,AAAC,GAAE,iBAAiB,EAAI,CAAC,EAAE,CAAC,EAAI,EAAI,EAAE,CAEhD,EAAO,EAAU,IACjB,AAAS,UAAT,GAAoB,AAA0B,KAA1B,EAAQ,OAAO,CAAC,GAE9B,AADR,GAAQ,EAAM,KAAK,CAAC,KAAK,MAAM,CAcjC,SAAuB,CAAS,EAC9B,OAAO,GAAa,AAAiC,KAAjC,EAAU,OAAO,CAAC,EACxC,GAhBgD,IAAI,CAAC,KAAK,IAAI,EAAC,EAC/C,MAAM,CAEZ,AAA0B,KAA1B,EAAQ,OAAO,CAAC,IAAiBgB,CAAAA,AAA0B,KAA1BA,EAAW,IAAI,CAAC,EAAK,EAAa,AAiCjF,SAAkBP,CAAI,EACpB,IAAI,EAAQA,CAAI,CAAC,EAAE,CACnB,GAAI,AAAU,MAAV,GAAiB,AAAU,MAAV,EACnB,MAAO,GAET,IAAI,EAAQA,EAAK,OAAO,CAAC,KACzB,GAAI,AAAU,KAAV,EACF,MAAO,GAET,IAAI,EAAeA,EAAK,OAAO,CAAC,KAChC,GAAI,AAAiB,KAAjB,GAAuB,EAAQ,EACjC,MAAO,GAET,IAAI,EAAOA,EAAK,OAAO,CAAC,YACxB,AAAa,KAAT,GAAe,EAAQ,GAGpB,EAAE,cAAc,CAAC,IAAI,CAE5B,SAAkB,CAAM,EACtB,OAAOA,AAA+B,IAA/BA,EAAK,OAAO,CAAC,EAAS,IAC/B,EACF,EAvDyF,EAAK,KAGxF,EAAI,KACJ,EAAI,GACiB,UAAjB,OAAO,IACT,EAAI,MACJ,EAAI,EAAG,MAAM,CAAC,IACd,EAAI,MAMV,GA1BA,EAAI,EAAQ,KAAO,IA2BrB,EAnDE,IAqDF,SAAcA,CAAG,EACf,IAAI,EAAM,EAAUA,EACiC,MAAvC,AAAC,GAAE,WAAW,EAAI,EAAE,AAAD,EAAG,OAAO,CAAC,IAEtC,AAAqB,KAArB,EAAQ,QAAQ,EAClB,EAAI,MACJ,EAAI,GACJ,EAAI,MAEJ,AAgDN,SAAmBA,CAAG,EAChB,EAAQ,QAAQ,GAAKA,GACnB,EAAE,EAAQ,KAAK,EAAI,GACrB,GAGN,EAtDe,EAKf,EAlEE,MA4FF,SAAgBA,CAAI,EACd,AAAqB,KAArB,EAAQ,QAAQ,EAClB,EAAI,EAAE,aAAa,CAAG,EAAE,aAAa,CAACA,GAAQA,EAElD,CA/FA,EAEA,SAAS,EAAK,CAAK,EACjB,EAAO,IAAI,CAAC,EACd,CAgHA,SAAS,IACP,EAAU,CAAE,SAAU,GAAO,MAAO,CAAE,CACxC,CACF,qBCvIA,IAAI,EAAU,CACZ,IAAK,QACL,IAAK,OACL,IAAK,OACL,IAAK,SACL,IAAK,OACP,EACI,EAAY,CACd,QAAS,IACT,OAAQ,IACR,OAAQ,IACR,SAAU,IACV,QAAS,GACX,EACI,EAAW,kCACX,EAAa,WAEjB,SAAS,EAAgB,CAAK,EAC5B,OAAO,CAAO,CAAC,EAAM,AACvB,CACA,SAAS,EAAkB,CAAK,EAC9B,OAAO,CAAS,CAAC,EAAM,AACzB,CAEA,SAAS,EAAYA,CAAI,EACvB,OAAOA,AAAQ,MAARA,EAAe,GAAKR,OAAOQ,GAAM,OAAO,CAAC,EAAY,EAC9D,CAEA,SAAS,EAAc,CAAI,EACzB,OAAO,AAAQ,MAAR,EAAe,GAAKR,OAAO,GAAM,OAAO,CAAC,EAAU,EAC5D,CAEA,EAAW,OAAO,CAAG,EAAa,OAAO,CAAG,CAAC,EAE7C,EAAO,OAAO,CAAG,CACf,OAAQ,EACR,OAAQ,EACR,OAAQ,EACR,SAAU,EACV,QAAS,eACX,qBCpCA,SAAS,EAAO,CAAW,CAAE,CAAI,EAE/B,OADA,CAAW,CAAC,EAAK,CAAG,GACb,CACT,CAEA,EAAO,OAAO,CATd,SAAgB,CAAI,EAClB,OAAO,EAAK,MAAM,CAAC,EAAO,CAAC,EAC7B,4ECGO,IAAMgB,WAAN,MAAMA,WAMT,YAAY,CAAK,CAAE,CACf,IAAI,CAAC,KAAK,CAAG,CACjB,CAIA,SAAU,CACN,OAAO,IAAI,CAAC,KAAK,AACrB,CACJ,EAIO,IAAMC,WAAN,MAAMA,mBAAmBD,WAK5B,YAAY,EAAQ,KAAK,CAAE,CACvB,KAAK,CAAC,EACV,CAIA,SAAS,CAAK,CAAE,CACZ,MAAO,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,AAC5B,CACJ,EAQO,IAAME,aAAN,MAAMA,qBAAqBF,WAQ9B,YAAY,CAAK,CAAE,EAAO,CAAC,CAAC,CAAE,CAC1B,KAAK,CAAC,GACN,IAAI,CAAC,IAAI,CAAG,CAChB,CAIA,SAAS,CAAK,CAAE,CACZ,GAAI,EACA,GAAI,CAEA,OAAO,AADI,EAAM,iBAAiB,CAACG,KAAK,YAAY,CAAE,IAAI,CAAC,IAAI,EACrD,MAAM,CAAC,IAAI,CAAC,KAAK,CAC/B,CACA,MAAO,EAAK,CACR,EAAM,WAAW,CAAC,EACtB,CAEJ,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,GAC/B,CACJ,EASO,IAAMC,eAAN,MAAMA,uBAAuBJ,WAChC,OAAO,cAAc,CAAK,CAAE,CACxB,GAAqB,UAAjB,OAAO,GAEP,aAAiBP,KADjB,MAAO,GAGX,GAAI,aAAiBO,WACjB,OAAOI,eAAe,aAAa,CAAC,EAAM,OAAO,IAErD,GAAI,aAAcC,WAAY,CAE1B,IAAM,EAAYA,WAAW,QAAQ,CACrC,GAAI,aAAiB,EAAU,OAAO,EAClC,aAAiB,EAAU,aAAa,EACxC,aAAiB,EAAU,SAAS,EACpC,aAAiB,EAAU,aAAa,EACxC,aAAiB,EAAU,SAAS,EACpC,aAAiB,EAAU,cAAc,CACzC,MAAO,EAEf,CACA,MAAO,EACX,CAQA,YAAY,CAAK,CAAE,EAAO,CAAC,CAAC,CAAE,CAEtB,aAAiBD,gBACjB,EAAO,CAAE,GAAG,EAAM,IAAI,CAAE,GAAG,CAAI,AAAC,EAChC,EAAQ,EAAM,KAAK,EAEd,aAAiBJ,YACtB,GAAQ,EAAM,OAAO,EAAC,EAGtB,AAAiB,UAAjB,OAAO,GACP,eAAgB,GAChB,AAAkB,SAAlB,EAAK,QAAQ,EACb,GAAO,CAAE,GAAG,CAAI,CAAE,SAAU,EAAM,UAAU,AAAC,GAEjD,KAAK,CAAC,GACN,IAAI,CAAC,IAAI,CAAG,CAChB,CACA,CAACM,OAAO,WAAW,CAAC,CAAC,CAAI,CAAE,CACvB,MAAO,AAAS,WAAT,EAAoB,IAAI,CAAC,QAAQ,GAAK,IAAI,CAAC,QAAQ,EAC9D,CAMA,UAAW,CACP,IAAM,EAAQ,IAAI,CAAC,KAAK,CACxB,GAAI,AAAiB,UAAjB,OAAO,EACP,OAAO,EACX,GAAI,aAAiBb,KACjB,OAAO,EAAM,OAAO,GACxB,GAAI,sBAAuB,EACvB,OAAO,EAAM,iBAAiB,CAElC,GAAI,oBAAqB,EACrB,OAAO,EAAM,eAAe,CAAC,OAAO,iBAAiB,AAEzD,OAAM,AAAIc,UAAU,4CACxB,CAIA,SAAS,CAAK,CAAE,CACZ,GAAI,EACA,GAAI,CAEA,OAAO,AADK,EAAM,iBAAiB,CAACJ,KAAK,cAAc,CAAE,IAAI,CAAC,IAAI,EACvD,MAAM,CAAC,IAAI,CAAC,KAAK,CAChC,CACA,MAAO,EAAK,CACR,EAAM,WAAW,CAAC,EACtB,OAEJ,AAAI,AAAsB,UAAtB,OAAO,IAAI,CAAC,KAAK,EAAiB,IAAI,CAAC,KAAK,YAAYV,KACjD,IAAIA,KAAK,IAAI,CAAC,KAAK,EAAE,WAAW,GAEpC,IAAI,CAAC,KAAK,CAAC,QAAQ,EAC9B,CACJ,ECtHA,SAAS,EAAW,CAAK,CAAE,CAAQ,CAAE,CAAI,SACrC,AAAI,CAAQ,CAAC,EAAK,CACP,EAAe,EAAO,CAAQ,CAAC,EAAK,CAAC,KAAK,GAErD,EAAM,WAAW,CAAC,AAAIe,WAAW,eAC1B,IAAIP,WACf,CAEA,SAAS,EAAa,CAAK,CAAE,CAAI,EAC7B,IAAM,EAAa,EAAE,CACf,EAAQlB,OAAO,MAAM,CAAC,MAC5B,IAAK,IAAM,KAAO,EACV,AAAa,SAAb,EAAI,IAAI,CACR,CAAK,CAAC,EAAI,IAAI,CAAC,CAAG,EAAkB,EAAO,EAAI,KAAK,EAGpD,EAAW,IAAI,CAAC,EAAkB,EAAO,IAGjD,MAAO,CAAE,aAAY,OAAM,CAC/B,CAEA,SAAS,EAAkB,CAAK,CAAE,CAAI,EAClC,OAAQ,EAAK,IAAI,EACb,IAAK,MACD,OAAO,EAAK,KAAK,AACrB,KAAK,MACD,OAAO,IAAImB,aAAa,EAAK,KAAK,CAAE,CAChC,sBAAuB,EAAK,SAAS,AACzC,EACJ,KAAK,MACD,OAAO,AAcnB,SAAkC,CAAK,CAAE,CAAE,MAAI,CAAE,EAC7C,IAAI,EACJ,GAAI,EAAM,MAAM,CAEZ,IAAInB,OAAO,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,EAAM,MAAM,CAAE,GAInD,OAAO,IAAIkB,WAAW,CAAC,CAAC,EAAE,EAAK,CAAC,OAHhC,EAAM,EAAM,MAAM,CAAC,EAAK,MAM3B,IAAI,GAAM,IAAI,EACflB,OAAO,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,EAAM,IAAI,CAAE,EAAI,EAOrD,OADA,EAAM,WAAW,CAAC,AAAI0B,eAAe,CAAC,mBAAmB,EAAE,EAAK,CAAC,GAC1D,IAAIR,WAAW,CAAC,CAAC,EAAE,EAAK,CAAC,EAJhC,EAAM,EAAM,IAAI,CAAC,EAAK,CAO1B,GAAI,aAAeD,WACf,OAAO,EAGX,OAAQ,OAAO,GACX,IAAK,SACD,OAAO,CACX,KAAK,SACD,OAAO,IAAIE,aAAa,EAC5B,KAAK,SACD,GAAIE,eAAe,aAAa,CAAC,GAC7B,OAAO,IAAIA,eAAe,EAGlC,SAEI,OADA,EAAM,WAAW,CAAC,AAAIG,UAAU,CAAC,8BAA8B,EAAE,EAAK,EAAE,EAAE,OAAO,EAAI,CAAC,GAC/E,IAAIN,WAAW,CAAC,CAAC,EAAE,EAAK,CAAC,CACxC,CACJ,EAtD4C,EAAO,EAC3C,KAAK,OACD,OAAO,AAsDnB,SAAiC,CAAK,CAAE,CAAE,MAAI,CAAE,MAAI,CAAE,EAClD,IAAM,EAAU,EAAM,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,GAC3C,GAAI,CAAC,EAED,OADA,EAAM,WAAW,CAAC,AAAIQ,eAAe,CAAC,iBAAiB,EAAE,EAAK,CAAC,GACxD,IAAIR,WAAW,GAE1B,GAAI,EAAM,CACN,IAAM,EAAY,EAAQ,UAAU,CAAC,EAAK,QAC1C,AAAI,EACO,EAAe,EAAO,IAEjC,EAAM,WAAW,CAAC,AAAIQ,eAAe,CAAC,mBAAmB,EAAE,EAAK,CAAC,GAC1D,IAAIR,WAAW,CAAC,EAAE,EAAK,CAAC,EAAE,EAAK,CAAC,EAC3C,QACA,AAAI,EAAQ,KAAK,CACN,EAAe,EAAO,EAAQ,KAAK,GAE9C,EAAM,WAAW,CAAC,AAAIQ,eAAe,CAAC,UAAU,EAAE,EAAK,CAAC,GACjD,IAAIR,WAAW,GAC1B,EAzE2C,EAAO,EAC1C,KAAK,OACD,OAAO,AAyEnB,SAA8B,CAAK,CAAE,CAAE,MAAI,CAAE,MAAI,CAAE,MAAI,CAAE,EACrD,IAAM,EAAK,CAAC,CAAC,EAAE,EAAK,CAAC,CACf,EAAO,EAAM,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,GACrC,GAAI,CAAC,EAED,OADA,EAAM,WAAW,CAAC,AAAIQ,eAAe,CAAC,cAAc,EAAE,EAAG,CAAC,GACnD,IAAIR,WAAW,GAE1B,GAAI,EAAM,CACN,IAAM,EAAY,EAAK,UAAU,CAAC,EAAK,CACvC,GAAI,EAAW,CAEX,EAAM,MAAM,CAAG,EAAa,EAAO,GAAM,KAAK,CAC9C,IAAM,EAAW,EAAe,EAAO,GAEvC,OADA,EAAM,MAAM,CAAG,KACR,CACX,CAEA,OADA,EAAM,WAAW,CAAC,AAAIQ,eAAe,CAAC,mBAAmB,EAAE,EAAK,CAAC,GAC1D,IAAIR,WAAW,CAAC,EAAE,EAAG,CAAC,EAAE,EAAK,CAAC,CACzC,CACA,EAAM,MAAM,CAAG,EAAa,EAAO,GAAM,KAAK,CAC9C,IAAM,EAAW,EAAe,EAAO,EAAK,KAAK,EAEjD,OADA,EAAM,MAAM,CAAG,KACR,CACX,EAhGwC,EAAO,EACvC,KAAK,OACD,OAAO,AAgGnB,SAAkC,CAAK,CAAE,CAAE,MAAI,CAAE,MAAI,CAAE,EAGnD,IAAI,EAAO,EAAM,MAAM,CAAC,UAAU,CAAC,EAAK,CACxC,GAAI,CAAC,EAED,OADA,EAAM,WAAW,CAAC,AAAIQ,eAAe,CAAC,kBAAkB,EAAE,EAAK,EAAE,CAAC,GAC3D,IAAIR,WAAW,CAAC,EAAE,EAAK,EAAE,CAAC,EAErC,GAAI,AAAgB,YAAhB,OAAO,EAEP,OADA,EAAM,WAAW,CAAC,AAAIM,UAAU,CAAC,SAAS,EAAE,EAAK,kBAAkB,CAAC,GAC7D,IAAIN,WAAW,CAAC,EAAE,EAAK,EAAE,CAAC,EAErC,GAAI,CACA,IAAIrB,EAAW,EAAa,EAAO,GACnC,OAAO,EAAKA,EAAS,UAAU,CAAEA,EAAS,KAAK,CACnD,CACA,MAAO,EAAK,CAER,OADA,EAAM,WAAW,CAAC,GACX,IAAIqB,WAAW,CAAC,EAAE,EAAK,EAAE,CAAC,CACrC,CACJ,EApH4C,EAAO,EAC3C,KAAK,SACD,OAAO,AAoHnB,SAAiC,CAAK,CAAE,CAAE,UAAQ,CAAE,UAAQ,CAAE,MAAI,CAAE,EAChE,IAAI,EAAM,EAAkB,EAAO,GACnC,GAAI,aAAeA,WACf,OAAO,EAAW,EAAO,EAAU,GAGvC,IAAK,IAAM,KAAW,EAAU,KAvLrB,EAAO,EAAU,EAwLxB,IAAM,EAAM,EAAkB,EAAO,EAAQ,GAAG,EAChD,GAzLO,EAyLG,EAzLI,EAyLG,EAxLrB,CAD4B,EAyLF,KAxLd,GAKR,aAAeC,cACf,aAAoBA,cACpB,EAAI,KAAK,GAAK,EAAS,KAAK,EAG5B,aAAoBA,cAAgB,AAAe,UAAf,OAAO,GAIvC,IAHW,EACV,iBAAiB,CAACC,KAAK,WAAW,CAAE,EAAS,IAAI,EACjD,MAAM,CAAC,EAAS,KAAK,GAKvB,EAuKC,OAAO,EAAe,EAAO,EAAQ,KAAK,CAElD,CACA,OAAO,EAAW,EAAO,EAAU,EACvC,EAjI2C,EAAO,EAC1C,SACI,OAAO,IAAIF,UACnB,CACJ,CA+HO,SAAS,EAAsB,CAAK,CAAE,CAAG,EAC5C,GAAI,EAAM,KAAK,CAAC,GAAG,CAAC,GAEhB,OADA,EAAM,WAAW,CAAC,AAAIO,WAAW,qBAC1B,IAAIP,WAGf,EAAM,KAAK,CAAC,GAAG,CAAC,GAChB,IAAM,EAAS,EAAE,CAGX,EAAe,EAAM,MAAM,CAAC,aAAa,EAAI,EAAI,MAAM,CAAG,EAChE,IAAK,IAAM,KAAQ,EAAK,CACpB,GAAI,AAAgB,UAAhB,OAAO,EAAmB,CAC1B,EAAO,IAAI,CAAC,EAAM,MAAM,CAAC,UAAU,CAAC,IACpC,QACJ,CAEA,GADA,EAAM,UAAU,GACZ,EAAM,UAAU,CAtNL,IA4NX,MALA,EAAM,KAAK,CAAC,MAAM,CAAC,GAKb,AAAIO,WAAW,iCAAiC,EAAM,UAAU,sBAAI,CAG1E,IACA,EAAO,IAAI,CA9NX,KAgOJ,EAAO,IAAI,CAAC,EAAkB,EAAO,GAAM,QAAQ,CAAC,IAChD,GACA,EAAO,IAAI,CAjOX,IAmOR,CAEA,OADA,EAAM,KAAK,CAAC,MAAM,CAAC,GACZ,EAAO,IAAI,CAAC,GACvB,CAKA,SAAS,EAAe,CAAK,CAAE,CAAK,QAEhC,AAAI,AAAiB,UAAjB,OAAO,EACA,EAAM,MAAM,CAAC,UAAU,CAAC,GAE5B,EAAsB,EAAO,EACxC,CC/QO,IAAME,MAAN,MAAMA,MACT,YAAY,CAAM,CAAE,CAAM,CAAE,CAAI,CAAE,CAM9B,IAAI,CAAC,KAAK,CAAG,IAAIC,QAEjB,IAAI,CAAC,MAAM,CAAG,KAMd,IAAI,CAAC,UAAU,CAAG,EAClB,IAAI,CAAC,MAAM,CAAG,EACd,IAAI,CAAC,MAAM,CAAG,EACd,IAAI,CAAC,IAAI,CAAG,CAChB,CACA,YAAY,CAAK,CAAE,CACf,GAAI,CAAC,IAAI,CAAC,MAAM,EAAI,CAAE,cAAiBC,KAAI,EACvC,MAAM,EAEV,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EACrB,CACA,kBAAkB,CAAI,CAAE,CAAI,CAAE,CAC1B,IAAI,EAAQ,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,GAC9B,IACD,EAAQ,CAAC,EACT,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,EAAM,IAEjC,IAAI,EAAKC,KAAK,SAAS,CAAC,GAMxB,OALI,AAAC,CAAK,CAAC,EAAG,EAGV,EAAK,CAAC,EAAG,CAAG,IAAI,EAAK,IAAI,CAAC,MAAM,CAAC,OAAO,CAAE,EAAI,EAE3C,CAAK,CAAC,EAAG,AACpB,CACJ,EC3BA,SAAS,EAAO,CAAI,CAAE,CAAO,EACzB,IAAM,EAAY9B,OAAO,MAAM,CAAC,MAChC,IAAK,GAAM,CAAC,EAAMQ,EAAI,GAAIR,OAAO,OAAO,CAAC,GACjC,EAAQ,QAAQ,CAAC,IACjB,EAAS,CAAC,EAAK,CAAGQ,EAAI,OAAO,EAAC,EAGtC,OAAO,CACX,CACA,IAAM,EAAiB,CACnB,cACA,kBACA,cACA,uBACA,wBACA,wBACA,2BACA,2BACH,CA6BM,SAAS,EAAO,CAAI,CAAE,CAAI,EAC7B,IAAI,EAAM,CAAI,CAAC,EAAE,CACjB,GAAI,aAAeU,WACf,OAAO,IAAIA,WAAW,CAAC,OAAO,EAAE,EAAI,OAAO,GAAG,CAAC,CAAC,EAEpD,GAAI,aAAeC,aACf,OAAO,IAAIA,aAAa,EAAI,OAAO,GAAI,CACnC,GAAG,EAAI,IAAI,CACX,GAAG,EAAO,EAAM,EAAe,AACnC,GAEJ,GAAI,aAAeE,eACf,OAAO,IAAIF,aAAa,EAAI,QAAQ,GAAI,CACpC,GAAG,EAAO,EAAM,EAAe,AACnC,EAEJ,OAAM,AAAIK,UAAU,6BACxB,CACA,IAAM,EAAmB,CACrB,YACA,YACA,yBACA,YACA,SACA,UACA,MACA,OACA,QACA,MACA,OACA,SACA,SACA,eACH,CAmCM,SAAS,EAAS,CAAI,CAAE,CAAI,EAC/B,IAAI,EAAM,CAAI,CAAC,EAAE,CACjB,GAAI,aAAeN,WACf,OAAO,IAAIA,WAAW,CAAC,SAAS,EAAE,EAAI,OAAO,GAAG,CAAC,CAAC,EAEtD,GAAI,aAAeG,gBAAkB,aAAeF,aAChD,OAAO,IAAIE,eAAe,EAAK,EAAO,EAAM,GAEhD,OAAM,AAAIG,UAAU,+BACxB,CCzIA,IAAM,EAAQ,IAAIO,ICSX,IAAMC,aAAN,MAAMA,aAqBT,YAAY,CAAO,CAAE,CAAE,WAAS,CAAE,eAAe,EAAI,CAAE,YAAY,AAAC,GAAM,CAAC,CAAG,CAAG,CAAC,CAAC,CAAE,CAEjF,IAAI,CAAC,MAAM,CAAG,IAAID,IAElB,IAAI,CAAC,SAAS,CAAG,IAAIA,IACrB,IAAI,CAAC,OAAO,CAAGjC,MAAM,OAAO,CAAC,GAAW,EAAU,CAAC,EAAQ,CAC3D,IAAI,CAAC,UAAU,CAAG,CACd,OAAM,EACN,SAAQ,EACR,GAAG,CAAS,AAChB,EACA,IAAI,CAAC,aAAa,CAAG,EACrB,IAAI,CAAC,UAAU,CAAG,EAClB,IAAI,CAAC,MAAM,CAAG,AD1Cf,SAA8B,CAAO,EACxC,IAAM,EAAeA,MAAM,OAAO,CAAC,GAAW,EAAQ,IAAI,CAAC,KAAO,EAC9D,EAAW,EAAM,GAAG,CAAC,GAKzB,OAJiB,SAAb,IACA,EAAW,IAAIiC,IACf,EAAM,GAAG,CAAC,EAAc,IAErB,CACX,ECkC2C,EACvC,CAMA,WAAW,CAAE,CAAE,CACX,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAC9B,CAUA,WAAW,CAAE,CAAE,CACX,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAC9B,CAeA,YAAY,CAAG,CAAE,CAAE,iBAAiB,EAAK,CAAG,CAAG,CAAC,CAAC,CAAE,CAC/C,IAAM,EAAS,EAAE,CACjB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAI,IAAI,CAAC,MAAM,CAAE,IAAK,CACtC,IAAI,EAAQ,EAAI,IAAI,CAAC,EAAE,CACvB,GAAI,EAAM,EAAE,CAAC,UAAU,CAAC,KAAM,CAG1B,GAAI,AAAmB,KAAnB,GAA4B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAM,EAAE,EAAG,CACvD,EAAO,IAAI,CAAC,AAAIF,MAAM,CAAC,uCAAuC,EAAE,EAAM,EAAE,CAAC,CAAC,CAAC,GAC3E,QACJ,CACA,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAM,EAAE,CAAE,EAC9B,KACK,CACD,GAAI,AAAmB,KAAnB,GAA4B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAM,EAAE,EAAG,CAC1D,EAAO,IAAI,CAAC,AAAIA,MAAM,CAAC,0CAA0C,EAAE,EAAM,EAAE,CAAC,CAAC,CAAC,GAC9E,QACJ,CACA,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAM,EAAE,CAAE,EACjC,CACJ,CACA,OAAO,CACX,CA+BA,cAAc,CAAO,CAAE,EAAO,IAAI,CAAE,EAAS,IAAI,CAAE,CAG/C,GAAI,AAAmB,UAAnB,OAAO,EACP,OAAO,IAAI,CAAC,UAAU,CAAC,GAG3B,IAAItB,EAAQ,IAAIoB,MAAM,IAAI,CAAE,EAAQ,GACpC,GAAI,CAEA,OAAO,AADK,EAAsBpB,EAAO,GAC5B,QAAQ,CAACA,EAC1B,CACA,MAAO,EAAK,CACR,GAAIA,EAAM,MAAM,EAAI,aAAesB,MAE/B,OADAtB,EAAM,MAAM,CAAC,IAAI,CAAC,GACX,IAAIW,aAAa,QAAQ,CAACX,EAErC,OAAM,CACV,CACJ,CACJ,ECtJA,IAAM,EAAmB,6BAGnB,EAAqB,2BACrB,EAAmB,SACnB,EAAoB,6BACpB,EAAgB,oBAChB,EAAe,kDACf,EAAmB,qBAOnB,EAAc,gBACd,EAAgB,iBAEhB,EAAmB,aACnB,EAAoB,2CAEpB,EAAsB,OACtB,EAAqB,MAErB,EAAiB,WAEjB,EAAY,QAEZ,EAAmB,QACnB,EAAoB,QACpB,EAAqB,SACrB,EAAsB,UACtB,EAAmB,YACnB,EAAc,YACd,EAAc,WAGd,EAAc,YACd,EAAc,OAIb,IAAM0B,eAAN,MAAMA,eACT,YAAY,CAAM,CAAE,CAChB,IAAI,CAAC,IAAI,CAAG,EAAE,CACd,EAAiB,SAAS,CAAG,EAC7B,IAAI,EAAS,EAGb,OAAa,CACT,IAAI,EAAO,EAAiB,IAAI,CAAC,GACjC,GAAI,AAAS,OAAT,EACA,MAEJ,EAAS,EAAiB,SAAS,CACnC,GAAI,CACA,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,AAkEvB,SAAsB,CAAE,EACpB,IAAI,EAAQ,IACR,EAAa,AAMrB,WACI,IAAI,EAAQjC,OAAO,MAAM,CAAC,MAC1B,KAAO,EAAK,IAAqB,CAC7B,IAAI,EAAO,EAAO,GACd,EAAQ,IACZ,GAAI,AAAU,OAAV,EACA,MAAM,AAAIkC,YAAY,2BAE1B,EAAK,CAAC,EAAK,CAAG,CAClB,CACA,OAAO,CACX,IAhBI,GAAI,AAAU,OAAV,GAAkBlC,AAAmC,IAAnCA,OAAO,IAAI,CAAC,GAAY,MAAM,CAChD,MAAM,AAAIkC,YAAY,wCAE1B,MAAO,CAAE,KAAI,QAAO,YAAW,CACnC,EAzEoC,CAAI,CAAC,EAAE,EACvC,CACA,MAAO,EAAK,CACR,GAAI,aAAeA,YAGf,QAEJ,OAAM,CACV,CACJ,CAcA,SAAS,EAAK,CAAE,EAEZ,OADA,EAAG,SAAS,CAAG,EACR,EAAG,IAAI,CAAC,EACnB,CAGA,SAAS,EAAY,CAAI,CAAE,CAAU,EACjC,GAAI,CAAM,CAAC,EAAO,GAAK,EAEnB,OADA,IACO,GAEX,GAAI,EACA,MAAM,IAAI,EAAW,CAAC,SAAS,EAAE,EAAK,CAAC,EAE3C,MAAO,EACX,CAGA,SAAS,EAAa,CAAE,CAAE,CAAU,EAChC,GAAI,EAAK,GAEL,OADA,EAAS,EAAG,SAAS,CACd,GAEX,GAAI,EACA,MAAM,IAAI,EAAW,CAAC,SAAS,EAAE,EAAG,QAAQ,GAAG,CAAC,EAEpD,MAAO,EACX,CAEA,SAAS,EAAM,CAAE,EACb,EAAG,SAAS,CAAG,EACf,IAAI,EAAS,EAAG,IAAI,CAAC,GACrB,GAAI,AAAW,OAAX,EACA,MAAM,AAAIA,YAAY,CAAC,SAAS,EAAE,EAAG,QAAQ,GAAG,CAAC,EAGrD,OADA,EAAS,EAAG,SAAS,CACd,CACX,CAEA,SAAS,EAAO,CAAE,EACd,OAAO,EAAM,EAAG,CAAC,EAAE,AACvB,CAqBA,SAAS,QACD,EAMJ,GAJI,EAAK,IACL,GAAQ,EAAO,EAAW,EAG1B,AAAmB,MAAnB,CAAM,CAAC,EAAO,EAAY,AAAmB,MAAnB,CAAM,CAAC,EAAO,CAExC,OAAO,EAAqB,EAAQ,CAAC,EAAM,CAAG,EAAE,CAAE,KAItD,IAAI,EAASC,WACb,AAAI,EACA,AAAI,EAGO,EAAqB,CAAC,EAAO,EAAO,CAAE,EAAO,MAAM,GAK9D,EAAO,KAAK,CAAG,EAAK,EAAO,KAAK,CAAE,GAC3B,EAAqB,CAAC,EAAO,CAAE,EAAO,MAAM,GAEvD,AAAI,EAEO,EAAK,EAAO,GAEhB,IACX,CAEA,SAAS,EAAqB,EAAW,EAAE,CAAE,CAAY,EACrD,OAAa,CACT,GAAI,EAAK,GAAc,CACnB,EAAS,IAAI,CAAC,EAAO,IACrB,QACJ,CACA,GAAI,AAAmB,MAAnB,CAAM,CAAC,EAAO,CAAU,CACxB,EAAS,IAAI,CAAC,KACd,QACJ,CACA,GAAI,AAAmB,MAAnB,CAAM,CAAC,EAAO,CACd,MAAM,AAAID,YAAY,4BAE1B,IAAI,EAASC,IACb,GAAI,EAAQ,CACR,EAAS,IAAI,CAAC,GACd,EAAe7B,KAAK,GAAG,CAAC,EAAc,EAAO,MAAM,EACnD,QACJ,CACA,KACJ,CACA,IAAI,EAAY,EAAS,MAAM,CAAG,EAC9B,EAAc,CAAQ,CAAC,EAAU,AAEjC,AAAuB,WAAvB,OAAO,GACP,EAAQ,CAAC,EAAU,CAAG,EAAK,EAAa,EAAkB,EAE9D,IAAI,EAAQ,EAAE,CACd,IAAK,IAAI,KAAW,EACZ,aAAmB8B,QAEnB,GAAU,EAAQ,KAAK,CAAC,KAAK,CAAC,EAAG,EAAQ,KAAK,CAAC,MAAM,CAAG,EAAY,EAEpE,GACA,EAAM,IAAI,CAAC,GAGnB,OAAO,CACX,CACA,SAAS,IACL,EAAa,EAAkBF,aAC/B,IAAI,EAAW,AAenB,SAAS,IACL,GAAI,AAAmB,MAAnB,CAAM,CAAC,EAAO,CAEd,OAAO,IAEX,GAAI,EAAK,GAAe,CACpB,GAAI,EAAG,EAAO,EAAM,EAAO,IAAI,CAAC,CAAG,EAAM,GACzC,GAAI,AAAU,MAAV,EACA,MAAO,CAAE,KAAM,MAAO,MAAK,EAE/B,GAAI,EAAa,GAAmB,CAChC,IAAIlB,EAAO,AAuBvB,WACI,IAAI,EAAO,EAAE,CACb,OAAa,CACT,OAAQ,CAAM,CAAC,EAAO,EAClB,IAAK,IAED,OADA,IACO,CACX,MAAK,OACD,MAAM,AAAIkB,YAAY,yBAC9B,CACA,EAAK,IAAI,CAAC,AAKlB,WACI,IAAI,EAAO,UACX,AAAI,AAAc,SAAd,EAAK,IAAI,CACF,EAEP,EAAa,GAEN,CACH,KAAM,OACN,KAAM,EAAK,IAAI,CACf,MAAO,GACX,EAGG,CACX,KAlBQ,EAAa,EACjB,CACJ,IApCY,GAAI,AAAU,MAAV,EAEA,MAAO,CAAE,KAAM,OAAQ,OAAM,OAAMlB,KAAAA,CAAK,EAE5C,GAAI,EAAiB,IAAI,CAAC,GACtB,MAAO,CAAE,KAAM,OAAQ,OAAMA,KAAAA,CAAK,CAEtC,OAAM,AAAIkB,YAAY,wCAC1B,OACA,AAAI,AAAU,MAAV,EAEO,CACH,KAAM,OACN,OACA,OACA,KAAM,EAAE,AACZ,EAEG,CAAE,KAAM,OAAQ,OAAM,MAAK,CACtC,CACA,OAAO,GACX,IA/CI,GAAI,EAAa,GACb,OAAO,EAEX,GAAI,EAAa,GAAc,CAC3B,IAAI,EAAW,AA2EvB,WACI,IAEI,EAFA,EAAW,EAAE,CACb,EAAQ,EAEZ,KAAO,EAAK,IAAmB,CACvB,EAAY,MACZ,GAAO,CAAI,EAEf,IAAI,EAAM,AAelB,eAEQ,EAWJ,OAZA,EAAa,EAAoBA,aAG7B,EADA,EAAK,GACC,IAGA,CACF,KAAM,MACN,MAAO,EAAO,EAClB,EAEJ,EAAa,EAAqBA,aAC3B,CACX,IA5BY,EAAQ,IACZ,GAAI,AAAU,OAAV,EACA,MAAM,AAAIA,YAAY,yBAE1B,EAAQ,CAAC,IAAQ,CAAG,CAAE,MAAK,OAAM,CACrC,CACA,GAAI,AAAU,IAAV,EACA,OAAO,KAEX,GAAI,AAAS,SAAT,EACA,MAAM,AAAIA,YAAY,4BAE1B,MAAO,CAAE,WAAU,MAAK,CAC5B,IA/FQ,OADA,EAAa,EAAmBA,aACzB,CACH,KAAM,SACN,WACA,GAAG,CAAQ,AACf,CACJ,CACA,MAAM,AAAIA,YAAY,qBAC1B,CAwGA,SAAS,IACL,GAAI,EAAK,GACL,OAAO,IAEX,GAAI,AAAmB,MAAnB,CAAM,CAAC,EAAO,CACP,CAcX,EAAY,IAAKA,aACjB,IAAI,EAAQ,GACZ,OAAa,CAET,GADA,GAAS,EAAO,GACZ,AAAmB,OAAnB,CAAM,CAAC,EAAO,CAAW,CACzB,GAAS,AAWrB,WACI,GAAI,EAAK,GACL,OAAO,EAAO,GAElB,GAAI,EAAK,GAAoB,CACzB,GAAI,EAAG,EAAY,EAAW,CAAG,EAAM,GACnC,EAAYG,SAAS,GAAc,EAAY,IACnD,OAAO,GAAa,OAAU,OAAU,EAEhCpC,OAAO,aAAa,CAAC,GAGrB,GACZ,CACA,MAAM,AAAIiC,YAAY,0BAC1B,IAzBY,QACJ,CACA,GAAI,EAAY,KACZ,MAAO,CAAE,KAAM,MAAO,OAAM,CAGhC,OAAM,AAAIA,YAAY,0BAC1B,OA3B8B,CAE9B,MAAM,AAAIA,YAAY,qBAC1B,CACA,SAAS,IACL,GAAI,EAAG,EAAO,EAAW,EAAE,CAAC,CAAG,EAAM,GACjC,EAAY,EAAS,MAAM,CAC/B,MAAO,CACH,KAAM,MACN,MAAOI,WAAW,GAClB,WACJ,CACJ,CAoCA,SAASH,IACL,IAAI,EAAQ,EAGZ,OAFA,EAAa,GAEL,CAAM,CAAC,EAAO,EAClB,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,KAAK,OAED,MAAO,EACX,KAAK,IAGD,OAAO,EAAW,EAAO,KAAK,CAAC,EAAO,GAC9C,OAIA,AAA2B,MAAvB,CAAM,CAAC,EAAS,EAAE,EAGX,EAAW,EAAO,KAAK,CAAC,EAAO,GAK9C,CAEA,SAAS,EAAK1B,CAAI,CAAEZ,CAAE,EAClB,OAAOY,EAAK,OAAO,CAACZ,EAAI,GAC5B,CAEA,SAAS,EAAW,CAAK,EAGrB,OAAO,IAAIuC,OAFC,EAAM,OAAO,CAAC,EAAgB,MAC7B,EAAU,IAAI,CAAC,EAAM,CAAC,EAAE,CAAC,MAAM,CAEhD,CACJ,CACJ,EACA,IAAMA,OAAN,MAAMA,OACF,YAAY,CAAK,CAAE,CAAM,CAAE,CACvB,IAAI,CAAC,KAAK,CAAG,EACb,IAAI,CAAC,MAAM,CAAG,CAClB,CACJ,wCC7aA,IAAI,EAAE,KAAW,EAAE,CAAC,qBAAqB,MAAG,CAAC,OAAO,MAAG,CAAC,YAAY,MAAG,CAAC,YAAY,MAAG,CAAC,gBAAgB,MAAG,CAAC,yBAAyB,CAAC,EAAE,IAAI,cAAc,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,CAAC,EAAE,sBAAsB,CAAC,EAAE,KAAK,GAAG,EAAE,SAAS,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,EAAE,EAAE,SAAS,CAAC,IAAIpC,OAAO,SAAS,CAAC,EAAEA,OAAO,cAAc,CAAC,GAAG,GAAG,EAAE,cAAc,CAAC,GAAG,OAAO,IAAK,EAAC,CAAC,EAAE,CAAC,EAAG,OAAM6B,MAAM,+KAA+K,CAAC,EAAE,kBAAkB,CAAC,CAAC,CAAC,EAAE,EAAE,eAAe,CAAC,CAAC,EAAE,+BAA+B,CAAC,EAAEhC,EAAE,KAAK,IAAIW,EAAE,IAAC,CAAC,OAAO,EAAE,CAAC,CAAC,GAAGA,EAAE,EAAE,EAAE,IAAI,CAACX,EAAE,EAAE,GAAGW,CAAC,EAAE,wBAAwB,GAAI,EAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,iBAAiB,MAAG,CAAC,cAAc,MAAG,CAAC,aAAa,MAAG,CAAC,qBAAqB,MAAG,CAAC,UAAU,MAAG,CAAC,YAAY,MAAG,CAAC,iBAAiB,MAAG,CAAC,WAAW,MAAG,CAAC,UAAU,MAAG,4BCDl4B,GAAK,CAAC,iBAAiB,CAAC,CAAC,WAAW,CAAC,CAAC,iBAAiB,CAAC,CAAC,UAAU,CAAC,CAAC,YAAY2B,CAAC,CAAC,CAAC,EAA42B9B,EAAE,CAACI,EAAEZ,EAAE,EAAE,KAAK,IAAI,EAAE,EAAE,GAAG,IAAI,EAAE,MAAM,CAAC,EAAE,IAAI,EAAEA,EAAE,KAAK,KAAK,EAAE,GAAG,EAAEY,MAAM,CAAC,IAAM,EAAE,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,GAAG,sBAAsB,EAAE,IAAI,CAAC,EAAE,IAAI,EAAEZ,EAAE,KAAK,EAAE,QAAQ,CAAC,GAAG,EAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,iBAAiB,GAAG,CAAC,EAAE,iBAAiB,QAAQ,GAAG,aAAa,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,EAAEA,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,IAAM,EAAE,EAAE,QAAQ,CAAC,IAAI,GAAG,GAAG,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC,CAAC,EAAEgC,MAAM,2CAA4C,GAAE,EAAE,KAAK,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,EAAEhC,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC,GAAG,GAAE,EAAE,EAAE,EAAC,IAAM,IAAC,CAAC,EAAE,IAAI,CAAC,CAAC,KAAK,EAAE,KAAK,MAAM,QAAQ,GAAG,SAAE,GAAG,EAAE,IAAI,CAAC,CAAC,KAAK,EAAE,KAAK,MAAM,GAAG,EAAE,IAAI,CAAC,OAAO,GAAG,SAAE,GAAG,CAAC,GAAG,SAAE,GAAG,MAAMgC,MAAM,wCAAwC,IAAM,EAAE,YAAY,EAAE,GAAG,GAAGhC,EAAE,IAAI,GAAG,EAAE,MAAMgC,MAAM,uEAAwE,EAAC,IAA4BpB,EAAE,IAAI,EAA1B,EAAE,SAAS,CAAC,IAAI,CAAC,GAAa,EAAG,GAAE,IAAI,CAAC,CAAC,KAAK,oBAAoB,SAASA,EAAE,KAAK,EAAE,kBAAkB,EAAE,kBAAkB,EAAE,OAAO,CAAC,GAAG,EAAE,IAAI,CAACA,CAAC,CAAC,MAAM,EAAE,GAAI,GAAE,IAAI,CAAC,CAAC,KAAK,EAAE,KAAK,WAAW,MAAM,EAAE,SAAS,CAAC,CAACc,OAAO,QAAQ,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,AAAD,EAAI,GAAE,IAAI,CAAC,CAAC,KAAK,EAAE,KAAK,MAAM,GAAG,EAAE,IAAI,CAAC,GAAG,EAAC,EAAG,OAAO,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,KAAK,GAAG,KAAK,IAAI,EAAE,MAAMM,MAAM,yBAA0B,GAAE,IAAI,CAAC,EAAE,IAAM,EAAE,EAAE,GAAG,GAAG,GAAG,aAAa,EAAE,IAAI,EAAE,CAAC,EAAE,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC,MAAMA,MAAM,4CAA4C,GAAG,EAAE,MAAM,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAEU,KAAK,IAAsC,EAAEF,SAAS,AAAzC,iBAAiB,IAAI,CAAC,EAAE,IAAI,CAAc,CAAC,EAAE,EAAE,EAAE,EAAE,kBAAkB,CAAC,GAAG,OAAO,EAAE,MAAMR,MAAM,2CAA2C,EAAE,eAAe,CAAC,mBAAmB,IAAM,EAAE,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,GAAG,sBAAsB,EAAE,IAAI,CAAC,MAAMA,MAAM,yNAA0N,EAAC,IAAM,EAAE,EAAE,QAAQ,CAAC,OAAO,CAAC,IAAM,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,iBAAiB,CAAC,CAAC,GAAG,KAAK,IAAI,GAAG,EAAE,IAAI,GAAG,cAAW,EAAE,EAAE,IAAI,GAAG,YAAS,EAAE,EAAE,KAAK,GAAG,EAAE,MAAM,GAAG,EAAE,IAAI,GAAG,cAAW,CAAC,CAAC,IAAM,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,OAAO,CAAC,EAAE,QAAQ,CAACU,GAAG,EAAE,SAAE,GAAG,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,iBAAiB,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,EAAI,EAAE,IAAI,GAAG,UAAO,EAAE,EAAE,IAAI,GAAG,aAAU,AAAE,GAAE,IAAI,CAAC,EAAE,EAAE,EAAE,iBAAiB,CAAC,GAAG,EAAE,iBAAiB,EAAE,EAAE,OAAO,CAAC,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,IAAM,EAAE,IAAIJ,EAAE,EAAE,EAAE,QAAQ,CAACI,EAAG,GAAE,EAAE,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,iBAAiB,GAAG,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,iBAAiB,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,IAAM,EAAE,IAAIC,YAAY,GAAG,IAAI,CAAC,MAAM,IAAI,IAAM,KAAK,EAAE,OAAO,CAAC,IAAI,IAAI,EAAE,EAAE,EAAE,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,UAAU,CAAC,GAA4D,OAAOC,KAAxDxC,OAAO,YAAY,IAAI,IAAIC,WAAW,EAAE,MAAM,GAAiB,CCLj0GoB,CAAAA,WAAW,wBAAwB,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,IAAI,IAAM,EAAEtB,OAAO,wBAAwB,CAACA,OAAO,cAAc,CAAC,GAAG,sBAAsB,GAAG,CAACA,OAAO,cAAc,CAAC,EAAE,qBAAqB,CAAC,MAAM,MAAM,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,kBAAkB,CAAC,GAAG,IAAM,EAAE,EAAE,SAAS,CAAC,wBAAwB,AAAC,GAAE,SAAS,CAAC,wBAAwB,CAAC,SAASS,CAAC,CAAC,CAAC,CAACF,CAAC,EAAE,oBAAoBE,GAAG,OAAOF,GAAG,EAAE,IAAI,CAAC,IAAI,EAAE,EAAE,IAAI,CAAC,IAAI,CAACE,EAAE,EAAEF,EAAE,EAAE,IAAM,EAAE,EAAE,SAAS,CAAC,iBAAiB,AAAC,GAAE,SAAS,CAAC,iBAAiB,CAAC,WAAW,IAAI,CAAC,YAAY,CAAC,oBAAoB,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,IAAM,EAAE,EAAE,SAAS,CAAC,gBAAgB,AAAC,GAAE,SAAS,CAAC,gBAAgB,CAAC,WAAW,OAAO,IAAI,CAAC,UAAU,CAAE,KAAI,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,AAAD,EAAG,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,IAAM,EAAEP,OAAO,cAAc,CAAC,EAAE,SAAS,EAAE,MAAM,AAAC,GAAE,SAAS,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,IAAM,EAAE,IAAI,CAAC,MAAM,GAAG,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,IAAIS,EAAE,EAAEA,EAAE,IAAI,CAAC,UAAU,CAAC,MAAM,CAACA,IAAI,CAAC,IAAM,EAAE,IAAI,CAAC,UAAU,CAACA,EAAE,CAAC,GAAG,EAAE,IAAI,CAAC,UAAU,CAAC,sBAAsB,CAAC,IAAMA,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,GAAI,KAAI,CAAC,eAAe,CAACA,GAAG,IAAI,CAAC,eAAe,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,ADKv/B,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC,QAAyF,EAAED,EAAE,EAAwE,EAAjK,GAAG,KAAK,IAAI,EAAE,UAAU,CAAC,MAAMqB,MAAM,4CAAsD,IAAM,EAAE,EAAE,CAAC,EAAEa,SAAS,gBAAgB,CAAC,EAAEC,WAAW,YAAY,EAAQ,KAAK,OAAQ,GAAE,EAAE,QAAQ,EAAC,GAAI,CAAC,IAAM,EAAE,EAAE,IAAI,CAAC,GAAG,EAAE,UAAU,CAAC,YAAY,CAAC,GAAG,IAAI,EAAE,MAAM,EAAE,KAAK,IAAI,EAAE,MAAMd,MAAM,CAAC,qEAAqE,EAAE,EAAE,2CAA2C,EAAErB,EAAE,CAAC,CAAC,CAAE,GAAEH,EAAE,EAAE,EAAE,EAAE,GAAG,KAAK,IAAI,GAAI,GAAE,GAAGG,IAAI,CAAC,MAAM,GAAG,EAAE,UAAU,CAAC,YAAY,EAAE,EAAE,EAAE,QAAQ,GAAG,EAAE,UAAU,CAAC,aAAa,CAAC,GAAG,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAMqB,MAAM,kBAAkB,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,GAAG,KAAK,IAAI,EAAE,CAAC,IAAM,EAAE,aAAae,WAAW,2CAA2C,aAAaC,iBAAiB,mBAAmB,EAAE,SAAS,CAACC,QAAQ,KAAK,CAAC,CAAC,uFAAuF,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,GCLmJ,EAAE,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,aAAa,CAAC,KAAM,SAAE,EAAE,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,6DCKvqC,IAAM,EAAExB,WAAW,EAAE,EAAE,UAAU,EAAG,MAAK,IAAI,EAAE,QAAQ,EAAE,EAAE,QAAQ,CAAC,YAAY,AAAD,GAAI,uBAAuByB,SAAS,SAAS,EAAE,YAAYC,cAAc,SAAS,CAAC,EAAEzB,SAAS,EAAE,IAAI0B,QAAQ,IAAM,UAAN,MAAM,UAAE,YAAYxC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,EAAE,IAAI,EAAE,MAAMoB,MAAM,oEAAqE,KAAI,CAAC,OAAO,CAACpB,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,YAAY,CAAC,IAAIA,EAAE,IAAI,CAAC,CAAC,CAAO,EAAE,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,KAAK,IAAIA,EAAE,CAAC,IAAM,EAAE,KAAK,IAAI,GAAG,IAAI,EAAE,MAAM,AAAC,IAAIA,CAAAA,EAAE,EAAE,GAAG,CAAC,EAAC,EAAG,KAAK,IAAIA,GAAI,CAAC,KAAI,CAAC,CAAC,CAACA,EAAE,IAAIuC,aAAY,EAAG,WAAW,CAAC,IAAI,CAAC,OAAO,EAAE,GAAG,EAAE,GAAG,CAAC,EAAEvC,EAAC,CAAE,CAAC,OAAOA,CAAC,CAAC,UAAU,CAAC,OAAO,IAAI,CAAC,OAAO,CAAC,EAAC,IAAqD,EAAE,CAACA,EAAE,GAAG,IAAmU,IAAI,UAA1T,IAAIA,EAAE,MAAM,CAACA,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAE,CAAC,EAAE,EAAE,IAAI,EAAE,AAACA,CAAAA,IAAI,GAAG,CAAC,IAAIA,EAAE,YAAY,CAAC,OAAOA,EAAE,OAAO,CAAC,GAAG,UAAU,OAAOA,EAAE,OAAOA,CAAE,OAAMoB,MAAM,mEAAmEpB,EAAE,uFAAuF,GAAG,GAAGA,CAAC,CAAC,EAAE,EAAE,CAAEA,CAAC,CAAC,EAAE,EAAiBA,EAAE,GAA2P,EAAE,EAAEA,GAAGA,EAAEA,GAAGA,aAAauC,cAAc,AAACvC,CAAAA,IAAI,IAAzqB,EAA6qB,EAAE,GAAG,IAAI,IAAM,KAAKA,EAAE,QAAQ,CAAC,GAAG,EAAE,OAAO,CAAC,OAAttB,IAAI,UAAE,UAAU,OAAnB,EAAkuB,GAAtsB,EAAE,EAAE,GAAG,KAAK,EAAE,EAA0rB,GAAGA,GAAGA,ECAnzC,CAAC,GAAG,CAAC,CAAC,eAAe,CAAC,CAAC,yBAAyB,CAAC,CAAC,oBAAoB,CAAC,CAAC,sBAAsB,CAAC,CAAC,eAAe,CAAC,CAAC,CAACT,OAAO,EAAEsB,WAAW,EAAE,EAAE,YAAY,CAAC,EAAE,EAAE,EAAE,WAAW,CAAC,GAAG,EAAE,EAAE,8BAA8B,CAAY,EAAE,CAAC,YAAYb,CAAC,CAAC,CAAC,EAAE,OAAO,GAAG,KAAKyC,QAAQzC,EAAEA,EAAE,EAAE,KAAK,KAAM,MAAKT,OAAO,KAAKF,MAAMW,EAAE,MAAMA,EAAEA,EAAEqB,KAAK,SAAS,CAACrB,EAAE,CAAC,OAAOA,CAAC,EAAE,cAAcA,CAAC,CAAC,CAAC,EAAE,IAAI,EAAEA,EAAE,OAAO,GAAG,KAAKyC,QAAQ,EAAE,OAAOzC,EAAE,KAAM,MAAK0C,OAAO,EAAE,OAAO1C,EAAE,KAAK0C,OAAO1C,GAAG,KAAM,MAAKT,OAAO,KAAKF,MAAM,GAAG,CAAC,EAAEgC,KAAK,KAAK,CAACrB,EAAE,CAAC,MAAMA,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAACA,EAAE,IAAI,CAAC,EAAEA,EAAE,GAAG,EAAE,CAAC,UAAU,CAAC,EAAE,KAAKR,OAAO,UAAU,EAAE,QAAQ,CAAC,EAAE,WAAW,CAAC,EAAE,WAAW,CAAC,CAAEsB,CAAAA,OAAO,QAAQ,GAAGA,OAAO,YAAY,EAAE,mBAAmB,GAAG,IAAI0B,QAAQ,IAAMG,EAAN,MAAMA,UAAUC,YAAY,OAAO,eAAe5C,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,AAAC,KAAI,CAAC,CAAC,GAAG,EAAE,AAAD,EAAG,IAAI,CAACA,EAAE,CAAC,WAAW,oBAAoB,CAAC,OAAO,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI,EAAE,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,OAAO,eAAeA,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,EAAG,GAAE,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,cAAc,CAACA,IAAK,CAAC,GAAET,OAAO,MAAM,CAAC,EAAC,EAAG,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAACS,EAAE,GAAG,CAAC,EAAE,UAAU,CAAC,CAAC,IAAM,EAAEc,SAAS,EAAE,IAAI,CAAC,qBAAqB,CAACd,EAAE,EAAE,EAAG,MAAK,IAAI,GAAG,EAAE,IAAI,CAAC,SAAS,CAACA,EAAE,EAAE,CAAC,CAAC,OAAO,sBAAsBA,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,CAACA,IAAI,CAAC,MAAM,OAAO,IAAI,CAAC,EAAE,EAAE,IAAIA,CAAC,EAAE,IAAI,CAAC,EAAE,CAACA,CAAC,CAAC,EAAE,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,IAAM,EAAE,GAAG,KAAK,IAAI,CAAE,IAAG,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,aAAa,CAACA,EAAE,EAAE,EAAE,EAAE,aAAa,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,OAAO,mBAAmBA,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAACA,IAAI,CAAC,CAAC,OAAO,MAAM,CAAC,GAAG,IAAI,CAAC,cAAc,CAAG,qBAAsB,OAAO,IAAMA,EAAE,EAAE,IAAI,CAAEA,CAAAA,EAAE,QAAQ,GAAG,KAAK,IAAIA,EAAE,CAAC,EAAG,KAAI,CAAC,CAAC,CAAC,IAAIA,EAAE,CAAC,CAAC,AAAD,EAAG,IAAI,CAAC,iBAAiB,CAAC,IAAIsB,IAAItB,EAAE,iBAAiB,CAAC,CAAC,OAAO,UAAU,CAAC,GAAG,IAAI,CAAC,cAAc,CAAG,aAAc,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,cAAc,CAAG,cAAe,CAAC,IAAMA,EAAE,IAAI,CAAC,UAAU,CAAqB,IAAI,IAAM,IAA5B,IAAI,EAAEA,MAAM,EAAEA,GAAG,CAAkB,IAAI,CAAC,cAAc,CAAC,EAAEA,CAAC,CAAC,EAAE,CAAC,CAAC,IAAMA,EAAE,IAAI,CAACc,OAAO,QAAQ,CAAC,CAAC,GAAG,OAAOd,EAAE,CAAC,IAAM,EAAE6C,oBAAoB,GAAG,CAAC7C,GAAG,GAAG,KAAK,IAAI,EAAE,IAAI,GAAK,CAACA,EAAE,EAAE,GAAG,EAAE,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAACA,EAAE,EAAE,CAAmB,IAAI,GAAK,CAACA,EAAE,EAAE,GAAhC,IAAI,CAAC,IAAI,CAAC,IAAIsB,IAAqB,IAAI,CAAC,iBAAiB,EAAC,CAAC,IAAM,EAAE,IAAI,CAAC,IAAI,CAACtB,EAAE,EAAG,MAAK,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAEA,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,OAAO,eAAe,CAAC,CAAC,CAAC,IAAM,EAAE,EAAE,CAAC,GAAGX,MAAM,OAAO,CAAC,GAA2C,IAAI,IAAM,KAAzC,IAAIyD,IAAI,EAAE,IAAI,CAAC,EAAE,GAAG,OAAO,IAAqB,EAAE,OAAO,CAAC,EAAE,SAAS,KAAK,IAAI,GAAG,EAAE,IAAI,CAAC,EAAE,IAAI,OAAO,CAAC,CAAC,OAAO,KAAK9C,CAAC,CAAC,CAAC,CAAC,CAAC,IAAM,EAAE,EAAE,SAAS,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,UAAU,OAAO,EAAE,EAAE,UAAU,OAAOA,EAAEA,EAAE,WAAW,GAAG,KAAK,CAAC,CAAC,aAAa,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,eAAe,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI+C,QAAS/C,GAAG,IAAI,CAAC,cAAc,CAACA,GAAI,IAAI,CAAC,IAAI,CAAC,IAAIsB,IAAI,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,QAAStB,GAAGA,EAAE,IAAI,EAAG,CAAC,cAAcA,CAAC,CAAC,CAAC,AAAC,KAAI,CAAC,IAAI,GAAG,IAAI8C,GAAE,EAAG,GAAG,CAAC9C,GAAG,KAAK,IAAI,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,WAAW,EAAEA,EAAE,aAAa,IAAI,CAAC,iBAAiBA,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,OAAOA,EAAE,CAAC,MAAM,CAAC,IAAMA,EAAE,IAAIsB,IAAyC,IAAI,IAAM,KAAK,AAAlD,IAAI,CAAC,WAAW,CAAC,iBAAiB,CAAkB,IAAI,GAAG,IAAI,CAAC,cAAc,CAAC,IAAKtB,CAAAA,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,OAAO,IAAI,CAAC,EAAE,AAAD,CAAGA,CAAAA,EAAE,IAAI,CAAC,GAAI,KAAI,CAAC,IAAI,CAACA,CAAAA,CAAE,CAAC,kBAAkB,CAAC,IAAMA,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,WAAW,CAAC,iBAAiB,EAAE,MAAO,ADApmE,EAAC,EAAE,KAAK,GAAG,EAAE,EAAE,kBAAkB,CAAC,EAAE,GAAG,CAAEA,GAAGA,aAAauC,cAAcvC,EAAEA,EAAE,UAAU,OAAQ,IAAI,IAAM,KAAK,EAAE,CAAC,IAAM,EAAEiC,SAAS,aAAa,CAAC,SAAS,EAAE,EAAE,QAAQ,AAAC,MAAK,IAAI,GAAG,EAAE,YAAY,CAAC,QAAQ,GAAG,EAAE,WAAW,CAAC,EAAE,OAAO,CAAC,EAAE,WAAW,CAAC,EAAE,CAAC,GCAm3DjC,EAAE,IAAI,CAAC,WAAW,CAAC,aAAa,EAAEA,CAAC,CAAC,mBAAmB,CAAC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,QAASA,GAAGA,EAAE,aAAa,KAAM,CAAC,eAAeA,CAAC,CAAC,CAAC,CAAC,sBAAsB,CAAC,IAAI,CAAC,IAAI,EAAE,QAASA,GAAGA,EAAE,gBAAgB,KAAM,CAAC,yBAAyBA,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAACA,EAAE,EAAE,CAAC,KAAKA,CAAC,CAAC,CAAC,CAAC,CAAC,IAAM,EAAE,IAAI,CAAC,WAAW,CAAC,iBAAiB,CAAC,GAAG,CAACA,GAAG,EAAE,IAAI,CAAC,WAAW,CAAC,IAAI,CAACA,EAAE,GAAG,GAAG,KAAK,IAAI,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,IAAM,EAAE,AAAC,MAAK,IAAI,EAAE,SAAS,EAAE,YAAY,EAAE,SAAS,CAAC,GAAG,WAAW,CAAC,EAAE,EAAE,IAAI,CAAE,KAAI,CAAC,IAAI,CAACA,EAAE,MAAM,EAAE,IAAI,CAAC,eAAe,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,KAAKA,CAAC,CAAC,CAAC,CAAC,CAAC,IAAM,EAAE,IAAI,CAAC,WAAW,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAACA,GAAG,GAAG,KAAK,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC,IAAMA,EAAE,EAAE,kBAAkB,CAAC,GAAG,EAAE,YAAY,OAAOA,EAAE,SAAS,CAAC,CAAC,cAAcA,EAAE,SAAS,EAAE,KAAK,IAAIA,EAAE,SAAS,EAAE,cAAcA,EAAE,SAAS,CAAC,CAAE,KAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,EAAEA,EAAE,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,IAAI,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,cAAcA,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,IAAIA,EAAE,CAAC,IAAM,EAAE,IAAI,CAAC,WAAW,CAAC,EAAE,IAAI,CAACA,EAAE,CAAC,GAAG,CAA8B,CAAC,CAA/B,KAAI,EAAE,kBAAkB,CAACA,EAAC,EAAO,UAAU,EAAE,GAAG,EAAE,IAAI,EAAE,UAAU,EAAE,EAAE,OAAO,EAAE,IAAI,IAAI,CAAC,IAAI,EAAE,IAAIA,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,IAAI,CAACA,EAAE,GAAE,EAAG,OAAO,IAAI,CAAC,CAAC,CAACA,EAAE,EAAE,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,eAAe,EAAG,KAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAC,CAAE,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,QAAQ,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,AAAC,KAAI,CAAC,IAAI,GAAG,IAAIsB,GAAE,EAAG,GAAG,CAACtB,IAAK,KAAI,CAAC,IAAI,CAAC,GAAG,CAACA,EAAE,GAAG,GAAG,IAAI,CAACA,EAAE,EAAE,CAAC,IAAI,GAAG,KAAK,IAAI,IAAK,KAAI,CAAC,IAAI,CAAC,GAAG,CAACA,IAAK,KAAI,CAAC,UAAU,EAAE,GAAI,GAAE,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAACA,EAAE,EAAC,EAAG,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,GAAGA,GAAG,AAAC,KAAI,CAAC,IAAI,GAAG,IAAI8C,GAAE,EAAG,GAAG,CAAC9C,EAAC,CAAE,CAAC,MAAM,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,EAAE,GAAG,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,MAAMA,EAAE,CAAC+C,QAAQ,MAAM,CAAC/C,EAAE,CAAC,IAAMA,EAAE,IAAI,CAAC,cAAc,GAAG,OAAO,MAAMA,GAAG,MAAMA,EAAE,CAAC,IAAI,CAAC,eAAe,CAAC,gBAAgB,CAAC,OAAO,IAAI,CAAC,aAAa,EAAE,CAAC,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,eAAe,CAAC,OAAO,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,GAAG,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,GAAK,CAACA,EAAE,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAACA,EAAE,CAAC,CAAE,KAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAMA,EAAE,IAAI,CAAC,WAAW,CAAC,iBAAiB,CAAC,GAAGA,EAAE,IAAI,CAAC,EAAE,IAAI,GAAK,CAAC,EAAE,EAAE,GAAGA,EAAE,CAAC,GAAK,CAAC,QAAQA,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,AAAC,EAAC,IAAIA,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC,IAAIA,EAAE,CAAC,EAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAACA,CAAAA,EAAE,IAAI,CAAC,YAAY,CAAC,EAAC,EAAK,KAAI,CAAC,UAAU,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,QAASA,GAAGA,EAAE,UAAU,MAAO,IAAI,CAAC,MAAM,CAAC,EAAC,EAAG,IAAI,CAAC,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC,MAAMA,EAAE,CAAC,EAAE,IAAI,CAAC,IAAI,GAAG,CAAC,CAACA,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,WAAWA,CAAC,CAAC,CAAC,CAAC,KAAKA,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,QAASA,GAAGA,EAAE,WAAW,MAAO,IAAI,CAAC,UAAU,EAAG,KAAI,CAAC,UAAU,CAAC,CAAC,EAAE,IAAI,CAAC,YAAY,CAACA,EAAC,EAAG,IAAI,CAAC,OAAO,CAACA,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAIsB,IAAI,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,IAAI,gBAAgB,CAAC,OAAO,IAAI,CAAC,iBAAiB,EAAE,CAAC,mBAAmB,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,aAAatB,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAOA,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAEA,GAAG,IAAI,CAAC,IAAI,CAACA,EAAE,IAAI,CAACA,EAAE,GAAI,IAAI,CAAC,IAAI,EAAE,CAAC,QAAQA,CAAC,CAAC,CAAC,CAAC,aAAaA,CAAC,CAAC,CAAC,CAAC,CAAC2C,CAAAA,EAAE,aAAa,CAAC,EAAE,CAACA,EAAE,iBAAiB,CAAC,CAAC,KAAK,MAAM,EAAEA,EAAI,iBAAqB,CAAC,IAAIrB,IAAIqB,EAAI,SAAa,CAAC,IAAIrB,IAAI,IAAI,CAAC,gBAAgBqB,CAAC,GAAG,AAAC,GAAE,uBAAuB,GAAG,EAAE,AAAD,EAAG,IAAI,CAAC,sECA5wL,IAAiD,EAAE7B,SAAS,IAAM,OAAN,MAAM,OAAE,IAAI,cAAc,CAAC,OAAO,IAAI,CAAC,CAAC,EAAG,KAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAIiC,QAAS,CAAC/C,EAAE,KAAK,IAAI,CAAC,CAAC,CAACA,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,GAAI,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC+C,QAAQ,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAACA,QAAQ,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,YAAY/C,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,AAAC,KAAI,CAAC,CAAC,CAACA,CAAAA,EAAG,aAAa,CAAC,IAAI,EAAE,IAAM,EAAE,UAAU,OAAO,EAAE,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC,CAAE,KAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,iBAAiB,GAAI,KAAI,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAG,CAAE,CAAC,YAAY,CAAC,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,aAAa,CAAC,gBAAgB,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,KAAK,IAAI,IAAI,CAAC,CAAC,CAAC,OAAO,IAAMA,EAAE,IAAI,CAAC,CAAC,GAAG,GAAG,CAACX,MAAM,OAAO,CAACW,GAAG,MAAMoB,MAAM,0CAA0C,OAAOpB,CAAC,CAAC,MAAM,GAAG,CAAC,IAAMA,EAAE,IAAI,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,AAAC,KAAI,CAAC,CAAC,CAACA,EAAEA,IAAI,GAAG,KAAK,IAAIA,GAAG,KAAK,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,EAAEA,IAAI,MAAM,IAAI,CAAC,GAAG,CAACA,EAAE,CAAC,MAAM,IAAIA,CAAC,CAAC,KAAK,EAAE,CAAEA,CAAAA,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAACA,EAAE,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,QAAS,KAAI,CAAC,CAAC,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,gBAAgB,IAAI,CAAC,OAAO,CAACI,eAAgB,IAAI,IAAI,CAAC,CAAC,CAAC,aAAa,IAAK,IAAI,CAAC,CAAC,CAAC,aAAa,GAAG,IAAM,EAAE,EAAE,IAAI,CAAC,CAAC,AAAC,KAAI,CAAC,CAAC,CAAC,IAAI4C,gBAAgB,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC,CAAChD,EAAE,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,MAAMA,EAAE,CAAC,EAAE,CAAC,EAAE,EAAEA,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC,MAAMA,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,MAAMA,EAAE,CAAC,IAAI,OAAO,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC,OAAOA,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,OAAOA,EAAE,OAAO,IAAK,MAAK,EAAE,OAAOA,EAAE,OAAO,IAAK,MAAK,EAAE,OAAOA,EAAE,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAE,MAAK,EAAE,OAAOA,EAAE,KAAK,GAAG,IAAI,CAAC,KAAK,CAAE,SAAQ,MAAMoB,MAAM,sBAAsB,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC,IAAM,EAAE,CAAC,EAAE,IAAI,IAAI,GAAG,EAAE,MAAM,GAAG,EAAE,MAAM,EAAE,EAAE,KAAK,CAAE,CAAC,EAAE,IAAI,CAAC,SAAE,EAAE,CAAC,CAAC,EAAE,uECA1vD,GAAK,CAAC,EAAE,CAAC,CAAC,CAAC,WAAC,CAAC,EAAE,GAAG,OAAO,GAAG,UAAU,OAAO,GAAG,YAAY,OAAO,EAA2B,4KCAjG,IAAM,EAAE,CAAC,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,kBAAkB,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,EAAEpB,GAAG,CAAC,GAAG,IAAK,EAAC,gBAAgBA,EAAE,OAAO,CAAC,GAAG,IAAMiD,EAAN,MAAMA,EAAE,YAAYjD,CAAC,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAKA,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAACA,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,KAAKA,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,MAAM,CAACA,EAAE,EAAE,CAAC,OAAOA,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,MAAM,IAAI,EAAE,CAAC,wFCA3S,IAAM,EAAEa,WAAW,EAAE,EAAE,YAAY,CAAC,EAAE,EAAE,EAAE,YAAY,CAAC,WAAW,CAAC,WAAWb,GAAGA,CAAC,GAAG,KAAK,EAAE,EAAE,QAAQ,EAAE,CAAC,IAAI,EAAEH,KAAK,MAAM,GAAG,OAAO,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAEoC,SAAS,EAAE,IAAI,EAAE,aAAa,CAAC,IAAI,EAAEjC,GAAG,OAAOA,GAAG,UAAU,OAAOA,GAAG,YAAY,OAAOA,EAAE,EAAEX,MAAM,OAAO,CAAC,EAAEW,GAAG,EAAEA,IAAI,YAAY,OAAOA,GAAG,CAACc,OAAO,QAAQ,CAAC,CAAC,EAAE,aAAc,EAAE,sDAAsD,EAAE,OAAO,EAAE,KAAK,EAAEoC,OAAO,CAAC,EAAE,EAAE,EAAE,kBAAkB,EAAE,EAAE,EAAE,EAAE,EAAE;AAAW,wBAAwB,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,qCAAqC,EAAElD,GAAG,CAAC,EAAE,GAAG,IAAK,EAAC,WAAWA,EAAE,QAAQ,EAAE,OAAO,CAAC,GAAG,EAAE,EAAE,GAAG,EAAE,EAAE,GAAU,GAAL,EAAE,GAAKc,OAAO,GAAG,CAAC,iBAAgB,EAAEA,OAAO,GAAG,CAAC,eAAe,EAAE,IAAI0B,QAAQ,EAAE,EAAE,gBAAgB,CAAC,EAAE,KAAK,SAAS,EAAExC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAEA,IAAI,CAACA,EAAE,cAAc,CAAC,OAAO,MAAMoB,MAAM,kCAAkC,OAAO,KAAK,IAAI,EAAE,EAAE,UAAU,CAAC,GAAG,CAAC,CAAC,IAAM,EAAE,CAACpB,EAAE,KAAK,IAAM,EAAEA,EAAE,MAAM,CAAC,EAAE,EAAE,EAAE,CAAK,EAAE,EAAE,IAAI,EAAE,QAAQ,IAAI,EAAE,SAAS,GAAG,EAAE,EAAE,IAAI,IAAI,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,IAAM,EAAEA,CAAC,CAAC,EAAE,CAAK,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,KAAK,EAAE,EAAE,MAAM,EAAG,GAAE,SAAS,CAAC,EAAc,OAAZ,GAAE,EAAE,IAAI,CAAC,EAAC,CAAS,GAAI,EAAE,EAAE,SAAS,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,KAAK,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,KAAK,IAAI,CAAC,CAAC,EAAE,CAAE,GAAE,IAAI,CAAC,CAAC,CAAC,EAAE,GAAI,GAAEkD,OAAO,KAAK,CAAC,CAAC,EAAE,CAAC,IAAG,EAAG,EAAE,GAAG,KAAK,IAAI,CAAC,CAAC,EAAE,EAAG,GAAE,GAAG,IAAI,EAAE,MAAM,CAAC,CAAC,EAAE,CAAE,GAAE,GAAG,EAAE,EAAE,EAAC,EAAG,KAAK,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,GAAI,GAAE,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,IAAI,GAAG,IAAI,EAAE,EAAE,EAAE,IAAI,GAAG,IAAI,EAAE,EAAE,EAAG,GAAE,EAAE,EAAE,KAAK,GAAG,IAAM,EAAE,IAAI,GAAGlD,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,MAAM,IAAI,GAAG,GAAG,IAAI,EAAE,EAAE,EAAE,GAAG,EAAG,GAAE,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,GAAG,EAAE,EAAE,KAAK,CAAC,GAAG,EAAE,GAAG,EAAE,EAAG,MAAK,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,EAAEA,EAAE,EAAGA,CAAAA,CAAC,CAAC,EAAE,EAAE,KAAI,EAAI,KAAI,EAAE,SAAS,IAAI,EAAE,UAAU,EAAC,GAAI,EAAE,EAAE,IAAMmD,EAAN,MAAMA,EAAE,YAAY,CAAC,QAAQnD,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC8B,CAAC,CAAC,KAAK,CAAE,KAAI,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,EAAE,EAAQ,EAAE9B,EAAE,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,EAAEoD,EAAE,CAAC,EAAEpD,EAAE,GAAG,GAAG,IAAI,CAAC,EAAE,CAACmD,EAAE,aAAa,CAAC,EAAErB,GAAG,EAAE,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,GAAG,IAAI,EAAE,CAAC,IAAM9B,EAAE,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,UAAU,CAACA,EAAE,WAAW,IAAIA,EAAE,UAAU,CAAC,CAAC,KAAK,OAAQ,GAAE,EAAE,QAAQ,EAAC,GAAI,EAAE,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,EAAE,QAAQ,CAAC,CAAC,GAAG,EAAE,aAAa,GAAG,IAAI,IAAMA,KAAK,EAAE,iBAAiB,GAAG,GAAGA,EAAE,QAAQ,CAAC,GAAG,CAAC,IAAM,EAAEoD,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,YAAY,CAACpD,GAAG,KAAK,CAAC,GAAG,EAAE,eAAe,IAAI,CAAC,EAAG,GAAE,IAAI,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,QAAQ,EAAE,KAAK,MAAM,CAAC,CAAC,EAAE,CAACqD,EAAE,MAAM,CAAC,CAAC,EAAE,CAACC,EAAE,MAAM,CAAC,CAAC,EAAE,CAACC,EAAEC,CAAC,GAAG,EAAE,eAAe,CAACxD,EAAE,MAAMA,EAAE,UAAU,CAAC,IAAK,GAAE,IAAI,CAAC,CAAC,KAAK,EAAE,MAAM,CAAC,GAAG,EAAE,eAAe,CAACA,EAAC,EAAG,GAAG,EAAE,IAAI,CAAC,EAAE,OAAO,EAAE,CAAC,IAAMA,EAAE,EAAE,WAAW,CAAC,KAAK,CAAC,GAAG,EAAEA,EAAE,MAAM,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,WAAW,CAAC,EAAE,EAAE,WAAW,CAAC,GAAG,IAAI,IAAI,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,CAACA,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,QAAQ,GAAG,EAAE,IAAI,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC,GAAG,EAAE,MAAM,CAACA,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,IAAI,EAAE,QAAQ,CAAC,GAAG,EAAE,IAAI,GAAG,EAAE,EAAE,IAAI,CAAC,CAAC,KAAK,EAAE,MAAM,CAAC,OAAO,CAAC,IAAIA,EAAE,GAAG,KAAK,KAAMA,CAAAA,EAAE,EAAE,IAAI,CAAC,OAAO,CAAC,EAAEA,EAAE,EAAC,GAAI,EAAE,IAAI,CAAC,CAAC,KAAK,EAAE,MAAM,CAAC,GAAGA,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,OAAO,cAAcA,CAAC,CAAC,CAAC,CAAC,CAAC,IAAM,EAAE,EAAE,aAAa,CAAC,YAAY,OAAO,EAAE,SAAS,CAACA,EAAE,CAAC,CAAC,EAAC,SAAS,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAO,EAAE,EAAE,GAAG,KAAK,EAAE,EAAE,eAAe,CAAC,OAAO,GAAG,cAAc,GAAI,IAAG,OAAO,CAAC,GAAG,KAAK,IAAI,EAAE,EAAE,KAAK,EAAG,AAAW,CAAX,EAAE,IAAI,EAAEA,EAAC,EAAI,IAAI,CAACA,EAAE,EAAE,GAAI,KAAK,IAAI,EAAE,AAAC,GAAE,IAAI,GAAG,EAAE,AAAD,CAAE,CAAC,EAAE,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,KAAK,IAAI,GAAI,GAAE,EAAEA,EAAE,EAAE,IAAI,CAACA,EAAE,EAAE,MAAM,EAAE,EAAE,EAAC,EAAG,CAAC,CAAC,IAAMyD,EAAN,MAAMA,EAAE,YAAYzD,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAACA,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,YAAY,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,MAAM,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAEA,CAAC,CAAC,CAAC,GAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,AAACA,CAAAA,GAAG,eAAe,GAAG,UAAU,CAAC,EAAE,CAAC,EAAG,GAAE,WAAW,CAAC,EAAE,IAAI,EAAE,EAAE,QAAQ,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,KAAK,IAAI,GAAG,CAAC,GAAG,IAAI,EAAE,KAAK,CAAC,CAAC,IAAI,CAAE,KAAI,EAAE,IAAI,CAAC,EAAE,IAAI0D,EAAE,EAAE,EAAE,WAAW,CAAC,IAAI,CAAC1D,GAAG,IAAI,EAAE,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,OAAO,CAAC,IAAI,CAACA,GAAG,IAAI,EAAE,IAAI,EAAG,GAAE,IAAI2D,EAAE,EAAE,IAAI,CAAC3D,EAAC,EAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,GAAG,OAAQ,GAAE,EAAE,QAAQ,GAAG,GAAE,CAAE,CAAC,OAAO,EAAE,WAAW,CAAC,EAAE,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,IAAI,IAAM,KAAK,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,GAAI,MAAK,IAAI,EAAE,OAAO,CAAE,GAAE,IAAI,CAACA,EAAE,EAAE,GAAG,GAAG,EAAE,OAAO,CAAC,MAAM,CAAC,GAAG,EAAE,IAAI,CAACA,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,EAAC,IAAM0D,EAAN,MAAMA,EAAE,IAAI,MAAM,CAAC,OAAO,IAAI,CAAC,IAAI,EAAE,MAAM,IAAI,CAAC,IAAI,CAAC,YAAY1D,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAACA,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,IAAI,YAAY,CAAC,IAAIA,EAAE,IAAI,CAAC,IAAI,CAAC,UAAU,CAAO,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,KAAK,IAAI,GAAG,KAAKA,GAAG,UAAWA,CAAAA,EAAE,EAAE,UAAU,AAAD,EAAGA,CAAC,CAAC,IAAI,WAAW,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,SAAS,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,KAAKA,CAAC,CAAC,EAAE,IAAI,CAAC,CAACA,AAAc,EAAdA,EAAE,EAAE,IAAI,CAACA,EAAE,IAAQA,IAAI,GAAG,MAAMA,GAAG,KAAKA,EAAG,KAAI,CAAC,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAGA,IAAI,IAAI,CAAC,IAAI,EAAEA,IAAI,GAAG,IAAI,CAAC,CAAC,CAACA,GAAG,KAAK,IAAIA,EAAE,UAAU,CAAC,IAAI,CAAC,CAAC,CAACA,GAAG,KAAK,IAAIA,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAACA,GAAG,EAAEA,GAAG,IAAI,CAAC,CAAC,CAACA,GAAG,IAAI,CAAC,CAAC,CAACA,EAAE,CAAC,EAAEA,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,YAAY,CAACA,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,GAAGA,GAAI,KAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAACA,EAAC,CAAE,CAAC,EAAEA,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,GAAG,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAACA,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,cAAc,CAACA,IAAI,IAAI,CAAC,IAAI,CAACA,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,GAAK,CAAC,OAAO,CAAC,CAAC,WAAW,CAAC,CAAC,CAACA,EAAE,EAAE,UAAU,OAAO,EAAE,IAAI,CAAC,IAAI,CAACA,GAAI,MAAK,IAAI,EAAE,EAAE,EAAG,GAAE,EAAE,CAACmD,EAAE,aAAa,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,OAAO,GAAG,GAAG,GAAG,IAAI,CAAC,IAAI,EAAE,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,IAAMnD,EAAE,IAAIyD,EAAE,EAAE,IAAI,EAAE,EAAEzD,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAEA,CAAAA,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAACA,CAAC,CAAC,CAAC,KAAKA,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,GAAG,CAACA,EAAE,OAAO,EAAE,OAAO,KAAK,IAAI,GAAG,EAAE,GAAG,CAACA,EAAE,OAAO,CAAC,EAAE,IAAImD,EAAEnD,IAAI,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,GAAI,KAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,EAAC,EAAG,IAAM,EAAE,IAAI,CAAC,IAAI,CAAK,EAAE,EAAE,EAAE,IAAI,IAAM,KAAKA,EAAE,IAAI,EAAE,MAAM,CAAC,EAAE,IAAI,CAAC,EAAE,IAAI0D,EAAE,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,GAAI,GAAE,EAAE,MAAM,EAAG,KAAI,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,MAAM,CAAC,EAAE,CAAC,KAAK1D,EAAE,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC,EAAE,GAAGA,GAAGA,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC,IAAM,EAAEA,EAAE,WAAW,AAACA,CAAAA,EAAE,MAAM,GAAGA,EAAE,CAAC,CAAC,CAAC,aAAaA,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,CAAC,IAAI,EAAG,KAAI,CAAC,IAAI,CAACA,EAAE,IAAI,CAAC,IAAI,GAAGA,EAAC,CAAE,CAAC,EAAC,IAAMwD,EAAN,MAAMA,EAAE,IAAI,SAAS,CAAC,OAAO,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,MAAM,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,YAAYxD,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,CAACA,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,EAAE,CAAE,KAAI,CAAC,IAAI,CAACX,MAAM,EAAE,MAAM,CAAC,GAAG,IAAI,CAAC,IAAIG,QAAQ,IAAI,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,KAAKQ,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAM,EAAE,IAAI,CAAC,OAAO,CAAK,EAAE,CAAC,EAAE,GAAG,KAAK,IAAI,EAAEA,AAAgB,GAAE,CAAC,EAAnBA,EAAE,EAAE,IAAI,CAACA,EAAE,EAAE,KAAYA,IAAI,IAAI,CAAC,IAAI,EAAEA,IAAI,IAAM,KAAI,CAAC,IAAI,CAACA,CAAAA,MAAO,CAAC,IAAc,EAAE,EAAV,EAAEA,EAAU,IAAIA,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,MAAM,CAAC,EAAE,IAAI,AAAqB,CAArB,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAC,IAAM,GAAI,GAAE,IAAI,CAAC,IAAI,CAAC,EAAE,AAAD,EAAG,IAAI,CAAC,EAAE,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAEA,EAAE,EAAEA,IAAI,GAAIA,CAAAA,GAAG,AAAC,IAAG,EAAC,EAAG,CAAC,CAAC,EAAE,EAAE,AAAD,EAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,CAACA,EAAE,CAAC,EAAEA,CAAC,CAAC,CAACA,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAACA,GAAG,GAAG,CAAC,EAAC,IAAMqD,EAAN,MAAMA,UAAUG,EAAE,aAAa,CAAC,KAAK,IAAIlE,WAAW,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAEU,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAACA,IAAI,EAAE,KAAK,EAAEA,CAAC,CAAC,EAAC,IAAMsD,EAAN,MAAMA,UAAUE,EAAE,aAAa,CAAC,KAAK,IAAIlE,WAAW,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAEU,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAACA,GAAGA,IAAI,EAAE,CAAC,EAAC,IAAMuD,EAAN,MAAMA,UAAUC,EAAE,YAAYxD,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAACA,EAAE,EAAE,EAAE,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,KAAKA,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,AAACA,CAAAA,EAAE,EAAE,IAAI,CAACA,EAAE,EAAE,IAAI,KAAK,EAAE,OAAO,IAAM,EAAE,IAAI,CAAC,IAAI,CAAC,EAAEA,IAAI,GAAG,IAAI,GAAGA,EAAE,OAAO,GAAG,EAAE,OAAO,EAAEA,EAAE,IAAI,GAAG,EAAE,IAAI,EAAEA,EAAE,OAAO,GAAG,EAAE,OAAO,CAAC,EAAEA,IAAI,GAAI,KAAI,GAAG,EAAG,IAAG,IAAI,CAAC,OAAO,CAAC,mBAAmB,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAACA,GAAG,IAAI,CAAC,IAAI,CAACA,CAAC,CAAC,YAAYA,CAAC,CAAC,CAAC,YAAY,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,IAAI,CAAC,OAAO,CAACA,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,CAACA,EAAE,CAAC,EAAC,IAAM2D,EAAN,MAAMA,EAAE,YAAY3D,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAACA,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAKA,CAAC,CAAC,CAAC,EAAE,IAAI,CAACA,EAAE,CAAC,EAAC,IAAM,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAEyD,EAAE,EAAE,EAAE,EAAE,EAAE,EAAEC,EAAE,EAAEF,EAAE,EAAEF,EAAE,EAAEC,EAAE,EAAEF,EAAE,EAAEM,CAAC,EAAE,EAAE,EAAE,sBAAsB,AAAC,KAAIR,EAAEO,GAAG,AAAC,GAAE,eAAe,GAAG,EAAE,AAAD,EAAG,IAAI,CAAC,SAAS,IAAM,EAAE,CAAC1D,EAAE,EAAE,KAAK,IAAM,EAAE,GAAG,cAAc,EAAM,EAAE,EAAE,UAAU,CAAC,GAAG,KAAK,IAAI,EAAE,CAAC,IAAMA,EAAE,GAAG,cAAc,IAAK,GAAE,UAAU,CAAC,EAAE,IAAI0D,EAAE,EAAE,YAAY,CAAC,IAAI1D,GAAGA,EAAE,KAAK,EAAE,GAAG,CAAC,EAAE,CAAC,OAAO,EAAE,IAAI,CAACA,GAAG,CAAC,oECA16N,IAAM4D,EAAN,MAAMA,UAAU,IAAC,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,IAAC,CAAC,EAAE,IAAI,GAAG,UAAO,CAAC,MAAMxC,MAAM,IAAI,CAAC,WAAW,CAAC,aAAa,CAAC,wCAAwC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,IAAC,EAAE,MAAM,EAAE,OAAO,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC,EAAE,GAAG,IAAI,IAAC,CAAC,OAAO,EAAE,GAAG,UAAU,OAAO,EAAE,MAAMA,MAAM,IAAI,CAAC,WAAW,CAAC,aAAa,CAAC,qCAAqC,GAAG,IAAI,IAAI,CAAC,EAAE,CAAC,OAAO,IAAI,CAAC,EAAE,AAAC,KAAI,CAAC,EAAE,CAAC,EAAE,IAAM,EAAE,CAAC,EAAE,CAAC,OAAO,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,WAAW,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,QAAQ,EAAE,OAAO,EAAE,CAAC,CAAC,CAACwC,CAAAA,EAAE,aAAa,CAAC,aAAaA,EAAE,UAAU,CAAC,EAAE,IAAM,EAAE,SAAEA,sHCA/gB,IAAM,EAAE/C,WAAW,IAAMoC,EAAN,MAAMA,UAAU,IAAC,CAAC,aAAa,CAAC,KAAK,IAAI3D,WAAW,IAAI,CAAC,aAAa,CAAC,CAAC,KAAK,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,kBAAkB,CAAC,IAAMU,EAAE,KAAK,CAAC,mBAAmB,OAAO,IAAI,CAAC,aAAa,CAAC,YAAY,GAAGA,EAAE,UAAU,CAACA,CAAC,CAAC,OAAOA,CAAC,CAAC,CAAC,IAAMZ,EAAE,IAAI,CAAC,MAAM,EAAG,KAAI,CAAC,UAAU,EAAG,KAAI,CAAC,aAAa,CAAC,WAAW,CAAC,IAAI,CAAC,WAAW,AAAD,EAAG,KAAK,CAAC,OAAOY,GAAG,IAAI,CAAC,IAAI,CAAC,SAAEZ,EAAE,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,mBAAmB,CAAC,KAAK,CAAC,oBAAoB,IAAI,CAAC,IAAI,EAAE,aAAa,CAAC,EAAE,CAAC,sBAAsB,CAAC,KAAK,CAAC,uBAAuB,IAAI,CAAC,IAAI,EAAE,aAAa,CAAC,EAAE,CAAC,QAAQ,CAAC,OAAO,IAAC,CAAC,CAAC6D,CAAAA,EAAE,aAAa,CAAC,CAAC,EAAEA,EAAE,SAAY,CAAC,CAAC,EAAE,EAAE,wBAAwB,GAAG,CAAC,WAAWA,CAAC,GAAG,IAAM,EAAE,EAAE,yBAAyB,CAAC,IAAI,CAAC,WAAWA,CAAC,GAAwD,AAAC,GAAE,kBAAkB,GAAG,EAAE,AAAD,EAAG,IAAI,CAAC"}
+{"version":3,"file":"5557.3923ba7ade67d4c8.js","sources":["webpack://@mdn/fred/./node_modules/assignment/assignment.js","webpack://@mdn/fred/./node_modules/css-loader/dist/runtime/api.js","webpack://@mdn/fred/./node_modules/css-loader/dist/runtime/getUrl.js","webpack://@mdn/fred/./node_modules/css-loader/dist/runtime/noSourceMaps.js","webpack://@mdn/fred/./node_modules/fflate/esm/browser.js","webpack://@mdn/fred/./node_modules/insane/attributes.js","webpack://@mdn/fred/./node_modules/insane/defaults.js","webpack://@mdn/fred/./node_modules/insane/elements.js","webpack://@mdn/fred/./node_modules/insane/insane.js","webpack://@mdn/fred/./node_modules/insane/lowercase.js","webpack://@mdn/fred/./node_modules/insane/parser.js","webpack://@mdn/fred/./node_modules/insane/sanitizer.js","webpack://@mdn/fred/./node_modules/insane/she.js","webpack://@mdn/fred/./node_modules/insane/toMap.js","webpack://@mdn/fred/./node_modules/@fluent/bundle/esm/types.js","webpack://@mdn/fred/./node_modules/@fluent/bundle/esm/resolver.js","webpack://@mdn/fred/./node_modules/@fluent/bundle/esm/scope.js","webpack://@mdn/fred/./node_modules/@fluent/bundle/esm/builtins.js","webpack://@mdn/fred/./node_modules/@fluent/bundle/esm/memoizer.js","webpack://@mdn/fred/./node_modules/@fluent/bundle/esm/bundle.js","webpack://@mdn/fred/./node_modules/@fluent/bundle/esm/resource.js","webpack://@mdn/fred/./node_modules/lit-html/private-ssr-support.js","webpack://@mdn/fred/./node_modules/@lit-labs/ssr-client/lib/hydrate-lit-html.js","webpack://@mdn/fred/./node_modules/@lit-labs/ssr-client/lit-element-hydrate-support.js","webpack://@mdn/fred/./node_modules/@lit/reactive-element/css-tag.js","webpack://@mdn/fred/./node_modules/@lit/reactive-element/reactive-element.js","webpack://@mdn/fred/./node_modules/@lit/task/task.js","webpack://@mdn/fred/./node_modules/lit-html/directive-helpers.js","webpack://@mdn/fred/./node_modules/lit-html/directive.js","webpack://@mdn/fred/./node_modules/lit-html/lit-html.js","webpack://@mdn/fred/./node_modules/lit-html/directives/unsafe-html.js","webpack://@mdn/fred/./node_modules/lit-element/lit-element.js"],"sourcesContent":["'use strict';\n\nfunction assignment (result) {\n  var stack = Array.prototype.slice.call(arguments, 1);\n  var item;\n  var key;\n  while (stack.length) {\n    item = stack.shift();\n    for (key in item) {\n      if (item.hasOwnProperty(key)) {\n        if (Object.prototype.toString.call(result[key]) === '[object Object]') {\n          result[key] = assignment(result[key], item[key]);\n        } else {\n          result[key] = item[key];\n        }\n      }\n    }\n  }\n  return result;\n}\n\nmodule.exports = assignment;\n","\"use strict\";\n\n/*\n  MIT License http://www.opensource.org/licenses/mit-license.php\n  Author Tobias Koppers @sokra\n*/\nmodule.exports = function (cssWithMappingToString) {\n  var list = [];\n\n  // return the list of modules as css string\n  list.toString = function toString() {\n    return this.map(function (item) {\n      var content = \"\";\n      var needLayer = typeof item[5] !== \"undefined\";\n      if (item[4]) {\n        content += \"@supports (\".concat(item[4], \") {\");\n      }\n      if (item[2]) {\n        content += \"@media \".concat(item[2], \" {\");\n      }\n      if (needLayer) {\n        content += \"@layer\".concat(item[5].length > 0 ? \" \".concat(item[5]) : \"\", \" {\");\n      }\n      content += cssWithMappingToString(item);\n      if (needLayer) {\n        content += \"}\";\n      }\n      if (item[2]) {\n        content += \"}\";\n      }\n      if (item[4]) {\n        content += \"}\";\n      }\n      return content;\n    }).join(\"\");\n  };\n\n  // import a list of modules into the list\n  list.i = function i(modules, media, dedupe, supports, layer) {\n    if (typeof modules === \"string\") {\n      modules = [[null, modules, undefined]];\n    }\n    var alreadyImportedModules = {};\n    if (dedupe) {\n      for (var k = 0; k < this.length; k++) {\n        var id = this[k][0];\n        if (id != null) {\n          alreadyImportedModules[id] = true;\n        }\n      }\n    }\n    for (var _k = 0; _k < modules.length; _k++) {\n      var item = [].concat(modules[_k]);\n      if (dedupe && alreadyImportedModules[item[0]]) {\n        continue;\n      }\n      if (typeof layer !== \"undefined\") {\n        if (typeof item[5] === \"undefined\") {\n          item[5] = layer;\n        } else {\n          item[1] = \"@layer\".concat(item[5].length > 0 ? \" \".concat(item[5]) : \"\", \" {\").concat(item[1], \"}\");\n          item[5] = layer;\n        }\n      }\n      if (media) {\n        if (!item[2]) {\n          item[2] = media;\n        } else {\n          item[1] = \"@media \".concat(item[2], \" {\").concat(item[1], \"}\");\n          item[2] = media;\n        }\n      }\n      if (supports) {\n        if (!item[4]) {\n          item[4] = \"\".concat(supports);\n        } else {\n          item[1] = \"@supports (\".concat(item[4], \") {\").concat(item[1], \"}\");\n          item[4] = supports;\n        }\n      }\n      list.push(item);\n    }\n  };\n  return list;\n};","\"use strict\";\n\nmodule.exports = function (url, options) {\n  if (!options) {\n    options = {};\n  }\n  if (!url) {\n    return url;\n  }\n  url = String(url.__esModule ? url.default : url);\n\n  // If url is already wrapped in quotes, remove them\n  if (/^['\"].*['\"]$/.test(url)) {\n    url = url.slice(1, -1);\n  }\n  if (options.hash) {\n    url += options.hash;\n  }\n\n  // Should url be wrapped?\n  // See https://drafts.csswg.org/css-values-3/#urls\n  if (/[\"'() \\t\\n]|(%20)/.test(url) || options.needQuotes) {\n    return \"\\\"\".concat(url.replace(/\"/g, '\\\\\"').replace(/\\n/g, \"\\\\n\"), \"\\\"\");\n  }\n  return url;\n};","\"use strict\";\n\nmodule.exports = function (i) {\n  return i[1];\n};","// 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","'use strict';\n\nvar toMap = require('./toMap');\nvar uris = ['background', 'base', 'cite', 'href', 'longdesc', 'src', 'usemap'];\n\nmodule.exports = {\n  uris: toMap(uris) // attributes that have an href and hence need to be sanitized\n};\n","'use strict';\n\nvar defaults = {\n  allowedAttributes: {\n    a: ['href', 'name', 'target', 'title', 'aria-label'],\n    iframe: ['allowfullscreen', 'frameborder', 'src'],\n    img: ['src', 'alt', 'title', 'aria-label']\n  },\n  allowedClasses: {},\n  allowedSchemes: ['http', 'https', 'mailto'],\n  allowedTags: [\n    'a', 'abbr', 'article', 'b', 'blockquote', 'br', 'caption', 'code', 'del', 'details', 'div', 'em',\n    'h1', 'h2', 'h3', 'h4', 'h5', 'h6', 'hr', 'i', 'img', 'ins', 'kbd', 'li', 'main', 'mark',\n    'ol', 'p', 'pre', 'section', 'span', 'strike', 'strong', 'sub', 'summary', 'sup', 'table',\n    'tbody', 'td', 'th', 'thead', 'tr', 'u', 'ul'\n  ],\n  filter: null\n};\n\nmodule.exports = defaults;\n","'use strict';\n\nvar toMap = require('./toMap');\nvar voids = ['area', 'br', 'col', 'hr', 'img', 'wbr', 'input', 'base', 'basefont', 'link', 'meta'];\n\nmodule.exports = {\n  voids: toMap(voids)\n};\n","'use strict';\n\nvar he = require('he');\nvar assign = require('assignment');\nvar parser = require('./parser');\nvar sanitizer = require('./sanitizer');\nvar defaults = require('./defaults');\n\nfunction insane (html, options, strict) {\n  var buffer = [];\n  var configuration = strict === true ? options : assign({}, defaults, options);\n  var handler = sanitizer(buffer, configuration);\n\n  parser(html, handler);\n\n  return buffer.join('');\n}\n\ninsane.defaults = defaults;\nmodule.exports = insane;\n","'use strict';\n\nmodule.exports = function lowercase (string) {\n  return typeof string === 'string' ? string.toLowerCase() : string;\n};\n","'use strict';\n\nvar he = require('he');\nvar lowercase = require('./lowercase');\nvar attributes = require('./attributes');\nvar elements = require('./elements');\nvar rstart = /^<\\s*([\\w:-]+)((?:\\s+[\\w:-]+(?:\\s*=\\s*(?:(?:\"[^\"]*\")|(?:'[^']*')|[^>\\s]+))?)*)\\s*(\\/?)\\s*>/;\nvar rend = /^<\\s*\\/\\s*([\\w:-]+)[^>]*>/;\nvar rattrs = /([\\w:-]+)(?:\\s*=\\s*(?:(?:\"((?:[^\"])*)\")|(?:'((?:[^'])*)')|([^>\\s]+)))?/g;\nvar rtag = /^</;\nvar rtagend = /^<\\s*\\//;\n\nfunction createStack () {\n  var stack = [];\n  stack.lastItem = function lastItem () {\n    return stack[stack.length - 1];\n  };\n  return stack;\n}\n\nfunction parser (html, handler) {\n  var stack = createStack();\n  var last = html;\n  var chars;\n\n  while (html) {\n    parsePart();\n  }\n  parseEndTag(); // clean up any remaining tags\n\n  function parsePart () {\n    chars = true;\n    parseTag();\n\n    var same = html === last;\n    last = html;\n\n    if (same) { // discard, because it's invalid\n      html = '';\n    }\n  }\n\n  function parseTag () {\n    if (html.substr(0, 4) === '<!--') { // comments\n      parseComment();\n    } else if (rtagend.test(html)) {\n      parseEdge(rend, parseEndTag);\n    } else if (rtag.test(html)) {\n      parseEdge(rstart, parseStartTag);\n    }\n    parseTagDecode();\n  }\n\n  function parseEdge (regex, parser) {\n    var match = html.match(regex);\n    if (match) {\n      html = html.substring(match[0].length);\n      match[0].replace(regex, parser);\n      chars = false;\n    }\n  }\n\n  function parseComment () {\n    var index = html.indexOf('-->');\n    if (index >= 0) {\n      if (handler.comment) {\n        handler.comment(html.substring(4, index));\n      }\n      html = html.substring(index + 3);\n      chars = false;\n    }\n  }\n\n  function parseTagDecode () {\n    if (!chars) {\n      return;\n    }\n    var text;\n    var index = html.indexOf('<');\n    if (index >= 0) {\n      text = html.substring(0, index);\n      html = html.substring(index);\n    } else {\n      text = html;\n      html = '';\n    }\n    if (handler.chars) {\n      handler.chars(text);\n    }\n  }\n\n  function parseStartTag (tag, tagName, rest, unary) {\n    var attrs = {};\n    var low = lowercase(tagName);\n    var u = elements.voids[low] || !!unary;\n\n    rest.replace(rattrs, attrReplacer);\n\n    if (!u) {\n      stack.push(low);\n    }\n    if (handler.start) {\n      handler.start(low, attrs, u);\n    }\n\n    function attrReplacer (match, name, doubleQuotedValue, singleQuotedValue, unquotedValue) {\n      if (doubleQuotedValue === void 0 && singleQuotedValue === void 0 && unquotedValue === void 0) {\n        attrs[name] = void 0; // attribute is like <button disabled></button>\n      } else {\n        attrs[name] = he.decode(doubleQuotedValue || singleQuotedValue || unquotedValue || '');\n      }\n    }\n  }\n\n  function parseEndTag (tag, tagName) {\n    var i;\n    var pos = 0;\n    var low = lowercase(tagName);\n    if (low) {\n      for (pos = stack.length - 1; pos >= 0; pos--) {\n        if (stack[pos] === low) {\n          break; // find the closest opened tag of the same type\n        }\n      }\n    }\n    if (pos >= 0) {\n      for (i = stack.length - 1; i >= pos; i--) {\n        if (handler.end) { // close all the open elements, up the stack\n          handler.end(stack[i]);\n        }\n      }\n      stack.length = pos;\n    }\n  }\n}\n\nmodule.exports = parser;\n","'use strict';\n\nvar he = require('he');\nvar lowercase = require('./lowercase');\nvar attributes = require('./attributes');\nvar elements = require('./elements');\n\nfunction sanitizer (buffer, options) {\n  var last;\n  var context;\n  var o = options || {};\n\n  reset();\n\n  return {\n    start: start,\n    end: end,\n    chars: chars\n  };\n\n  function out (value) {\n    buffer.push(value);\n  }\n\n  function start (tag, attrs, unary) {\n    var low = lowercase(tag);\n\n    if (context.ignoring) {\n      ignore(low); return;\n    }\n    if ((o.allowedTags || []).indexOf(low) === -1) {\n      ignore(low); return;\n    }\n    if (o.filter && !o.filter({ tag: low, attrs: attrs })) {\n      ignore(low); return;\n    }\n\n    out('<');\n    out(low);\n    Object.keys(attrs).forEach(parse);\n    out(unary ? '/>' : '>');\n\n    function parse (key) {\n      var value = attrs[key];\n      var classesOk = (o.allowedClasses || {})[low] || [];\n      var attrsOk = (o.allowedAttributes || {})[low] || [];\n      var valid;\n      var lkey = lowercase(key);\n      if (lkey === 'class' && attrsOk.indexOf(lkey) === -1) {\n        value = value.split(' ').filter(isValidClass).join(' ').trim();\n        valid = value.length;\n      } else {\n        valid = attrsOk.indexOf(lkey) !== -1 && (attributes.uris[lkey] !== true || testUrl(value));\n      }\n      if (valid) {\n        out(' ');\n        out(key);\n        if (typeof value === 'string') {\n          out('=\"');\n          out(he.encode(value));\n          out('\"');\n        }\n      }\n      function isValidClass (className) {\n        return classesOk && classesOk.indexOf(className) !== -1;\n      }\n    }\n  }\n\n  function end (tag) {\n    var low = lowercase(tag);\n    var allowed = (o.allowedTags || []).indexOf(low) !== -1;\n    if (allowed) {\n      if (context.ignoring === false) {\n        out('</');\n        out(low);\n        out('>');\n      } else {\n        unignore(low);\n      }\n    } else {\n      unignore(low);\n    }\n  }\n\n  function testUrl (text) {\n    var start = text[0];\n    if (start === '#' || start === '/') {\n      return true;\n    }\n    var colon = text.indexOf(':');\n    if (colon === -1) {\n      return true;\n    }\n    var questionmark = text.indexOf('?');\n    if (questionmark !== -1 && colon > questionmark) {\n      return true;\n    }\n    var hash = text.indexOf('#');\n    if (hash !== -1 && colon > hash) {\n      return true;\n    }\n    return o.allowedSchemes.some(matches);\n\n    function matches (scheme) {\n      return text.indexOf(scheme + ':') === 0;\n    }\n  }\n\n  function chars (text) {\n    if (context.ignoring === false) {\n      out(o.transformText ? o.transformText(text) : text);\n    }\n  }\n\n  function ignore (tag) {\n    if (elements.voids[tag]) {\n      return;\n    }\n    if (context.ignoring === false) {\n      context = { ignoring: tag, depth: 1 };\n    } else if (context.ignoring === tag) {\n      context.depth++;\n    }\n  }\n\n  function unignore (tag) {\n    if (context.ignoring === tag) {\n      if (--context.depth <= 0) {\n        reset();\n      }\n    }\n  }\n\n  function reset () {\n    context = { ignoring: false, depth: 0 };\n  }\n}\n\nmodule.exports = sanitizer;\n","'use strict';\n\nvar escapes = {\n  '&': '&amp;',\n  '<': '&lt;',\n  '>': '&gt;',\n  '\"': '&quot;',\n  \"'\": '&#39;'\n};\nvar unescapes = {\n  '&amp;': '&',\n  '&lt;': '<',\n  '&gt;': '>',\n  '&quot;': '\"',\n  '&#39;': \"'\"\n};\nvar rescaped = /(&amp;|&lt;|&gt;|&quot;|&#39;)/g;\nvar runescaped = /[&<>\"']/g;\n\nfunction escapeHtmlChar (match) {\n  return escapes[match];\n}\nfunction unescapeHtmlChar (match) {\n  return unescapes[match];\n}\n\nfunction escapeHtml (text) {\n  return text == null ? '' : String(text).replace(runescaped, escapeHtmlChar);\n}\n\nfunction unescapeHtml (html) {\n  return html == null ? '' : String(html).replace(rescaped, unescapeHtmlChar);\n}\n\nescapeHtml.options = unescapeHtml.options = {};\n\nmodule.exports = {\n  encode: escapeHtml,\n  escape: escapeHtml,\n  decode: unescapeHtml,\n  unescape: unescapeHtml,\n  version: '1.0.0-browser'\n};\n","'use strict';\n\nfunction toMap (list) {\n  return list.reduce(asKey, {});\n}\n\nfunction asKey (accumulator, item) {\n  accumulator[item] = true;\n  return accumulator;\n}\n\nmodule.exports = toMap;\n","/**\n * The `FluentType` class is the base of Fluent's type system.\n *\n * Fluent types wrap JavaScript values and store additional configuration for\n * them, which can then be used in the `toString` method together with a proper\n * `Intl` formatter.\n */\nexport class FluentType {\n    /**\n     * Create a `FluentType` instance.\n     *\n     * @param value The JavaScript value to wrap.\n     */\n    constructor(value) {\n        this.value = value;\n    }\n    /**\n     * Unwrap the raw value stored by this `FluentType`.\n     */\n    valueOf() {\n        return this.value;\n    }\n}\n/**\n * A {@link FluentType} representing no correct value.\n */\nexport class FluentNone extends FluentType {\n    /**\n     * Create an instance of `FluentNone` with an optional fallback value.\n     * @param value The fallback value of this `FluentNone`.\n     */\n    constructor(value = \"???\") {\n        super(value);\n    }\n    /**\n     * Format this `FluentNone` to the fallback string.\n     */\n    toString(scope) {\n        return `{${this.value}}`;\n    }\n}\n/**\n * A {@link FluentType} representing a number.\n *\n * A `FluentNumber` instance stores the number value of the number it\n * represents. It may also store an option bag of options which will be passed\n * to `Intl.NumerFormat` when the `FluentNumber` is formatted to a string.\n */\nexport class FluentNumber extends FluentType {\n    /**\n     * Create an instance of `FluentNumber` with options to the\n     * `Intl.NumberFormat` constructor.\n     *\n     * @param value The number value of this `FluentNumber`.\n     * @param opts Options which will be passed to `Intl.NumberFormat`.\n     */\n    constructor(value, opts = {}) {\n        super(value);\n        this.opts = opts;\n    }\n    /**\n     * Format this `FluentNumber` to a string.\n     */\n    toString(scope) {\n        if (scope) {\n            try {\n                const nf = scope.memoizeIntlObject(Intl.NumberFormat, this.opts);\n                return nf.format(this.value);\n            }\n            catch (err) {\n                scope.reportError(err);\n            }\n        }\n        return this.value.toString(10);\n    }\n}\n/**\n * A {@link FluentType} representing a date and time.\n *\n * A `FluentDateTime` instance stores a Date object, Temporal object, or a number\n * as a numerical timestamp in milliseconds. It may also store an\n * option bag of options which will be passed to `Intl.DateTimeFormat` when the\n * `FluentDateTime` is formatted to a string.\n */\nexport class FluentDateTime extends FluentType {\n    static supportsValue(value) {\n        if (typeof value === \"number\")\n            return true;\n        if (value instanceof Date)\n            return true;\n        if (value instanceof FluentType)\n            return FluentDateTime.supportsValue(value.valueOf());\n        // Temporary workaround to support environments without Temporal\n        if (\"Temporal\" in globalThis) {\n            // for TypeScript, which doesn't know about Temporal yet\n            const _Temporal = globalThis.Temporal;\n            if (value instanceof _Temporal.Instant ||\n                value instanceof _Temporal.PlainDateTime ||\n                value instanceof _Temporal.PlainDate ||\n                value instanceof _Temporal.PlainMonthDay ||\n                value instanceof _Temporal.PlainTime ||\n                value instanceof _Temporal.PlainYearMonth) {\n                return true;\n            }\n        }\n        return false;\n    }\n    /**\n     * Create an instance of `FluentDateTime` with options to the\n     * `Intl.DateTimeFormat` constructor.\n     *\n     * @param value The number value of this `FluentDateTime`, in milliseconds.\n     * @param opts Options which will be passed to `Intl.DateTimeFormat`.\n     */\n    constructor(value, opts = {}) {\n        // unwrap any FluentType value, but only retain the opts from FluentDateTime\n        if (value instanceof FluentDateTime) {\n            opts = { ...value.opts, ...opts };\n            value = value.value;\n        }\n        else if (value instanceof FluentType) {\n            value = value.valueOf();\n        }\n        // Intl.DateTimeFormat defaults to gregorian calendar, but Temporal defaults to iso8601\n        if (typeof value === \"object\" &&\n            \"calendarId\" in value &&\n            opts.calendar === undefined) {\n            opts = { ...opts, calendar: value.calendarId };\n        }\n        super(value);\n        this.opts = opts;\n    }\n    [Symbol.toPrimitive](hint) {\n        return hint === \"string\" ? this.toString() : this.toNumber();\n    }\n    /**\n     * Convert this `FluentDateTime` to a number.\n     * Note that this isn't always possible due to the nature of Temporal objects.\n     * In such cases, a TypeError will be thrown.\n     */\n    toNumber() {\n        const value = this.value;\n        if (typeof value === \"number\")\n            return value;\n        if (value instanceof Date)\n            return value.getTime();\n        if (\"epochMilliseconds\" in value) {\n            return value.epochMilliseconds;\n        }\n        if (\"toZonedDateTime\" in value) {\n            return value.toZonedDateTime(\"UTC\").epochMilliseconds;\n        }\n        throw new TypeError(\"Unwrapping a non-number value as a number\");\n    }\n    /**\n     * Format this `FluentDateTime` to a string.\n     */\n    toString(scope) {\n        if (scope) {\n            try {\n                const dtf = scope.memoizeIntlObject(Intl.DateTimeFormat, this.opts);\n                return dtf.format(this.value);\n            }\n            catch (err) {\n                scope.reportError(err);\n            }\n        }\n        if (typeof this.value === \"number\" || this.value instanceof Date) {\n            return new Date(this.value).toISOString();\n        }\n        return this.value.toString();\n    }\n}\n","/**\n * The role of the Fluent resolver is to format a `Pattern` to an instance of\n * `FluentValue`. For performance reasons, primitive strings are considered\n * such instances, too.\n *\n * Translations can contain references to other messages or variables,\n * conditional logic in form of select expressions, traits which describe their\n * grammatical features, and can use Fluent builtins which make use of the\n * `Intl` formatters to format numbers and dates into the bundle's languages.\n * See the documentation of the Fluent syntax for more information.\n *\n * In case of errors the resolver will try to salvage as much of the\n * translation as possible. In rare situations where the resolver didn't know\n * how to recover from an error it will return an instance of `FluentNone`.\n *\n * All expressions resolve to an instance of `FluentValue`. The caller should\n * use the `toString` method to convert the instance to a native value.\n *\n * Functions in this file pass around an instance of the `Scope` class, which\n * stores the data required for successful resolution and error recovery.\n */\nimport { FluentType, FluentNone, FluentNumber, FluentDateTime, } from \"./types.js\";\n/**\n * The maximum number of placeables which can be expanded in a single call to\n * `formatPattern`. The limit protects against the Billion Laughs and Quadratic\n * Blowup attacks. See https://msdn.microsoft.com/en-us/magazine/ee335713.aspx.\n */\nconst MAX_PLACEABLES = 100;\n/** Unicode bidi isolation characters. */\nconst FSI = \"\\u2068\";\nconst PDI = \"\\u2069\";\n/** Helper: match a variant key to the given selector. */\nfunction match(scope, selector, key) {\n    if (key === selector) {\n        // Both are strings.\n        return true;\n    }\n    // XXX Consider comparing options too, e.g. minimumFractionDigits.\n    if (key instanceof FluentNumber &&\n        selector instanceof FluentNumber &&\n        key.value === selector.value) {\n        return true;\n    }\n    if (selector instanceof FluentNumber && typeof key === \"string\") {\n        let category = scope\n            .memoizeIntlObject(Intl.PluralRules, selector.opts)\n            .select(selector.value);\n        if (key === category) {\n            return true;\n        }\n    }\n    return false;\n}\n/** Helper: resolve the default variant from a list of variants. */\nfunction getDefault(scope, variants, star) {\n    if (variants[star]) {\n        return resolvePattern(scope, variants[star].value);\n    }\n    scope.reportError(new RangeError(\"No default\"));\n    return new FluentNone();\n}\n/** Helper: resolve arguments to a call expression. */\nfunction getArguments(scope, args) {\n    const positional = [];\n    const named = Object.create(null);\n    for (const arg of args) {\n        if (arg.type === \"narg\") {\n            named[arg.name] = resolveExpression(scope, arg.value);\n        }\n        else {\n            positional.push(resolveExpression(scope, arg));\n        }\n    }\n    return { positional, named };\n}\n/** Resolve an expression to a Fluent type. */\nfunction resolveExpression(scope, expr) {\n    switch (expr.type) {\n        case \"str\":\n            return expr.value;\n        case \"num\":\n            return new FluentNumber(expr.value, {\n                minimumFractionDigits: expr.precision,\n            });\n        case \"var\":\n            return resolveVariableReference(scope, expr);\n        case \"mesg\":\n            return resolveMessageReference(scope, expr);\n        case \"term\":\n            return resolveTermReference(scope, expr);\n        case \"func\":\n            return resolveFunctionReference(scope, expr);\n        case \"select\":\n            return resolveSelectExpression(scope, expr);\n        default:\n            return new FluentNone();\n    }\n}\n/** Resolve a reference to a variable. */\nfunction resolveVariableReference(scope, { name }) {\n    let arg;\n    if (scope.params) {\n        // We're inside a TermReference. It's OK to reference undefined parameters.\n        if (Object.prototype.hasOwnProperty.call(scope.params, name)) {\n            arg = scope.params[name];\n        }\n        else {\n            return new FluentNone(`$${name}`);\n        }\n    }\n    else if (scope.args &&\n        Object.prototype.hasOwnProperty.call(scope.args, name)) {\n        // We're in the top-level Pattern or inside a MessageReference. Missing\n        // variables references produce ReferenceErrors.\n        arg = scope.args[name];\n    }\n    else {\n        scope.reportError(new ReferenceError(`Unknown variable: $${name}`));\n        return new FluentNone(`$${name}`);\n    }\n    // Return early if the argument already is an instance of FluentType.\n    if (arg instanceof FluentType) {\n        return arg;\n    }\n    // Convert the argument to a Fluent type.\n    switch (typeof arg) {\n        case \"string\":\n            return arg;\n        case \"number\":\n            return new FluentNumber(arg);\n        case \"object\":\n            if (FluentDateTime.supportsValue(arg)) {\n                return new FluentDateTime(arg);\n            }\n        // eslint-disable-next-line no-fallthrough\n        default:\n            scope.reportError(new TypeError(`Variable type not supported: $${name}, ${typeof arg}`));\n            return new FluentNone(`$${name}`);\n    }\n}\n/** Resolve a reference to another message. */\nfunction resolveMessageReference(scope, { name, attr }) {\n    const message = scope.bundle._messages.get(name);\n    if (!message) {\n        scope.reportError(new ReferenceError(`Unknown message: ${name}`));\n        return new FluentNone(name);\n    }\n    if (attr) {\n        const attribute = message.attributes[attr];\n        if (attribute) {\n            return resolvePattern(scope, attribute);\n        }\n        scope.reportError(new ReferenceError(`Unknown attribute: ${attr}`));\n        return new FluentNone(`${name}.${attr}`);\n    }\n    if (message.value) {\n        return resolvePattern(scope, message.value);\n    }\n    scope.reportError(new ReferenceError(`No value: ${name}`));\n    return new FluentNone(name);\n}\n/** Resolve a call to a Term with key-value arguments. */\nfunction resolveTermReference(scope, { name, attr, args }) {\n    const id = `-${name}`;\n    const term = scope.bundle._terms.get(id);\n    if (!term) {\n        scope.reportError(new ReferenceError(`Unknown term: ${id}`));\n        return new FluentNone(id);\n    }\n    if (attr) {\n        const attribute = term.attributes[attr];\n        if (attribute) {\n            // Every TermReference has its own variables.\n            scope.params = getArguments(scope, args).named;\n            const resolved = resolvePattern(scope, attribute);\n            scope.params = null;\n            return resolved;\n        }\n        scope.reportError(new ReferenceError(`Unknown attribute: ${attr}`));\n        return new FluentNone(`${id}.${attr}`);\n    }\n    scope.params = getArguments(scope, args).named;\n    const resolved = resolvePattern(scope, term.value);\n    scope.params = null;\n    return resolved;\n}\n/** Resolve a call to a Function with positional and key-value arguments. */\nfunction resolveFunctionReference(scope, { name, args }) {\n    // Some functions are built-in. Others may be provided by the runtime via\n    // the `FluentBundle` constructor.\n    let func = scope.bundle._functions[name];\n    if (!func) {\n        scope.reportError(new ReferenceError(`Unknown function: ${name}()`));\n        return new FluentNone(`${name}()`);\n    }\n    if (typeof func !== \"function\") {\n        scope.reportError(new TypeError(`Function ${name}() is not callable`));\n        return new FluentNone(`${name}()`);\n    }\n    try {\n        let resolved = getArguments(scope, args);\n        return func(resolved.positional, resolved.named);\n    }\n    catch (err) {\n        scope.reportError(err);\n        return new FluentNone(`${name}()`);\n    }\n}\n/** Resolve a select expression to the member object. */\nfunction resolveSelectExpression(scope, { selector, variants, star }) {\n    let sel = resolveExpression(scope, selector);\n    if (sel instanceof FluentNone) {\n        return getDefault(scope, variants, star);\n    }\n    // Match the selector against keys of each variant, in order.\n    for (const variant of variants) {\n        const key = resolveExpression(scope, variant.key);\n        if (match(scope, sel, key)) {\n            return resolvePattern(scope, variant.value);\n        }\n    }\n    return getDefault(scope, variants, star);\n}\n/** Resolve a pattern (a complex string with placeables). */\nexport function resolveComplexPattern(scope, ptn) {\n    if (scope.dirty.has(ptn)) {\n        scope.reportError(new RangeError(\"Cyclic reference\"));\n        return new FluentNone();\n    }\n    // Tag the pattern as dirty for the purpose of the current resolution.\n    scope.dirty.add(ptn);\n    const result = [];\n    // Wrap interpolations with Directional Isolate Formatting characters\n    // only when the pattern has more than one element.\n    const useIsolating = scope.bundle._useIsolating && ptn.length > 1;\n    for (const elem of ptn) {\n        if (typeof elem === \"string\") {\n            result.push(scope.bundle._transform(elem));\n            continue;\n        }\n        scope.placeables++;\n        if (scope.placeables > MAX_PLACEABLES) {\n            scope.dirty.delete(ptn);\n            // This is a fatal error which causes the resolver to instantly bail out\n            // on this pattern. The length check protects against excessive memory\n            // usage, and throwing protects against eating up the CPU when long\n            // placeables are deeply nested.\n            throw new RangeError(`Too many placeables expanded: ${scope.placeables}, ` +\n                `max allowed is ${MAX_PLACEABLES}`);\n        }\n        if (useIsolating) {\n            result.push(FSI);\n        }\n        result.push(resolveExpression(scope, elem).toString(scope));\n        if (useIsolating) {\n            result.push(PDI);\n        }\n    }\n    scope.dirty.delete(ptn);\n    return result.join(\"\");\n}\n/**\n * Resolve a simple or a complex Pattern to a FluentString\n * (which is really the string primitive).\n */\nfunction resolvePattern(scope, value) {\n    // Resolve a simple pattern.\n    if (typeof value === \"string\") {\n        return scope.bundle._transform(value);\n    }\n    return resolveComplexPattern(scope, value);\n}\n","export class Scope {\n    constructor(bundle, errors, args) {\n        /**\n         * The Set of patterns already encountered during this resolution.\n         * Used to detect and prevent cyclic resolutions.\n         * @ignore\n         */\n        this.dirty = new WeakSet();\n        /** A dict of parameters passed to a TermReference. */\n        this.params = null;\n        /**\n         * The running count of placeables resolved so far.\n         * Used to detect the Billion Laughs and Quadratic Blowup attacks.\n         * @ignore\n         */\n        this.placeables = 0;\n        this.bundle = bundle;\n        this.errors = errors;\n        this.args = args;\n    }\n    reportError(error) {\n        if (!this.errors || !(error instanceof Error)) {\n            throw error;\n        }\n        this.errors.push(error);\n    }\n    memoizeIntlObject(ctor, opts) {\n        let cache = this.bundle._intls.get(ctor);\n        if (!cache) {\n            cache = {};\n            this.bundle._intls.set(ctor, cache);\n        }\n        let id = JSON.stringify(opts);\n        if (!cache[id]) {\n            // @ts-expect-error This is fine.\n            // eslint-disable-next-line @typescript-eslint/no-unsafe-assignment\n            cache[id] = new ctor(this.bundle.locales, opts);\n        }\n        return cache[id];\n    }\n}\n","/**\n * @overview\n *\n * The FTL resolver ships with a number of functions built-in.\n *\n * Each function take two arguments:\n *   - args - an array of positional args\n *   - opts - an object of key-value args\n *\n * Arguments to functions are guaranteed to already be instances of\n * `FluentValue`.  Functions must return `FluentValues` as well.\n */\nimport { FluentNone, FluentNumber, FluentDateTime, } from \"./types.js\";\nfunction values(opts, allowed) {\n    const unwrapped = Object.create(null);\n    for (const [name, opt] of Object.entries(opts)) {\n        if (allowed.includes(name)) {\n            unwrapped[name] = opt.valueOf();\n        }\n    }\n    return unwrapped;\n}\nconst NUMBER_ALLOWED = [\n    \"unitDisplay\",\n    \"currencyDisplay\",\n    \"useGrouping\",\n    \"minimumIntegerDigits\",\n    \"minimumFractionDigits\",\n    \"maximumFractionDigits\",\n    \"minimumSignificantDigits\",\n    \"maximumSignificantDigits\",\n];\n/**\n * The implementation of the `NUMBER()` builtin available to translations.\n *\n * Translations may call the `NUMBER()` builtin in order to specify formatting\n * options of a number. For example:\n *\n *     pi = The value of π is {NUMBER($pi, maximumFractionDigits: 2)}.\n *\n * The implementation expects an array of {@link FluentValue | FluentValues} representing the\n * positional arguments, and an object of named {@link FluentValue | FluentValues} representing the\n * named parameters.\n *\n * The following options are recognized:\n *\n *     unitDisplay\n *     currencyDisplay\n *     useGrouping\n *     minimumIntegerDigits\n *     minimumFractionDigits\n *     maximumFractionDigits\n *     minimumSignificantDigits\n *     maximumSignificantDigits\n *\n * Other options are ignored.\n *\n * @param args The positional arguments passed to this `NUMBER()`.\n * @param opts The named argments passed to this `NUMBER()`.\n */\nexport function NUMBER(args, opts) {\n    let arg = args[0];\n    if (arg instanceof FluentNone) {\n        return new FluentNone(`NUMBER(${arg.valueOf()})`);\n    }\n    if (arg instanceof FluentNumber) {\n        return new FluentNumber(arg.valueOf(), {\n            ...arg.opts,\n            ...values(opts, NUMBER_ALLOWED),\n        });\n    }\n    if (arg instanceof FluentDateTime) {\n        return new FluentNumber(arg.toNumber(), {\n            ...values(opts, NUMBER_ALLOWED),\n        });\n    }\n    throw new TypeError(\"Invalid argument to NUMBER\");\n}\nconst DATETIME_ALLOWED = [\n    \"dateStyle\",\n    \"timeStyle\",\n    \"fractionalSecondDigits\",\n    \"dayPeriod\",\n    \"hour12\",\n    \"weekday\",\n    \"era\",\n    \"year\",\n    \"month\",\n    \"day\",\n    \"hour\",\n    \"minute\",\n    \"second\",\n    \"timeZoneName\",\n];\n/**\n * The implementation of the `DATETIME()` builtin available to translations.\n *\n * Translations may call the `DATETIME()` builtin in order to specify\n * formatting options of a number. For example:\n *\n *     now = It's {DATETIME($today, month: \"long\")}.\n *\n * The implementation expects an array of {@link FluentValue | FluentValues} representing the\n * positional arguments, and an object of named {@link FluentValue | FluentValues} representing the\n * named parameters.\n *\n * The following options are recognized:\n *\n *     dateStyle\n *     timeStyle\n *     fractionalSecondDigits\n *     dayPeriod\n *     hour12\n *     weekday\n *     era\n *     year\n *     month\n *     day\n *     hour\n *     minute\n *     second\n *     timeZoneName\n *\n * Other options are ignored.\n *\n * @param args The positional arguments passed to this `DATETIME()`.\n * @param opts The named argments passed to this `DATETIME()`.\n */\nexport function DATETIME(args, opts) {\n    let arg = args[0];\n    if (arg instanceof FluentNone) {\n        return new FluentNone(`DATETIME(${arg.valueOf()})`);\n    }\n    if (arg instanceof FluentDateTime || arg instanceof FluentNumber) {\n        return new FluentDateTime(arg, values(opts, DATETIME_ALLOWED));\n    }\n    throw new TypeError(\"Invalid argument to DATETIME\");\n}\n","const cache = new Map();\nexport function getMemoizerForLocale(locales) {\n    const stringLocale = Array.isArray(locales) ? locales.join(\" \") : locales;\n    let memoizer = cache.get(stringLocale);\n    if (memoizer === undefined) {\n        memoizer = new Map();\n        cache.set(stringLocale, memoizer);\n    }\n    return memoizer;\n}\n","import { resolveComplexPattern } from \"./resolver.js\";\nimport { Scope } from \"./scope.js\";\nimport { FluentNone } from \"./types.js\";\nimport { NUMBER, DATETIME } from \"./builtins.js\";\nimport { getMemoizerForLocale } from \"./memoizer.js\";\n/**\n * Message bundles are single-language stores of translation resources. They are\n * responsible for formatting message values and attributes to strings.\n */\nexport class FluentBundle {\n    /**\n     * Create an instance of `FluentBundle`.\n     *\n     * @example\n     * ```js\n     * let bundle = new FluentBundle([\"en-US\", \"en\"]);\n     *\n     * let bundle = new FluentBundle(locales, {useIsolating: false});\n     *\n     * let bundle = new FluentBundle(locales, {\n     *   useIsolating: true,\n     *   functions: {\n     *     NODE_ENV: () => process.env.NODE_ENV\n     *   }\n     * });\n     * ```\n     *\n     * @param locales - Used to instantiate `Intl` formatters used by translations.\n     * @param options - Optional configuration for the bundle.\n     */\n    constructor(locales, { functions, useIsolating = true, transform = (v) => v, } = {}) {\n        /** @ignore */\n        this._terms = new Map();\n        /** @ignore */\n        this._messages = new Map();\n        this.locales = Array.isArray(locales) ? locales : [locales];\n        this._functions = {\n            NUMBER,\n            DATETIME,\n            ...functions,\n        };\n        this._useIsolating = useIsolating;\n        this._transform = transform;\n        this._intls = getMemoizerForLocale(locales);\n    }\n    /**\n     * Check if a message is present in the bundle.\n     *\n     * @param id - The identifier of the message to check.\n     */\n    hasMessage(id) {\n        return this._messages.has(id);\n    }\n    /**\n     * Return a raw unformatted message object from the bundle.\n     *\n     * Raw messages are `{value, attributes}` shapes containing translation units\n     * called `Patterns`. `Patterns` are implementation-specific; they should be\n     * treated as black boxes and formatted with `FluentBundle.formatPattern`.\n     *\n     * @param id - The identifier of the message to check.\n     */\n    getMessage(id) {\n        return this._messages.get(id);\n    }\n    /**\n     * Add a translation resource to the bundle.\n     *\n     * @example\n     * ```js\n     * let res = new FluentResource(\"foo = Foo\");\n     * bundle.addResource(res);\n     * bundle.getMessage(\"foo\");\n     * // → {value: .., attributes: {..}}\n     * ```\n     *\n     * @param res\n     * @param options\n     */\n    addResource(res, { allowOverrides = false, } = {}) {\n        const errors = [];\n        for (let i = 0; i < res.body.length; i++) {\n            let entry = res.body[i];\n            if (entry.id.startsWith(\"-\")) {\n                // Identifiers starting with a dash (-) define terms. Terms are private\n                // and cannot be retrieved from FluentBundle.\n                if (allowOverrides === false && this._terms.has(entry.id)) {\n                    errors.push(new Error(`Attempt to override an existing term: \"${entry.id}\"`));\n                    continue;\n                }\n                this._terms.set(entry.id, entry);\n            }\n            else {\n                if (allowOverrides === false && this._messages.has(entry.id)) {\n                    errors.push(new Error(`Attempt to override an existing message: \"${entry.id}\"`));\n                    continue;\n                }\n                this._messages.set(entry.id, entry);\n            }\n        }\n        return errors;\n    }\n    /**\n     * Format a `Pattern` to a string.\n     *\n     * Format a raw `Pattern` into a string. `args` will be used to resolve\n     * references to variables passed as arguments to the translation.\n     *\n     * In case of errors `formatPattern` will try to salvage as much of the\n     * translation as possible and will still return a string. For performance\n     * reasons, the encountered errors are not returned but instead are appended\n     * to the `errors` array passed as the third argument.\n     *\n     * If `errors` is omitted, the first encountered error will be thrown.\n     *\n     * @example\n     * ```js\n     * let errors = [];\n     * bundle.addResource(\n     *     new FluentResource(\"hello = Hello, {$name}!\"));\n     *\n     * let hello = bundle.getMessage(\"hello\");\n     * if (hello.value) {\n     *     bundle.formatPattern(hello.value, {name: \"Jane\"}, errors);\n     *     // Returns \"Hello, Jane!\" and `errors` is empty.\n     *\n     *     bundle.formatPattern(hello.value, undefined, errors);\n     *     // Returns \"Hello, {$name}!\" and `errors` is now:\n     *     // [<ReferenceError: Unknown variable: name>]\n     * }\n     * ```\n     */\n    formatPattern(pattern, args = null, errors = null) {\n        // Resolve a simple pattern without creating a scope. No error handling is\n        // required; by definition simple patterns don't have placeables.\n        if (typeof pattern === \"string\") {\n            return this._transform(pattern);\n        }\n        // Resolve a complex pattern.\n        let scope = new Scope(this, errors, args);\n        try {\n            let value = resolveComplexPattern(scope, pattern);\n            return value.toString(scope);\n        }\n        catch (err) {\n            if (scope.errors && err instanceof Error) {\n                scope.errors.push(err);\n                return new FluentNone().toString(scope);\n            }\n            throw err;\n        }\n    }\n}\n","// This regex is used to iterate through the beginnings of messages and terms.\n// With the /m flag, the ^ matches at the beginning of every line.\nconst RE_MESSAGE_START = /^(-?[a-zA-Z][\\w-]*) *= */gm;\n// Both Attributes and Variants are parsed in while loops. These regexes are\n// used to break out of them.\nconst RE_ATTRIBUTE_START = /\\.([a-zA-Z][\\w-]*) *= */y;\nconst RE_VARIANT_START = /\\*?\\[/y;\nconst RE_NUMBER_LITERAL = /(-?[0-9]+(?:\\.([0-9]+))?)/y;\nconst RE_IDENTIFIER = /([a-zA-Z][\\w-]*)/y;\nconst RE_REFERENCE = /([$-])?([a-zA-Z][\\w-]*)(?:\\.([a-zA-Z][\\w-]*))?/y;\nconst RE_FUNCTION_NAME = /^[A-Z][A-Z0-9_-]*$/;\n// A \"run\" is a sequence of text or string literal characters which don't\n// require any special handling. For TextElements such special characters are: {\n// (starts a placeable), and line breaks which require additional logic to check\n// if the next line is indented. For StringLiterals they are: \\ (starts an\n// escape sequence), \" (ends the literal), and line breaks which are not allowed\n// in StringLiterals. Note that string runs may be empty; text runs may not.\nconst RE_TEXT_RUN = /([^{}\\n\\r]+)/y;\nconst RE_STRING_RUN = /([^\\\\\"\\n\\r]*)/y;\n// Escape sequences.\nconst RE_STRING_ESCAPE = /\\\\([\\\\\"])/y;\nconst RE_UNICODE_ESCAPE = /\\\\u([a-fA-F0-9]{4})|\\\\U([a-fA-F0-9]{6})/y;\n// Used for trimming TextElements and indents.\nconst RE_LEADING_NEWLINES = /^\\n+/;\nconst RE_TRAILING_SPACES = / +$/;\n// Used in makeIndent to strip spaces from blank lines and normalize CRLF to LF.\nconst RE_BLANK_LINES = / *\\r?\\n/g;\n// Used in makeIndent to measure the indentation.\nconst RE_INDENT = /( *)$/;\n// Common tokens.\nconst TOKEN_BRACE_OPEN = /{\\s*/y;\nconst TOKEN_BRACE_CLOSE = /\\s*}/y;\nconst TOKEN_BRACKET_OPEN = /\\[\\s*/y;\nconst TOKEN_BRACKET_CLOSE = /\\s*] */y;\nconst TOKEN_PAREN_OPEN = /\\s*\\(\\s*/y;\nconst TOKEN_ARROW = /\\s*->\\s*/y;\nconst TOKEN_COLON = /\\s*:\\s*/y;\n// Note the optional comma. As a deviation from the Fluent EBNF, the parser\n// doesn't enforce commas between call arguments.\nconst TOKEN_COMMA = /\\s*,?\\s*/y;\nconst TOKEN_BLANK = /\\s+/y;\n/**\n * Fluent Resource is a structure storing parsed localization entries.\n */\nexport class FluentResource {\n    constructor(source) {\n        this.body = [];\n        RE_MESSAGE_START.lastIndex = 0;\n        let cursor = 0;\n        // Iterate over the beginnings of messages and terms to efficiently skip\n        // comments and recover from errors.\n        while (true) {\n            let next = RE_MESSAGE_START.exec(source);\n            if (next === null) {\n                break;\n            }\n            cursor = RE_MESSAGE_START.lastIndex;\n            try {\n                this.body.push(parseMessage(next[1]));\n            }\n            catch (err) {\n                if (err instanceof SyntaxError) {\n                    // Don't report any Fluent syntax errors. Skip directly to the\n                    // beginning of the next message or term.\n                    continue;\n                }\n                throw err;\n            }\n        }\n        // The parser implementation is inlined below for performance reasons,\n        // as well as for convenience of accessing `source` and `cursor`.\n        // The parser focuses on minimizing the number of false negatives at the\n        // expense of increasing the risk of false positives. In other words, it\n        // aims at parsing valid Fluent messages with a success rate of 100%, but it\n        // may also parse a few invalid messages which the reference parser would\n        // reject. The parser doesn't perform any validation and may produce entries\n        // which wouldn't make sense in the real world. For best results users are\n        // advised to validate translations with the fluent-syntax parser\n        // pre-runtime.\n        // The parser makes an extensive use of sticky regexes which can be anchored\n        // to any offset of the source string without slicing it. Errors are thrown\n        // to bail out of parsing of ill-formed messages.\n        function test(re) {\n            re.lastIndex = cursor;\n            return re.test(source);\n        }\n        // Advance the cursor by the char if it matches. May be used as a predicate\n        // (was the match found?) or, if errorClass is passed, as an assertion.\n        function consumeChar(char, errorClass) {\n            if (source[cursor] === char) {\n                cursor++;\n                return true;\n            }\n            if (errorClass) {\n                throw new errorClass(`Expected ${char}`);\n            }\n            return false;\n        }\n        // Advance the cursor by the token if it matches. May be used as a predicate\n        // (was the match found?) or, if errorClass is passed, as an assertion.\n        function consumeToken(re, errorClass) {\n            if (test(re)) {\n                cursor = re.lastIndex;\n                return true;\n            }\n            if (errorClass) {\n                throw new errorClass(`Expected ${re.toString()}`);\n            }\n            return false;\n        }\n        // Execute a regex, advance the cursor, and return all capture groups.\n        function match(re) {\n            re.lastIndex = cursor;\n            let result = re.exec(source);\n            if (result === null) {\n                throw new SyntaxError(`Expected ${re.toString()}`);\n            }\n            cursor = re.lastIndex;\n            return result;\n        }\n        // Execute a regex, advance the cursor, and return the capture group.\n        function match1(re) {\n            return match(re)[1];\n        }\n        function parseMessage(id) {\n            let value = parsePattern();\n            let attributes = parseAttributes();\n            if (value === null && Object.keys(attributes).length === 0) {\n                throw new SyntaxError(\"Expected message value or attributes\");\n            }\n            return { id, value, attributes };\n        }\n        function parseAttributes() {\n            let attrs = Object.create(null);\n            while (test(RE_ATTRIBUTE_START)) {\n                let name = match1(RE_ATTRIBUTE_START);\n                let value = parsePattern();\n                if (value === null) {\n                    throw new SyntaxError(\"Expected attribute value\");\n                }\n                attrs[name] = value;\n            }\n            return attrs;\n        }\n        function parsePattern() {\n            let first;\n            // First try to parse any simple text on the same line as the id.\n            if (test(RE_TEXT_RUN)) {\n                first = match1(RE_TEXT_RUN);\n            }\n            // If there's a placeable on the first line, parse a complex pattern.\n            if (source[cursor] === \"{\" || source[cursor] === \"}\") {\n                // Re-use the text parsed above, if possible.\n                return parsePatternElements(first ? [first] : [], Infinity);\n            }\n            // RE_TEXT_VALUE stops at newlines. Only continue parsing the pattern if\n            // what comes after the newline is indented.\n            let indent = parseIndent();\n            if (indent) {\n                if (first) {\n                    // If there's text on the first line, the blank block is part of the\n                    // translation content in its entirety.\n                    return parsePatternElements([first, indent], indent.length);\n                }\n                // Otherwise, we're dealing with a block pattern, i.e. a pattern which\n                // starts on a new line. Discrad the leading newlines but keep the\n                // inline indent; it will be used by the dedentation logic.\n                indent.value = trim(indent.value, RE_LEADING_NEWLINES);\n                return parsePatternElements([indent], indent.length);\n            }\n            if (first) {\n                // It was just a simple inline text after all.\n                return trim(first, RE_TRAILING_SPACES);\n            }\n            return null;\n        }\n        // Parse a complex pattern as an array of elements.\n        function parsePatternElements(elements = [], commonIndent) {\n            while (true) {\n                if (test(RE_TEXT_RUN)) {\n                    elements.push(match1(RE_TEXT_RUN));\n                    continue;\n                }\n                if (source[cursor] === \"{\") {\n                    elements.push(parsePlaceable());\n                    continue;\n                }\n                if (source[cursor] === \"}\") {\n                    throw new SyntaxError(\"Unbalanced closing brace\");\n                }\n                let indent = parseIndent();\n                if (indent) {\n                    elements.push(indent);\n                    commonIndent = Math.min(commonIndent, indent.length);\n                    continue;\n                }\n                break;\n            }\n            let lastIndex = elements.length - 1;\n            let lastElement = elements[lastIndex];\n            // Trim the trailing spaces in the last element if it's a TextElement.\n            if (typeof lastElement === \"string\") {\n                elements[lastIndex] = trim(lastElement, RE_TRAILING_SPACES);\n            }\n            let baked = [];\n            for (let element of elements) {\n                if (element instanceof Indent) {\n                    // Dedent indented lines by the maximum common indent.\n                    element = element.value.slice(0, element.value.length - commonIndent);\n                }\n                if (element) {\n                    baked.push(element);\n                }\n            }\n            return baked;\n        }\n        function parsePlaceable() {\n            consumeToken(TOKEN_BRACE_OPEN, SyntaxError);\n            let selector = parseInlineExpression();\n            if (consumeToken(TOKEN_BRACE_CLOSE)) {\n                return selector;\n            }\n            if (consumeToken(TOKEN_ARROW)) {\n                let variants = parseVariants();\n                consumeToken(TOKEN_BRACE_CLOSE, SyntaxError);\n                return {\n                    type: \"select\",\n                    selector,\n                    ...variants,\n                };\n            }\n            throw new SyntaxError(\"Unclosed placeable\");\n        }\n        function parseInlineExpression() {\n            if (source[cursor] === \"{\") {\n                // It's a nested placeable.\n                return parsePlaceable();\n            }\n            if (test(RE_REFERENCE)) {\n                let [, sigil, name, attr = null] = match(RE_REFERENCE);\n                if (sigil === \"$\") {\n                    return { type: \"var\", name };\n                }\n                if (consumeToken(TOKEN_PAREN_OPEN)) {\n                    let args = parseArguments();\n                    if (sigil === \"-\") {\n                        // A parameterized term: -term(...).\n                        return { type: \"term\", name, attr, args };\n                    }\n                    if (RE_FUNCTION_NAME.test(name)) {\n                        return { type: \"func\", name, args };\n                    }\n                    throw new SyntaxError(\"Function names must be all upper-case\");\n                }\n                if (sigil === \"-\") {\n                    // A non-parameterized term: -term.\n                    return {\n                        type: \"term\",\n                        name,\n                        attr,\n                        args: [],\n                    };\n                }\n                return { type: \"mesg\", name, attr };\n            }\n            return parseLiteral();\n        }\n        function parseArguments() {\n            let args = [];\n            while (true) {\n                switch (source[cursor]) {\n                    case \")\": // End of the argument list.\n                        cursor++;\n                        return args;\n                    case undefined: // EOF\n                        throw new SyntaxError(\"Unclosed argument list\");\n                }\n                args.push(parseArgument());\n                // Commas between arguments are treated as whitespace.\n                consumeToken(TOKEN_COMMA);\n            }\n        }\n        function parseArgument() {\n            let expr = parseInlineExpression();\n            if (expr.type !== \"mesg\") {\n                return expr;\n            }\n            if (consumeToken(TOKEN_COLON)) {\n                // The reference is the beginning of a named argument.\n                return {\n                    type: \"narg\",\n                    name: expr.name,\n                    value: parseLiteral(),\n                };\n            }\n            // It's a regular message reference.\n            return expr;\n        }\n        function parseVariants() {\n            let variants = [];\n            let count = 0;\n            let star;\n            while (test(RE_VARIANT_START)) {\n                if (consumeChar(\"*\")) {\n                    star = count;\n                }\n                let key = parseVariantKey();\n                let value = parsePattern();\n                if (value === null) {\n                    throw new SyntaxError(\"Expected variant value\");\n                }\n                variants[count++] = { key, value };\n            }\n            if (count === 0) {\n                return null;\n            }\n            if (star === undefined) {\n                throw new SyntaxError(\"Expected default variant\");\n            }\n            return { variants, star };\n        }\n        function parseVariantKey() {\n            consumeToken(TOKEN_BRACKET_OPEN, SyntaxError);\n            let key;\n            if (test(RE_NUMBER_LITERAL)) {\n                key = parseNumberLiteral();\n            }\n            else {\n                key = {\n                    type: \"str\",\n                    value: match1(RE_IDENTIFIER),\n                };\n            }\n            consumeToken(TOKEN_BRACKET_CLOSE, SyntaxError);\n            return key;\n        }\n        function parseLiteral() {\n            if (test(RE_NUMBER_LITERAL)) {\n                return parseNumberLiteral();\n            }\n            if (source[cursor] === '\"') {\n                return parseStringLiteral();\n            }\n            throw new SyntaxError(\"Invalid expression\");\n        }\n        function parseNumberLiteral() {\n            let [, value, fraction = \"\"] = match(RE_NUMBER_LITERAL);\n            let precision = fraction.length;\n            return {\n                type: \"num\",\n                value: parseFloat(value),\n                precision,\n            };\n        }\n        function parseStringLiteral() {\n            consumeChar('\"', SyntaxError);\n            let value = \"\";\n            while (true) {\n                value += match1(RE_STRING_RUN);\n                if (source[cursor] === \"\\\\\") {\n                    value += parseEscapeSequence();\n                    continue;\n                }\n                if (consumeChar('\"')) {\n                    return { type: \"str\", value };\n                }\n                // We've reached an EOL of EOF.\n                throw new SyntaxError(\"Unclosed string literal\");\n            }\n        }\n        // Unescape known escape sequences.\n        function parseEscapeSequence() {\n            if (test(RE_STRING_ESCAPE)) {\n                return match1(RE_STRING_ESCAPE);\n            }\n            if (test(RE_UNICODE_ESCAPE)) {\n                let [, codepoint4, codepoint6] = match(RE_UNICODE_ESCAPE);\n                let codepoint = parseInt(codepoint4 || codepoint6, 16);\n                return codepoint <= 0xd7ff || 0xe000 <= codepoint\n                    ? // It's a Unicode scalar value.\n                        String.fromCodePoint(codepoint)\n                    : // Lonely surrogates can cause trouble when the parsing result is\n                        // saved using UTF-8. Use U+FFFD REPLACEMENT CHARACTER instead.\n                        \"�\";\n            }\n            throw new SyntaxError(\"Unknown escape sequence\");\n        }\n        // Parse blank space. Return it if it looks like indent before a pattern\n        // line. Skip it othwerwise.\n        function parseIndent() {\n            let start = cursor;\n            consumeToken(TOKEN_BLANK);\n            // Check the first non-blank character after the indent.\n            switch (source[cursor]) {\n                case \".\":\n                case \"[\":\n                case \"*\":\n                case \"}\":\n                case undefined: // EOF\n                    // A special character. End the Pattern.\n                    return false;\n                case \"{\":\n                    // Placeables don't require indentation (in EBNF: block-placeable).\n                    // Continue the Pattern.\n                    return makeIndent(source.slice(start, cursor));\n            }\n            // If the first character on the line is not one of the special characters\n            // listed above, it's a regular text character. Check if there's at least\n            // one space of indent before it.\n            if (source[cursor - 1] === \" \") {\n                // It's an indented text character (in EBNF: indented-char). Continue\n                // the Pattern.\n                return makeIndent(source.slice(start, cursor));\n            }\n            // A not-indented text character is likely the identifier of the next\n            // message. End the Pattern.\n            return false;\n        }\n        // Trim blanks in text according to the given regex.\n        function trim(text, re) {\n            return text.replace(re, \"\");\n        }\n        // Normalize a blank block and extract the indent details.\n        function makeIndent(blank) {\n            let value = blank.replace(RE_BLANK_LINES, \"\\n\");\n            let length = RE_INDENT.exec(blank)[1].length;\n            return new Indent(value, length);\n        }\n    }\n}\nclass Indent {\n    constructor(value, length) {\n        this.value = value;\n        this.length = length;\n    }\n}\n","import{_$LH as e,noChange as t}from\"./lit-html.js\";\n/**\n * @license\n * Copyright 2019 Google LLC\n * SPDX-License-Identifier: BSD-3-Clause\n */\nlet r=null;const i={boundAttributeSuffix:e.M,marker:e.P,markerMatch:e.A,HTML_RESULT:e.C,getTemplateHtml:e.L,overrideDirectiveResolve:(e,t)=>class extends e{_$AS(e,r){return t(this,r)}},patchDirectiveResolve:(e,t)=>{if(e.prototype._$AS.name!==t.name){r??=e.prototype._$AS.name;for(let i=e.prototype;i!==Object.prototype;i=Object.getPrototypeOf(i))if(i.hasOwnProperty(r))return void(i[r]=t);throw Error(\"Internal error: It is possible that both dev mode and production mode Lit was mixed together during SSR. Please comment on the issue: https://github.com/lit/lit/issues/4527\")}},setDirectiveClass(e,t){e._$litDirective$=t},getAttributePartCommittedValue:(e,r,i)=>{let o=t;return e.j=e=>o=e,e._$AI(r,e,i),o},connectedDisconnectable:e=>({...e,_$AU:!0}),resolveDirective:e.V,AttributePart:e.H,PropertyPart:e.B,BooleanAttributePart:e.N,EventPart:e.U,ElementPart:e.F,TemplateInstance:e.R,isIterable:e.D,ChildPart:e.I};export{i as _$LH};\n//# sourceMappingURL=private-ssr-support.js.map\n","import{noChange as e}from\"lit-html\";import{_$LH as t}from\"lit-html/private-ssr-support.js\";import{PartType as r}from\"lit-html/directive.js\";import{isPrimitive as n,isTemplateResult as o,isCompiledTemplateResult as i,isSingleExpression as a}from\"lit-html/directive-helpers.js\";\n/**\n * @license\n * Copyright 2019 Google LLC\n * SPDX-License-Identifier: BSD-3-Clause\n */const{TemplateInstance:l,isIterable:s,resolveDirective:d,ChildPart:c,ElementPart:p}=t,f=(e,t,r={})=>{if(void 0!==t._$litPart$)throw Error(\"container already contains a live render\");let n,o,i;const a=[],l=document.createTreeWalker(t,NodeFilter.SHOW_COMMENT);let s;for(;null!==(s=l.nextNode());){const t=s.data;if(t.startsWith(\"lit-part\")){if(0===a.length&&void 0!==n)throw Error(`There must be only one root part per container. Found a part marker (${s}) when we already have a root part marker (${o})`);i=m(e,s,a,r),void 0===n&&(n=i),o??=s}else if(t.startsWith(\"lit-node\"))u(s,a,r);else if(t.startsWith(\"/lit-part\")){if(1===a.length&&i!==n)throw Error(\"internal error\");i=h(s,i,a)}}if(void 0===n){const e=t instanceof ShadowRoot?\"{container.host.localName}'s shadow root\":t instanceof DocumentFragment?\"DocumentFragment\":t.localName;console.error(`There should be exactly one root part in a render container, but we didn't find any in ${e}.`)}t._$litPart$=n},m=(t,r,a,p)=>{let f,m;if(0===a.length)m=new c(r,null,void 0,p),f=t;else{const e=a[a.length-1];if(\"template-instance\"===e.type)m=new c(r,null,e.instance,p),e.instance._$AV.push(m),f=e.result.values[e.instancePartIndex++],e.templatePartIndex++;else if(\"iterable\"===e.type){m=new c(r,null,e.part,p);const t=e.iterator.next();if(t.done)throw f=void 0,e.done=!0,Error(\"Unhandled shorter than expected iterable\");f=t.value,e.part._$AH.push(m)}else m=new c(r,null,e.part,p)}if(f=d(m,f),f===e)a.push({part:m,type:\"leaf\"});else if(n(f))a.push({part:m,type:\"leaf\"}),m._$AH=f;else if(o(f)){if(i(f))throw Error(\"compiled templates are not supported\");const e=\"lit-part \"+w(f);if(r.data!==e)throw Error(\"Hydration value mismatch: Unexpected TemplateResult rendered to part\");{const e=c.prototype._$AC(f),t=new l(e,m);a.push({type:\"template-instance\",instance:t,part:m,templatePartIndex:0,instancePartIndex:0,result:f}),m._$AH=t}}else s(f)?(a.push({part:m,type:\"iterable\",value:f,iterator:f[Symbol.iterator](),done:!1}),m._$AH=[]):(a.push({part:m,type:\"leaf\"}),m._$AH=f??\"\");return m},h=(e,t,r)=>{if(void 0===t)throw Error(\"unbalanced part marker\");t._$AB=e;const n=r.pop();if(\"iterable\"===n.type&&!n.iterator.next().done)throw Error(\"unexpected longer than expected iterable\");if(r.length>0)return r[r.length-1].part},u=(e,t,n)=>{const o=/lit-node (\\d+)/.exec(e.data),i=parseInt(o[1]),l=e.nextElementSibling;if(null===l)throw Error(\"could not find node for attribute parts\");l.removeAttribute(\"defer-hydration\");const s=t[t.length-1];if(\"template-instance\"!==s.type)throw Error(\"Hydration value mismatch: Primitive found where TemplateResult expected. This usually occurs due to conditional rendering that resulted in a different value or template being rendered between the server and client.\");{const e=s.instance;for(;;){const t=e._$AD.parts[s.templatePartIndex];if(void 0===t||t.type!==r.ATTRIBUTE&&t.type!==r.ELEMENT||t.index!==i)break;if(t.type===r.ATTRIBUTE){const o=new t.ctor(l,t.name,t.strings,s.instance,n),i=a(o)?s.result.values[s.instancePartIndex]:s.result.values,d=!(o.type===r.EVENT||o.type===r.PROPERTY);o._$AI(i,o,s.instancePartIndex,d),s.instancePartIndex+=t.strings.length-1,e._$AV.push(o)}else{const t=new p(l,s.instance,n);d(t,s.result.values[s.instancePartIndex++]),e._$AV.push(t)}s.templatePartIndex++}}},w=e=>{const t=new Uint32Array(2).fill(5381);for(const r of e.strings)for(let e=0;e<r.length;e++)t[e%2]=33*t[e%2]^r.charCodeAt(e);const r=String.fromCharCode(...new Uint8Array(t.buffer));return btoa(r)};export{w as digestForTemplateResult,f as hydrate};\n//# sourceMappingURL=hydrate-lit-html.js.map\n","import{render as t}from\"lit-html\";import{hydrate as i}from\"./lib/hydrate-lit-html.js\";globalThis.litElementHydrateSupport=({LitElement:s})=>{const h=Object.getOwnPropertyDescriptor(Object.getPrototypeOf(s),\"observedAttributes\").get;Object.defineProperty(s,\"observedAttributes\",{get(){return[...h.call(this),\"defer-hydration\"]}});const e=s.prototype.attributeChangedCallback;s.prototype.attributeChangedCallback=function(t,i,s){\"defer-hydration\"===t&&null===s&&n.call(this),e.call(this,t,i,s)};const n=s.prototype.connectedCallback;s.prototype.connectedCallback=function(){this.hasAttribute(\"defer-hydration\")||n.call(this)};const o=s.prototype.createRenderRoot;s.prototype.createRenderRoot=function(){return this.shadowRoot?(this._$AG=!0,this.shadowRoot):o.call(this)};const r=Object.getPrototypeOf(s.prototype).update;s.prototype.update=function(s){const h=this.render();if(r.call(this,s),this._$AG){this._$AG=!1;for(let t=0;t<this.attributes.length;t++){const i=this.attributes[t];if(i.name.startsWith(\"hydrate-internals-\")){const t=i.name.slice(18);this.removeAttribute(t),this.removeAttribute(i.name)}}i(h,this.renderRoot,this.renderOptions)}else t(h,this.renderRoot,this.renderOptions)}};\n//# sourceMappingURL=lit-element-hydrate-support.js.map\n","/**\n * @license\n * Copyright 2019 Google LLC\n * SPDX-License-Identifier: BSD-3-Clause\n */\nconst t=globalThis,e=t.ShadowRoot&&(void 0===t.ShadyCSS||t.ShadyCSS.nativeShadow)&&\"adoptedStyleSheets\"in Document.prototype&&\"replace\"in CSSStyleSheet.prototype,s=Symbol(),o=new WeakMap;class n{constructor(t,e,o){if(this._$cssResult$=!0,o!==s)throw Error(\"CSSResult is not constructable. Use `unsafeCSS` or `css` instead.\");this.cssText=t,this.t=e}get styleSheet(){let t=this.o;const s=this.t;if(e&&void 0===t){const e=void 0!==s&&1===s.length;e&&(t=o.get(s)),void 0===t&&((this.o=t=new CSSStyleSheet).replaceSync(this.cssText),e&&o.set(s,t))}return t}toString(){return this.cssText}}const r=t=>new n(\"string\"==typeof t?t:t+\"\",void 0,s),i=(t,...e)=>{const o=1===t.length?t[0]:e.reduce(((e,s,o)=>e+(t=>{if(!0===t._$cssResult$)return t.cssText;if(\"number\"==typeof t)return t;throw Error(\"Value passed to 'css' function must be a 'css' function result: \"+t+\". Use 'unsafeCSS' to pass non-literal values, but take care to ensure page security.\")})(s)+t[o+1]),t[0]);return new n(o,t,s)},S=(s,o)=>{if(e)s.adoptedStyleSheets=o.map((t=>t instanceof CSSStyleSheet?t:t.styleSheet));else for(const e of o){const o=document.createElement(\"style\"),n=t.litNonce;void 0!==n&&o.setAttribute(\"nonce\",n),o.textContent=e.cssText,s.appendChild(o)}},c=e?t=>t:t=>t instanceof CSSStyleSheet?(t=>{let e=\"\";for(const s of t.cssRules)e+=s.cssText;return r(e)})(t):t;export{n as CSSResult,S as adoptStyles,i as css,c as getCompatibleStyle,e as supportsAdoptingStyleSheets,r as unsafeCSS};\n//# sourceMappingURL=css-tag.js.map\n","import{getCompatibleStyle as t,adoptStyles as s}from\"./css-tag.js\";export{CSSResult,css,supportsAdoptingStyleSheets,unsafeCSS}from\"./css-tag.js\";\n/**\n * @license\n * Copyright 2017 Google LLC\n * SPDX-License-Identifier: BSD-3-Clause\n */const{is:i,defineProperty:e,getOwnPropertyDescriptor:h,getOwnPropertyNames:r,getOwnPropertySymbols:o,getPrototypeOf:n}=Object,a=globalThis,c=a.trustedTypes,l=c?c.emptyScript:\"\",p=a.reactiveElementPolyfillSupport,d=(t,s)=>t,u={toAttribute(t,s){switch(s){case Boolean:t=t?l:null;break;case Object:case Array:t=null==t?t:JSON.stringify(t)}return t},fromAttribute(t,s){let i=t;switch(s){case Boolean:i=null!==t;break;case Number:i=null===t?null:Number(t);break;case Object:case Array:try{i=JSON.parse(t)}catch(t){i=null}}return i}},f=(t,s)=>!i(t,s),b={attribute:!0,type:String,converter:u,reflect:!1,useDefault:!1,hasChanged:f};Symbol.metadata??=Symbol(\"metadata\"),a.litPropertyMetadata??=new WeakMap;class y extends HTMLElement{static addInitializer(t){this._$Ei(),(this.l??=[]).push(t)}static get observedAttributes(){return this.finalize(),this._$Eh&&[...this._$Eh.keys()]}static createProperty(t,s=b){if(s.state&&(s.attribute=!1),this._$Ei(),this.prototype.hasOwnProperty(t)&&((s=Object.create(s)).wrapped=!0),this.elementProperties.set(t,s),!s.noAccessor){const i=Symbol(),h=this.getPropertyDescriptor(t,i,s);void 0!==h&&e(this.prototype,t,h)}}static getPropertyDescriptor(t,s,i){const{get:e,set:r}=h(this.prototype,t)??{get(){return this[s]},set(t){this[s]=t}};return{get:e,set(s){const h=e?.call(this);r?.call(this,s),this.requestUpdate(t,h,i)},configurable:!0,enumerable:!0}}static getPropertyOptions(t){return this.elementProperties.get(t)??b}static _$Ei(){if(this.hasOwnProperty(d(\"elementProperties\")))return;const t=n(this);t.finalize(),void 0!==t.l&&(this.l=[...t.l]),this.elementProperties=new Map(t.elementProperties)}static finalize(){if(this.hasOwnProperty(d(\"finalized\")))return;if(this.finalized=!0,this._$Ei(),this.hasOwnProperty(d(\"properties\"))){const t=this.properties,s=[...r(t),...o(t)];for(const i of s)this.createProperty(i,t[i])}const t=this[Symbol.metadata];if(null!==t){const s=litPropertyMetadata.get(t);if(void 0!==s)for(const[t,i]of s)this.elementProperties.set(t,i)}this._$Eh=new Map;for(const[t,s]of this.elementProperties){const i=this._$Eu(t,s);void 0!==i&&this._$Eh.set(i,t)}this.elementStyles=this.finalizeStyles(this.styles)}static finalizeStyles(s){const i=[];if(Array.isArray(s)){const e=new Set(s.flat(1/0).reverse());for(const s of e)i.unshift(t(s))}else void 0!==s&&i.push(t(s));return i}static _$Eu(t,s){const i=s.attribute;return!1===i?void 0:\"string\"==typeof i?i:\"string\"==typeof t?t.toLowerCase():void 0}constructor(){super(),this._$Ep=void 0,this.isUpdatePending=!1,this.hasUpdated=!1,this._$Em=null,this._$Ev()}_$Ev(){this._$ES=new Promise((t=>this.enableUpdating=t)),this._$AL=new Map,this._$E_(),this.requestUpdate(),this.constructor.l?.forEach((t=>t(this)))}addController(t){(this._$EO??=new Set).add(t),void 0!==this.renderRoot&&this.isConnected&&t.hostConnected?.()}removeController(t){this._$EO?.delete(t)}_$E_(){const t=new Map,s=this.constructor.elementProperties;for(const i of s.keys())this.hasOwnProperty(i)&&(t.set(i,this[i]),delete this[i]);t.size>0&&(this._$Ep=t)}createRenderRoot(){const t=this.shadowRoot??this.attachShadow(this.constructor.shadowRootOptions);return s(t,this.constructor.elementStyles),t}connectedCallback(){this.renderRoot??=this.createRenderRoot(),this.enableUpdating(!0),this._$EO?.forEach((t=>t.hostConnected?.()))}enableUpdating(t){}disconnectedCallback(){this._$EO?.forEach((t=>t.hostDisconnected?.()))}attributeChangedCallback(t,s,i){this._$AK(t,i)}_$ET(t,s){const i=this.constructor.elementProperties.get(t),e=this.constructor._$Eu(t,i);if(void 0!==e&&!0===i.reflect){const h=(void 0!==i.converter?.toAttribute?i.converter:u).toAttribute(s,i.type);this._$Em=t,null==h?this.removeAttribute(e):this.setAttribute(e,h),this._$Em=null}}_$AK(t,s){const i=this.constructor,e=i._$Eh.get(t);if(void 0!==e&&this._$Em!==e){const t=i.getPropertyOptions(e),h=\"function\"==typeof t.converter?{fromAttribute:t.converter}:void 0!==t.converter?.fromAttribute?t.converter:u;this._$Em=e,this[e]=h.fromAttribute(s,t.type)??this._$Ej?.get(e)??null,this._$Em=null}}requestUpdate(t,s,i){if(void 0!==t){const e=this.constructor,h=this[t];if(i??=e.getPropertyOptions(t),!((i.hasChanged??f)(h,s)||i.useDefault&&i.reflect&&h===this._$Ej?.get(t)&&!this.hasAttribute(e._$Eu(t,i))))return;this.C(t,s,i)}!1===this.isUpdatePending&&(this._$ES=this._$EP())}C(t,s,{useDefault:i,reflect:e,wrapped:h},r){i&&!(this._$Ej??=new Map).has(t)&&(this._$Ej.set(t,r??s??this[t]),!0!==h||void 0!==r)||(this._$AL.has(t)||(this.hasUpdated||i||(s=void 0),this._$AL.set(t,s)),!0===e&&this._$Em!==t&&(this._$Eq??=new Set).add(t))}async _$EP(){this.isUpdatePending=!0;try{await this._$ES}catch(t){Promise.reject(t)}const t=this.scheduleUpdate();return null!=t&&await t,!this.isUpdatePending}scheduleUpdate(){return this.performUpdate()}performUpdate(){if(!this.isUpdatePending)return;if(!this.hasUpdated){if(this.renderRoot??=this.createRenderRoot(),this._$Ep){for(const[t,s]of this._$Ep)this[t]=s;this._$Ep=void 0}const t=this.constructor.elementProperties;if(t.size>0)for(const[s,i]of t){const{wrapped:t}=i,e=this[s];!0!==t||this._$AL.has(s)||void 0===e||this.C(s,void 0,i,e)}}let t=!1;const s=this._$AL;try{t=this.shouldUpdate(s),t?(this.willUpdate(s),this._$EO?.forEach((t=>t.hostUpdate?.())),this.update(s)):this._$EM()}catch(s){throw t=!1,this._$EM(),s}t&&this._$AE(s)}willUpdate(t){}_$AE(t){this._$EO?.forEach((t=>t.hostUpdated?.())),this.hasUpdated||(this.hasUpdated=!0,this.firstUpdated(t)),this.updated(t)}_$EM(){this._$AL=new Map,this.isUpdatePending=!1}get updateComplete(){return this.getUpdateComplete()}getUpdateComplete(){return this._$ES}shouldUpdate(t){return!0}update(t){this._$Eq&&=this._$Eq.forEach((t=>this._$ET(t,this[t]))),this._$EM()}updated(t){}firstUpdated(t){}}y.elementStyles=[],y.shadowRootOptions={mode:\"open\"},y[d(\"elementProperties\")]=new Map,y[d(\"finalized\")]=new Map,p?.({ReactiveElement:y}),(a.reactiveElementVersions??=[]).push(\"2.1.0\");export{y as ReactiveElement,s as adoptStyles,u as defaultConverter,t as getCompatibleStyle,f as notEqual};\n//# sourceMappingURL=reactive-element.js.map\n","import{notEqual as t}from\"@lit/reactive-element\";\n/**\n * @license\n * Copyright 2017 Google LLC\n * SPDX-License-Identifier: BSD-3-Clause\n */const s={INITIAL:0,PENDING:1,COMPLETE:2,ERROR:3},i=Symbol();class h{get taskComplete(){return this.t||(1===this.i?this.t=new Promise(((t,s)=>{this.o=t,this.h=s})):3===this.i?this.t=Promise.reject(this.l):this.t=Promise.resolve(this.u)),this.t}constructor(t,s,i){this.p=0,this.i=0,(this._=t).addController(this);const h=\"object\"==typeof s?s:{task:s,args:i};this.v=h.task,this.j=h.args,this.m=h.argsEqual??r,this.k=h.onComplete,this.A=h.onError,this.autoRun=h.autoRun??!0,\"initialValue\"in h&&(this.u=h.initialValue,this.i=2,this.O=this.T?.())}hostUpdate(){!0===this.autoRun&&this.S()}hostUpdated(){\"afterUpdate\"===this.autoRun&&this.S()}T(){if(void 0===this.j)return;const t=this.j();if(!Array.isArray(t))throw Error(\"The args function must return an array\");return t}async S(){const t=this.T(),s=this.O;this.O=t,t===s||void 0===t||void 0!==s&&this.m(s,t)||await this.run(t)}async run(t){let s,h;t??=this.T(),this.O=t,1===this.i?this.q?.abort():(this.t=void 0,this.o=void 0,this.h=void 0),this.i=1,\"afterUpdate\"===this.autoRun?queueMicrotask((()=>this._.requestUpdate())):this._.requestUpdate();const r=++this.p;this.q=new AbortController;let e=!1;try{s=await this.v(t,{signal:this.q.signal})}catch(t){e=!0,h=t}if(this.p===r){if(s===i)this.i=0;else{if(!1===e){try{this.k?.(s)}catch{}this.i=2,this.o?.(s)}else{try{this.A?.(h)}catch{}this.i=3,this.h?.(h)}this.u=s,this.l=h}this._.requestUpdate()}}abort(t){1===this.i&&this.q?.abort(t)}get value(){return this.u}get error(){return this.l}get status(){return this.i}render(t){switch(this.i){case 0:return t.initial?.();case 1:return t.pending?.();case 2:return t.complete?.(this.value);case 3:return t.error?.(this.error);default:throw Error(\"Unexpected status: \"+this.i)}}}const r=(s,i)=>s===i||s.length===i.length&&s.every(((s,h)=>!t(s,i[h])));export{h as Task,s as TaskStatus,i as initialState,r as shallowArrayEquals};\n//# sourceMappingURL=task.js.map\n","import{_$LH as o}from\"./lit-html.js\";\n/**\n * @license\n * Copyright 2020 Google LLC\n * SPDX-License-Identifier: BSD-3-Clause\n */const{I:t}=o,i=o=>null===o||\"object\"!=typeof o&&\"function\"!=typeof o,n={HTML:1,SVG:2,MATHML:3},e=(o,t)=>void 0===t?void 0!==o?._$litType$:o?._$litType$===t,l=o=>null!=o?._$litType$?.h,d=o=>void 0!==o?._$litDirective$,c=o=>o?._$litDirective$,f=o=>void 0===o.strings,r=()=>document.createComment(\"\"),s=(o,i,n)=>{const e=o._$AA.parentNode,l=void 0===i?o._$AB:i._$AA;if(void 0===n){const i=e.insertBefore(r(),l),d=e.insertBefore(r(),l);n=new t(i,d,o,o.options)}else{const t=n._$AB.nextSibling,i=n._$AM,d=i!==o;if(d){let t;n._$AQ?.(o),n._$AM=o,void 0!==n._$AP&&(t=o._$AU)!==i._$AU&&n._$AP(t)}if(t!==l||d){let o=n._$AA;for(;o!==t;){const t=o.nextSibling;e.insertBefore(o,l),o=t}}}return n},v=(o,t,i=o)=>(o._$AI(t,i),o),u={},m=(o,t=u)=>o._$AH=t,p=o=>o._$AH,M=o=>{o._$AR(),o._$AA.remove()},h=o=>{o._$AR()};export{n as TemplateResultType,h as clearPart,p as getCommittedValue,c as getDirectiveClass,s as insertPart,l as isCompiledTemplateResult,d as isDirectiveResult,i as isPrimitive,f as isSingleExpression,e as isTemplateResult,M as removePart,v as setChildPartValue,m as setCommittedValue};\n//# sourceMappingURL=directive-helpers.js.map\n","/**\n * @license\n * Copyright 2017 Google LLC\n * SPDX-License-Identifier: BSD-3-Clause\n */\nconst t={ATTRIBUTE:1,CHILD:2,PROPERTY:3,BOOLEAN_ATTRIBUTE:4,EVENT:5,ELEMENT:6},e=t=>(...e)=>({_$litDirective$:t,values:e});class i{constructor(t){}get _$AU(){return this._$AM._$AU}_$AT(t,e,i){this._$Ct=t,this._$AM=e,this._$Ci=i}_$AS(t,e){return this.update(t,e)}update(t,e){return this.render(...e)}}export{i as Directive,t as PartType,e as directive};\n//# sourceMappingURL=directive.js.map\n","/**\n * @license\n * Copyright 2017 Google LLC\n * SPDX-License-Identifier: BSD-3-Clause\n */\nconst t=globalThis,i=t.trustedTypes,s=i?i.createPolicy(\"lit-html\",{createHTML:t=>t}):void 0,e=\"$lit$\",h=`lit$${Math.random().toFixed(9).slice(2)}$`,o=\"?\"+h,n=`<${o}>`,r=document,l=()=>r.createComment(\"\"),c=t=>null===t||\"object\"!=typeof t&&\"function\"!=typeof t,a=Array.isArray,u=t=>a(t)||\"function\"==typeof t?.[Symbol.iterator],d=\"[ \\t\\n\\f\\r]\",f=/<(?:(!--|\\/[^a-zA-Z])|(\\/?[a-zA-Z][^>\\s]*)|(\\/?$))/g,v=/-->/g,_=/>/g,m=RegExp(`>|${d}(?:([^\\\\s\"'>=/]+)(${d}*=${d}*(?:[^ \\t\\n\\f\\r\"'\\`<>=]|(\"|')|))|$)`,\"g\"),p=/'/g,g=/\"/g,$=/^(?:script|style|textarea|title)$/i,y=t=>(i,...s)=>({_$litType$:t,strings:i,values:s}),x=y(1),b=y(2),w=y(3),T=Symbol.for(\"lit-noChange\"),E=Symbol.for(\"lit-nothing\"),A=new WeakMap,C=r.createTreeWalker(r,129);function P(t,i){if(!a(t)||!t.hasOwnProperty(\"raw\"))throw Error(\"invalid template strings array\");return void 0!==s?s.createHTML(i):i}const V=(t,i)=>{const s=t.length-1,o=[];let r,l=2===i?\"<svg>\":3===i?\"<math>\":\"\",c=f;for(let i=0;i<s;i++){const s=t[i];let a,u,d=-1,y=0;for(;y<s.length&&(c.lastIndex=y,u=c.exec(s),null!==u);)y=c.lastIndex,c===f?\"!--\"===u[1]?c=v:void 0!==u[1]?c=_:void 0!==u[2]?($.test(u[2])&&(r=RegExp(\"</\"+u[2],\"g\")),c=m):void 0!==u[3]&&(c=m):c===m?\">\"===u[0]?(c=r??f,d=-1):void 0===u[1]?d=-2:(d=c.lastIndex-u[2].length,a=u[1],c=void 0===u[3]?m:'\"'===u[3]?g:p):c===g||c===p?c=m:c===v||c===_?c=f:(c=m,r=void 0);const x=c===m&&t[i+1].startsWith(\"/>\")?\" \":\"\";l+=c===f?s+n:d>=0?(o.push(a),s.slice(0,d)+e+s.slice(d)+h+x):s+h+(-2===d?i:x)}return[P(t,l+(t[s]||\"<?>\")+(2===i?\"</svg>\":3===i?\"</math>\":\"\")),o]};class N{constructor({strings:t,_$litType$:s},n){let r;this.parts=[];let c=0,a=0;const u=t.length-1,d=this.parts,[f,v]=V(t,s);if(this.el=N.createElement(f,n),C.currentNode=this.el.content,2===s||3===s){const t=this.el.content.firstChild;t.replaceWith(...t.childNodes)}for(;null!==(r=C.nextNode())&&d.length<u;){if(1===r.nodeType){if(r.hasAttributes())for(const t of r.getAttributeNames())if(t.endsWith(e)){const i=v[a++],s=r.getAttribute(t).split(h),e=/([.?@])?(.*)/.exec(i);d.push({type:1,index:c,name:e[2],strings:s,ctor:\".\"===e[1]?H:\"?\"===e[1]?I:\"@\"===e[1]?L:k}),r.removeAttribute(t)}else t.startsWith(h)&&(d.push({type:6,index:c}),r.removeAttribute(t));if($.test(r.tagName)){const t=r.textContent.split(h),s=t.length-1;if(s>0){r.textContent=i?i.emptyScript:\"\";for(let i=0;i<s;i++)r.append(t[i],l()),C.nextNode(),d.push({type:2,index:++c});r.append(t[s],l())}}}else if(8===r.nodeType)if(r.data===o)d.push({type:2,index:c});else{let t=-1;for(;-1!==(t=r.data.indexOf(h,t+1));)d.push({type:7,index:c}),t+=h.length-1}c++}}static createElement(t,i){const s=r.createElement(\"template\");return s.innerHTML=t,s}}function S(t,i,s=t,e){if(i===T)return i;let h=void 0!==e?s._$Co?.[e]:s._$Cl;const o=c(i)?void 0:i._$litDirective$;return h?.constructor!==o&&(h?._$AO?.(!1),void 0===o?h=void 0:(h=new o(t),h._$AT(t,s,e)),void 0!==e?(s._$Co??=[])[e]=h:s._$Cl=h),void 0!==h&&(i=S(t,h._$AS(t,i.values),h,e)),i}class M{constructor(t,i){this._$AV=[],this._$AN=void 0,this._$AD=t,this._$AM=i}get parentNode(){return this._$AM.parentNode}get _$AU(){return this._$AM._$AU}u(t){const{el:{content:i},parts:s}=this._$AD,e=(t?.creationScope??r).importNode(i,!0);C.currentNode=e;let h=C.nextNode(),o=0,n=0,l=s[0];for(;void 0!==l;){if(o===l.index){let i;2===l.type?i=new R(h,h.nextSibling,this,t):1===l.type?i=new l.ctor(h,l.name,l.strings,this,t):6===l.type&&(i=new z(h,this,t)),this._$AV.push(i),l=s[++n]}o!==l?.index&&(h=C.nextNode(),o++)}return C.currentNode=r,e}p(t){let i=0;for(const s of this._$AV)void 0!==s&&(void 0!==s.strings?(s._$AI(t,s,i),i+=s.strings.length-2):s._$AI(t[i])),i++}}class R{get _$AU(){return this._$AM?._$AU??this._$Cv}constructor(t,i,s,e){this.type=2,this._$AH=E,this._$AN=void 0,this._$AA=t,this._$AB=i,this._$AM=s,this.options=e,this._$Cv=e?.isConnected??!0}get parentNode(){let t=this._$AA.parentNode;const i=this._$AM;return void 0!==i&&11===t?.nodeType&&(t=i.parentNode),t}get startNode(){return this._$AA}get endNode(){return this._$AB}_$AI(t,i=this){t=S(this,t,i),c(t)?t===E||null==t||\"\"===t?(this._$AH!==E&&this._$AR(),this._$AH=E):t!==this._$AH&&t!==T&&this._(t):void 0!==t._$litType$?this.$(t):void 0!==t.nodeType?this.T(t):u(t)?this.k(t):this._(t)}O(t){return this._$AA.parentNode.insertBefore(t,this._$AB)}T(t){this._$AH!==t&&(this._$AR(),this._$AH=this.O(t))}_(t){this._$AH!==E&&c(this._$AH)?this._$AA.nextSibling.data=t:this.T(r.createTextNode(t)),this._$AH=t}$(t){const{values:i,_$litType$:s}=t,e=\"number\"==typeof s?this._$AC(t):(void 0===s.el&&(s.el=N.createElement(P(s.h,s.h[0]),this.options)),s);if(this._$AH?._$AD===e)this._$AH.p(i);else{const t=new M(e,this),s=t.u(this.options);t.p(i),this.T(s),this._$AH=t}}_$AC(t){let i=A.get(t.strings);return void 0===i&&A.set(t.strings,i=new N(t)),i}k(t){a(this._$AH)||(this._$AH=[],this._$AR());const i=this._$AH;let s,e=0;for(const h of t)e===i.length?i.push(s=new R(this.O(l()),this.O(l()),this,this.options)):s=i[e],s._$AI(h),e++;e<i.length&&(this._$AR(s&&s._$AB.nextSibling,e),i.length=e)}_$AR(t=this._$AA.nextSibling,i){for(this._$AP?.(!1,!0,i);t!==this._$AB;){const i=t.nextSibling;t.remove(),t=i}}setConnected(t){void 0===this._$AM&&(this._$Cv=t,this._$AP?.(t))}}class k{get tagName(){return this.element.tagName}get _$AU(){return this._$AM._$AU}constructor(t,i,s,e,h){this.type=1,this._$AH=E,this._$AN=void 0,this.element=t,this.name=i,this._$AM=e,this.options=h,s.length>2||\"\"!==s[0]||\"\"!==s[1]?(this._$AH=Array(s.length-1).fill(new String),this.strings=s):this._$AH=E}_$AI(t,i=this,s,e){const h=this.strings;let o=!1;if(void 0===h)t=S(this,t,i,0),o=!c(t)||t!==this._$AH&&t!==T,o&&(this._$AH=t);else{const e=t;let n,r;for(t=h[0],n=0;n<h.length-1;n++)r=S(this,e[s+n],i,n),r===T&&(r=this._$AH[n]),o||=!c(r)||r!==this._$AH[n],r===E?t=E:t!==E&&(t+=(r??\"\")+h[n+1]),this._$AH[n]=r}o&&!e&&this.j(t)}j(t){t===E?this.element.removeAttribute(this.name):this.element.setAttribute(this.name,t??\"\")}}class H extends k{constructor(){super(...arguments),this.type=3}j(t){this.element[this.name]=t===E?void 0:t}}class I extends k{constructor(){super(...arguments),this.type=4}j(t){this.element.toggleAttribute(this.name,!!t&&t!==E)}}class L extends k{constructor(t,i,s,e,h){super(t,i,s,e,h),this.type=5}_$AI(t,i=this){if((t=S(this,t,i,0)??E)===T)return;const s=this._$AH,e=t===E&&s!==E||t.capture!==s.capture||t.once!==s.once||t.passive!==s.passive,h=t!==E&&(s===E||e);e&&this.element.removeEventListener(this.name,this,s),h&&this.element.addEventListener(this.name,this,t),this._$AH=t}handleEvent(t){\"function\"==typeof this._$AH?this._$AH.call(this.options?.host??this.element,t):this._$AH.handleEvent(t)}}class z{constructor(t,i,s){this.element=t,this.type=6,this._$AN=void 0,this._$AM=i,this.options=s}get _$AU(){return this._$AM._$AU}_$AI(t){S(this,t)}}const Z={M:e,P:h,A:o,C:1,L:V,R:M,D:u,V:S,I:R,H:k,N:I,U:L,B:H,F:z},j=t.litHtmlPolyfillSupport;j?.(N,R),(t.litHtmlVersions??=[]).push(\"3.3.1\");const B=(t,i,s)=>{const e=s?.renderBefore??i;let h=e._$litPart$;if(void 0===h){const t=s?.renderBefore??null;e._$litPart$=h=new R(i.insertBefore(l(),t),t,void 0,s??{})}return h._$AI(t),h};export{Z as _$LH,x as html,w as mathml,T as noChange,E as nothing,B as render,b as svg};\n//# sourceMappingURL=lit-html.js.map\n","import{nothing as t,noChange as i}from\"../lit-html.js\";import{Directive as r,PartType as s,directive as n}from\"../directive.js\";\n/**\n * @license\n * Copyright 2017 Google LLC\n * SPDX-License-Identifier: BSD-3-Clause\n */class e extends r{constructor(i){if(super(i),this.it=t,i.type!==s.CHILD)throw Error(this.constructor.directiveName+\"() can only be used in child bindings\")}render(r){if(r===t||null==r)return this._t=void 0,this.it=r;if(r===i)return r;if(\"string\"!=typeof r)throw Error(this.constructor.directiveName+\"() called with a non-string value\");if(r===this.it)return this._t;this.it=r;const s=[r];return s.raw=s,this._t={_$litType$:this.constructor.resultType,strings:s,values:[]}}}e.directiveName=\"unsafeHTML\",e.resultType=1;const o=n(e);export{e as UnsafeHTMLDirective,o as unsafeHTML};\n//# sourceMappingURL=unsafe-html.js.map\n","import{ReactiveElement as t}from\"@lit/reactive-element\";export*from\"@lit/reactive-element\";import{render as e,noChange as r}from\"lit-html\";export*from\"lit-html\";\n/**\n * @license\n * Copyright 2017 Google LLC\n * SPDX-License-Identifier: BSD-3-Clause\n */const s=globalThis;class i extends t{constructor(){super(...arguments),this.renderOptions={host:this},this._$Do=void 0}createRenderRoot(){const t=super.createRenderRoot();return this.renderOptions.renderBefore??=t.firstChild,t}update(t){const r=this.render();this.hasUpdated||(this.renderOptions.isConnected=this.isConnected),super.update(t),this._$Do=e(r,this.renderRoot,this.renderOptions)}connectedCallback(){super.connectedCallback(),this._$Do?.setConnected(!0)}disconnectedCallback(){super.disconnectedCallback(),this._$Do?.setConnected(!1)}render(){return r}}i._$litElement$=!0,i[\"finalized\"]=!0,s.litElementHydrateSupport?.({LitElement:i});const o=s.litElementPolyfillSupport;o?.({LitElement:i});const n={_$AK:(t,e,r)=>{t._$AK(e,r)},_$AL:t=>t._$AL};(s.litElementVersions??=[]).push(\"4.2.0\");export{i as LitElement,n as _$LE};\n//# sourceMappingURL=lit-element.js.map\n"],"names":["r","Array","arguments","Object","String","Uint8Array","Uint16Array","Int32Array","m","Math","s","o","t","Date","TextEncoder","TextDecoder","queueMicrotask","u","l","a","FluentType","FluentNone","FluentNumber","Intl","FluentDateTime","globalThis","Symbol","TypeError","RangeError","ReferenceError","Scope","WeakSet","Error","JSON","Map","FluentBundle","FluentResource","SyntaxError","p","Indent","parseInt","parseFloat","n","Uint32Array","btoa","document","NodeFilter","ShadowRoot","DocumentFragment","console","Document","CSSStyleSheet","WeakMap","Boolean","Number","y","HTMLElement","litPropertyMetadata","Set","Promise","AbortController","i","RegExp","N","v","H","I","L","k","M","R","z","e"],"mappings":";0FAqBA,EAAO,OAAO,CAnBd,SAAS,EAAYA,CAAM,EAIzB,IAHA,IACI,EACA,EAFA,EAAQC,MAAM,SAAS,CAAC,KAAK,CAAC,IAAI,CAACC,UAAW,GAG3C,EAAM,MAAM,EAEjB,IAAK,KADL,EAAO,EAAM,KAAK,GAEZ,EAAK,cAAc,CAAC,KAClBC,AAAgD,oBAAhDA,OAAO,SAAS,CAAC,QAAQ,CAAC,IAAI,CAACH,CAAM,CAAC,EAAI,EAC5CA,CAAM,CAAC,EAAI,CAAG,EAAWA,CAAM,CAAC,EAAI,CAAE,CAAI,CAAC,EAAI,EAE/CA,CAAM,CAAC,EAAI,CAAG,CAAI,CAAC,EAAI,EAK/B,OAAOA,CACT,qBCbA,EAAO,OAAO,CAAG,SAAU,CAAsB,EAC/C,IAAI,EAAO,EAAE,CA4Eb,OAzEA,EAAK,QAAQ,CAAG,WACd,OAAO,IAAI,CAAC,GAAG,CAAC,SAAU,CAAI,EAC5B,IAAI,EAAU,GACV,EAAY,AAAmB,SAAZ,CAAI,CAAC,EAAE,CAoB9B,OAnBI,CAAI,CAAC,EAAE,EACT,IAAW,cAAc,MAAM,CAAC,CAAI,CAAC,EAAE,CAAE,MAAK,EAE5C,CAAI,CAAC,EAAE,EACT,IAAW,UAAU,MAAM,CAAC,CAAI,CAAC,EAAE,CAAE,KAAI,EAEvC,GACF,IAAW,SAAS,MAAM,CAAC,CAAI,CAAC,EAAE,CAAC,MAAM,CAAG,EAAI,IAAI,MAAM,CAAC,CAAI,CAAC,EAAE,EAAI,GAAI,KAAI,EAEhF,GAAW,EAAuB,GAC9B,GACF,IAAW,GAAE,EAEX,CAAI,CAAC,EAAE,EACT,IAAW,GAAE,EAEX,CAAI,CAAC,EAAE,EACT,IAAW,GAAE,EAER,CACT,GAAG,IAAI,CAAC,GACV,EAGA,EAAK,CAAC,CAAG,SAAW,CAAO,CAAE,CAAK,CAAE,CAAM,CAAE,CAAQ,CAAE,CAAK,EACrD,AAAmB,UAAnB,OAAO,GACT,GAAU,CAAC,CAAC,KAAM,EAAS,OAAU,CAAC,AAAD,EAEvC,IAAI,EAAyB,CAAC,EAC9B,GAAI,EACF,IAAK,IAAI,EAAI,EAAG,EAAI,IAAI,CAAC,MAAM,CAAE,IAAK,CACpC,IAAI,EAAK,IAAI,CAAC,EAAE,CAAC,EAAE,AACf,AAAM,OAAN,GACF,EAAsB,CAAC,EAAG,CAAG,EAAG,CAEpC,CAEF,IAAK,IAAI,EAAK,EAAG,EAAK,EAAQ,MAAM,CAAE,IAAM,CAC1C,IAAI,EAAO,EAAE,CAAC,MAAM,CAAC,CAAO,CAAC,EAAG,EAC5B,GAAU,CAAsB,CAAC,CAAI,CAAC,EAAE,CAAC,GAGxB,SAAV,IACc,SAAZ,CAAI,CAAC,EAAE,EAGhB,EAAI,CAAC,EAAE,CAAG,SAAS,MAAM,CAAC,CAAI,CAAC,EAAE,CAAC,MAAM,CAAG,EAAI,IAAI,MAAM,CAAC,CAAI,CAAC,EAAE,EAAI,GAAI,MAAM,MAAM,CAAC,CAAI,CAAC,EAAE,CAAE,IAAG,EAFlG,CAAI,CAAC,EAAE,CAAG,GAMV,IACG,CAAI,CAAC,EAAE,EAGV,EAAI,CAAC,EAAE,CAAG,UAAU,MAAM,CAAC,CAAI,CAAC,EAAE,CAAE,MAAM,MAAM,CAAC,CAAI,CAAC,EAAE,CAAE,IAAG,EAF7D,CAAI,CAAC,EAAE,CAAG,GAMV,IACG,CAAI,CAAC,EAAE,EAGV,CAAI,CAAC,EAAE,CAAG,cAAc,MAAM,CAAC,CAAI,CAAC,EAAE,CAAE,OAAO,MAAM,CAAC,CAAI,CAAC,EAAE,CAAE,KAC/D,CAAI,CAAC,EAAE,CAAG,GAHV,CAAI,CAAC,EAAE,CAAG,GAAG,MAAM,CAAC,IAMxB,EAAK,IAAI,CAAC,GACZ,CACF,EACO,CACT,qBClFA,EAAO,OAAO,CAAG,SAAU,CAAG,CAAE,CAAO,SACjC,AAAC,GACH,GAAU,CAAC,GAER,IAGL,EAAMI,OAAO,EAAI,UAAU,CAAG,EAAI,OAAO,CAAG,GAGxC,eAAe,IAAI,CAAC,IACtB,GAAM,EAAI,KAAK,CAAC,EAAG,GAAE,EAEnB,EAAQ,IAAI,EACd,IAAO,EAAQ,IAAI,AAAD,EAKhB,oBAAoB,IAAI,CAAC,IAAQ,EAAQ,UAAU,GAC9C,IAAK,MAAM,CAAC,EAAI,OAAO,CAAC,KAAM,OAAO,OAAO,CAAC,MAAO,OAAQ,KAE9D,CACT,oBCvBA,EAAO,OAAO,CAAG,SAAU,CAAC,EAC1B,OAAO,CAAC,CAAC,EAAE,AACb,qDC0BA,IAAI,EAAKC,WAAY,EAAMC,YAAa,EAAMC,WAE1C,EAAO,IAAI,EAAG,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAgB,EAAG,EAAoB,EAAE,EAE5I,EAAO,IAAI,EAAG,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAiB,EAAG,EAAE,EAEnI,EAAO,IAAI,EAAG,CAAC,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAG,EAEhF,EAAO,SAAU,CAAE,CAAE,CAAK,EAE1B,IAAK,IADD,EAAI,IAAI,EAAI,IACP,EAAI,EAAG,EAAI,GAAI,EAAE,EACtB,CAAC,CAAC,EAAE,CAAG,GAAS,GAAK,CAAE,CAAC,EAAI,EAAE,CAIlC,IAAK,IADD,EAAI,IAAI,EAAI,CAAC,CAAC,GAAG,EACZ,EAAI,EAAG,EAAI,GAAI,EAAE,EACtB,IAAK,IAAI,EAAI,CAAC,CAAC,EAAE,CAAE,EAAI,CAAC,CAAC,EAAI,EAAE,CAAE,EAAE,EAC/B,CAAC,CAAC,EAAE,CAAG,AAAE,EAAI,CAAC,CAAC,EAAE,EAAK,EAAK,EAGnC,MAAO,CAAE,EAAG,EAAG,EAAG,CAAE,CACxB,EACI,EAAK,EAAK,EAAM,GAAI,EAAK,EAAG,CAAC,CAAE,EAAQ,EAAG,CAAC,AAE/C,EAAE,CAAC,GAAG,CAAG,IAAK,CAAK,CAAC,IAAI,CAAG,GAI3B,IAAK,IAHD,EAAK,EAAK,EAAM,GAAe,GAAN,EAAG,CAAC,CAAU,EAAG,CAAC,EAE3C,EAAM,IAAI,EAAI,OACT,EAAI,EAAG,EAAI,MAAO,EAAE,EAAG,CAE5B,IAAI,EAAI,AAAE,CAAI,MAAJ,CAAS,GAAM,EAAM,AAAC,CAAI,MAAJ,CAAS,GAAM,EAE/C,EAAI,AAAE,CAAI,MADV,GAAI,AAAE,CAAI,MAAJ,CAAS,GAAM,EAAM,AAAC,CAAI,MAAJ,CAAS,GAAM,CAAC,CAC7B,GAAM,EAAM,AAAC,CAAI,KAAJ,CAAS,GAAM,EAC3C,CAAG,CAAC,EAAE,CAAG,AAAC,CAAE,CAAI,MAAJ,CAAS,GAAM,EAAM,AAAC,CAAI,IAAJ,CAAS,GAAM,CAAC,GAAM,CAC5D,CAuDA,IAAK,IAnDD,EAAQ,SAAU,CAAE,CAAE,CAAE,CAAE,CAAC,EAO3B,IANA,IAeI,EAfA,EAAI,EAAG,MAAM,CAEb,EAAI,EAEJ,EAAI,IAAI,EAAI,GAET,EAAI,EAAG,EAAE,EACR,CAAE,CAAC,EAAE,EACL,EAAE,CAAC,CAAC,CAAE,CAAC,EAAE,CAAG,EAAE,CAGtB,IAAI,EAAK,IAAI,EAAI,GACjB,IAAK,EAAI,EAAG,EAAI,EAAI,EAAE,EAClB,CAAE,CAAC,EAAE,CAAG,AAAC,CAAE,CAAC,EAAI,EAAE,CAAG,CAAC,CAAC,EAAI,EAAE,EAAK,EAGtC,GAAI,EAAG,CAEH,EAAK,IAAI,EAAI,GAAK,GAElB,IAAI,EAAM,GAAK,EACf,IAAK,EAAI,EAAG,EAAI,EAAG,EAAE,EAEjB,GAAI,CAAE,CAAC,EAAE,CAQL,IAAK,IAND,EAAK,AAAC,GAAK,EAAK,CAAE,CAAC,EAAE,CAErB,EAAM,EAAK,CAAE,CAAC,EAAE,CAEhB,EAAI,CAAE,CAAC,CAAE,CAAC,EAAE,CAAG,EAAE,IAAM,EAElBC,EAAI,EAAK,AAAC,IAAK,CAAE,EAAK,EAAI,GAAKA,EAAG,EAAE,EAEzC,CAAE,CAAC,CAAG,CAAC,EAAE,EAAI,EAAI,CAAG,CAIpC,MAGI,IAAK,EAAI,EADT,EAAK,IAAI,EAAI,GACD,EAAI,EAAG,EAAE,EACb,CAAE,CAAC,EAAE,EACL,EAAE,CAAC,EAAE,CAAG,CAAG,CAAC,CAAE,CAAC,CAAE,CAAC,EAAE,CAAG,EAAE,GAAG,EAAK,GAAK,CAAE,CAAC,EAAE,EAIvD,OAAO,CACX,EAEI,EAAM,IAAI,EAAG,KACR,EAAI,EAAG,EAAI,IAAK,EAAE,EACvB,CAAG,CAAC,EAAE,CAAG,EACb,IAAK,IAAI,EAAI,IAAK,EAAI,IAAK,EAAE,EACzB,CAAG,CAAC,EAAE,CAAG,EACb,IAAK,IAAI,EAAI,IAAK,EAAI,IAAK,EAAE,EACzB,CAAG,CAAC,EAAE,CAAG,EACb,IAAK,IAAI,EAAI,IAAK,EAAI,IAAK,EAAE,EACzB,CAAG,CAAC,EAAE,CAAG,EAGb,IAAK,IADD,EAAM,IAAI,EAAG,IACR,EAAI,EAAG,EAAI,GAAI,EAAE,EACtB,CAAG,CAAC,EAAE,CAAG,EA3Eb,IA6EI,EAAoB,EAAK,EAAK,EAAG,GAEjC,EAAoB,EAAK,EAAK,EAAG,GAqBjC,EAAO,SAAU,CAAC,EAAI,MAAO,AAAE,GAAI,GAAK,EAAK,CAAG,EAGhD,EAAM,SAAU,CAAC,CAAE,CAAC,CAAE,CAAC,EAMvB,MALI,CAAK,MAAL,GAAa,EAAI,IACjB,GAAI,GACJ,CAAK,MAAL,GAAa,EAAI,EAAE,MAAM,AAAD,GACxB,GAAI,EAAE,MAAM,AAAD,EAER,IAAI,EAAG,EAAE,QAAQ,CAAC,EAAG,GAChC,EAuOI,EAAQ,SAAU,CAAC,CAAE,CAAC,CAAE,CAAC,EACzB,IAAM,AAAI,EAAJ,EACN,IAAI,EAAI,AAAC,EAAI,EAAK,CAClB,EAAC,CAAC,EAAE,EAAI,EACR,CAAC,CAAC,EAAI,EAAE,EAAI,GAAK,CACrB,EAEI,EAAU,SAAU,CAAC,CAAE,CAAC,CAAE,CAAC,EAC3B,IAAM,AAAI,EAAJ,EACN,IAAI,EAAI,AAAC,EAAI,EAAK,CAClB,EAAC,CAAC,EAAE,EAAI,EACR,CAAC,CAAC,EAAI,EAAE,EAAI,GAAK,EACjB,CAAC,CAAC,EAAI,EAAE,EAAI,GAAK,EACrB,EAEI,EAAQ,SAAU,CAAC,CAAE,CAAE,EAGvB,IAAK,IADD,EAAI,EAAE,CACD,EAAI,EAAG,EAAI,EAAE,MAAM,CAAE,EAAE,EACxB,CAAC,CAAC,EAAE,EACJ,EAAE,IAAI,CAAC,CAAE,EAAG,EAAG,EAAG,CAAC,CAAC,EAAE,AAAC,GAH/B,IAKI,EAAI,EAAE,MAAM,CACZ,EAAK,EAAE,KAAK,GAChB,GAAI,CAAC,EACD,MAAO,CAAE,EAAG,EAAI,EAAG,CAAE,EACzB,GAAI,AAAK,GAAL,EAAQ,CACR,IAAI,EAAI,IAAI,EAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAG,GAExB,OADA,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAG,EACL,CAAE,EAAG,EAAG,EAAG,CAAE,CACxB,CACA,EAAE,IAAI,CAAC,SAAU,CAAC,CAAE,CAAC,EAAI,OAAO,EAAE,CAAC,CAAG,EAAE,CAAC,AAAE,GAG3C,EAAE,IAAI,CAAC,CAAE,EAAG,GAAI,EAAG,KAAM,GACzB,IAAI,EAAI,CAAC,CAAC,EAAE,CAAE,EAAI,CAAC,CAAC,EAAE,CAAE,EAAK,EAAG,EAAK,EAAG,EAAK,EAO7C,IANA,CAAC,CAAC,EAAE,CAAG,CAAE,EAAG,GAAI,EAAG,EAAE,CAAC,CAAG,EAAE,CAAC,CAAE,EAAG,EAAG,EAAG,CAAE,EAMlC,GAAM,EAAI,GACb,EAAI,CAAC,CAAC,CAAC,CAAC,EAAG,CAAC,CAAC,CAAG,CAAC,CAAC,EAAG,CAAC,CAAC,CAAG,IAAO,IAAK,CACtC,EAAI,CAAC,CAAC,GAAM,GAAM,CAAC,CAAC,EAAG,CAAC,CAAC,CAAG,CAAC,CAAC,EAAG,CAAC,CAAC,CAAG,IAAO,IAAK,CAClD,CAAC,CAAC,IAAK,CAAG,CAAE,EAAG,GAAI,EAAG,EAAE,CAAC,CAAG,EAAE,CAAC,CAAE,EAAG,EAAG,EAAG,CAAE,EAGhD,IAAK,IADD,EAAS,CAAE,CAAC,EAAE,CAAC,CAAC,CACX,EAAI,EAAG,EAAI,EAAG,EAAE,EACjB,CAAE,CAAC,EAAE,CAAC,CAAC,CAAG,GACV,GAAS,CAAE,CAAC,EAAE,CAAC,CAAC,AAAD,EAHvB,IAMI,EAAK,IAAI,EAAI,EAAS,GAEtB,EAAM,EAAG,CAAC,CAAC,EAAK,EAAE,CAAE,EAAI,GAC5B,GAAI,EAAM,EAAI,CAIV,IAAI,EAAI,EAAG,EAAK,EAEZ,EAAM,EAAM,EAAI,EAAM,GAAK,EAE/B,IADA,EAAG,IAAI,CAAC,SAAU,CAAC,CAAE,CAAC,EAAI,OAAO,CAAE,CAAC,EAAE,CAAC,CAAC,CAAG,CAAE,CAAC,EAAE,CAAC,CAAC,EAAI,EAAE,CAAC,CAAG,EAAE,CAAC,AAAE,GAC1D,EAAI,EAAG,EAAE,EAAG,CACf,IAAI,EAAO,CAAE,CAAC,EAAE,CAAC,CAAC,CAClB,GAAI,CAAE,CAAC,EAAK,CAAG,EACX,GAAM,EAAO,IAAM,EAAM,CAAE,CAAC,EAAK,EACjC,CAAE,CAAC,EAAK,CAAG,OAGX,KACR,CAEA,IADA,IAAO,EACA,EAAK,GAAG,CACX,IAAI,EAAO,CAAE,CAAC,EAAE,CAAC,CAAC,AACd,EAAE,CAAC,EAAK,CAAG,EACX,GAAM,GAAM,EAAK,CAAE,CAAC,EAAK,GAAK,EAE9B,EAAE,CACV,CACA,KAAO,GAAK,GAAK,EAAI,EAAE,EAAG,CACtB,IAAI,EAAO,CAAE,CAAC,EAAE,CAAC,CAAC,AACd,EAAE,CAAC,EAAK,EAAI,IACZ,EAAE,CAAE,CAAC,EAAK,CACV,EAAE,EAEV,CACA,EAAM,CACV,CACA,MAAO,CAAE,EAAG,IAAI,EAAG,GAAK,EAAG,CAAI,CACnC,EAEI,EAAK,SAAU,CAAC,CAAE,CAAC,CAAE,CAAC,EACtB,OAAO,AAAO,IAAP,EAAE,CAAC,CACJC,KAAK,GAAG,CAAC,EAAG,EAAE,CAAC,CAAE,EAAG,EAAI,GAAI,EAAG,EAAE,CAAC,CAAE,EAAG,EAAI,IAC1C,CAAC,CAAC,EAAE,CAAC,CAAC,CAAG,CACpB,EAEI,EAAK,SAAU,CAAC,EAGhB,IAFA,IAAI,EAAI,EAAE,MAAM,CAET,GAAK,CAAC,CAAC,CAAC,EAAE,EAAE,GAMnB,IAAK,IAJD,EAAK,IAAI,EAAI,EAAE,GAEf,EAAM,EAAG,EAAM,CAAC,CAAC,EAAE,CAAE,EAAM,EAC3B,EAAI,SAAU,CAAC,EAAI,CAAE,CAAC,IAAM,CAAG,CAAG,EAC7B,EAAI,EAAG,GAAK,EAAG,EAAE,EACtB,GAAI,CAAC,CAAC,EAAE,EAAI,GAAO,GAAK,EACpB,EAAE,MACD,CACD,GAAI,CAAC,GAAO,EAAM,EAAG,CACjB,KAAO,EAAM,IAAK,GAAO,IACrB,EAAE,OACF,EAAM,IACN,EAAE,EAAM,GAAK,AAAE,EAAM,IAAO,EAAK,MAAQ,AAAE,EAAM,GAAM,EAAK,OAC5D,EAAM,EAEd,MACK,GAAI,EAAM,EAAG,CAEd,IADA,EAAE,GAAM,EAAE,EACH,EAAM,EAAG,GAAO,EACnB,EAAE,KACF,GAAM,GACN,GAAE,AAAE,EAAM,GAAM,EAAK,MAAO,EAAM,EAC1C,CACA,KAAO,KACH,EAAE,GACN,EAAM,EACN,EAAM,CAAC,CAAC,EAAE,AACd,CAEJ,MAAO,CAAE,EAAG,EAAG,QAAQ,CAAC,EAAG,GAAM,EAAG,CAAE,CAC1C,EAEI,EAAO,SAAU,CAAE,CAAE,CAAE,EAEvB,IAAK,IADD,EAAI,EACC,EAAI,EAAG,EAAI,EAAG,MAAM,CAAE,EAAE,EAC7B,GAAK,CAAE,CAAC,EAAE,CAAG,CAAE,CAAC,EAAE,CACtB,OAAO,CACX,EAGI,EAAQ,SAAU,CAAG,CAAE,CAAG,CAAE,CAAG,EAE/B,IAAIC,EAAI,EAAI,MAAM,CACdC,EAAI,EAAK,EAAM,EACnB,EAAG,CAACA,EAAE,CAAGD,AAAI,IAAJA,EACT,CAAG,CAACC,EAAI,EAAE,CAAGD,GAAK,EAClB,CAAG,CAACC,EAAI,EAAE,CAAG,AAAS,IAAT,CAAG,CAACA,EAAE,CACnB,CAAG,CAACA,EAAI,EAAE,CAAG,AAAa,IAAb,CAAG,CAACA,EAAI,EAAE,CACvB,IAAK,IAAI,EAAI,EAAG,EAAID,EAAG,EAAE,EACrB,CAAG,CAACC,EAAI,EAAI,EAAE,CAAG,CAAG,CAAC,EAAE,CAC3B,MAAO,AAACA,CAAAA,EAAI,EAAID,CAAAA,EAAK,CACzB,EAEI,EAAO,SAAU,CAAG,CAAE,CAAG,CAAE,CAAK,CAAEA,CAAI,CAAE,CAAE,CAAE,CAAE,CAAE,CAAE,CAAE,CAAE,CAAE,CAAE,CAAE,CAAE,CAAE,CAAC,EACjE,EAAM,EAAK,IAAK,GAChB,EAAE,CAAE,CAAC,IAAI,CAMT,IAAK,IAaD,EAAI,EAAI,EAAI,EAlBZ,EAAK,EAAM,EAAI,IAAK,EAAM,EAAG,CAAC,CAAE,EAAM,EAAG,CAAC,CAC1C,EAAK,EAAM,EAAI,IAAK,EAAM,EAAG,CAAC,CAAE,EAAM,EAAG,CAAC,CAC1C,EAAK,EAAG,GAAM,EAAO,EAAG,CAAC,CAAE,EAAM,EAAG,CAAC,CACrC,EAAK,EAAG,GAAM,EAAO,EAAG,CAAC,CAAE,EAAM,EAAG,CAAC,CACrC,EAAS,IAAI,EAAI,IACZ,GAAI,EAAG,GAAI,EAAK,MAAM,CAAE,EAAE,GAC/B,EAAE,CAAM,CAAC,AAAU,GAAV,CAAI,CAAC,GAAE,CAAM,CAC1B,IAAK,IAAI,GAAI,EAAG,GAAI,EAAK,MAAM,CAAE,EAAE,GAC/B,EAAE,CAAM,CAAC,AAAU,GAAV,CAAI,CAAC,GAAE,CAAM,CAG1B,IAXA,IASI,GAAK,EAAM,EAAQ,GAAI,GAAM,GAAG,CAAC,CAAE,GAAO,GAAG,CAAC,CAC9C,GAAO,GACJ,GAAO,GAAK,CAAC,EAAG,CAAC,CAAI,CAAC,GAAO,EAAE,CAAC,CAAE,EAAE,IAE3C,IAAI,GAAO,AAAC,EAAK,GAAM,EACnB,GAAQ,EAAK,EAAI,GAAO,EAAK,EAAI,GAAO,EACxC,GAAQ,EAAK,EAAI,GAAO,EAAK,EAAI,GAAO,EAAK,GAAK,EAAI,GAAO,EAAK,EAAQ,IAAO,EAAI,CAAM,CAAC,GAAG,CAAG,EAAI,CAAM,CAAC,GAAG,CAAG,EAAI,CAAM,CAAC,GAAG,CACrI,GAAI,GAAM,GAAK,IAAQ,IAAS,IAAQ,GACpC,OAAO,EAAM,EAAK,EAAG,EAAI,QAAQ,CAAC,EAAI,EAAK,IAG/C,GADA,EAAM,EAAK,EAAG,EAAK,IAAQ,EAAI,GAAK,GAAK,EACrC,GAAQ,GAAO,CACf,EAAK,EAAK,EAAK,EAAK,GAAI,EAAK,EAAK,EAAK,EAAK,EAAK,EAAK,GAAI,EAAK,EAC/D,IAAI,GAAM,EAAK,GAAK,GAAM,GAC1B,EAAM,EAAK,EAAG,EAAM,KACpB,EAAM,EAAK,EAAI,EAAG,EAAM,GACxB,EAAM,EAAK,EAAI,GAAI,GAAO,GAC1B,GAAK,GACL,IAAK,IAAI,GAAI,EAAG,GAAI,GAAM,EAAE,GACxB,EAAM,EAAK,EAAI,EAAI,GAAG,EAAG,CAAC,CAAI,CAAC,GAAE,CAAC,EACtC,GAAK,EAAI,GAET,IAAK,IADD,GAAO,CAAC,EAAM,EAAK,CACd,GAAK,EAAG,GAAK,EAAG,EAAE,GAEvB,IAAK,IADD,GAAO,EAAI,CAAC,GAAG,CACV,GAAI,EAAG,GAAI,GAAK,MAAM,CAAE,EAAE,GAAG,CAClC,IAAI,GAAM,AAAU,GAAV,EAAI,CAAC,GAAE,CACjB,EAAM,EAAK,EAAG,EAAG,CAAC,GAAI,EAAG,GAAK,EAAG,CAAC,GAAI,CAClC,GAAM,IACN,GAAM,EAAK,EAAG,AAAC,EAAI,CAAC,GAAE,EAAI,EAAK,KAAM,GAAK,EAAI,CAAC,GAAE,EAAI,EAAC,CAC9D,CAER,MAEI,EAAK,EAAK,EAAK,EAAK,EAAK,EAAK,EAAK,EAEvC,IAAK,IAAI,GAAI,EAAG,GAAI,EAAI,EAAE,GAAG,CACzB,IAAI,GAAMA,CAAI,CAAC,GAAE,CACjB,GAAI,GAAM,IAAK,CACX,IAAI,GAAM,AAAC,IAAO,GAAM,GACxB,EAAQ,EAAK,EAAG,CAAE,CAAC,GAAM,IAAI,EAAG,GAAK,CAAE,CAAC,GAAM,IAAI,CAC9C,GAAM,GACN,GAAM,EAAK,EAAG,AAAC,IAAO,GAAM,IAAK,GAAK,CAAI,CAAC,GAAI,AAAD,EAClD,IAAI,GAAM,AAAM,GAAN,GACV,EAAQ,EAAK,EAAG,CAAE,CAAC,GAAI,EAAG,GAAK,CAAE,CAAC,GAAI,CAClC,GAAM,GACN,GAAQ,EAAK,EAAG,AAAC,IAAO,EAAK,MAAO,GAAK,CAAI,CAAC,GAAI,AAAD,CACzD,MAEI,EAAQ,EAAK,EAAG,CAAE,CAAC,GAAI,EAAG,GAAK,CAAE,CAAC,GAAI,AAE9C,CAEA,OADA,EAAQ,EAAK,EAAG,CAAE,CAAC,IAAI,EAChB,EAAI,CAAE,CAAC,IAAI,AACtB,EAEI,EAAoB,IAAI,EAAI,CAAC,MAAO,OAAQ,OAAQ,OAAQ,OAAQ,QAAS,QAAS,QAAS,QAAQ,EAEvG,EAAmB,IAAI,EAAG,GAE1B,EAAO,SAAU,CAAG,CAAE,CAAG,CAAE,CAAI,CAAE,CAAG,CAAE,CAAI,CAAE,CAAE,EAC9C,IAAI,EAAI,EAAG,CAAC,EAAI,EAAI,MAAM,CACtB,EAAI,IAAI,EAAG,EAAM,EAAI,EAAK,GAAID,KAAK,IAAI,CAAC,EAAI,IAAI,EAAK,GAErD,EAAI,EAAE,QAAQ,CAAC,EAAK,EAAE,MAAM,CAAG,GAC/B,EAAM,EAAG,CAAC,CACV,EAAM,AAAc,EAAb,GAAG,CAAC,EAAI,GACnB,GAAI,EAAK,CACD,GACA,EAAC,CAAC,EAAE,CAAG,EAAG,CAAC,EAAI,GAenB,IAdA,IAAI,EAAM,CAAG,CAAC,EAAM,EAAE,CAClB,EAAI,GAAO,GAAI,EAAI,AAAM,KAAN,EACnB,EAAQ,AAAC,IAAK,CAAG,EAAK,EAEtB,EAAO,EAAG,CAAC,EAAI,IAAI,EAAI,OAAQ,EAAO,EAAG,CAAC,EAAI,IAAI,EAAI,EAAQ,GAC9D,EAAQA,KAAK,IAAI,CAAC,EAAO,GAAI,EAAQ,EAAI,EACzC,EAAM,SAAU,CAAC,EAAI,MAAO,AAAC,EAAG,CAAC,EAAE,CAAI,CAAG,CAAC,EAAI,EAAE,EAAI,EAAU,CAAG,CAAC,EAAI,EAAE,EAAI,CAAK,EAAK,CAAO,EAG9F,EAAO,IAAI,EAAI,MAEf,EAAK,IAAI,EAAI,KAAM,EAAK,IAAI,EAAI,IAEhC,EAAO,EAAG,EAAK,EAAG,EAAI,EAAG,CAAC,EAAI,EAAG,EAAK,EAAG,EAAK,EAAG,CAAC,EAAI,EAAG,EAAK,EAC3D,EAAI,EAAI,EAAG,EAAE,EAAG,CAEnB,IAAI,EAAK,EAAI,GAET,EAAO,AAAI,MAAJ,EAAW,GAAQ,CAAI,CAAC,EAAG,CAKtC,GAJA,CAAI,CAAC,EAAK,CAAG,GACb,CAAI,CAAC,EAAG,CAAG,EAGP,GAAM,EAAG,CAET,IAAI,GAAM,EAAI,EACd,GAAI,AAAC,GAAO,KAAQ,EAAK,KAAI,GAAO,IAAM,KAAO,CAAC,CAAE,EAAI,CACpD,EAAM,EAAK,EAAK,EAAG,EAAG,EAAM,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,GACxD,EAAK,EAAO,EAAK,EAAG,EAAK,EACzB,IAAK,IAAI,GAAI,EAAG,GAAI,IAAK,EAAE,GACvB,CAAE,CAAC,GAAE,CAAG,EACZ,IAAK,IAAI,GAAI,EAAG,GAAI,GAAI,EAAE,GACtB,CAAE,CAAC,GAAE,CAAG,CAChB,CAEA,IAAI,GAAI,EAAG,GAAI,EAAG,GAAO,EAAG,GAAM,EAAO,GAAQ,MACjD,GAAI,GAAM,GAAK,GAAM,EAAI,EAAI,IAMzB,IALA,IAAI,GAAOA,KAAK,GAAG,CAAC,EAAG,IAAO,EAC1B,GAAOA,KAAK,GAAG,CAAC,MAAO,GAGvB,GAAKA,KAAK,GAAG,CAAC,IAAK,IAChB,IAAO,IAAQ,EAAE,IAAQ,GAAQ,IAAO,CAC3C,GAAI,CAAG,CAAC,EAAI,GAAE,EAAI,CAAG,CAAC,EAAI,GAAI,GAAI,CAAE,CAEhC,IADA,IAAI,GAAK,EACF,GAAK,IAAM,CAAG,CAAC,EAAI,GAAG,EAAI,CAAG,CAAC,EAAI,GAAK,GAAI,CAAE,EAAE,IAEtD,GAAI,GAAK,GAAG,CAGR,GAFA,GAAI,GAAI,GAAI,GAER,GAAK,GACL,MAMJ,IAAK,IAFD,GAAMA,KAAK,GAAG,CAAC,GAAK,GAAK,GACzB,GAAK,EACA,GAAI,EAAG,GAAI,GAAK,EAAE,GAAG,CAC1B,IAAI,GAAK,EAAI,GAAM,GAAI,MACnB,GAAM,CAAI,CAAC,GAAG,CACd,GAAK,GAAK,GAAM,KAChB,IAAK,IACL,IAAK,GAAI,GAAQ,EAAC,CAC1B,CACJ,CACJ,CAEc,GAAQ,CAAI,CAA1B,EAAO,GAAyB,CAChC,IAAO,EAAO,GAAQ,KAC1B,CAGJ,GAAI,GAAG,CAGH,CAAI,CAAC,IAAK,CAAG,WAAa,CAAK,CAAC,GAAE,EAAI,GAAM,CAAK,CAAC,GAAE,CACpD,IAAI,GAAM,AAAW,GAAX,CAAK,CAAC,GAAE,CAAO,GAAM,AAAW,GAAX,CAAK,CAAC,GAAE,CACvC,GAAM,CAAI,CAAC,GAAI,CAAG,CAAI,CAAC,GAAI,CAC3B,EAAE,CAAE,CAAC,IAAM,GAAI,CACf,EAAE,CAAE,CAAC,GAAI,CACT,EAAK,EAAI,GACT,EAAE,CACN,MAEI,CAAI,CAAC,IAAK,CAAG,CAAG,CAAC,EAAE,CACnB,EAAE,CAAE,CAAC,CAAG,CAAC,EAAE,CAAC,AAEpB,CACJ,CACA,IAAK,EAAIA,KAAK,GAAG,CAAC,EAAG,GAAK,EAAI,EAAG,EAAE,EAC/B,CAAI,CAAC,IAAK,CAAG,CAAG,CAAC,EAAE,CACnB,EAAE,CAAE,CAAC,CAAG,CAAC,EAAE,CAAC,CAEhB,EAAM,EAAK,EAAK,EAAG,EAAK,EAAM,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,GACrD,IACD,EAAG,CAAC,CAAG,AAAO,EAAN,EAAW,CAAC,CAAC,AAAC,EAAM,EAAK,EAAE,EAAI,EAEvC,GAAO,EACP,EAAG,CAAC,CAAG,EAAM,EAAG,CAAC,CAAG,EAAM,EAAG,CAAC,CAAG,EAAG,EAAG,CAAC,CAAG,EAEnD,KACK,CACD,IAAK,IAAI,EAAI,EAAG,CAAC,EAAI,EAAG,EAAI,EAAI,EAAK,GAAK,MAAO,CAE7C,IAAI,GAAI,EAAI,MACR,IAAK,IAEL,CAAC,CAAC,AAAC,EAAM,EAAK,EAAE,CAAG,EACnB,GAAI,GAER,EAAM,EAAM,EAAG,EAAM,EAAG,EAAI,QAAQ,CAAC,EAAG,IAC5C,CACA,EAAG,CAAC,CAAG,CACX,CACA,OAAO,EAAI,EAAG,EAAG,EAAM,EAAK,GAAO,EACvC,EAEI,EAAqB,AAAC,WAEtB,IAAK,IADDG,EAAI,IAAIL,WAAW,KACd,EAAI,EAAG,EAAI,IAAK,EAAE,EAAG,CAE1B,IADA,IAAI,EAAI,EAAG,EAAI,EACR,EAAE,GACL,EAAI,AAAC,CAAK,EAAJ,GAAU,WAAS,EAAM,IAAM,CACzCK,CAAAA,CAAC,CAAC,EAAE,CAAG,CACX,CACA,OAAOA,CACX,IAEI,EAAM,WACN,IAAI,EAAI,GACR,MAAO,CACH,EAAG,SAAU,CAAC,EAGV,IAAK,IADD,EAAK,EACA,EAAI,EAAG,EAAI,EAAE,MAAM,CAAE,EAAE,EAC5B,EAAK,CAAI,CAAC,AAAM,IAAL,EAAY,CAAC,CAAC,EAAE,CAAC,CAAI,IAAO,EAC3C,EAAI,CACR,EACA,EAAG,WAAc,MAAO,CAAC,CAAG,CAChC,CACJ,EAyBI,EAAO,SAAU,CAAG,CAAE,CAAG,CAAE,CAAG,CAAE,CAAI,CAAE,CAAE,EACxC,GAAI,CAAC,IACD,EAAK,CAAE,EAAG,CAAE,EACR,EAAI,UAAU,EAAE,CAChB,IAAI,EAAO,EAAI,UAAU,CAAC,QAAQ,CAAC,QAC/B,EAAS,IAAI,EAAG,EAAK,MAAM,CAAG,EAAI,MAAM,EAC5C,EAAO,GAAG,CAAC,GACX,EAAO,GAAG,CAAC,EAAK,EAAK,MAAM,EAC3B,EAAM,EACN,EAAG,CAAC,CAAG,EAAK,MAAM,AACtB,CAEJ,OAAO,EAAK,EAAK,AAAa,MAAb,EAAI,KAAK,CAAW,EAAI,EAAI,KAAK,CAAE,AAAW,MAAX,EAAI,GAAG,CAAY,EAAG,CAAC,CAAGH,KAAK,IAAI,CAACA,AAAkD,IAAlDA,KAAK,GAAG,CAAC,EAAGA,KAAK,GAAG,CAAC,GAAIA,KAAK,GAAG,CAAC,EAAI,MAAM,KAAa,GAAO,GAAK,EAAI,GAAG,CAAG,EAAK,EAAM,EACtL,EAmJI,EAAS,SAAU,CAAC,CAAE,CAAC,CAAE,CAAC,EAC1B,KAAO,EAAG,EAAE,EACR,CAAC,CAAC,EAAE,CAAG,EAAG,KAAO,CACzB,EAEI,EAAM,SAAU,CAAC,CAAE,CAAC,EACpB,IAAI,EAAK,EAAE,QAAQ,CAInB,GAHA,CAAC,CAAC,EAAE,CAAG,GAAI,CAAC,CAAC,EAAE,CAAG,IAAK,CAAC,CAAC,EAAE,CAAG,EAAG,CAAC,CAAC,EAAE,CAAG,EAAE,KAAK,CAAG,EAAI,EAAI,AAAe,EAAf,CAAW,GAAX,EAAE,KAAK,AAAI,EAAW,CAAC,CAAC,EAAE,CAAG,EACnF,AAAW,GAAX,EAAE,KAAK,EACP,EAAO,EAAG,EAAGA,KAAK,KAAK,CAAC,IAAII,KAAK,EAAE,KAAK,EAAIA,KAAK,GAAG,IAAM,MAC1D,EAAI,CACJ,CAAC,CAAC,EAAE,CAAG,EACP,IAAK,IAAI,EAAI,EAAG,GAAK,EAAG,MAAM,CAAE,EAAE,EAC9B,CAAC,CAAC,EAAI,GAAG,CAAG,EAAG,UAAU,CAAC,EAClC,CACJ,EAmTO,SAAS,EAAS,CAAI,CAAE,CAAI,EAC3B,AAAC,GACD,GAAO,CAAC,GACZ,IAlSiB,EAkSb,EAAI,IAAO,EAAI,EAAK,MAAM,CAC9B,EAAE,CAAC,CAAC,GACJ,IAAI,EAAI,EAAK,EAAM,EApSU,GAAM,EAAlB,EAoSa,GApSO,QAAQ,CAAG,EAAE,QAAQ,CAAC,MAAM,CAAG,EAAI,GAoSnC,GAAI,EAAI,EAAE,MAAM,CACrD,OAAO,EAAI,EAAG,GAAO,EAAO,EAAG,EAAI,EAAG,EAAE,CAAC,IAAK,EAAO,EAAG,EAAI,EAAG,GAAI,CACvE,CAuWA,IAAI,EAAK,AAAsB,aAAtB,OAAOC,aAA4C,IAAIA,YAE5D,GAAK,AAAsB,aAAtB,OAAOC,aAA4C,IAAIA,YAGhE,GAAI,CACA,GAAG,MAAM,CAAC,EAAI,CAAE,OAAQ,EAAK,EAEjC,CACA,MAAO,EAAG,CAAE,CAwGL,SAAS,GAAQ,CAAG,CAAE,CAAM,EAC/B,GAAI,EAAQ,CAER,IAAK,IADD,EAAO,IAAI,EAAG,EAAI,MAAM,EACnB,EAAI,EAAG,EAAI,EAAI,MAAM,CAAE,EAAE,EAC9B,CAAI,CAAC,EAAE,CAAG,EAAI,UAAU,CAAC,GAC7B,OAAO,CACX,CACA,GAAI,EACA,OAAO,EAAG,MAAM,CAAC,GAKrB,IAAK,IAJD,EAAI,EAAI,MAAM,CACd,EAAK,IAAI,EAAG,EAAI,MAAM,CAAI,GAAI,MAAM,EAAI,IACxC,EAAK,EACL,EAAI,SAAU,CAAC,EAAI,CAAE,CAAC,IAAK,CAAG,CAAG,EAC5B,EAAI,EAAG,EAAI,EAAG,EAAE,EAAG,CACxB,GAAI,EAAK,EAAI,EAAG,MAAM,CAAE,CACpB,IAAI,EAAI,IAAI,EAAG,EAAK,EAAK,CAAC,EAAI,GAAM,IACpC,EAAE,GAAG,CAAC,GACN,EAAK,CACT,CACA,IAAI,EAAI,EAAI,UAAU,CAAC,EACnB,GAAI,KAAO,EACX,EAAE,IACG,EAAI,KACT,EAAE,IAAO,GAAK,IACT,EAAI,OAAS,EAAI,MACtB,CACI,EAAE,IAAO,AADb,GAAI,MAAS,CAAI,QAAJ,CAAa,EAAM,AAAsB,KAAtB,EAAI,UAAU,CAAC,EAAE,EAAS,GACxC,IAAM,EAAE,IAAO,AAAC,GAAK,GAAM,GAAgD,EAE7F,EAAE,IAAO,GAAK,IAAM,EAAE,IAAO,AAAC,GAAK,EAAK,KAAM,EAAE,IAAO,AAAI,GAAJ,GAC/D,CACA,OAAO,EAAI,EAAI,EAAG,EACtB,CAiuBS,AAAyB,YAAzB,OAAOC,gBAA+BA,sCC39E/C,EAAO,OAAO,CAAG,CACf,KAAM,AAJI,EAAQ,OACT,CAAC,aAAc,OAAQ,OAAQ,OAAQ,WAAY,MAAO,SAAS,CAI9E,oBCYA,EAAO,OAAO,CAjBC,CACb,kBAAmB,CACjB,EAAG,CAAC,OAAQ,OAAQ,SAAU,QAAS,aAAa,CACpD,OAAQ,CAAC,kBAAmB,cAAe,MAAM,CACjD,IAAK,CAAC,MAAO,MAAO,QAAS,aAAa,AAC5C,EACA,eAAgB,CAAC,EACjB,eAAgB,CAAC,OAAQ,QAAS,SAAS,CAC3C,YAAa,CACX,IAAK,OAAQ,UAAW,IAAK,aAAc,KAAM,UAAW,OAAQ,MAAO,UAAW,MAAO,KAC7F,KAAM,KAAM,KAAM,KAAM,KAAM,KAAM,KAAM,IAAK,MAAO,MAAO,MAAO,KAAM,OAAQ,OAClF,KAAM,IAAK,MAAO,UAAW,OAAQ,SAAU,SAAU,MAAO,UAAW,MAAO,QAClF,QAAS,KAAM,KAAM,QAAS,KAAM,IAAK,KAC1C,CACD,OAAQ,IACV,yBCZA,EAAO,OAAO,CAAG,CACf,MAAO,AAJG,EAAQ,OACR,CAAC,OAAQ,KAAM,MAAO,KAAM,MAAO,MAAO,QAAS,OAAQ,WAAY,OAAQ,OAAO,CAIlG,yBCLS,EAAQ,OACjB,IAAI,EAAS,EAAQ,OACjB,EAAS,EAAQ,OACjB,EAAY,EAAQ,MACpB,EAAW,EAAQ,MAEvB,SAAS,EAAQ,CAAI,CAAE,CAAO,CAAE,CAAM,EACpC,IAAI,EAAS,EAAE,CAMf,OAFA,EAAO,EAFO,EAAU,EADJ,AAAW,KAAX,EAAkB,EAAU,EAAO,CAAC,EAAG,EAAU,KAK9D,EAAO,IAAI,CAAC,GACrB,CAEA,EAAO,QAAQ,CAAG,EAClB,EAAO,OAAO,CAAG,qBCjBjB,EAAO,OAAO,CAAG,SAAoB,CAAM,EACzC,MAAO,AAAkB,UAAlB,OAAO,EAAsB,EAAO,WAAW,GAAK,CAC7D,yBCFA,IAAI,EAAK,EAAQ,OACb,EAAY,EAAQ,OACP,EAAQ,OACzB,IAAI,EAAW,EAAQ,OACnB,EAAS,6FACT,EAAO,4BACP,EAAS,0EACT,EAAO,KACP,EAAU,SA8Hd,GAAO,OAAO,CApHd,SAAiB,CAAI,CAAE,CAAO,EAK5B,IAJA,IARI,EAUA,EAFA,GAPJ,CADI,EAAQ,EAAE,EACR,QAAQ,CAAG,WACf,OAAO,CAAK,CAAC,EAAM,MAAM,CAAG,EAAE,AAChC,EACO,GAKH,EAAO,EAGJ,IACL,AAIF,WACE,EAAQ,GAYJ,AAAsB,YAAtB,EAAK,MAAM,CAAC,EAAG,GACjB,AAkBJ,WACE,IAAI,EAAQ,EAAK,OAAO,CAAC,UACrB,GAAS,IACP,EAAQ,OAAO,EACjB,EAAQ,OAAO,CAAC,EAAK,SAAS,CAAC,EAAG,IAEpC,EAAO,EAAK,SAAS,CAAC,EAAQ,GAC9B,EAAQ,GAEZ,IA1Ba,EAAQ,IAAI,CAAC,GACtB,EAAU,EAAM,GACP,EAAK,IAAI,CAAC,IACnB,EAAU,EAAQ,GAEpB,AAuBF,WACE,GAAK,GAIL,IADI,EACA,EAAQ,EAAK,OAAO,CAAC,IACrB,IAAS,GACX,EAAO,EAAK,SAAS,CAAC,EAAG,GACzB,EAAO,EAAK,SAAS,CAAC,KAEtB,EAAO,EACP,EAAO,IAEL,EAAQ,KAAK,EACf,EAAQ,KAAK,CAAC,GAElB,IAvDE,IAAI,EAAO,IAAS,EACpB,EAAO,EAEH,GACF,GAAO,EAAC,CAEZ,IAaA,SAAS,EAAWhB,CAAK,CAAE,CAAM,EAC/B,IAAI,EAAQ,EAAK,KAAK,CAACA,GACnB,IACF,EAAO,EAAK,SAAS,CAAC,CAAK,CAAC,EAAE,CAAC,MAAM,EACrC,CAAK,CAAC,EAAE,CAAC,OAAO,CAACA,EAAO,GACxB,EAAQ,GAEZ,CA+BA,SAAS,EAAeY,CAAG,CAAE,CAAO,CAAE,CAAI,CAAEK,CAAK,EAC/C,IAAI,EAAQ,CAAC,EACT,EAAM,EAAU,GAChB,EAAI,EAAS,KAAK,CAAC,EAAI,EAAI,CAAC,CAACA,EAEjC,EAAK,OAAO,CAAC,EASb,SAAuB,CAAK,CAAE,CAAI,CAAE,CAAiB,CAAE,CAAiB,CAAE,CAAa,EACjF,AAAsB,KAAK,IAA3B,GAAgC,AAAsB,KAAK,IAA3B,GAAgC,AAAkB,KAAK,IAAvB,EAClE,CAAK,CAAC,EAAK,CAAG,KAAK,EAEnB,CAAK,CAAC,EAAK,CAAG,EAAG,MAAM,CAAC,GAAqB,GAAqB,GAAiB,GAEvF,GAbI,AAAC,GACH,EAAM,IAAI,CAAC,GAET,EAAQ,KAAK,EACf,EAAQ,KAAK,CAAC,EAAK,EAAO,EAU9B,CAEA,SAAS,EAAaL,CAAG,CAAE,CAAO,EAEhC,IADI,EACA,EAAM,EACNM,EAAM,EAAU,GACpB,GAAIA,EACF,IAAK,EAAM,EAAM,MAAM,CAAG,EAAG,GAAO,GAC9B,CAAK,CAAC,EAAI,GAAKA,EADkB,KAMzC,GAAI,GAAO,EAAG,CACZ,IAAK,EAAI,EAAM,MAAM,CAAG,EAAG,GAAK,EAAK,IAC/B,EAAQ,GAAG,EACb,EAAQ,GAAG,CAAC,CAAK,CAAC,EAAE,CAGxB,GAAM,MAAM,CAAG,CACjB,CACF,CAzGA,GA0GF,wBCpIA,IAAI,EAAK,EAAQ,OACb,EAAY,EAAQ,OACpBC,EAAa,EAAQ,OACrB,EAAW,EAAQ,MAsIvB,GAAO,OAAO,CApId,SAAoB,CAAM,CAAE,CAAO,EAGjC,IADI,EACA,EAAI,GAAW,CAAC,EAIpB,OAFA,IAEO,CACL,MASF,SAAgBP,CAAG,CAAE,CAAK,CAAE,CAAK,EAC/B,IAAI,EAAM,EAAUA,GAEpB,GAAI,EAAQ,QAAQ,EAGhB,AAAuC,KAAvC,AAAC,GAAE,WAAW,EAAI,EAAE,AAAD,EAAG,OAAO,CAAC,IAG9B,EAAE,MAAM,EAAI,CAAC,EAAE,MAAM,CAAC,CAAE,IAAK,EAAK,MAAO,CAAM,GAN7B,YACpB,AAuFJ,SAAiBA,CAAG,GACd,EAAS,KAAK,CAACA,EAAI,GAGnB,AAAqB,KAArB,EAAQ,QAAQ,CAClB,EAAU,CAAE,SAAUA,EAAK,MAAO,CAAE,EAC3B,EAAQ,QAAQ,GAAKA,GAC9B,EAAQ,KAAK,GAEjB,EAhGW,GAST,EAAI,KACJ,EAAI,GACJT,OAAO,IAAI,CAAC,GAAO,OAAO,CAG1B,SAAgB,CAAG,EACjB,IAAI,EAAQ,CAAK,CAAC,EAAI,CAClB,EAAY,AAAC,GAAE,cAAc,EAAI,CAAC,EAAE,CAAC,EAAI,EAAI,EAAE,CAC/C,EAAU,AAAC,GAAE,iBAAiB,EAAI,CAAC,EAAE,CAAC,EAAI,EAAI,EAAE,CAEhD,EAAO,EAAU,IACjB,AAAS,UAAT,GAAoB,AAA0B,KAA1B,EAAQ,OAAO,CAAC,GAE9B,AADR,GAAQ,EAAM,KAAK,CAAC,KAAK,MAAM,CAcjC,SAAuB,CAAS,EAC9B,OAAO,GAAa,AAAiC,KAAjC,EAAU,OAAO,CAAC,EACxC,GAhBgD,IAAI,CAAC,KAAK,IAAI,EAAC,EAC/C,MAAM,CAEZ,AAA0B,KAA1B,EAAQ,OAAO,CAAC,IAAiBgB,CAAAA,AAA0B,KAA1BA,EAAW,IAAI,CAAC,EAAK,EAAa,AAiCjF,SAAkBP,CAAI,EACpB,IAAI,EAAQA,CAAI,CAAC,EAAE,CACnB,GAAI,AAAU,MAAV,GAAiB,AAAU,MAAV,EACnB,MAAO,GAET,IAAI,EAAQA,EAAK,OAAO,CAAC,KACzB,GAAI,AAAU,KAAV,EACF,MAAO,GAET,IAAI,EAAeA,EAAK,OAAO,CAAC,KAChC,GAAI,AAAiB,KAAjB,GAAuB,EAAQ,EACjC,MAAO,GAET,IAAI,EAAOA,EAAK,OAAO,CAAC,YACxB,AAAa,KAAT,GAAe,EAAQ,GAGpB,EAAE,cAAc,CAAC,IAAI,CAE5B,SAAkB,CAAM,EACtB,OAAOA,AAA+B,IAA/BA,EAAK,OAAO,CAAC,EAAS,IAC/B,EACF,EAvDyF,EAAK,KAGxF,EAAI,KACJ,EAAI,GACiB,UAAjB,OAAO,IACT,EAAI,MACJ,EAAI,EAAG,MAAM,CAAC,IACd,EAAI,MAMV,GA1BA,EAAI,EAAQ,KAAO,IA2BrB,EAnDE,IAqDF,SAAcA,CAAG,EACf,IAAI,EAAM,EAAUA,EACiC,MAAvC,AAAC,GAAE,WAAW,EAAI,EAAE,AAAD,EAAG,OAAO,CAAC,IAEtC,AAAqB,KAArB,EAAQ,QAAQ,EAClB,EAAI,MACJ,EAAI,GACJ,EAAI,MAEJ,AAgDN,SAAmBA,CAAG,EAChB,EAAQ,QAAQ,GAAKA,GACnB,EAAE,EAAQ,KAAK,EAAI,GACrB,GAGN,EAtDe,EAKf,EAlEE,MA4FF,SAAgBA,CAAI,EACd,AAAqB,KAArB,EAAQ,QAAQ,EAClB,EAAI,EAAE,aAAa,CAAG,EAAE,aAAa,CAACA,GAAQA,EAElD,CA/FA,EAEA,SAAS,EAAK,CAAK,EACjB,EAAO,IAAI,CAAC,EACd,CAgHA,SAAS,IACP,EAAU,CAAE,SAAU,GAAO,MAAO,CAAE,CACxC,CACF,qBCvIA,IAAI,EAAU,CACZ,IAAK,QACL,IAAK,OACL,IAAK,OACL,IAAK,SACL,IAAK,OACP,EACI,EAAY,CACd,QAAS,IACT,OAAQ,IACR,OAAQ,IACR,SAAU,IACV,QAAS,GACX,EACI,EAAW,kCACX,EAAa,WAEjB,SAAS,EAAgB,CAAK,EAC5B,OAAO,CAAO,CAAC,EAAM,AACvB,CACA,SAAS,EAAkB,CAAK,EAC9B,OAAO,CAAS,CAAC,EAAM,AACzB,CAEA,SAAS,EAAYA,CAAI,EACvB,OAAOA,AAAQ,MAARA,EAAe,GAAKR,OAAOQ,GAAM,OAAO,CAAC,EAAY,EAC9D,CAEA,SAAS,EAAc,CAAI,EACzB,OAAO,AAAQ,MAAR,EAAe,GAAKR,OAAO,GAAM,OAAO,CAAC,EAAU,EAC5D,CAEA,EAAW,OAAO,CAAG,EAAa,OAAO,CAAG,CAAC,EAE7C,EAAO,OAAO,CAAG,CACf,OAAQ,EACR,OAAQ,EACR,OAAQ,EACR,SAAU,EACV,QAAS,eACX,qBCpCA,SAAS,EAAO,CAAW,CAAE,CAAI,EAE/B,OADA,CAAW,CAAC,EAAK,CAAG,GACb,CACT,CAEA,EAAO,OAAO,CATd,SAAgB,CAAI,EAClB,OAAO,EAAK,MAAM,CAAC,EAAO,CAAC,EAC7B,4ECGO,IAAMgB,WAAN,MAAMA,WAMT,YAAY,CAAK,CAAE,CACf,IAAI,CAAC,KAAK,CAAG,CACjB,CAIA,SAAU,CACN,OAAO,IAAI,CAAC,KAAK,AACrB,CACJ,EAIO,IAAMC,WAAN,MAAMA,mBAAmBD,WAK5B,YAAY,EAAQ,KAAK,CAAE,CACvB,KAAK,CAAC,EACV,CAIA,SAAS,CAAK,CAAE,CACZ,MAAO,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,AAC5B,CACJ,EAQO,IAAME,aAAN,MAAMA,qBAAqBF,WAQ9B,YAAY,CAAK,CAAE,EAAO,CAAC,CAAC,CAAE,CAC1B,KAAK,CAAC,GACN,IAAI,CAAC,IAAI,CAAG,CAChB,CAIA,SAAS,CAAK,CAAE,CACZ,GAAI,EACA,GAAI,CAEA,OAAO,AADI,EAAM,iBAAiB,CAACG,KAAK,YAAY,CAAE,IAAI,CAAC,IAAI,EACrD,MAAM,CAAC,IAAI,CAAC,KAAK,CAC/B,CACA,MAAO,EAAK,CACR,EAAM,WAAW,CAAC,EACtB,CAEJ,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,GAC/B,CACJ,EASO,IAAMC,eAAN,MAAMA,uBAAuBJ,WAChC,OAAO,cAAc,CAAK,CAAE,CACxB,GAAqB,UAAjB,OAAO,GAEP,aAAiBP,KADjB,MAAO,GAGX,GAAI,aAAiBO,WACjB,OAAOI,eAAe,aAAa,CAAC,EAAM,OAAO,IAErD,GAAI,aAAcC,WAAY,CAE1B,IAAM,EAAYA,WAAW,QAAQ,CACrC,GAAI,aAAiB,EAAU,OAAO,EAClC,aAAiB,EAAU,aAAa,EACxC,aAAiB,EAAU,SAAS,EACpC,aAAiB,EAAU,aAAa,EACxC,aAAiB,EAAU,SAAS,EACpC,aAAiB,EAAU,cAAc,CACzC,MAAO,EAEf,CACA,MAAO,EACX,CAQA,YAAY,CAAK,CAAE,EAAO,CAAC,CAAC,CAAE,CAEtB,aAAiBD,gBACjB,EAAO,CAAE,GAAG,EAAM,IAAI,CAAE,GAAG,CAAI,AAAC,EAChC,EAAQ,EAAM,KAAK,EAEd,aAAiBJ,YACtB,GAAQ,EAAM,OAAO,EAAC,EAGtB,AAAiB,UAAjB,OAAO,GACP,eAAgB,GAChB,AAAkB,SAAlB,EAAK,QAAQ,EACb,GAAO,CAAE,GAAG,CAAI,CAAE,SAAU,EAAM,UAAU,AAAC,GAEjD,KAAK,CAAC,GACN,IAAI,CAAC,IAAI,CAAG,CAChB,CACA,CAACM,OAAO,WAAW,CAAC,CAAC,CAAI,CAAE,CACvB,MAAO,AAAS,WAAT,EAAoB,IAAI,CAAC,QAAQ,GAAK,IAAI,CAAC,QAAQ,EAC9D,CAMA,UAAW,CACP,IAAM,EAAQ,IAAI,CAAC,KAAK,CACxB,GAAI,AAAiB,UAAjB,OAAO,EACP,OAAO,EACX,GAAI,aAAiBb,KACjB,OAAO,EAAM,OAAO,GACxB,GAAI,sBAAuB,EACvB,OAAO,EAAM,iBAAiB,CAElC,GAAI,oBAAqB,EACrB,OAAO,EAAM,eAAe,CAAC,OAAO,iBAAiB,AAEzD,OAAM,AAAIc,UAAU,4CACxB,CAIA,SAAS,CAAK,CAAE,CACZ,GAAI,EACA,GAAI,CAEA,OAAO,AADK,EAAM,iBAAiB,CAACJ,KAAK,cAAc,CAAE,IAAI,CAAC,IAAI,EACvD,MAAM,CAAC,IAAI,CAAC,KAAK,CAChC,CACA,MAAO,EAAK,CACR,EAAM,WAAW,CAAC,EACtB,OAEJ,AAAI,AAAsB,UAAtB,OAAO,IAAI,CAAC,KAAK,EAAiB,IAAI,CAAC,KAAK,YAAYV,KACjD,IAAIA,KAAK,IAAI,CAAC,KAAK,EAAE,WAAW,GAEpC,IAAI,CAAC,KAAK,CAAC,QAAQ,EAC9B,CACJ,ECtHA,SAAS,EAAW,CAAK,CAAE,CAAQ,CAAE,CAAI,SACrC,AAAI,CAAQ,CAAC,EAAK,CACP,EAAe,EAAO,CAAQ,CAAC,EAAK,CAAC,KAAK,GAErD,EAAM,WAAW,CAAC,AAAIe,WAAW,eAC1B,IAAIP,WACf,CAEA,SAAS,EAAa,CAAK,CAAE,CAAI,EAC7B,IAAM,EAAa,EAAE,CACf,EAAQlB,OAAO,MAAM,CAAC,MAC5B,IAAK,IAAM,KAAO,EACV,AAAa,SAAb,EAAI,IAAI,CACR,CAAK,CAAC,EAAI,IAAI,CAAC,CAAG,EAAkB,EAAO,EAAI,KAAK,EAGpD,EAAW,IAAI,CAAC,EAAkB,EAAO,IAGjD,MAAO,CAAE,aAAY,OAAM,CAC/B,CAEA,SAAS,EAAkB,CAAK,CAAE,CAAI,EAClC,OAAQ,EAAK,IAAI,EACb,IAAK,MACD,OAAO,EAAK,KAAK,AACrB,KAAK,MACD,OAAO,IAAImB,aAAa,EAAK,KAAK,CAAE,CAChC,sBAAuB,EAAK,SAAS,AACzC,EACJ,KAAK,MACD,OAAO,AAcnB,SAAkC,CAAK,CAAE,CAAE,MAAI,CAAE,EAC7C,IAAI,EACJ,GAAI,EAAM,MAAM,CAEZ,IAAInB,OAAO,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,EAAM,MAAM,CAAE,GAInD,OAAO,IAAIkB,WAAW,CAAC,CAAC,EAAE,EAAK,CAAC,OAHhC,EAAM,EAAM,MAAM,CAAC,EAAK,MAM3B,IAAI,GAAM,IAAI,EACflB,OAAO,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,EAAM,IAAI,CAAE,EAAI,EAOrD,OADA,EAAM,WAAW,CAAC,AAAI0B,eAAe,CAAC,mBAAmB,EAAE,EAAK,CAAC,GAC1D,IAAIR,WAAW,CAAC,CAAC,EAAE,EAAK,CAAC,EAJhC,EAAM,EAAM,IAAI,CAAC,EAAK,CAO1B,GAAI,aAAeD,WACf,OAAO,EAGX,OAAQ,OAAO,GACX,IAAK,SACD,OAAO,CACX,KAAK,SACD,OAAO,IAAIE,aAAa,EAC5B,KAAK,SACD,GAAIE,eAAe,aAAa,CAAC,GAC7B,OAAO,IAAIA,eAAe,EAGlC,SAEI,OADA,EAAM,WAAW,CAAC,AAAIG,UAAU,CAAC,8BAA8B,EAAE,EAAK,EAAE,EAAE,OAAO,EAAI,CAAC,GAC/E,IAAIN,WAAW,CAAC,CAAC,EAAE,EAAK,CAAC,CACxC,CACJ,EAtD4C,EAAO,EAC3C,KAAK,OACD,OAAO,AAsDnB,SAAiC,CAAK,CAAE,CAAE,MAAI,CAAE,MAAI,CAAE,EAClD,IAAM,EAAU,EAAM,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,GAC3C,GAAI,CAAC,EAED,OADA,EAAM,WAAW,CAAC,AAAIQ,eAAe,CAAC,iBAAiB,EAAE,EAAK,CAAC,GACxD,IAAIR,WAAW,GAE1B,GAAI,EAAM,CACN,IAAM,EAAY,EAAQ,UAAU,CAAC,EAAK,QAC1C,AAAI,EACO,EAAe,EAAO,IAEjC,EAAM,WAAW,CAAC,AAAIQ,eAAe,CAAC,mBAAmB,EAAE,EAAK,CAAC,GAC1D,IAAIR,WAAW,CAAC,EAAE,EAAK,CAAC,EAAE,EAAK,CAAC,EAC3C,QACA,AAAI,EAAQ,KAAK,CACN,EAAe,EAAO,EAAQ,KAAK,GAE9C,EAAM,WAAW,CAAC,AAAIQ,eAAe,CAAC,UAAU,EAAE,EAAK,CAAC,GACjD,IAAIR,WAAW,GAC1B,EAzE2C,EAAO,EAC1C,KAAK,OACD,OAAO,AAyEnB,SAA8B,CAAK,CAAE,CAAE,MAAI,CAAE,MAAI,CAAE,MAAI,CAAE,EACrD,IAAM,EAAK,CAAC,CAAC,EAAE,EAAK,CAAC,CACf,EAAO,EAAM,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,GACrC,GAAI,CAAC,EAED,OADA,EAAM,WAAW,CAAC,AAAIQ,eAAe,CAAC,cAAc,EAAE,EAAG,CAAC,GACnD,IAAIR,WAAW,GAE1B,GAAI,EAAM,CACN,IAAM,EAAY,EAAK,UAAU,CAAC,EAAK,CACvC,GAAI,EAAW,CAEX,EAAM,MAAM,CAAG,EAAa,EAAO,GAAM,KAAK,CAC9C,IAAM,EAAW,EAAe,EAAO,GAEvC,OADA,EAAM,MAAM,CAAG,KACR,CACX,CAEA,OADA,EAAM,WAAW,CAAC,AAAIQ,eAAe,CAAC,mBAAmB,EAAE,EAAK,CAAC,GAC1D,IAAIR,WAAW,CAAC,EAAE,EAAG,CAAC,EAAE,EAAK,CAAC,CACzC,CACA,EAAM,MAAM,CAAG,EAAa,EAAO,GAAM,KAAK,CAC9C,IAAM,EAAW,EAAe,EAAO,EAAK,KAAK,EAEjD,OADA,EAAM,MAAM,CAAG,KACR,CACX,EAhGwC,EAAO,EACvC,KAAK,OACD,OAAO,AAgGnB,SAAkC,CAAK,CAAE,CAAE,MAAI,CAAE,MAAI,CAAE,EAGnD,IAAI,EAAO,EAAM,MAAM,CAAC,UAAU,CAAC,EAAK,CACxC,GAAI,CAAC,EAED,OADA,EAAM,WAAW,CAAC,AAAIQ,eAAe,CAAC,kBAAkB,EAAE,EAAK,EAAE,CAAC,GAC3D,IAAIR,WAAW,CAAC,EAAE,EAAK,EAAE,CAAC,EAErC,GAAI,AAAgB,YAAhB,OAAO,EAEP,OADA,EAAM,WAAW,CAAC,AAAIM,UAAU,CAAC,SAAS,EAAE,EAAK,kBAAkB,CAAC,GAC7D,IAAIN,WAAW,CAAC,EAAE,EAAK,EAAE,CAAC,EAErC,GAAI,CACA,IAAIrB,EAAW,EAAa,EAAO,GACnC,OAAO,EAAKA,EAAS,UAAU,CAAEA,EAAS,KAAK,CACnD,CACA,MAAO,EAAK,CAER,OADA,EAAM,WAAW,CAAC,GACX,IAAIqB,WAAW,CAAC,EAAE,EAAK,EAAE,CAAC,CACrC,CACJ,EApH4C,EAAO,EAC3C,KAAK,SACD,OAAO,AAoHnB,SAAiC,CAAK,CAAE,CAAE,UAAQ,CAAE,UAAQ,CAAE,MAAI,CAAE,EAChE,IAAI,EAAM,EAAkB,EAAO,GACnC,GAAI,aAAeA,WACf,OAAO,EAAW,EAAO,EAAU,GAGvC,IAAK,IAAM,KAAW,EAAU,KAvLrB,EAAO,EAAU,EAwLxB,IAAM,EAAM,EAAkB,EAAO,EAAQ,GAAG,EAChD,GAzLO,EAyLG,EAzLI,EAyLG,EAxLrB,CAD4B,EAyLF,KAxLd,GAKR,aAAeC,cACf,aAAoBA,cACpB,EAAI,KAAK,GAAK,EAAS,KAAK,EAG5B,aAAoBA,cAAgB,AAAe,UAAf,OAAO,GAIvC,IAHW,EACV,iBAAiB,CAACC,KAAK,WAAW,CAAE,EAAS,IAAI,EACjD,MAAM,CAAC,EAAS,KAAK,GAKvB,EAuKC,OAAO,EAAe,EAAO,EAAQ,KAAK,CAElD,CACA,OAAO,EAAW,EAAO,EAAU,EACvC,EAjI2C,EAAO,EAC1C,SACI,OAAO,IAAIF,UACnB,CACJ,CA+HO,SAAS,EAAsB,CAAK,CAAE,CAAG,EAC5C,GAAI,EAAM,KAAK,CAAC,GAAG,CAAC,GAEhB,OADA,EAAM,WAAW,CAAC,AAAIO,WAAW,qBAC1B,IAAIP,WAGf,EAAM,KAAK,CAAC,GAAG,CAAC,GAChB,IAAM,EAAS,EAAE,CAGX,EAAe,EAAM,MAAM,CAAC,aAAa,EAAI,EAAI,MAAM,CAAG,EAChE,IAAK,IAAM,KAAQ,EAAK,CACpB,GAAI,AAAgB,UAAhB,OAAO,EAAmB,CAC1B,EAAO,IAAI,CAAC,EAAM,MAAM,CAAC,UAAU,CAAC,IACpC,QACJ,CAEA,GADA,EAAM,UAAU,GACZ,EAAM,UAAU,CAtNL,IA4NX,MALA,EAAM,KAAK,CAAC,MAAM,CAAC,GAKb,AAAIO,WAAW,iCAAiC,EAAM,UAAU,sBAAI,CAG1E,IACA,EAAO,IAAI,CA9NX,KAgOJ,EAAO,IAAI,CAAC,EAAkB,EAAO,GAAM,QAAQ,CAAC,IAChD,GACA,EAAO,IAAI,CAjOX,IAmOR,CAEA,OADA,EAAM,KAAK,CAAC,MAAM,CAAC,GACZ,EAAO,IAAI,CAAC,GACvB,CAKA,SAAS,EAAe,CAAK,CAAE,CAAK,QAEhC,AAAI,AAAiB,UAAjB,OAAO,EACA,EAAM,MAAM,CAAC,UAAU,CAAC,GAE5B,EAAsB,EAAO,EACxC,CC/QO,IAAME,MAAN,MAAMA,MACT,YAAY,CAAM,CAAE,CAAM,CAAE,CAAI,CAAE,CAM9B,IAAI,CAAC,KAAK,CAAG,IAAIC,QAEjB,IAAI,CAAC,MAAM,CAAG,KAMd,IAAI,CAAC,UAAU,CAAG,EAClB,IAAI,CAAC,MAAM,CAAG,EACd,IAAI,CAAC,MAAM,CAAG,EACd,IAAI,CAAC,IAAI,CAAG,CAChB,CACA,YAAY,CAAK,CAAE,CACf,GAAI,CAAC,IAAI,CAAC,MAAM,EAAI,CAAE,cAAiBC,KAAI,EACvC,MAAM,EAEV,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EACrB,CACA,kBAAkB,CAAI,CAAE,CAAI,CAAE,CAC1B,IAAI,EAAQ,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,GAC9B,IACD,EAAQ,CAAC,EACT,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,EAAM,IAEjC,IAAI,EAAKC,KAAK,SAAS,CAAC,GAMxB,OALI,AAAC,CAAK,CAAC,EAAG,EAGV,EAAK,CAAC,EAAG,CAAG,IAAI,EAAK,IAAI,CAAC,MAAM,CAAC,OAAO,CAAE,EAAI,EAE3C,CAAK,CAAC,EAAG,AACpB,CACJ,EC3BA,SAAS,EAAO,CAAI,CAAE,CAAO,EACzB,IAAM,EAAY9B,OAAO,MAAM,CAAC,MAChC,IAAK,GAAM,CAAC,EAAMQ,EAAI,GAAIR,OAAO,OAAO,CAAC,GACjC,EAAQ,QAAQ,CAAC,IACjB,EAAS,CAAC,EAAK,CAAGQ,EAAI,OAAO,EAAC,EAGtC,OAAO,CACX,CACA,IAAM,EAAiB,CACnB,cACA,kBACA,cACA,uBACA,wBACA,wBACA,2BACA,2BACH,CA6BM,SAAS,EAAO,CAAI,CAAE,CAAI,EAC7B,IAAI,EAAM,CAAI,CAAC,EAAE,CACjB,GAAI,aAAeU,WACf,OAAO,IAAIA,WAAW,CAAC,OAAO,EAAE,EAAI,OAAO,GAAG,CAAC,CAAC,EAEpD,GAAI,aAAeC,aACf,OAAO,IAAIA,aAAa,EAAI,OAAO,GAAI,CACnC,GAAG,EAAI,IAAI,CACX,GAAG,EAAO,EAAM,EAAe,AACnC,GAEJ,GAAI,aAAeE,eACf,OAAO,IAAIF,aAAa,EAAI,QAAQ,GAAI,CACpC,GAAG,EAAO,EAAM,EAAe,AACnC,EAEJ,OAAM,AAAIK,UAAU,6BACxB,CACA,IAAM,EAAmB,CACrB,YACA,YACA,yBACA,YACA,SACA,UACA,MACA,OACA,QACA,MACA,OACA,SACA,SACA,eACH,CAmCM,SAAS,EAAS,CAAI,CAAE,CAAI,EAC/B,IAAI,EAAM,CAAI,CAAC,EAAE,CACjB,GAAI,aAAeN,WACf,OAAO,IAAIA,WAAW,CAAC,SAAS,EAAE,EAAI,OAAO,GAAG,CAAC,CAAC,EAEtD,GAAI,aAAeG,gBAAkB,aAAeF,aAChD,OAAO,IAAIE,eAAe,EAAK,EAAO,EAAM,GAEhD,OAAM,AAAIG,UAAU,+BACxB,CCzIA,IAAM,EAAQ,IAAIO,ICSX,IAAMC,aAAN,MAAMA,aAqBT,YAAY,CAAO,CAAE,CAAE,WAAS,CAAE,eAAe,EAAI,CAAE,YAAY,AAAC,GAAM,CAAC,CAAG,CAAG,CAAC,CAAC,CAAE,CAEjF,IAAI,CAAC,MAAM,CAAG,IAAID,IAElB,IAAI,CAAC,SAAS,CAAG,IAAIA,IACrB,IAAI,CAAC,OAAO,CAAGjC,MAAM,OAAO,CAAC,GAAW,EAAU,CAAC,EAAQ,CAC3D,IAAI,CAAC,UAAU,CAAG,CACd,OAAM,EACN,SAAQ,EACR,GAAG,CAAS,AAChB,EACA,IAAI,CAAC,aAAa,CAAG,EACrB,IAAI,CAAC,UAAU,CAAG,EAClB,IAAI,CAAC,MAAM,CAAG,AD1Cf,SAA8B,CAAO,EACxC,IAAM,EAAeA,MAAM,OAAO,CAAC,GAAW,EAAQ,IAAI,CAAC,KAAO,EAC9D,EAAW,EAAM,GAAG,CAAC,GAKzB,OAJiB,SAAb,IACA,EAAW,IAAIiC,IACf,EAAM,GAAG,CAAC,EAAc,IAErB,CACX,ECkC2C,EACvC,CAMA,WAAW,CAAE,CAAE,CACX,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAC9B,CAUA,WAAW,CAAE,CAAE,CACX,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAC9B,CAeA,YAAY,CAAG,CAAE,CAAE,iBAAiB,EAAK,CAAG,CAAG,CAAC,CAAC,CAAE,CAC/C,IAAM,EAAS,EAAE,CACjB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAI,IAAI,CAAC,MAAM,CAAE,IAAK,CACtC,IAAI,EAAQ,EAAI,IAAI,CAAC,EAAE,CACvB,GAAI,EAAM,EAAE,CAAC,UAAU,CAAC,KAAM,CAG1B,GAAI,AAAmB,KAAnB,GAA4B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAM,EAAE,EAAG,CACvD,EAAO,IAAI,CAAC,AAAIF,MAAM,CAAC,uCAAuC,EAAE,EAAM,EAAE,CAAC,CAAC,CAAC,GAC3E,QACJ,CACA,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAM,EAAE,CAAE,EAC9B,KACK,CACD,GAAI,AAAmB,KAAnB,GAA4B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAM,EAAE,EAAG,CAC1D,EAAO,IAAI,CAAC,AAAIA,MAAM,CAAC,0CAA0C,EAAE,EAAM,EAAE,CAAC,CAAC,CAAC,GAC9E,QACJ,CACA,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAM,EAAE,CAAE,EACjC,CACJ,CACA,OAAO,CACX,CA+BA,cAAc,CAAO,CAAE,EAAO,IAAI,CAAE,EAAS,IAAI,CAAE,CAG/C,GAAI,AAAmB,UAAnB,OAAO,EACP,OAAO,IAAI,CAAC,UAAU,CAAC,GAG3B,IAAItB,EAAQ,IAAIoB,MAAM,IAAI,CAAE,EAAQ,GACpC,GAAI,CAEA,OAAO,AADK,EAAsBpB,EAAO,GAC5B,QAAQ,CAACA,EAC1B,CACA,MAAO,EAAK,CACR,GAAIA,EAAM,MAAM,EAAI,aAAesB,MAE/B,OADAtB,EAAM,MAAM,CAAC,IAAI,CAAC,GACX,IAAIW,aAAa,QAAQ,CAACX,EAErC,OAAM,CACV,CACJ,CACJ,ECtJA,IAAM,EAAmB,6BAGnB,EAAqB,2BACrB,EAAmB,SACnB,EAAoB,6BACpB,EAAgB,oBAChB,EAAe,kDACf,EAAmB,qBAOnB,EAAc,gBACd,EAAgB,iBAEhB,EAAmB,aACnB,EAAoB,2CAEpB,EAAsB,OACtB,EAAqB,MAErB,EAAiB,WAEjB,EAAY,QAEZ,EAAmB,QACnB,EAAoB,QACpB,EAAqB,SACrB,EAAsB,UACtB,EAAmB,YACnB,EAAc,YACd,EAAc,WAGd,EAAc,YACd,EAAc,OAIb,IAAM0B,eAAN,MAAMA,eACT,YAAY,CAAM,CAAE,CAChB,IAAI,CAAC,IAAI,CAAG,EAAE,CACd,EAAiB,SAAS,CAAG,EAC7B,IAAI,EAAS,EAGb,OAAa,CACT,IAAI,EAAO,EAAiB,IAAI,CAAC,GACjC,GAAI,AAAS,OAAT,EACA,MAEJ,EAAS,EAAiB,SAAS,CACnC,GAAI,CACA,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,AAkEvB,SAAsB,CAAE,EACpB,IAAI,EAAQ,IACR,EAAa,AAMrB,WACI,IAAI,EAAQjC,OAAO,MAAM,CAAC,MAC1B,KAAO,EAAK,IAAqB,CAC7B,IAAI,EAAO,EAAO,GACd,EAAQ,IACZ,GAAI,AAAU,OAAV,EACA,MAAM,AAAIkC,YAAY,2BAE1B,EAAK,CAAC,EAAK,CAAG,CAClB,CACA,OAAO,CACX,IAhBI,GAAI,AAAU,OAAV,GAAkBlC,AAAmC,IAAnCA,OAAO,IAAI,CAAC,GAAY,MAAM,CAChD,MAAM,AAAIkC,YAAY,wCAE1B,MAAO,CAAE,KAAI,QAAO,YAAW,CACnC,EAzEoC,CAAI,CAAC,EAAE,EACvC,CACA,MAAO,EAAK,CACR,GAAI,aAAeA,YAGf,QAEJ,OAAM,CACV,CACJ,CAcA,SAAS,EAAK,CAAE,EAEZ,OADA,EAAG,SAAS,CAAG,EACR,EAAG,IAAI,CAAC,EACnB,CAGA,SAAS,EAAY,CAAI,CAAE,CAAU,EACjC,GAAI,CAAM,CAAC,EAAO,GAAK,EAEnB,OADA,IACO,GAEX,GAAI,EACA,MAAM,IAAI,EAAW,CAAC,SAAS,EAAE,EAAK,CAAC,EAE3C,MAAO,EACX,CAGA,SAAS,EAAa,CAAE,CAAE,CAAU,EAChC,GAAI,EAAK,GAEL,OADA,EAAS,EAAG,SAAS,CACd,GAEX,GAAI,EACA,MAAM,IAAI,EAAW,CAAC,SAAS,EAAE,EAAG,QAAQ,GAAG,CAAC,EAEpD,MAAO,EACX,CAEA,SAAS,EAAM,CAAE,EACb,EAAG,SAAS,CAAG,EACf,IAAI,EAAS,EAAG,IAAI,CAAC,GACrB,GAAI,AAAW,OAAX,EACA,MAAM,AAAIA,YAAY,CAAC,SAAS,EAAE,EAAG,QAAQ,GAAG,CAAC,EAGrD,OADA,EAAS,EAAG,SAAS,CACd,CACX,CAEA,SAAS,EAAO,CAAE,EACd,OAAO,EAAM,EAAG,CAAC,EAAE,AACvB,CAqBA,SAAS,QACD,EAMJ,GAJI,EAAK,IACL,GAAQ,EAAO,EAAW,EAG1B,AAAmB,MAAnB,CAAM,CAAC,EAAO,EAAY,AAAmB,MAAnB,CAAM,CAAC,EAAO,CAExC,OAAO,EAAqB,EAAQ,CAAC,EAAM,CAAG,EAAE,CAAE,KAItD,IAAI,EAASC,WACb,AAAI,EACA,AAAI,EAGO,EAAqB,CAAC,EAAO,EAAO,CAAE,EAAO,MAAM,GAK9D,EAAO,KAAK,CAAG,EAAK,EAAO,KAAK,CAAE,GAC3B,EAAqB,CAAC,EAAO,CAAE,EAAO,MAAM,GAEvD,AAAI,EAEO,EAAK,EAAO,GAEhB,IACX,CAEA,SAAS,EAAqB,EAAW,EAAE,CAAE,CAAY,EACrD,OAAa,CACT,GAAI,EAAK,GAAc,CACnB,EAAS,IAAI,CAAC,EAAO,IACrB,QACJ,CACA,GAAI,AAAmB,MAAnB,CAAM,CAAC,EAAO,CAAU,CACxB,EAAS,IAAI,CAAC,KACd,QACJ,CACA,GAAI,AAAmB,MAAnB,CAAM,CAAC,EAAO,CACd,MAAM,AAAID,YAAY,4BAE1B,IAAI,EAASC,IACb,GAAI,EAAQ,CACR,EAAS,IAAI,CAAC,GACd,EAAe7B,KAAK,GAAG,CAAC,EAAc,EAAO,MAAM,EACnD,QACJ,CACA,KACJ,CACA,IAAI,EAAY,EAAS,MAAM,CAAG,EAC9B,EAAc,CAAQ,CAAC,EAAU,AAEjC,AAAuB,WAAvB,OAAO,GACP,EAAQ,CAAC,EAAU,CAAG,EAAK,EAAa,EAAkB,EAE9D,IAAI,EAAQ,EAAE,CACd,IAAK,IAAI,KAAW,EACZ,aAAmB8B,QAEnB,GAAU,EAAQ,KAAK,CAAC,KAAK,CAAC,EAAG,EAAQ,KAAK,CAAC,MAAM,CAAG,EAAY,EAEpE,GACA,EAAM,IAAI,CAAC,GAGnB,OAAO,CACX,CACA,SAAS,IACL,EAAa,EAAkBF,aAC/B,IAAI,EAAW,AAenB,SAAS,IACL,GAAI,AAAmB,MAAnB,CAAM,CAAC,EAAO,CAEd,OAAO,IAEX,GAAI,EAAK,GAAe,CACpB,GAAI,EAAG,EAAO,EAAM,EAAO,IAAI,CAAC,CAAG,EAAM,GACzC,GAAI,AAAU,MAAV,EACA,MAAO,CAAE,KAAM,MAAO,MAAK,EAE/B,GAAI,EAAa,GAAmB,CAChC,IAAIlB,EAAO,AAuBvB,WACI,IAAI,EAAO,EAAE,CACb,OAAa,CACT,OAAQ,CAAM,CAAC,EAAO,EAClB,IAAK,IAED,OADA,IACO,CACX,MAAK,OACD,MAAM,AAAIkB,YAAY,yBAC9B,CACA,EAAK,IAAI,CAAC,AAKlB,WACI,IAAI,EAAO,UACX,AAAI,AAAc,SAAd,EAAK,IAAI,CACF,EAEP,EAAa,GAEN,CACH,KAAM,OACN,KAAM,EAAK,IAAI,CACf,MAAO,GACX,EAGG,CACX,KAlBQ,EAAa,EACjB,CACJ,IApCY,GAAI,AAAU,MAAV,EAEA,MAAO,CAAE,KAAM,OAAQ,OAAM,OAAMlB,KAAAA,CAAK,EAE5C,GAAI,EAAiB,IAAI,CAAC,GACtB,MAAO,CAAE,KAAM,OAAQ,OAAMA,KAAAA,CAAK,CAEtC,OAAM,AAAIkB,YAAY,wCAC1B,OACA,AAAI,AAAU,MAAV,EAEO,CACH,KAAM,OACN,OACA,OACA,KAAM,EAAE,AACZ,EAEG,CAAE,KAAM,OAAQ,OAAM,MAAK,CACtC,CACA,OAAO,GACX,IA/CI,GAAI,EAAa,GACb,OAAO,EAEX,GAAI,EAAa,GAAc,CAC3B,IAAI,EAAW,AA2EvB,WACI,IAEI,EAFA,EAAW,EAAE,CACb,EAAQ,EAEZ,KAAO,EAAK,IAAmB,CACvB,EAAY,MACZ,GAAO,CAAI,EAEf,IAAI,EAAM,AAelB,eAEQ,EAWJ,OAZA,EAAa,EAAoBA,aAG7B,EADA,EAAK,GACC,IAGA,CACF,KAAM,MACN,MAAO,EAAO,EAClB,EAEJ,EAAa,EAAqBA,aAC3B,CACX,IA5BY,EAAQ,IACZ,GAAI,AAAU,OAAV,EACA,MAAM,AAAIA,YAAY,yBAE1B,EAAQ,CAAC,IAAQ,CAAG,CAAE,MAAK,OAAM,CACrC,CACA,GAAI,AAAU,IAAV,EACA,OAAO,KAEX,GAAI,AAAS,SAAT,EACA,MAAM,AAAIA,YAAY,4BAE1B,MAAO,CAAE,WAAU,MAAK,CAC5B,IA/FQ,OADA,EAAa,EAAmBA,aACzB,CACH,KAAM,SACN,WACA,GAAG,CAAQ,AACf,CACJ,CACA,MAAM,AAAIA,YAAY,qBAC1B,CAwGA,SAAS,IACL,GAAI,EAAK,GACL,OAAO,IAEX,GAAI,AAAmB,MAAnB,CAAM,CAAC,EAAO,CACP,CAcX,EAAY,IAAKA,aACjB,IAAI,EAAQ,GACZ,OAAa,CAET,GADA,GAAS,EAAO,GACZ,AAAmB,OAAnB,CAAM,CAAC,EAAO,CAAW,CACzB,GAAS,AAWrB,WACI,GAAI,EAAK,GACL,OAAO,EAAO,GAElB,GAAI,EAAK,GAAoB,CACzB,GAAI,EAAG,EAAY,EAAW,CAAG,EAAM,GACnC,EAAYG,SAAS,GAAc,EAAY,IACnD,OAAO,GAAa,OAAU,OAAU,EAEhCpC,OAAO,aAAa,CAAC,GAGrB,GACZ,CACA,MAAM,AAAIiC,YAAY,0BAC1B,IAzBY,QACJ,CACA,GAAI,EAAY,KACZ,MAAO,CAAE,KAAM,MAAO,OAAM,CAGhC,OAAM,AAAIA,YAAY,0BAC1B,OA3B8B,CAE9B,MAAM,AAAIA,YAAY,qBAC1B,CACA,SAAS,IACL,GAAI,EAAG,EAAO,EAAW,EAAE,CAAC,CAAG,EAAM,GACjC,EAAY,EAAS,MAAM,CAC/B,MAAO,CACH,KAAM,MACN,MAAOI,WAAW,GAClB,WACJ,CACJ,CAoCA,SAASH,IACL,IAAI,EAAQ,EAGZ,OAFA,EAAa,GAEL,CAAM,CAAC,EAAO,EAClB,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,KAAK,OAED,MAAO,EACX,KAAK,IAGD,OAAO,EAAW,EAAO,KAAK,CAAC,EAAO,GAC9C,OAIA,AAA2B,MAAvB,CAAM,CAAC,EAAS,EAAE,EAGX,EAAW,EAAO,KAAK,CAAC,EAAO,GAK9C,CAEA,SAAS,EAAK1B,CAAI,CAAEZ,CAAE,EAClB,OAAOY,EAAK,OAAO,CAACZ,EAAI,GAC5B,CAEA,SAAS,EAAW,CAAK,EAGrB,OAAO,IAAIuC,OAFC,EAAM,OAAO,CAAC,EAAgB,MAC7B,EAAU,IAAI,CAAC,EAAM,CAAC,EAAE,CAAC,MAAM,CAEhD,CACJ,CACJ,EACA,IAAMA,OAAN,MAAMA,OACF,YAAY,CAAK,CAAE,CAAM,CAAE,CACvB,IAAI,CAAC,KAAK,CAAG,EACb,IAAI,CAAC,MAAM,CAAG,CAClB,CACJ,wCC7aA,IAAI,EAAE,KAAW,EAAE,CAAC,qBAAqB,MAAG,CAAC,OAAO,MAAG,CAAC,YAAY,MAAG,CAAC,YAAY,MAAG,CAAC,gBAAgB,MAAG,CAAC,yBAAyB,CAAC,EAAE,IAAI,cAAc,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,CAAC,EAAE,sBAAsB,CAAC,EAAE,KAAK,GAAG,EAAE,SAAS,CAAC,IAAI,CAAC,IAAI,GAAG,EAAE,IAAI,CAAC,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,EAAE,EAAE,SAAS,CAAC,IAAIpC,OAAO,SAAS,CAAC,EAAEA,OAAO,cAAc,CAAC,GAAG,GAAG,EAAE,cAAc,CAAC,GAAG,OAAO,IAAK,EAAC,CAAC,EAAE,CAAC,EAAG,OAAM6B,MAAM,+KAA+K,CAAC,EAAE,kBAAkB,CAAC,CAAC,CAAC,EAAE,EAAE,eAAe,CAAC,CAAC,EAAE,+BAA+B,CAAC,EAAEhC,EAAE,KAAK,IAAIW,EAAE,IAAC,CAAC,OAAO,EAAE,CAAC,CAAC,GAAGA,EAAE,EAAE,EAAE,IAAI,CAACX,EAAE,EAAE,GAAGW,CAAC,EAAE,wBAAwB,GAAI,EAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,iBAAiB,MAAG,CAAC,cAAc,MAAG,CAAC,aAAa,MAAG,CAAC,qBAAqB,MAAG,CAAC,UAAU,MAAG,CAAC,YAAY,MAAG,CAAC,iBAAiB,MAAG,CAAC,WAAW,MAAG,CAAC,UAAU,MAAG,4BCD54B,GAAK,CAAC,iBAAiB,CAAC,CAAC,WAAW,CAAC,CAAC,iBAAiB,CAAC,CAAC,UAAU,CAAC,CAAC,YAAY2B,CAAC,CAAC,CAAC,EAA42B9B,EAAE,CAACI,EAAEZ,EAAE,EAAE,KAAK,IAAI,EAAE,EAAE,GAAG,IAAI,EAAE,MAAM,CAAC,EAAE,IAAI,EAAEA,EAAE,KAAK,KAAK,EAAE,GAAG,EAAEY,MAAM,CAAC,IAAM,EAAE,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,GAAG,sBAAsB,EAAE,IAAI,CAAC,EAAE,IAAI,EAAEZ,EAAE,KAAK,EAAE,QAAQ,CAAC,GAAG,EAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,iBAAiB,GAAG,CAAC,EAAE,iBAAiB,QAAQ,GAAG,aAAa,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,EAAEA,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,IAAM,EAAE,EAAE,QAAQ,CAAC,IAAI,GAAG,GAAG,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC,CAAC,EAAEgC,MAAM,2CAA4C,GAAE,EAAE,KAAK,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,EAAEhC,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC,GAAG,GAAE,EAAE,EAAE,EAAC,IAAM,IAAC,CAAC,EAAE,IAAI,CAAC,CAAC,KAAK,EAAE,KAAK,MAAM,QAAQ,GAAG,SAAE,GAAG,EAAE,IAAI,CAAC,CAAC,KAAK,EAAE,KAAK,MAAM,GAAG,EAAE,IAAI,CAAC,OAAO,GAAG,SAAE,GAAG,CAAC,GAAG,SAAE,GAAG,MAAMgC,MAAM,wCAAwC,IAAM,EAAE,YAAY,EAAE,GAAG,GAAGhC,EAAE,IAAI,GAAG,EAAE,MAAMgC,MAAM,uEAAwE,EAAC,IAA4BpB,EAAE,IAAI,EAA1B,EAAE,SAAS,CAAC,IAAI,CAAC,GAAa,EAAG,GAAE,IAAI,CAAC,CAAC,KAAK,oBAAoB,SAASA,EAAE,KAAK,EAAE,kBAAkB,EAAE,kBAAkB,EAAE,OAAO,CAAC,GAAG,EAAE,IAAI,CAACA,CAAC,CAAC,MAAM,EAAE,GAAI,GAAE,IAAI,CAAC,CAAC,KAAK,EAAE,KAAK,WAAW,MAAM,EAAE,SAAS,CAAC,CAACc,OAAO,QAAQ,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,AAAD,EAAI,GAAE,IAAI,CAAC,CAAC,KAAK,EAAE,KAAK,MAAM,GAAG,EAAE,IAAI,CAAC,GAAG,EAAC,EAAG,OAAO,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,KAAK,GAAG,KAAK,IAAI,EAAE,MAAMM,MAAM,yBAA0B,GAAE,IAAI,CAAC,EAAE,IAAM,EAAE,EAAE,GAAG,GAAG,GAAG,aAAa,EAAE,IAAI,EAAE,CAAC,EAAE,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC,MAAMA,MAAM,4CAA4C,GAAG,EAAE,MAAM,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAEU,KAAK,IAAsC,EAAEF,SAAS,AAAzC,iBAAiB,IAAI,CAAC,EAAE,IAAI,CAAc,CAAC,EAAE,EAAE,EAAE,EAAE,kBAAkB,CAAC,GAAG,OAAO,EAAE,MAAMR,MAAM,2CAA2C,EAAE,eAAe,CAAC,mBAAmB,IAAM,EAAE,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,GAAG,sBAAsB,EAAE,IAAI,CAAC,MAAMA,MAAM,yNAA0N,EAAC,IAAM,EAAE,EAAE,QAAQ,CAAC,OAAO,CAAC,IAAM,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,iBAAiB,CAAC,CAAC,GAAG,KAAK,IAAI,GAAG,EAAE,IAAI,GAAG,cAAW,EAAE,EAAE,IAAI,GAAG,YAAS,EAAE,EAAE,KAAK,GAAG,EAAE,MAAM,GAAG,EAAE,IAAI,GAAG,cAAW,CAAC,CAAC,IAAM,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,OAAO,CAAC,EAAE,QAAQ,CAACU,GAAG,EAAE,SAAE,GAAG,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,iBAAiB,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,EAAI,EAAE,IAAI,GAAG,UAAO,EAAE,EAAE,IAAI,GAAG,aAAU,AAAE,GAAE,IAAI,CAAC,EAAE,EAAE,EAAE,iBAAiB,CAAC,GAAG,EAAE,iBAAiB,EAAE,EAAE,OAAO,CAAC,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,IAAM,EAAE,IAAIJ,EAAE,EAAE,EAAE,QAAQ,CAACI,EAAG,GAAE,EAAE,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,iBAAiB,GAAG,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,iBAAiB,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,IAAM,EAAE,IAAIC,YAAY,GAAG,IAAI,CAAC,MAAM,IAAI,IAAM,KAAK,EAAE,OAAO,CAAC,IAAI,IAAI,EAAE,EAAE,EAAE,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,UAAU,CAAC,GAA4D,OAAOC,KAAxDxC,OAAO,YAAY,IAAI,IAAIC,WAAW,EAAE,MAAM,GAAiB,CCLj0GoB,CAAAA,WAAW,wBAAwB,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,IAAI,IAAM,EAAEtB,OAAO,wBAAwB,CAACA,OAAO,cAAc,CAAC,GAAG,sBAAsB,GAAG,CAACA,OAAO,cAAc,CAAC,EAAE,qBAAqB,CAAC,MAAM,MAAM,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,kBAAkB,CAAC,GAAG,IAAM,EAAE,EAAE,SAAS,CAAC,wBAAwB,AAAC,GAAE,SAAS,CAAC,wBAAwB,CAAC,SAASS,CAAC,CAAC,CAAC,CAACF,CAAC,EAAE,oBAAoBE,GAAG,OAAOF,GAAG,EAAE,IAAI,CAAC,IAAI,EAAE,EAAE,IAAI,CAAC,IAAI,CAACE,EAAE,EAAEF,EAAE,EAAE,IAAM,EAAE,EAAE,SAAS,CAAC,iBAAiB,AAAC,GAAE,SAAS,CAAC,iBAAiB,CAAC,WAAW,IAAI,CAAC,YAAY,CAAC,oBAAoB,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,IAAM,EAAE,EAAE,SAAS,CAAC,gBAAgB,AAAC,GAAE,SAAS,CAAC,gBAAgB,CAAC,WAAW,OAAO,IAAI,CAAC,UAAU,CAAE,KAAI,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,AAAD,EAAG,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,IAAM,EAAEP,OAAO,cAAc,CAAC,EAAE,SAAS,EAAE,MAAM,AAAC,GAAE,SAAS,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,IAAM,EAAE,IAAI,CAAC,MAAM,GAAG,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,IAAIS,EAAE,EAAEA,EAAE,IAAI,CAAC,UAAU,CAAC,MAAM,CAACA,IAAI,CAAC,IAAM,EAAE,IAAI,CAAC,UAAU,CAACA,EAAE,CAAC,GAAG,EAAE,IAAI,CAAC,UAAU,CAAC,sBAAsB,CAAC,IAAMA,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,GAAI,KAAI,CAAC,eAAe,CAACA,GAAG,IAAI,CAAC,eAAe,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,ADKv/B,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC,QAAyF,EAAED,EAAE,EAAwE,EAAjK,GAAG,KAAK,IAAI,EAAE,UAAU,CAAC,MAAMqB,MAAM,4CAAsD,IAAM,EAAE,EAAE,CAAC,EAAEa,SAAS,gBAAgB,CAAC,EAAEC,WAAW,YAAY,EAAQ,KAAK,OAAQ,GAAE,EAAE,QAAQ,EAAC,GAAI,CAAC,IAAM,EAAE,EAAE,IAAI,CAAC,GAAG,EAAE,UAAU,CAAC,YAAY,CAAC,GAAG,IAAI,EAAE,MAAM,EAAE,KAAK,IAAI,EAAE,MAAMd,MAAM,CAAC,qEAAqE,EAAE,EAAE,2CAA2C,EAAErB,EAAE,CAAC,CAAC,CAAE,GAAEH,EAAE,EAAE,EAAE,EAAE,GAAG,KAAK,IAAI,GAAI,GAAE,GAAGG,IAAI,CAAC,MAAM,GAAG,EAAE,UAAU,CAAC,YAAY,EAAE,EAAE,EAAE,QAAQ,GAAG,EAAE,UAAU,CAAC,aAAa,CAAC,GAAG,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAMqB,MAAM,kBAAkB,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,GAAG,KAAK,IAAI,EAAE,CAAC,IAAM,EAAE,aAAae,WAAW,2CAA2C,aAAaC,iBAAiB,mBAAmB,EAAE,SAAS,CAACC,QAAQ,KAAK,CAAC,CAAC,uFAAuF,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,GCLmJ,EAAE,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,aAAa,CAAC,KAAM,SAAE,EAAE,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,6DCKvqC,IAAM,EAAExB,WAAW,EAAE,EAAE,UAAU,EAAG,MAAK,IAAI,EAAE,QAAQ,EAAE,EAAE,QAAQ,CAAC,YAAY,AAAD,GAAI,uBAAuByB,SAAS,SAAS,EAAE,YAAYC,cAAc,SAAS,CAAC,EAAEzB,SAAS,EAAE,IAAI0B,QAAQ,IAAM,UAAN,MAAM,UAAE,YAAYxC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,EAAE,IAAI,EAAE,MAAMoB,MAAM,oEAAqE,KAAI,CAAC,OAAO,CAACpB,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,YAAY,CAAC,IAAIA,EAAE,IAAI,CAAC,CAAC,CAAO,EAAE,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,KAAK,IAAIA,EAAE,CAAC,IAAM,EAAE,KAAK,IAAI,GAAG,IAAI,EAAE,MAAM,AAAC,IAAIA,CAAAA,EAAE,EAAE,GAAG,CAAC,EAAC,EAAG,KAAK,IAAIA,GAAI,CAAC,KAAI,CAAC,CAAC,CAACA,EAAE,IAAIuC,aAAY,EAAG,WAAW,CAAC,IAAI,CAAC,OAAO,EAAE,GAAG,EAAE,GAAG,CAAC,EAAEvC,EAAC,CAAE,CAAC,OAAOA,CAAC,CAAC,UAAU,CAAC,OAAO,IAAI,CAAC,OAAO,CAAC,EAAC,IAAqD,EAAE,CAACA,EAAE,GAAG,IAAmU,IAAI,UAA1T,IAAIA,EAAE,MAAM,CAACA,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAE,CAAC,EAAE,EAAE,IAAI,EAAE,AAACA,CAAAA,IAAI,GAAG,CAAC,IAAIA,EAAE,YAAY,CAAC,OAAOA,EAAE,OAAO,CAAC,GAAG,UAAU,OAAOA,EAAE,OAAOA,CAAE,OAAMoB,MAAM,mEAAmEpB,EAAE,uFAAuF,GAAG,GAAGA,CAAC,CAAC,EAAE,EAAE,CAAEA,CAAC,CAAC,EAAE,EAAiBA,EAAE,GAA2P,EAAE,EAAEA,GAAGA,EAAEA,GAAGA,aAAauC,cAAc,AAACvC,CAAAA,IAAI,IAAzqB,EAA6qB,EAAE,GAAG,IAAI,IAAM,KAAKA,EAAE,QAAQ,CAAC,GAAG,EAAE,OAAO,CAAC,OAAttB,IAAI,UAAE,UAAU,OAAnB,EAAkuB,GAAtsB,EAAE,EAAE,GAAG,KAAK,EAAE,EAA0rB,GAAGA,GAAGA,ECAnzC,CAAC,GAAG,CAAC,CAAC,eAAe,CAAC,CAAC,yBAAyB,CAAC,CAAC,oBAAoB,CAAC,CAAC,sBAAsB,CAAC,CAAC,eAAe,CAAC,CAAC,CAACT,OAAO,EAAEsB,WAAW,EAAE,EAAE,YAAY,CAAC,EAAE,EAAE,EAAE,WAAW,CAAC,GAAG,EAAE,EAAE,8BAA8B,CAAY,EAAE,CAAC,YAAYb,CAAC,CAAC,CAAC,EAAE,OAAO,GAAG,KAAKyC,QAAQzC,EAAEA,EAAE,EAAE,KAAK,KAAM,MAAKT,OAAO,KAAKF,MAAMW,EAAE,MAAMA,EAAEA,EAAEqB,KAAK,SAAS,CAACrB,EAAE,CAAC,OAAOA,CAAC,EAAE,cAAcA,CAAC,CAAC,CAAC,EAAE,IAAI,EAAEA,EAAE,OAAO,GAAG,KAAKyC,QAAQ,EAAE,OAAOzC,EAAE,KAAM,MAAK0C,OAAO,EAAE,OAAO1C,EAAE,KAAK0C,OAAO1C,GAAG,KAAM,MAAKT,OAAO,KAAKF,MAAM,GAAG,CAAC,EAAEgC,KAAK,KAAK,CAACrB,EAAE,CAAC,MAAMA,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAACA,EAAE,IAAI,CAAC,EAAEA,EAAE,GAAG,EAAE,CAAC,UAAU,CAAC,EAAE,KAAKR,OAAO,UAAU,EAAE,QAAQ,CAAC,EAAE,WAAW,CAAC,EAAE,WAAW,CAAC,CAAEsB,CAAAA,OAAO,QAAQ,GAAGA,OAAO,YAAY,EAAE,mBAAmB,GAAG,IAAI0B,QAAQ,IAAMG,EAAN,MAAMA,UAAUC,YAAY,OAAO,eAAe5C,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,AAAC,KAAI,CAAC,CAAC,GAAG,EAAE,AAAD,EAAG,IAAI,CAACA,EAAE,CAAC,WAAW,oBAAoB,CAAC,OAAO,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI,EAAE,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,OAAO,eAAeA,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,EAAG,GAAE,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,cAAc,CAACA,IAAK,CAAC,GAAET,OAAO,MAAM,CAAC,EAAC,EAAG,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAACS,EAAE,GAAG,CAAC,EAAE,UAAU,CAAC,CAAC,IAAM,EAAEc,SAAS,EAAE,IAAI,CAAC,qBAAqB,CAACd,EAAE,EAAE,EAAG,MAAK,IAAI,GAAG,EAAE,IAAI,CAAC,SAAS,CAACA,EAAE,EAAE,CAAC,CAAC,OAAO,sBAAsBA,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,CAACA,IAAI,CAAC,MAAM,OAAO,IAAI,CAAC,EAAE,EAAE,IAAIA,CAAC,EAAE,IAAI,CAAC,EAAE,CAACA,CAAC,CAAC,EAAE,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,IAAM,EAAE,GAAG,KAAK,IAAI,CAAE,IAAG,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,aAAa,CAACA,EAAE,EAAE,EAAE,EAAE,aAAa,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,OAAO,mBAAmBA,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAACA,IAAI,CAAC,CAAC,OAAO,MAAM,CAAC,GAAG,IAAI,CAAC,cAAc,CAAG,qBAAsB,OAAO,IAAMA,EAAE,EAAE,IAAI,CAAEA,CAAAA,EAAE,QAAQ,GAAG,KAAK,IAAIA,EAAE,CAAC,EAAG,KAAI,CAAC,CAAC,CAAC,IAAIA,EAAE,CAAC,CAAC,AAAD,EAAG,IAAI,CAAC,iBAAiB,CAAC,IAAIsB,IAAItB,EAAE,iBAAiB,CAAC,CAAC,OAAO,UAAU,CAAC,GAAG,IAAI,CAAC,cAAc,CAAG,aAAc,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,cAAc,CAAG,cAAe,CAAC,IAAMA,EAAE,IAAI,CAAC,UAAU,CAAqB,IAAI,IAAM,IAA5B,IAAI,EAAEA,MAAM,EAAEA,GAAG,CAAkB,IAAI,CAAC,cAAc,CAAC,EAAEA,CAAC,CAAC,EAAE,CAAC,CAAC,IAAMA,EAAE,IAAI,CAACc,OAAO,QAAQ,CAAC,CAAC,GAAG,OAAOd,EAAE,CAAC,IAAM,EAAE6C,oBAAoB,GAAG,CAAC7C,GAAG,GAAG,KAAK,IAAI,EAAE,IAAI,GAAK,CAACA,EAAE,EAAE,GAAG,EAAE,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAACA,EAAE,EAAE,CAAmB,IAAI,GAAK,CAACA,EAAE,EAAE,GAAhC,IAAI,CAAC,IAAI,CAAC,IAAIsB,IAAqB,IAAI,CAAC,iBAAiB,EAAC,CAAC,IAAM,EAAE,IAAI,CAAC,IAAI,CAACtB,EAAE,EAAG,MAAK,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAEA,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,OAAO,eAAe,CAAC,CAAC,CAAC,IAAM,EAAE,EAAE,CAAC,GAAGX,MAAM,OAAO,CAAC,GAA2C,IAAI,IAAM,KAAzC,IAAIyD,IAAI,EAAE,IAAI,CAAC,EAAE,GAAG,OAAO,IAAqB,EAAE,OAAO,CAAC,EAAE,SAAS,KAAK,IAAI,GAAG,EAAE,IAAI,CAAC,EAAE,IAAI,OAAO,CAAC,CAAC,OAAO,KAAK9C,CAAC,CAAC,CAAC,CAAC,CAAC,IAAM,EAAE,EAAE,SAAS,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,UAAU,OAAO,EAAE,EAAE,UAAU,OAAOA,EAAEA,EAAE,WAAW,GAAG,KAAK,CAAC,CAAC,aAAa,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,eAAe,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI+C,QAAS/C,GAAG,IAAI,CAAC,cAAc,CAACA,GAAI,IAAI,CAAC,IAAI,CAAC,IAAIsB,IAAI,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,QAAStB,GAAGA,EAAE,IAAI,EAAG,CAAC,cAAcA,CAAC,CAAC,CAAC,AAAC,KAAI,CAAC,IAAI,GAAG,IAAI8C,GAAE,EAAG,GAAG,CAAC9C,GAAG,KAAK,IAAI,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,WAAW,EAAEA,EAAE,aAAa,IAAI,CAAC,iBAAiBA,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,OAAOA,EAAE,CAAC,MAAM,CAAC,IAAMA,EAAE,IAAIsB,IAAyC,IAAI,IAAM,KAAK,AAAlD,IAAI,CAAC,WAAW,CAAC,iBAAiB,CAAkB,IAAI,GAAG,IAAI,CAAC,cAAc,CAAC,IAAKtB,CAAAA,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,OAAO,IAAI,CAAC,EAAE,AAAD,CAAGA,CAAAA,EAAE,IAAI,CAAC,GAAI,KAAI,CAAC,IAAI,CAACA,CAAAA,CAAE,CAAC,kBAAkB,CAAC,IAAMA,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,WAAW,CAAC,iBAAiB,EAAE,MAAO,ADApmE,EAAC,EAAE,KAAK,GAAG,EAAE,EAAE,kBAAkB,CAAC,EAAE,GAAG,CAAEA,GAAGA,aAAauC,cAAcvC,EAAEA,EAAE,UAAU,OAAQ,IAAI,IAAM,KAAK,EAAE,CAAC,IAAM,EAAEiC,SAAS,aAAa,CAAC,SAAS,EAAE,EAAE,QAAQ,AAAC,MAAK,IAAI,GAAG,EAAE,YAAY,CAAC,QAAQ,GAAG,EAAE,WAAW,CAAC,EAAE,OAAO,CAAC,EAAE,WAAW,CAAC,EAAE,CAAC,GCAm3DjC,EAAE,IAAI,CAAC,WAAW,CAAC,aAAa,EAAEA,CAAC,CAAC,mBAAmB,CAAC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,QAASA,GAAGA,EAAE,aAAa,KAAM,CAAC,eAAeA,CAAC,CAAC,CAAC,CAAC,sBAAsB,CAAC,IAAI,CAAC,IAAI,EAAE,QAASA,GAAGA,EAAE,gBAAgB,KAAM,CAAC,yBAAyBA,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAACA,EAAE,EAAE,CAAC,KAAKA,CAAC,CAAC,CAAC,CAAC,CAAC,IAAM,EAAE,IAAI,CAAC,WAAW,CAAC,iBAAiB,CAAC,GAAG,CAACA,GAAG,EAAE,IAAI,CAAC,WAAW,CAAC,IAAI,CAACA,EAAE,GAAG,GAAG,KAAK,IAAI,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,IAAM,EAAE,AAAC,MAAK,IAAI,EAAE,SAAS,EAAE,YAAY,EAAE,SAAS,CAAC,GAAG,WAAW,CAAC,EAAE,EAAE,IAAI,CAAE,KAAI,CAAC,IAAI,CAACA,EAAE,MAAM,EAAE,IAAI,CAAC,eAAe,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,KAAKA,CAAC,CAAC,CAAC,CAAC,CAAC,IAAM,EAAE,IAAI,CAAC,WAAW,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAACA,GAAG,GAAG,KAAK,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC,IAAMA,EAAE,EAAE,kBAAkB,CAAC,GAAG,EAAE,YAAY,OAAOA,EAAE,SAAS,CAAC,CAAC,cAAcA,EAAE,SAAS,EAAE,KAAK,IAAIA,EAAE,SAAS,EAAE,cAAcA,EAAE,SAAS,CAAC,CAAE,KAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,EAAEA,EAAE,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,IAAI,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,cAAcA,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,IAAIA,EAAE,CAAC,IAAM,EAAE,IAAI,CAAC,WAAW,CAAC,EAAE,IAAI,CAACA,EAAE,CAAC,GAAG,CAA8B,CAAC,CAA/B,KAAI,EAAE,kBAAkB,CAACA,EAAC,EAAO,UAAU,EAAE,GAAG,EAAE,IAAI,EAAE,UAAU,EAAE,EAAE,OAAO,EAAE,IAAI,IAAI,CAAC,IAAI,EAAE,IAAIA,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,IAAI,CAACA,EAAE,GAAE,EAAG,OAAO,IAAI,CAAC,CAAC,CAACA,EAAE,EAAE,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,eAAe,EAAG,KAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAC,CAAE,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,QAAQ,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,AAAC,KAAI,CAAC,IAAI,GAAG,IAAIsB,GAAE,EAAG,GAAG,CAACtB,IAAK,KAAI,CAAC,IAAI,CAAC,GAAG,CAACA,EAAE,GAAG,GAAG,IAAI,CAACA,EAAE,EAAE,CAAC,IAAI,GAAG,KAAK,IAAI,IAAK,KAAI,CAAC,IAAI,CAAC,GAAG,CAACA,IAAK,KAAI,CAAC,UAAU,EAAE,GAAI,GAAE,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAACA,EAAE,EAAC,EAAG,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,GAAGA,GAAG,AAAC,KAAI,CAAC,IAAI,GAAG,IAAI8C,GAAE,EAAG,GAAG,CAAC9C,EAAC,CAAE,CAAC,MAAM,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,EAAE,GAAG,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,MAAMA,EAAE,CAAC+C,QAAQ,MAAM,CAAC/C,EAAE,CAAC,IAAMA,EAAE,IAAI,CAAC,cAAc,GAAG,OAAO,MAAMA,GAAG,MAAMA,EAAE,CAAC,IAAI,CAAC,eAAe,CAAC,gBAAgB,CAAC,OAAO,IAAI,CAAC,aAAa,EAAE,CAAC,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,eAAe,CAAC,OAAO,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,GAAG,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,GAAK,CAACA,EAAE,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAACA,EAAE,CAAC,CAAE,KAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAMA,EAAE,IAAI,CAAC,WAAW,CAAC,iBAAiB,CAAC,GAAGA,EAAE,IAAI,CAAC,EAAE,IAAI,GAAK,CAAC,EAAE,EAAE,GAAGA,EAAE,CAAC,GAAK,CAAC,QAAQA,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,AAAC,EAAC,IAAIA,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC,IAAIA,EAAE,CAAC,EAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAACA,CAAAA,EAAE,IAAI,CAAC,YAAY,CAAC,EAAC,EAAK,KAAI,CAAC,UAAU,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,QAASA,GAAGA,EAAE,UAAU,MAAO,IAAI,CAAC,MAAM,CAAC,EAAC,EAAG,IAAI,CAAC,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC,MAAMA,EAAE,CAAC,EAAE,IAAI,CAAC,IAAI,GAAG,CAAC,CAACA,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,WAAWA,CAAC,CAAC,CAAC,CAAC,KAAKA,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,QAASA,GAAGA,EAAE,WAAW,MAAO,IAAI,CAAC,UAAU,EAAG,KAAI,CAAC,UAAU,CAAC,CAAC,EAAE,IAAI,CAAC,YAAY,CAACA,EAAC,EAAG,IAAI,CAAC,OAAO,CAACA,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAIsB,IAAI,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,IAAI,gBAAgB,CAAC,OAAO,IAAI,CAAC,iBAAiB,EAAE,CAAC,mBAAmB,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,aAAatB,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAOA,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAEA,GAAG,IAAI,CAAC,IAAI,CAACA,EAAE,IAAI,CAACA,EAAE,GAAI,IAAI,CAAC,IAAI,EAAE,CAAC,QAAQA,CAAC,CAAC,CAAC,CAAC,aAAaA,CAAC,CAAC,CAAC,CAAC,CAAC2C,CAAAA,EAAE,aAAa,CAAC,EAAE,CAACA,EAAE,iBAAiB,CAAC,CAAC,KAAK,MAAM,EAAEA,EAAI,iBAAqB,CAAC,IAAIrB,IAAIqB,EAAI,SAAa,CAAC,IAAIrB,IAAI,IAAI,CAAC,gBAAgBqB,CAAC,GAAG,AAAC,GAAE,uBAAuB,GAAG,EAAE,AAAD,EAAG,IAAI,CAAC,sECA5wL,IAAiD,EAAE7B,SAAS,IAAM,OAAN,MAAM,OAAE,IAAI,cAAc,CAAC,OAAO,IAAI,CAAC,CAAC,EAAG,KAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAIiC,QAAS,CAAC/C,EAAE,KAAK,IAAI,CAAC,CAAC,CAACA,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,GAAI,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC+C,QAAQ,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAACA,QAAQ,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,YAAY/C,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,AAAC,KAAI,CAAC,CAAC,CAACA,CAAAA,EAAG,aAAa,CAAC,IAAI,EAAE,IAAM,EAAE,UAAU,OAAO,EAAE,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC,CAAE,KAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,iBAAiB,GAAI,KAAI,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAG,CAAE,CAAC,YAAY,CAAC,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,aAAa,CAAC,gBAAgB,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,KAAK,IAAI,IAAI,CAAC,CAAC,CAAC,OAAO,IAAMA,EAAE,IAAI,CAAC,CAAC,GAAG,GAAG,CAACX,MAAM,OAAO,CAACW,GAAG,MAAMoB,MAAM,0CAA0C,OAAOpB,CAAC,CAAC,MAAM,GAAG,CAAC,IAAMA,EAAE,IAAI,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,AAAC,KAAI,CAAC,CAAC,CAACA,EAAEA,IAAI,GAAG,KAAK,IAAIA,GAAG,KAAK,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,EAAEA,IAAI,MAAM,IAAI,CAAC,GAAG,CAACA,EAAE,CAAC,MAAM,IAAIA,CAAC,CAAC,KAAK,EAAE,CAAEA,CAAAA,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAACA,EAAE,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,QAAS,KAAI,CAAC,CAAC,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,gBAAgB,IAAI,CAAC,OAAO,CAACI,eAAgB,IAAI,IAAI,CAAC,CAAC,CAAC,aAAa,IAAK,IAAI,CAAC,CAAC,CAAC,aAAa,GAAG,IAAM,EAAE,EAAE,IAAI,CAAC,CAAC,AAAC,KAAI,CAAC,CAAC,CAAC,IAAI4C,gBAAgB,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC,CAAChD,EAAE,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,MAAMA,EAAE,CAAC,EAAE,CAAC,EAAE,EAAEA,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC,MAAMA,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,MAAMA,EAAE,CAAC,IAAI,OAAO,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC,OAAOA,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,OAAOA,EAAE,OAAO,IAAK,MAAK,EAAE,OAAOA,EAAE,OAAO,IAAK,MAAK,EAAE,OAAOA,EAAE,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAE,MAAK,EAAE,OAAOA,EAAE,KAAK,GAAG,IAAI,CAAC,KAAK,CAAE,SAAQ,MAAMoB,MAAM,sBAAsB,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC,IAAM,EAAE,CAAC,EAAE,IAAI,IAAI,GAAG,EAAE,MAAM,GAAG,EAAE,MAAM,EAAE,EAAE,KAAK,CAAE,CAAC,EAAE,IAAI,CAAC,SAAE,EAAE,CAAC,CAAC,EAAE,uECA1vD,GAAK,CAAC,EAAE,CAAC,CAAC,CAAC,WAAC,CAAC,EAAE,GAAG,OAAO,GAAG,UAAU,OAAO,GAAG,YAAY,OAAO,EAA2B,4KCAjG,IAAM,EAAE,CAAC,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,kBAAkB,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,EAAEpB,GAAG,CAAC,GAAG,IAAK,EAAC,gBAAgBA,EAAE,OAAO,CAAC,GAAG,IAAMiD,EAAN,MAAMA,EAAE,YAAYjD,CAAC,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAKA,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAACA,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,KAAKA,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,MAAM,CAACA,EAAE,EAAE,CAAC,OAAOA,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,MAAM,IAAI,EAAE,CAAC,wFCA3S,IAAM,EAAEa,WAAW,EAAE,EAAE,YAAY,CAAC,EAAE,EAAE,EAAE,YAAY,CAAC,WAAW,CAAC,WAAWb,GAAGA,CAAC,GAAG,KAAK,EAAE,EAAE,QAAQ,EAAE,CAAC,IAAI,EAAEH,KAAK,MAAM,GAAG,OAAO,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAEoC,SAAS,EAAE,IAAI,EAAE,aAAa,CAAC,IAAI,EAAEjC,GAAG,OAAOA,GAAG,UAAU,OAAOA,GAAG,YAAY,OAAOA,EAAE,EAAEX,MAAM,OAAO,CAAC,EAAEW,GAAG,EAAEA,IAAI,YAAY,OAAOA,GAAG,CAACc,OAAO,QAAQ,CAAC,CAAC,EAAE,aAAc,EAAE,sDAAsD,EAAE,OAAO,EAAE,KAAK,EAAEoC,OAAO,CAAC,EAAE,EAAE,EAAE,kBAAkB,EAAE,EAAE,EAAE,EAAE,EAAE;AAAW,wBAAwB,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,qCAAqC,EAAElD,GAAG,CAAC,EAAE,GAAG,IAAK,EAAC,WAAWA,EAAE,QAAQ,EAAE,OAAO,CAAC,GAAG,EAAE,EAAE,GAAG,EAAE,EAAE,GAAU,GAAL,EAAE,GAAKc,OAAO,GAAG,CAAC,iBAAgB,EAAEA,OAAO,GAAG,CAAC,eAAe,EAAE,IAAI0B,QAAQ,EAAE,EAAE,gBAAgB,CAAC,EAAE,KAAK,SAAS,EAAExC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAEA,IAAI,CAACA,EAAE,cAAc,CAAC,OAAO,MAAMoB,MAAM,kCAAkC,OAAO,KAAK,IAAI,EAAE,EAAE,UAAU,CAAC,GAAG,CAAC,CAAC,IAAM,EAAE,CAACpB,EAAE,KAAK,IAAM,EAAEA,EAAE,MAAM,CAAC,EAAE,EAAE,EAAE,CAAK,EAAE,EAAE,IAAI,EAAE,QAAQ,IAAI,EAAE,SAAS,GAAG,EAAE,EAAE,IAAI,IAAI,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,IAAM,EAAEA,CAAC,CAAC,EAAE,CAAK,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,KAAK,EAAE,EAAE,MAAM,EAAG,GAAE,SAAS,CAAC,EAAc,OAAZ,GAAE,EAAE,IAAI,CAAC,EAAC,CAAS,GAAI,EAAE,EAAE,SAAS,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,KAAK,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,KAAK,IAAI,CAAC,CAAC,EAAE,CAAE,GAAE,IAAI,CAAC,CAAC,CAAC,EAAE,GAAI,GAAEkD,OAAO,KAAK,CAAC,CAAC,EAAE,CAAC,IAAG,EAAG,EAAE,GAAG,KAAK,IAAI,CAAC,CAAC,EAAE,EAAG,GAAE,GAAG,IAAI,EAAE,MAAM,CAAC,CAAC,EAAE,CAAE,GAAE,GAAG,EAAE,EAAE,EAAC,EAAG,KAAK,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,GAAI,GAAE,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,IAAI,GAAG,IAAI,EAAE,EAAE,EAAE,IAAI,GAAG,IAAI,EAAE,EAAE,EAAG,GAAE,EAAE,EAAE,KAAK,GAAG,IAAM,EAAE,IAAI,GAAGlD,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,MAAM,IAAI,GAAG,GAAG,IAAI,EAAE,EAAE,EAAE,GAAG,EAAG,GAAE,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,GAAG,EAAE,EAAE,KAAK,CAAC,GAAG,EAAE,GAAG,EAAE,EAAG,MAAK,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,EAAEA,EAAE,EAAGA,CAAAA,CAAC,CAAC,EAAE,EAAE,KAAI,EAAI,KAAI,EAAE,SAAS,IAAI,EAAE,UAAU,EAAC,GAAI,EAAE,EAAE,IAAMmD,EAAN,MAAMA,EAAE,YAAY,CAAC,QAAQnD,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC8B,CAAC,CAAC,KAAK,CAAE,KAAI,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,EAAE,EAAQ,EAAE9B,EAAE,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,EAAEoD,EAAE,CAAC,EAAEpD,EAAE,GAAG,GAAG,IAAI,CAAC,EAAE,CAACmD,EAAE,aAAa,CAAC,EAAErB,GAAG,EAAE,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,GAAG,IAAI,EAAE,CAAC,IAAM9B,EAAE,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,UAAU,CAACA,EAAE,WAAW,IAAIA,EAAE,UAAU,CAAC,CAAC,KAAK,OAAQ,GAAE,EAAE,QAAQ,EAAC,GAAI,EAAE,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,EAAE,QAAQ,CAAC,CAAC,GAAG,EAAE,aAAa,GAAG,IAAI,IAAMA,KAAK,EAAE,iBAAiB,GAAG,GAAGA,EAAE,QAAQ,CAAC,GAAG,CAAC,IAAM,EAAEoD,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,YAAY,CAACpD,GAAG,KAAK,CAAC,GAAG,EAAE,eAAe,IAAI,CAAC,EAAG,GAAE,IAAI,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,QAAQ,EAAE,KAAK,MAAM,CAAC,CAAC,EAAE,CAACqD,EAAE,MAAM,CAAC,CAAC,EAAE,CAACC,EAAE,MAAM,CAAC,CAAC,EAAE,CAACC,EAAEC,CAAC,GAAG,EAAE,eAAe,CAACxD,EAAE,MAAMA,EAAE,UAAU,CAAC,IAAK,GAAE,IAAI,CAAC,CAAC,KAAK,EAAE,MAAM,CAAC,GAAG,EAAE,eAAe,CAACA,EAAC,EAAG,GAAG,EAAE,IAAI,CAAC,EAAE,OAAO,EAAE,CAAC,IAAMA,EAAE,EAAE,WAAW,CAAC,KAAK,CAAC,GAAG,EAAEA,EAAE,MAAM,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,WAAW,CAAC,EAAE,EAAE,WAAW,CAAC,GAAG,IAAI,IAAI,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,CAACA,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,QAAQ,GAAG,EAAE,IAAI,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC,GAAG,EAAE,MAAM,CAACA,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,IAAI,EAAE,QAAQ,CAAC,GAAG,EAAE,IAAI,GAAG,EAAE,EAAE,IAAI,CAAC,CAAC,KAAK,EAAE,MAAM,CAAC,OAAO,CAAC,IAAIA,EAAE,GAAG,KAAK,KAAMA,CAAAA,EAAE,EAAE,IAAI,CAAC,OAAO,CAAC,EAAEA,EAAE,EAAC,GAAI,EAAE,IAAI,CAAC,CAAC,KAAK,EAAE,MAAM,CAAC,GAAGA,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,OAAO,cAAcA,CAAC,CAAC,CAAC,CAAC,CAAC,IAAM,EAAE,EAAE,aAAa,CAAC,YAAY,OAAO,EAAE,SAAS,CAACA,EAAE,CAAC,CAAC,EAAC,SAAS,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAO,EAAE,EAAE,GAAG,KAAK,EAAE,EAAE,eAAe,CAAC,OAAO,GAAG,cAAc,GAAI,IAAG,OAAO,CAAC,GAAG,KAAK,IAAI,EAAE,EAAE,KAAK,EAAG,AAAW,CAAX,EAAE,IAAI,EAAEA,EAAC,EAAI,IAAI,CAACA,EAAE,EAAE,GAAI,KAAK,IAAI,EAAE,AAAC,GAAE,IAAI,GAAG,EAAE,AAAD,CAAE,CAAC,EAAE,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,KAAK,IAAI,GAAI,GAAE,EAAEA,EAAE,EAAE,IAAI,CAACA,EAAE,EAAE,MAAM,EAAE,EAAE,EAAC,EAAG,CAAC,CAAC,IAAMyD,EAAN,MAAMA,EAAE,YAAYzD,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAACA,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,YAAY,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,MAAM,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAEA,CAAC,CAAC,CAAC,GAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,AAACA,CAAAA,GAAG,eAAe,GAAG,UAAU,CAAC,EAAE,CAAC,EAAG,GAAE,WAAW,CAAC,EAAE,IAAI,EAAE,EAAE,QAAQ,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,KAAK,IAAI,GAAG,CAAC,GAAG,IAAI,EAAE,KAAK,CAAC,CAAC,IAAI,CAAE,KAAI,EAAE,IAAI,CAAC,EAAE,IAAI0D,EAAE,EAAE,EAAE,WAAW,CAAC,IAAI,CAAC1D,GAAG,IAAI,EAAE,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,OAAO,CAAC,IAAI,CAACA,GAAG,IAAI,EAAE,IAAI,EAAG,GAAE,IAAI2D,EAAE,EAAE,IAAI,CAAC3D,EAAC,EAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,GAAG,OAAQ,GAAE,EAAE,QAAQ,GAAG,GAAE,CAAE,CAAC,OAAO,EAAE,WAAW,CAAC,EAAE,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,IAAI,IAAM,KAAK,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,GAAI,MAAK,IAAI,EAAE,OAAO,CAAE,GAAE,IAAI,CAACA,EAAE,EAAE,GAAG,GAAG,EAAE,OAAO,CAAC,MAAM,CAAC,GAAG,EAAE,IAAI,CAACA,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,EAAC,IAAM0D,EAAN,MAAMA,EAAE,IAAI,MAAM,CAAC,OAAO,IAAI,CAAC,IAAI,EAAE,MAAM,IAAI,CAAC,IAAI,CAAC,YAAY1D,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAACA,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,IAAI,YAAY,CAAC,IAAIA,EAAE,IAAI,CAAC,IAAI,CAAC,UAAU,CAAO,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,KAAK,IAAI,GAAG,KAAKA,GAAG,UAAWA,CAAAA,EAAE,EAAE,UAAU,AAAD,EAAGA,CAAC,CAAC,IAAI,WAAW,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,SAAS,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,KAAKA,CAAC,CAAC,EAAE,IAAI,CAAC,CAACA,AAAc,EAAdA,EAAE,EAAE,IAAI,CAACA,EAAE,IAAQA,IAAI,GAAG,MAAMA,GAAG,KAAKA,EAAG,KAAI,CAAC,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAGA,IAAI,IAAI,CAAC,IAAI,EAAEA,IAAI,GAAG,IAAI,CAAC,CAAC,CAACA,GAAG,KAAK,IAAIA,EAAE,UAAU,CAAC,IAAI,CAAC,CAAC,CAACA,GAAG,KAAK,IAAIA,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAACA,GAAG,EAAEA,GAAG,IAAI,CAAC,CAAC,CAACA,GAAG,IAAI,CAAC,CAAC,CAACA,EAAE,CAAC,EAAEA,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,YAAY,CAACA,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,GAAGA,GAAI,KAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAACA,EAAC,CAAE,CAAC,EAAEA,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,GAAG,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAACA,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,cAAc,CAACA,IAAI,IAAI,CAAC,IAAI,CAACA,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,GAAK,CAAC,OAAO,CAAC,CAAC,WAAW,CAAC,CAAC,CAACA,EAAE,EAAE,UAAU,OAAO,EAAE,IAAI,CAAC,IAAI,CAACA,GAAI,MAAK,IAAI,EAAE,EAAE,EAAG,GAAE,EAAE,CAACmD,EAAE,aAAa,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,OAAO,GAAG,GAAG,GAAG,IAAI,CAAC,IAAI,EAAE,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,IAAMnD,EAAE,IAAIyD,EAAE,EAAE,IAAI,EAAE,EAAEzD,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAEA,CAAAA,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAACA,CAAC,CAAC,CAAC,KAAKA,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,GAAG,CAACA,EAAE,OAAO,EAAE,OAAO,KAAK,IAAI,GAAG,EAAE,GAAG,CAACA,EAAE,OAAO,CAAC,EAAE,IAAImD,EAAEnD,IAAI,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,GAAI,KAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,EAAC,EAAG,IAAM,EAAE,IAAI,CAAC,IAAI,CAAK,EAAE,EAAE,EAAE,IAAI,IAAM,KAAKA,EAAE,IAAI,EAAE,MAAM,CAAC,EAAE,IAAI,CAAC,EAAE,IAAI0D,EAAE,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,GAAI,GAAE,EAAE,MAAM,EAAG,KAAI,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,MAAM,CAAC,EAAE,CAAC,KAAK1D,EAAE,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC,EAAE,GAAGA,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC,IAAM,EAAEA,EAAE,WAAW,AAACA,CAAAA,EAAE,MAAM,GAAGA,EAAE,CAAC,CAAC,CAAC,aAAaA,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,CAAC,IAAI,EAAG,KAAI,CAAC,IAAI,CAACA,EAAE,IAAI,CAAC,IAAI,GAAGA,EAAC,CAAE,CAAC,EAAC,IAAMwD,EAAN,MAAMA,EAAE,IAAI,SAAS,CAAC,OAAO,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,MAAM,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,YAAYxD,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,CAACA,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,EAAE,CAAE,KAAI,CAAC,IAAI,CAACX,MAAM,EAAE,MAAM,CAAC,GAAG,IAAI,CAAC,IAAIG,QAAQ,IAAI,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,KAAKQ,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAM,EAAE,IAAI,CAAC,OAAO,CAAK,EAAE,CAAC,EAAE,GAAG,KAAK,IAAI,EAAEA,AAAgB,GAAE,CAAC,EAAnBA,EAAE,EAAE,IAAI,CAACA,EAAE,EAAE,KAAYA,IAAI,IAAI,CAAC,IAAI,EAAEA,IAAI,IAAM,KAAI,CAAC,IAAI,CAACA,CAAAA,MAAO,CAAC,IAAc,EAAE,EAAV,EAAEA,EAAU,IAAIA,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,MAAM,CAAC,EAAE,IAAI,AAAqB,CAArB,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAC,IAAM,GAAI,GAAE,IAAI,CAAC,IAAI,CAAC,EAAE,AAAD,EAAG,IAAI,CAAC,EAAE,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAEA,EAAE,EAAEA,IAAI,GAAIA,CAAAA,GAAG,AAAC,IAAG,EAAC,EAAG,CAAC,CAAC,EAAE,EAAE,AAAD,EAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,CAACA,EAAE,CAAC,EAAEA,CAAC,CAAC,CAACA,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAACA,GAAG,GAAG,CAAC,EAAC,IAAMqD,EAAN,MAAMA,UAAUG,EAAE,aAAa,CAAC,KAAK,IAAIlE,WAAW,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAEU,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAACA,IAAI,EAAE,KAAK,EAAEA,CAAC,CAAC,EAAC,IAAMsD,EAAN,MAAMA,UAAUE,EAAE,aAAa,CAAC,KAAK,IAAIlE,WAAW,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAEU,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAACA,GAAGA,IAAI,EAAE,CAAC,EAAC,IAAMuD,EAAN,MAAMA,UAAUC,EAAE,YAAYxD,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAACA,EAAE,EAAE,EAAE,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,KAAKA,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,AAACA,CAAAA,EAAE,EAAE,IAAI,CAACA,EAAE,EAAE,IAAI,KAAK,EAAE,OAAO,IAAM,EAAE,IAAI,CAAC,IAAI,CAAC,EAAEA,IAAI,GAAG,IAAI,GAAGA,EAAE,OAAO,GAAG,EAAE,OAAO,EAAEA,EAAE,IAAI,GAAG,EAAE,IAAI,EAAEA,EAAE,OAAO,GAAG,EAAE,OAAO,CAAC,EAAEA,IAAI,GAAI,KAAI,GAAG,EAAG,IAAG,IAAI,CAAC,OAAO,CAAC,mBAAmB,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAACA,GAAG,IAAI,CAAC,IAAI,CAACA,CAAC,CAAC,YAAYA,CAAC,CAAC,CAAC,YAAY,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,IAAI,CAAC,OAAO,CAACA,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,CAACA,EAAE,CAAC,EAAC,IAAM2D,EAAN,MAAMA,EAAE,YAAY3D,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAACA,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAKA,CAAC,CAAC,CAAC,EAAE,IAAI,CAACA,EAAE,CAAC,EAAC,IAAM,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAEyD,EAAE,EAAE,EAAE,EAAE,EAAE,EAAEC,EAAE,EAAEF,EAAE,EAAEF,EAAE,EAAEC,EAAE,EAAEF,EAAE,EAAEM,CAAC,EAAE,EAAE,EAAE,sBAAsB,AAAC,KAAIR,EAAEO,GAAG,AAAC,GAAE,eAAe,GAAG,EAAE,AAAD,EAAG,IAAI,CAAC,SAAS,IAAM,EAAE,CAAC1D,EAAE,EAAE,KAAK,IAAM,EAAE,GAAG,cAAc,EAAM,EAAE,EAAE,UAAU,CAAC,GAAG,KAAK,IAAI,EAAE,CAAC,IAAMA,EAAE,GAAG,cAAc,IAAK,GAAE,UAAU,CAAC,EAAE,IAAI0D,EAAE,EAAE,YAAY,CAAC,IAAI1D,GAAGA,EAAE,KAAK,EAAE,GAAG,CAAC,EAAE,CAAC,OAAO,EAAE,IAAI,CAACA,GAAG,CAAC,oECAv6N,IAAM4D,EAAN,MAAMA,UAAU,IAAC,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,IAAC,CAAC,EAAE,IAAI,GAAG,UAAO,CAAC,MAAMxC,MAAM,IAAI,CAAC,WAAW,CAAC,aAAa,CAAC,wCAAwC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,IAAC,EAAE,MAAM,EAAE,OAAO,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC,EAAE,GAAG,IAAI,IAAC,CAAC,OAAO,EAAE,GAAG,UAAU,OAAO,EAAE,MAAMA,MAAM,IAAI,CAAC,WAAW,CAAC,aAAa,CAAC,qCAAqC,GAAG,IAAI,IAAI,CAAC,EAAE,CAAC,OAAO,IAAI,CAAC,EAAE,AAAC,KAAI,CAAC,EAAE,CAAC,EAAE,IAAM,EAAE,CAAC,EAAE,CAAC,OAAO,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,WAAW,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,QAAQ,EAAE,OAAO,EAAE,CAAC,CAAC,CAACwC,CAAAA,EAAE,aAAa,CAAC,aAAaA,EAAE,UAAU,CAAC,EAAE,IAAM,EAAE,SAAEA,sHCA/gB,IAAM,EAAE/C,WAAW,IAAMoC,EAAN,MAAMA,UAAU,IAAC,CAAC,aAAa,CAAC,KAAK,IAAI3D,WAAW,IAAI,CAAC,aAAa,CAAC,CAAC,KAAK,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,kBAAkB,CAAC,IAAMU,EAAE,KAAK,CAAC,mBAAmB,OAAO,IAAI,CAAC,aAAa,CAAC,YAAY,GAAGA,EAAE,UAAU,CAACA,CAAC,CAAC,OAAOA,CAAC,CAAC,CAAC,IAAMZ,EAAE,IAAI,CAAC,MAAM,EAAG,KAAI,CAAC,UAAU,EAAG,KAAI,CAAC,aAAa,CAAC,WAAW,CAAC,IAAI,CAAC,WAAW,AAAD,EAAG,KAAK,CAAC,OAAOY,GAAG,IAAI,CAAC,IAAI,CAAC,SAAEZ,EAAE,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,mBAAmB,CAAC,KAAK,CAAC,oBAAoB,IAAI,CAAC,IAAI,EAAE,aAAa,CAAC,EAAE,CAAC,sBAAsB,CAAC,KAAK,CAAC,uBAAuB,IAAI,CAAC,IAAI,EAAE,aAAa,CAAC,EAAE,CAAC,QAAQ,CAAC,OAAO,IAAC,CAAC,CAAC6D,CAAAA,EAAE,aAAa,CAAC,CAAC,EAAEA,EAAE,SAAY,CAAC,CAAC,EAAE,EAAE,wBAAwB,GAAG,CAAC,WAAWA,CAAC,GAAG,IAAM,EAAE,EAAE,yBAAyB,CAAC,IAAI,CAAC,WAAWA,CAAC,GAAwD,AAAC,GAAE,kBAAkB,GAAG,EAAE,AAAD,EAAG,IAAI,CAAC"}