@textadventures/squiffy-packager 7.0.0-beta.4 → 7.0.0-beta.6

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
@@ -1 +1 @@
1
- {"version":3,"file":"packager.js","names":["pkg","runtimeCss","pageCss","squiffyRuntime","htmlTemplateFile","u8","u16","i32","fleb","fdeb","clim","freb","eb","start","b","i","r","j","_a","fl","revfl","_b","fd","revfd","rev","x","hMap","cd","mb","l","le","co","rvb","sv","r_1","v","m","flt","fdt","flm","fdm","shft","p","slc","s","e","ec","err","ind","msg","nt","wbits","d","o","wbits16","hTree","t","t2","et","a","i0","i1","i2","maxSym","tr","mbt","ln","dt","lft","cst","i2_1","i2_2","i2_3","n","lc","c","cl","cli","cln","cls","w","clen","cf","wfblk","out","pos","dat","wblk","final","syms","lf","df","li","bs","bl","dlt","mlb","ddt","mdb","_c","lclt","nlc","_d","lcdt","ndc","lcfreq","_e","lct","mlcb","nlcc","flen","ftlen","dtlen","lm","ll","dm","dl","llm","lcts","it","clct","len","sym","dst","deo","dflt","lvl","plvl","pre","post","st","lst","opt","msk_1","prev","head","bs1_1","bs2_1","hsh","lc_1","wi","hv","imod","pimod","rem","ch_1","dif","maxn","maxd","ml","nl","mmd","md","ti","lin","din","crct","k","crc","cr","dopt","dict","newDat","mrg","wbytes","deflateSync","data","opts","fltn","val","op","te","td","tds","strToU8","str","latin1","ar_1","ar","ai","exfl","ex","wzh","f","fn","u","ce","col","exl","y","exf","wzf","zipSync","files","tot","file","compression","com","ms","oe","cdl","badd","squiffy_runtime_global_default","squiffy_runtime_default","index_template_default","squiffy_page_default","name","version$1","repository","publishConfig","main","types","scripts","author","contributors","dependencies","devDependencies","files","type","package_default","name","version$1","repository","publishConfig","main","types","scripts","author","contributors","version","mimeTypes","getMimeType","path","normaliseAssetPath","normalised","toBase64","bytes","binary","i","scriptSafeJson","value","createPackage","input","createZipOrOptions","options","output","uiInfo","infoComment","scriptData","script","stylesheetData","sheet","combinedCss","squiffy_runtime_default","squiffy_page_default","storyJs","assets","hasAssets","assetOptions","styleContent","runtimeContent","storyContent","squiffy_runtime_global_default","dataUris","htmlData","index_template_default","_","indent","zipSync","text","strToU8"],"sources":["../../node_modules/fflate/esm/browser.js","../src/packager.ts"],"sourcesContent":["// DEFLATE is a complex format; to read this code, you should probably check the RFC first:\n// https://tools.ietf.org/html/rfc1951\n// You may also wish to take a look at the guide I made about this program:\n// https://gist.github.com/101arrowz/253f31eb5abc3d9275ab943003ffecad\n// Some of the following code is similar to that of UZIP.js:\n// https://github.com/photopea/UZIP.js\n// However, the vast majority of the codebase has diverged from UZIP.js to increase performance and reduce bundle size.\n// Sometimes 0 will appear where -1 would be more appropriate. This is because using a uint\n// is better for memory in most engines (I *think*).\nvar ch2 = {};\nvar wk = (function (c, id, msg, transfer, cb) {\n var w = new Worker(ch2[id] || (ch2[id] = URL.createObjectURL(new Blob([\n c + ';addEventListener(\"error\",function(e){e=e.error;postMessage({$e$:[e.message,e.code,e.stack]})})'\n ], { type: 'text/javascript' }))));\n w.onmessage = function (e) {\n var d = e.data, ed = d.$e$;\n if (ed) {\n var err = new Error(ed[0]);\n err['code'] = ed[1];\n err.stack = ed[2];\n cb(err, null);\n }\n else\n cb(null, d);\n };\n w.postMessage(msg, transfer);\n return w;\n});\n\n// aliases for shorter compressed code (most minifers don't do this)\nvar u8 = Uint8Array, u16 = Uint16Array, i32 = Int32Array;\n// fixed length extra bits\nvar fleb = new u8([0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0, /* unused */ 0, 0, /* impossible */ 0]);\n// fixed distance extra bits\nvar fdeb = new u8([0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, /* unused */ 0, 0]);\n// code length index map\nvar clim = new u8([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]);\n// get base, reverse index map from extra bits\nvar freb = function (eb, start) {\n var b = new u16(31);\n for (var i = 0; i < 31; ++i) {\n b[i] = start += 1 << eb[i - 1];\n }\n // numbers here are at max 18 bits\n var r = new i32(b[30]);\n for (var i = 1; i < 30; ++i) {\n for (var j = b[i]; j < b[i + 1]; ++j) {\n r[j] = ((j - b[i]) << 5) | i;\n }\n }\n return { b: b, r: r };\n};\nvar _a = freb(fleb, 2), fl = _a.b, revfl = _a.r;\n// we can ignore the fact that the other numbers are wrong; they never happen anyway\nfl[28] = 258, revfl[258] = 28;\nvar _b = freb(fdeb, 0), fd = _b.b, revfd = _b.r;\n// map of value to reverse (assuming 16 bits)\nvar rev = new u16(32768);\nfor (var i = 0; i < 32768; ++i) {\n // reverse table algorithm from SO\n var x = ((i & 0xAAAA) >> 1) | ((i & 0x5555) << 1);\n x = ((x & 0xCCCC) >> 2) | ((x & 0x3333) << 2);\n x = ((x & 0xF0F0) >> 4) | ((x & 0x0F0F) << 4);\n rev[i] = (((x & 0xFF00) >> 8) | ((x & 0x00FF) << 8)) >> 1;\n}\n// create huffman tree from u8 \"map\": index -> code length for code index\n// mb (max bits) must be at most 15\n// TODO: optimize/split up?\nvar hMap = (function (cd, mb, r) {\n var s = cd.length;\n // index\n var i = 0;\n // u16 \"map\": index -> # of codes with bit length = index\n var l = new u16(mb);\n // length of cd must be 288 (total # of codes)\n for (; i < s; ++i) {\n if (cd[i])\n ++l[cd[i] - 1];\n }\n // u16 \"map\": index -> minimum code for bit length = index\n var le = new u16(mb);\n for (i = 1; i < mb; ++i) {\n le[i] = (le[i - 1] + l[i - 1]) << 1;\n }\n var co;\n if (r) {\n // u16 \"map\": index -> number of actual bits, symbol for code\n co = new u16(1 << mb);\n // bits to remove for reverser\n var rvb = 15 - mb;\n for (i = 0; i < s; ++i) {\n // ignore 0 lengths\n if (cd[i]) {\n // num encoding both symbol and bits read\n var sv = (i << 4) | cd[i];\n // free bits\n var r_1 = mb - cd[i];\n // start value\n var v = le[cd[i] - 1]++ << r_1;\n // m is end value\n for (var m = v | ((1 << r_1) - 1); v <= m; ++v) {\n // every 16 bit value starting with the code yields the same result\n co[rev[v] >> rvb] = sv;\n }\n }\n }\n }\n else {\n co = new u16(s);\n for (i = 0; i < s; ++i) {\n if (cd[i]) {\n co[i] = rev[le[cd[i] - 1]++] >> (15 - cd[i]);\n }\n }\n }\n return co;\n});\n// fixed length tree\nvar flt = new u8(288);\nfor (var i = 0; i < 144; ++i)\n flt[i] = 8;\nfor (var i = 144; i < 256; ++i)\n flt[i] = 9;\nfor (var i = 256; i < 280; ++i)\n flt[i] = 7;\nfor (var i = 280; i < 288; ++i)\n flt[i] = 8;\n// fixed distance tree\nvar fdt = new u8(32);\nfor (var i = 0; i < 32; ++i)\n fdt[i] = 5;\n// fixed length map\nvar flm = /*#__PURE__*/ hMap(flt, 9, 0), flrm = /*#__PURE__*/ hMap(flt, 9, 1);\n// fixed distance map\nvar fdm = /*#__PURE__*/ hMap(fdt, 5, 0), fdrm = /*#__PURE__*/ hMap(fdt, 5, 1);\n// find max of array\nvar max = function (a) {\n var m = a[0];\n for (var i = 1; i < a.length; ++i) {\n if (a[i] > m)\n m = a[i];\n }\n return m;\n};\n// read d, starting at bit p and mask with m\nvar bits = function (d, p, m) {\n var o = (p / 8) | 0;\n return ((d[o] | (d[o + 1] << 8)) >> (p & 7)) & m;\n};\n// read d, starting at bit p continuing for at least 16 bits\nvar bits16 = function (d, p) {\n var o = (p / 8) | 0;\n return ((d[o] | (d[o + 1] << 8) | (d[o + 2] << 16)) >> (p & 7));\n};\n// get end of byte\nvar shft = function (p) { return ((p + 7) / 8) | 0; };\n// typed array slice - allows garbage collector to free original reference,\n// while being more compatible than .slice\nvar slc = function (v, s, e) {\n if (s == null || s < 0)\n s = 0;\n if (e == null || e > v.length)\n e = v.length;\n // can't use .constructor in case user-supplied\n return new u8(v.subarray(s, e));\n};\n/**\n * Codes for errors generated within this library\n */\nexport var FlateErrorCode = {\n UnexpectedEOF: 0,\n InvalidBlockType: 1,\n InvalidLengthLiteral: 2,\n InvalidDistance: 3,\n StreamFinished: 4,\n NoStreamHandler: 5,\n InvalidHeader: 6,\n NoCallback: 7,\n InvalidUTF8: 8,\n ExtraFieldTooLong: 9,\n InvalidDate: 10,\n FilenameTooLong: 11,\n StreamFinishing: 12,\n InvalidZipData: 13,\n UnknownCompressionMethod: 14\n};\n// error codes\nvar ec = [\n 'unexpected EOF',\n 'invalid block type',\n 'invalid length/literal',\n 'invalid distance',\n 'stream finished',\n 'no stream handler',\n , // determined by compression function\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[0]) {\n strm.push(ev.data[0], ev.data[1]);\n postMessage([ev.data[0].length]);\n }\n else\n strm.flush(ev.data[1]);\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 // can fail for cross-realm Uint8Array, but ok - only a small performance penalty\n w.postMessage([d, t = f], d.buffer instanceof ArrayBuffer ? [d.buffer] : []);\n };\n strm.terminate = function () { w.terminate(); };\n if (flush) {\n strm.flush = function (sync) { w.postMessage([0, sync]); };\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; };\n// read 8 bytes\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 if (final) {\n // cleanup unneeded buffers/state to reduce memory usage\n this.s = this.o = {};\n this.b = et;\n }\n };\n /**\n * Flushes buffered uncompressed data. Useful to immediately retrieve the\n * deflated output for small inputs.\n * @param sync Whether to flush to a byte boundary. A sync flush takes 4-5\n * extra bytes, but guarantees all pushed data is immediately\n * decompressible. A separate DEFLATE stream may be concatenated\n * with the current output after a sync flush.\n */\n Deflate.prototype.flush = function (sync) {\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 // could technically skip writing the type-0 block for (this.s.r & 7) == 0,\n // but the deterministic trailer (00 00 FF FF) is useful in some situations\n if (sync) {\n var c = new u8(6);\n c[0] = this.s.r >> 3;\n // write empty, non-final type-0 block\n var ep = wfblk(c, this.s.r, et);\n this.s.r = 0;\n this.ondata(c.subarray(0, ep >> 3), false);\n }\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}\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 * @param sync Whether to flush to a byte boundary. A sync flush takes 4-5\n * extra bytes, but guarantees all pushed data is immediately\n * decompressible.\n */\n Gzip.prototype.flush = function (sync) {\n Deflate.prototype.flush.call(this, sync);\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, 0);\n // process concatenated GZIP\n if (this.s.f && !this.s.l) {\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 else if (final) {\n Inflate.prototype.c.call(this, 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}\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 * @param sync Whether to flush to a byte boundary. A sync flush takes 4-5\n * extra bytes, but guarantees all pushed data is immediately\n * decompressible.\n */\n Zlib.prototype.flush = function (sync) {\n Deflate.prototype.flush.call(this, sync);\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}\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 (ArrayBuffer.isView(val))\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), efl = b2(d, b + 30), fn = strFromU8(d.subarray(b + 46, b + 46 + fnl), !(b2(d, b + 8) & 2048)), es = b + 46 + fnl;\n var _a = z64hs(d, es, efl, z, b4(d, b + 20), b4(d, b + 24), b4(d, b + 42)), sc = _a[0], su = _a[1], off = _a[2];\n return [b2(d, b + 10), sc, su, fn, es + efl + b2(d, b + 32), off];\n};\n// read zip64 header sizes\nvar z64hs = function (d, b, l, z, sc, su, off) {\n var nsc = sc == 4294967295, nsu = su == 4294967295, noff = off == 4294967295, e = b + l;\n var nf = nsc + nsu + noff;\n if (z && nf) {\n for (; b + 4 < e; b += 4 + b2(d, b + 2)) {\n if (b2(d, b) == 1) {\n return [\n nsc ? b8(d, b + 4 + 8 * nsu) : sc,\n nsu ? b8(d, b + 4) : su,\n noff ? b8(d, b + 4 + 8 * (nsu + nsc)) : off,\n 1\n ];\n }\n }\n // z == 2 for unknown whether or not zip64\n if (z < 2)\n err(13);\n }\n return [sc, su, off, 0];\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 // we shouldn't really do this cast, but properly handling ArrayBufferLike\n // makes the API unergonomic with Buffer\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 (chunk, final) {\n // same as ZipPassThrough: cast to retain Buffer ergonomics\n this.ondata(null, chunk, 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 (chunk, final) {\n try {\n this.i.push(chunk, 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 (chunk, final) {\n if (this.i.terminate)\n chunk = slc(chunk, 0);\n this.i.push(chunk, 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 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 lsc = b4(buf, i + 18), lsu = b4(buf, i + 22);\n var fn_1 = strFromU8(buf.subarray(i + 30, i += 30 + fnl), !u);\n var _a = z64hs(buf, i, es, 2, lsc, lsu, 0), sc_1 = _a[0], su_1 = _a[1], z64 = _a[3];\n if (dd)\n sc_1 = -1 - z64;\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 = b4(data, e - 20) == 0x7064B50;\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 = b4(data, e - 20) == 0x7064B50;\n if (z) {\n var ze = b4(data, e - 12);\n z = b4(data, ze) == 0x6064B50;\n if (z) {\n c = b4(data, ze + 32);\n o = b4(data, ze + 48);\n }\n }\n var fltr = opts && opts.filter;\n for (var i = 0; i < c; ++i) {\n var _a = zh(data, o, z), c_2 = _a[0], sc = _a[1], su = _a[2], fn = _a[3], no = _a[4], off = _a[5], b = slzh(data, off);\n o = no;\n if (!fltr || fltr({\n name: fn,\n size: sc,\n originalSize: su,\n compression: c_2\n })) {\n if (!c_2)\n files[fn] = slc(data, b, b + sc);\n else if (c_2 == 8)\n files[fn] = inflateSync(data.subarray(b, b + sc), { out: new u8(su) });\n else\n err(14, 'unknown compression type ' + c_2);\n }\n }\n return files;\n}\n","import { strToU8, zipSync } from \"fflate\";\nimport { CompileSuccess } from \"squiffy-compiler\";\n\nimport squiffyRuntime from \"squiffy-runtime/dist/squiffy.runtime.global.js?raw\";\nimport runtimeCss from \"squiffy-runtime/dist/squiffy.runtime.css?raw\";\nimport htmlTemplateFile from \"./index.template.html?raw\";\nimport pageCss from \"squiffy-runtime/dist/squiffy.page.css?raw\";\n\nimport pkg from \"../package.json\" with {type: \"json\"};\n\nconst version = pkg.version;\n\nexport interface Package {\n files: Record<string, string>;\n zip?: Uint8Array;\n}\n\nexport interface PackageOptions {\n createZip?: boolean;\n inlineHtml?: boolean;\n /**\n * Asset files used by the story (images, audio etc.), keyed by their path relative to the story,\n * e.g. \"cat.png\" or \"images/cat.png\". They're added to the zip at those paths. With inlineHtml,\n * they're embedded in index.html as data: URIs, which the runtime uses via its resolveAssetUrl option.\n * They're not added to Package.files, as those are text files, and the caller already has the assets.\n */\n assets?: Record<string, Uint8Array>;\n}\n\nconst mimeTypes: Record<string, string> = {\n apng: \"image/apng\",\n avif: \"image/avif\",\n bmp: \"image/bmp\",\n gif: \"image/gif\",\n ico: \"image/x-icon\",\n jpeg: \"image/jpeg\",\n jpg: \"image/jpeg\",\n png: \"image/png\",\n svg: \"image/svg+xml\",\n webp: \"image/webp\",\n aac: \"audio/aac\",\n flac: \"audio/flac\",\n m4a: \"audio/mp4\",\n mp3: \"audio/mpeg\",\n oga: \"audio/ogg\",\n ogg: \"audio/ogg\",\n opus: \"audio/ogg\",\n wav: \"audio/wav\",\n weba: \"audio/webm\",\n m4v: \"video/mp4\",\n mp4: \"video/mp4\",\n ogv: \"video/ogg\",\n webm: \"video/webm\",\n vtt: \"text/vtt\",\n otf: \"font/otf\",\n ttf: \"font/ttf\",\n woff: \"font/woff\",\n woff2: \"font/woff2\",\n pdf: \"application/pdf\",\n json: \"application/json\",\n txt: \"text/plain\",\n};\n\nexport const getMimeType = (path: string) =>\n mimeTypes[path.split(\".\").pop()?.toLowerCase() ?? \"\"] ?? \"application/octet-stream\";\n\n// Normalises an asset path to the form the runtime will see it in story output, e.g. \"./images\\\\cat.png\" -> \"images/cat.png\".\n// Throws for paths that would end up outside the package.\nexport const normaliseAssetPath = (path: string) => {\n const normalised = path.replace(/\\\\/g, \"/\").replace(/^(\\.\\/)+/, \"\");\n if (!normalised || normalised.startsWith(\"/\") || /^[a-z]:/i.test(normalised) || normalised.split(\"/\").includes(\"..\")) {\n throw new Error(`Invalid asset path: ${path}`);\n }\n return normalised;\n};\n\nconst toBase64 = (bytes: Uint8Array) => {\n let binary = \"\";\n const chunkSize = 0x8000;\n for (let i = 0; i < bytes.length; i += chunkSize) {\n binary += String.fromCharCode(...bytes.subarray(i, i + chunkSize));\n }\n return btoa(binary);\n};\n\n// Escapes JSON so that it's safe inside a <script> element.\nconst scriptSafeJson = (value: unknown) => JSON.stringify(value).replace(/</g, \"\\\\u003c\");\n\nexport const createPackage = async (input: CompileSuccess, createZipOrOptions: boolean | PackageOptions = false): Promise<Package> => {\n // Handle both old boolean signature and new options object\n const options: PackageOptions = typeof createZipOrOptions === \"boolean\"\n ? { createZip: createZipOrOptions }\n : createZipOrOptions;\n\n const output: Record<string, string> = {};\n const uiInfo = input.getUiInfo();\n\n const infoComment = `<!--\\n\\nCreated with Squiffy ${version}\\n\\nhttps://squiffystory.com\\nhttps://github.com/textadventures/squiffy\\n\\n-->`;\n const scriptData = uiInfo.externalScripts.map(script => `<script src=\"${script}\"></script>`).join(\"\\n\");\n const stylesheetData = uiInfo.externalStylesheets.map(sheet => `<link rel=\"stylesheet\" href=\"${sheet}\"/>`).join(\"\\n\");\n const combinedCss = runtimeCss.toString() + \"\\n\\n\" + pageCss.toString();\n\n const storyJs = await input.getJs();\n\n const assets: Record<string, Uint8Array> = {};\n for (const [path, bytes] of Object.entries(options.assets ?? {})) {\n assets[normaliseAssetPath(path)] = bytes;\n }\n const hasAssets = Object.keys(assets).length > 0;\n let assetOptions = \"\";\n\n // Generate content for placeholders based on inline vs external mode\n // Note: We use arrow functions as replacements to prevent $-pattern interpretation\n // (e.g., $& or ${...} in the replacement string would otherwise be treated specially)\n let styleContent: string;\n let runtimeContent: string;\n let storyContent: string;\n\n if (options.inlineHtml) {\n // Inline everything into the HTML\n styleContent = \"<style>\\n\" + combinedCss + \"\\n </style>\";\n runtimeContent = \"<script>\\n\" + squiffyRuntime + \"\\n </script>\";\n storyContent = \"<script>\\n\" + storyJs + \"\\n </script>\";\n\n if (hasAssets) {\n // A single-file export can't refer to separate asset files, so embed them as data: URIs.\n const dataUris = Object.fromEntries(Object.entries(assets).map(([path, bytes]) =>\n [path, `data:${getMimeType(path)};base64,${toBase64(bytes)}`]));\n storyContent += \"\\n <script>\\nvar squiffyAssetUrls = \" + scriptSafeJson(dataUris) + \";\\n </script>\";\n assetOptions = \"resolveAssetUrl: function (path) { return squiffyAssetUrls[path.replace(/^(\\\\.\\\\/)+/, \\\"\\\")] || path; },\";\n }\n } else {\n // Reference external files\n styleContent = \"<link rel=\\\"stylesheet\\\" href=\\\"style.css\\\"/>\";\n runtimeContent = \"<script src=\\\"squiffy.runtime.global.js\\\"></script>\";\n storyContent = \"<script src=\\\"story.js\\\"></script>\";\n\n output[\"story.js\"] = storyJs;\n output[\"squiffy.runtime.global.js\"] = squiffyRuntime;\n output[\"style.css\"] = combinedCss;\n }\n\n let htmlData = htmlTemplateFile.toString();\n htmlData = htmlData.replace(\"<!-- INFO -->\", () => infoComment);\n htmlData = htmlData.replace(\"<!-- TITLE -->\", () => uiInfo.title);\n htmlData = htmlData.replace(\"<!-- SCRIPTS -->\", () => scriptData);\n htmlData = htmlData.replace(\"<!-- STYLESHEETS -->\", () => stylesheetData);\n htmlData = htmlData.replace(\"<!-- STYLE_CONTENT -->\", () => styleContent);\n htmlData = htmlData.replace(\"<!-- RUNTIME_CONTENT -->\", () => runtimeContent);\n htmlData = htmlData.replace(\"<!-- STORY_CONTENT -->\", () => storyContent);\n htmlData = htmlData.replace(/\\n([ \\t]*)\\/\\* ASSET_OPTIONS \\*\\//, (_, indent: string) => assetOptions ? \"\\n\" + indent + assetOptions : \"\");\n\n output[\"index.html\"] = htmlData;\n\n return {\n files: output,\n zip: !options.createZip ? undefined : zipSync({\n // Assets are already embedded in index.html when inlining\n ...(options.inlineHtml ? {} : assets),\n // Generated files take precedence over any asset with the same name\n ...Object.fromEntries(\n Object.entries(output).map(([name, text]) => [name, strToU8(text)])\n )\n })\n };\n};"],"ignoreList":[0],"mappings":"AA8BA,IAAIK,IAAK,YAAYC,IAAM,aAAaC,KAAM,YAE1CC,KAAO,IAAIH,EAAG;AAAA,EAAC;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAgB;AAAA,EAAG;AAAA,EAAoB;AAAC,CAAC,GAE5II,KAAO,IAAIJ,EAAG;AAAA,EAAC;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAiB;AAAA,EAAG;AAAC,CAAC,GAEnIK,KAAO,IAAIL,EAAG;AAAA,EAAC;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAI;AAAA,EAAG;AAAA,EAAI;AAAA,EAAG;AAAA,EAAI;AAAA,EAAG;AAAA,EAAI;AAAA,EAAG;AAAA,EAAI;AAAA,EAAG;AAAE,CAAC,GAEhFM,KAAO,SAAUC,GAAIC,GAAO;AAE5B,WADIC,IAAI,IAAIR,EAAI,EAAE,GACTS,IAAI,GAAGA,IAAI,IAAI,EAAEA,EACtB,CAAAD,EAAEC,CAAA,IAAKF,KAAS,KAAKD,EAAGG,IAAI,CAAA;AAIhC,WADIC,IAAI,IAAIT,GAAIO,EAAE,EAAA,CAAG,GACZC,IAAI,GAAGA,IAAI,IAAI,EAAEA,EACtB,UAASE,IAAIH,EAAEC,CAAA,GAAIE,IAAIH,EAAEC,IAAI,CAAA,GAAI,EAAEE,EAC/B,CAAAD,EAAEC,CAAA,IAAOA,IAAIH,EAAEC,CAAA,KAAO,IAAKA;AAGnC,SAAO;AAAA,IAAK,GAAAD;AAAA,IAAM,GAAAE;AAAA,EAAE;AACxB,GACIE,KAAKP,GAAKH,IAAM,CAAC,GAAGW,KAAKD,GAAG,GAAGE,KAAQF,GAAG;AAE9CC,GAAG,EAAA,IAAM,KAAKC,GAAM,GAAA,IAAO;AAC3B,IAAIC,KAAKV,GAAKF,IAAM,CAAC,GAAGa,KAAKD,GAAG,GAAGE,KAAQF,GAAG,GAE1CG,KAAM,IAAIlB,EAAI,KAAK;AACvB,SAASS,IAAI,GAAGA,IAAI,OAAO,EAAEA,GAAG;AAE5B,MAAIU,KAAMV,IAAI,UAAW,KAAOA,IAAI,UAAW;AAC/C,EAAAU,KAAMA,IAAI,UAAW,KAAOA,IAAI,UAAW,GAC3CA,KAAMA,IAAI,UAAW,KAAOA,IAAI,SAAW,GAC3CD,GAAIT,CAAA,MAAQU,IAAI,UAAW,KAAOA,IAAI,QAAW,MAAO;AAC5D;AAIA,IAAIC,KAAQ,SAAUC,GAAIC,GAAI,GAAG;AAO7B,WANI,IAAID,EAAG,QAEP,IAAI,GAEJE,IAAI,IAAIvB,EAAIsB,CAAE,GAEX,IAAI,GAAG,EAAE,EACZ,CAAID,EAAG,CAAA,KACH,EAAEE,EAAEF,EAAG,CAAA,IAAK,CAAA;AAGpB,MAAIG,IAAK,IAAIxB,EAAIsB,CAAE;AACnB,OAAK,IAAI,GAAG,IAAIA,GAAI,EAAE,EAClB,CAAAE,EAAG,CAAA,IAAMA,EAAG,IAAI,CAAA,IAAKD,EAAE,IAAI,CAAA,KAAO;AAEtC,MAAIE;AACJ,MAAI,GAAG;AAEH,IAAAA,IAAK,IAAIzB,EAAI,KAAKsB,CAAE;AAEpB,QAAII,IAAM,KAAKJ;AACf,SAAK,IAAI,GAAG,IAAI,GAAG,EAAE,EAEjB,KAAID,EAAG,CAAA;AAQH,eANIM,IAAM,KAAK,IAAKN,EAAG,CAAA,GAEnBO,IAAMN,IAAKD,EAAG,CAAA,GAEdQ,IAAIL,EAAGH,EAAG,CAAA,IAAK,CAAA,OAAQO,GAElBE,IAAID,KAAM,KAAKD,KAAO,GAAIC,KAAKC,GAAG,EAAED,EAEzC,CAAAJ,EAAGP,GAAIW,CAAA,KAAMH,CAAA,IAAOC;AAAA,EAIpC;AAGI,SADAF,IAAK,IAAIzB,EAAI,CAAC,GACT,IAAI,GAAG,IAAI,GAAG,EAAE,EACjB,CAAIqB,EAAG,CAAA,MACHI,EAAG,CAAA,IAAKP,GAAIM,EAAGH,EAAG,CAAA,IAAK,CAAA,GAAE,KAAQ,KAAKA,EAAG,CAAA;AAIrD,SAAOI;AACX,IAEIM,IAAM,IAAIhC,EAAG,GAAG;AACpB,SAASU,IAAI,GAAGA,IAAI,KAAK,EAAEA,EACvB,CAAAsB,EAAItB,CAAA,IAAK;AACb,SAASA,IAAI,KAAKA,IAAI,KAAK,EAAEA,EACzB,CAAAsB,EAAItB,CAAA,IAAK;AACb,SAASA,IAAI,KAAKA,IAAI,KAAK,EAAEA,EACzB,CAAAsB,EAAItB,CAAA,IAAK;AACb,SAASA,IAAI,KAAKA,IAAI,KAAK,EAAEA,EACzB,CAAAsB,EAAItB,CAAA,IAAK;AAEb,IAAIuB,IAAM,IAAIjC,EAAG,EAAE;AACnB,SAASU,IAAI,GAAGA,IAAI,IAAI,EAAEA,EACtB,CAAAuB,EAAIvB,CAAA,IAAK;AAEb,IAAIwB,KAAoB,gBAAAb,EAAKW,GAAK,GAAG,CAAC,GAElCG,KAAoB,gBAAAd,EAAKY,GAAK,GAAG,CAAC,GAqBlCG,KAAO,SAAUC,GAAG;AAAE,UAASA,IAAI,KAAK,IAAK;AAAG,GAGhDC,KAAM,SAAUR,GAAGS,GAAGC,GAAG;AACzB,UAAID,KAAK,QAAQA,IAAI,OACjBA,IAAI,KACJC,KAAK,QAAQA,IAAIV,EAAE,YACnBU,IAAIV,EAAE,SAEH,IAAI9B,EAAG8B,EAAE,SAASS,GAAGC,CAAC,CAAC;AAClC,GAsBIC,KAAK;AAAA,EACL;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,E;A,EAEA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAEJ,GAEIC,IAAM,SAAUC,GAAKC,GAAKC,GAAI;AAC9B,MAAIL,IAAI,IAAI,MAAMI,KAAOH,GAAGE,CAAA,CAAI;AAIhC,MAHAH,EAAE,OAAOG,GACL,MAAM,qBACN,MAAM,kBAAkBH,GAAGE,CAAG,GAC9B,CAACG,EACD,OAAML;AACV,SAAOA;AACX,GAuLIM,IAAQ,SAAUC,GAAGV,GAAGP,GAAG;AAC3B,EAAAA,MAAMO,IAAI;AACV,MAAIW,IAAKX,IAAI,IAAK;AAClB,EAAAU,EAAEC,CAAA,KAAMlB,GACRiB,EAAEC,IAAI,CAAA,KAAMlB,KAAK;AACrB,GAEImB,IAAU,SAAUF,GAAGV,GAAGP,GAAG;AAC7B,EAAAA,MAAMO,IAAI;AACV,MAAIW,IAAKX,IAAI,IAAK;AAClB,EAAAU,EAAEC,CAAA,KAAMlB,GACRiB,EAAEC,IAAI,CAAA,KAAMlB,KAAK,GACjBiB,EAAEC,IAAI,CAAA,KAAMlB,KAAK;AACrB,GAEIoB,KAAQ,SAAUH,GAAGxB,GAAI;AAGzB,WADI4B,IAAI,CAAC,GACAzC,IAAI,GAAGA,IAAIqC,EAAE,QAAQ,EAAErC,EAC5B,CAAIqC,EAAErC,CAAA,KACFyC,EAAE,KAAK;AAAA,IAAEzC;AAAA,IAAM,GAAGqC,EAAErC,CAAA;AAAA,EAAG,CAAC;AAEhC,MAAI6B,IAAIY,EAAE,QACNC,IAAKD,EAAE,MAAM;AACjB,MAAI,CAACZ,EACD,QAAO;AAAA,IAAE,GAAGc;AAAA,IAAI,GAAG;AAAA,EAAE;AACzB,MAAId,KAAK,GAAG;AACR,QAAIT,IAAI,IAAI9B,EAAGmD,EAAE,CAAA,EAAG,IAAI,CAAC;AACzB,WAAArB,EAAEqB,EAAE,CAAA,EAAG,CAAA,IAAK,GACL;AAAA,MAAE,GAAGrB;AAAA,MAAG,GAAG;AAAA,IAAE;AAAA,EACxB;AACA,EAAAqB,EAAE,KAAK,SAAUG,GAAG7C,GAAG;AAAE,WAAO6C,EAAE,IAAI7C,EAAE;AAAA,EAAG,CAAC,GAG5C0C,EAAE,KAAK;AAAA,IAAE,GAAG;AAAA,IAAI,GAAG;AAAA,EAAM,CAAC;AAC1B,MAAI,IAAIA,EAAE,CAAA,GAAIxC,IAAIwC,EAAE,CAAA,GAAII,IAAK,GAAGC,IAAK,GAAGC,IAAK;AAO7C,OANAN,EAAE,CAAA,IAAK;AAAA,IAAE,GAAG;AAAA,IAAI,GAAG,EAAE,IAAIxC,EAAE;AAAA,IAAM;AAAA,IAAM,GAAAA;AAAA,EAAE,GAMlC6C,KAAMjB,IAAI;AACb,QAAIY,EAAEA,EAAEI,CAAA,EAAI,IAAIJ,EAAEM,CAAA,EAAI,IAAIF,MAAOE,GAAA,GACjC9C,IAAIwC,EAAEI,KAAMC,KAAML,EAAEI,CAAA,EAAI,IAAIJ,EAAEM,CAAA,EAAI,IAAIF,MAAOE,GAAA,GAC7CN,EAAEK,GAAA,IAAQ;AAAA,MAAE,GAAG;AAAA,MAAI,GAAG,EAAE,IAAI7C,EAAE;AAAA,MAAM;AAAA,MAAM,GAAAA;AAAA,IAAE;AAGhD,WADI+C,IAASN,EAAG,CAAA,EAAG,GACV1C,IAAI,GAAGA,IAAI6B,GAAG,EAAE7B,EACrB,CAAI0C,EAAG1C,CAAA,EAAG,IAAIgD,MACVA,IAASN,EAAG1C,CAAA,EAAG;AAGvB,MAAIiD,IAAK,IAAI1D,EAAIyD,IAAS,CAAC,GAEvBE,IAAMC,GAAGV,EAAEK,IAAK,CAAA,GAAIG,GAAI,CAAC;AAC7B,MAAIC,IAAMrC,GAAI;AAIV,QAAIb,IAAI,GAAGoD,IAAK,GAEZC,IAAMH,IAAMrC,GAAIyC,IAAM,KAAKD;AAE/B,SADAX,EAAG,KAAK,SAAUE,GAAG7C,GAAG;AAAE,aAAOkD,EAAGlD,EAAE,CAAA,IAAKkD,EAAGL,EAAE,CAAA,KAAMA,EAAE,IAAI7C,EAAE;AAAA,IAAG,CAAC,GAC3DC,IAAI6B,GAAG,EAAE7B,GAAG;AACf,UAAIuD,IAAOb,EAAG1C,CAAA,EAAG;AACjB,UAAIiD,EAAGM,CAAA,IAAQ1C;AACX,QAAAuC,KAAME,KAAO,KAAMJ,IAAMD,EAAGM,CAAA,IAC5BN,EAAGM,CAAA,IAAQ1C;AAAA,UAGX;AAAA,IACR;AAEA,SADAuC,MAAOC,GACAD,IAAK,KAAG;AACX,UAAII,IAAOd,EAAG1C,CAAA,EAAG;AACjB,MAAIiD,EAAGO,CAAA,IAAQ3C,IACXuC,KAAM,KAAMvC,IAAKoC,EAAGO,CAAA,MAAU,IAE9B,EAAExD;AAAA,IACV;AACA,WAAOA,KAAK,KAAKoD,GAAI,EAAEpD,GAAG;AACtB,UAAIyD,IAAOf,EAAG1C,CAAA,EAAG;AACjB,MAAIiD,EAAGQ,CAAA,KAAS5C,MACZ,EAAEoC,EAAGQ,CAAA,GACL,EAAEL;AAAA,IAEV;AACA,IAAAF,IAAMrC;AAAA,EACV;AACA,SAAO;AAAA,IAAE,GAAG,IAAIvB,EAAG2D,CAAE;AAAA,IAAG,GAAGC;AAAA,EAAI;AACnC,GAEIC,KAAK,SAAUO,GAAG5C,GAAGuB,GAAG;AACxB,SAAOqB,EAAE,KAAK,KACR,KAAK,IAAIP,GAAGO,EAAE,GAAG5C,GAAGuB,IAAI,CAAC,GAAGc,GAAGO,EAAE,GAAG5C,GAAGuB,IAAI,CAAC,CAAC,IAC5CvB,EAAE4C,EAAE,CAAA,IAAKrB;AACpB,GAEIsB,KAAK,SAAUC,GAAG;AAGlB,WAFI/B,IAAI+B,EAAE,QAEH/B,KAAK,CAAC+B,EAAE,EAAE/B,CAAA,IAAA;AAMjB,WAJIgC,IAAK,IAAItE,EAAI,EAAEsC,CAAC,GAEhBiC,IAAM,GAAGC,IAAMH,EAAE,CAAA,GAAII,IAAM,GAC3BC,IAAI,SAAU7C,GAAG;AAAE,IAAAyC,EAAGC,GAAA,IAAS1C;AAAA,EAAG,GAC7BpB,IAAI,GAAGA,KAAK6B,GAAG,EAAE7B,EACtB,KAAI4D,EAAE5D,CAAA,KAAM+D,KAAO/D,KAAK6B,EACpB,GAAEmC;AAAA,OACD;AACD,QAAI,CAACD,KAAOC,IAAM,GAAG;AACjB,aAAOA,IAAM,KAAKA,KAAO,IACrB,CAAAC,EAAE,KAAK;AACX,MAAID,IAAM,MACNC,EAAED,IAAM,KAAOA,IAAM,MAAO,IAAK,QAAUA,IAAM,KAAM,IAAK,KAAK,GACjEA,IAAM;AAAA,IAEd,WACSA,IAAM,GAAG;AAEd,WADAC,EAAEF,CAAG,GAAG,EAAEC,GACHA,IAAM,GAAGA,KAAO,EACnB,CAAAC,EAAE,IAAI;AACV,MAAID,IAAM,MACNC,EAAID,IAAM,KAAM,IAAK,IAAI,GAAGA,IAAM;AAAA,IAC1C;AACA,WAAOA,MACH,CAAAC,EAAEF,CAAG;AACT,IAAAC,IAAM,GACND,IAAMH,EAAE5D,CAAA;AAAA,EACZ;AAEJ,SAAO;AAAA,IAAE,GAAG6D,EAAG,SAAS,GAAGC,CAAG;AAAA,IAAG,GAAGjC;AAAA,EAAE;AAC1C,GAEIqC,IAAO,SAAUC,GAAIN,GAAI;AAEzB,WADI/C,IAAI,GACCd,IAAI,GAAGA,IAAI6D,EAAG,QAAQ,EAAE7D,EAC7B,CAAAc,KAAKqD,EAAGnE,CAAA,IAAK6D,EAAG7D,CAAA;AACpB,SAAOc;AACX,GAGIsD,KAAQ,SAAUC,GAAKC,GAAKC,GAAK;AAEjC,MAAI,IAAIA,EAAI,QACRjC,IAAIZ,GAAK4C,IAAM,CAAC;AACpB,EAAAD,EAAI/B,CAAA,IAAK,IAAI,KACb+B,EAAI/B,IAAI,CAAA,IAAK,KAAK,GAClB+B,EAAI/B,IAAI,CAAA,IAAK+B,EAAI/B,CAAA,IAAK,KACtB+B,EAAI/B,IAAI,CAAA,IAAK+B,EAAI/B,IAAI,CAAA,IAAK;AAC1B,WAAStC,IAAI,GAAGA,IAAI,GAAG,EAAEA,EACrB,CAAAqE,EAAI/B,IAAItC,IAAI,CAAA,IAAKuE,EAAIvE,CAAA;AACzB,UAAQsC,IAAI,IAAI,KAAK;AACzB,GAEIkC,KAAO,SAAUD,GAAKF,GAAKI,GAAOC,GAAMC,GAAIC,GAAI/E,GAAIgF,GAAIC,GAAIC,GAAIpD,GAAG;AACnE,EAAAS,EAAMiC,GAAK1C,KAAK8C,CAAK,GACrB,EAAEE,EAAG,GAAA;AAML,WALIxE,IAAKqC,GAAMmC,GAAI,EAAE,GAAGK,IAAM7E,EAAG,GAAG8E,IAAM9E,EAAG,GACzCG,IAAKkC,GAAMoC,GAAI,EAAE,GAAGM,IAAM5E,EAAG,GAAG6E,IAAM7E,EAAG,GACzC8E,IAAKzB,GAAGqB,CAAG,GAAGK,IAAOD,EAAG,GAAGE,IAAMF,EAAG,GACpCG,IAAK5B,GAAGuB,CAAG,GAAGM,IAAOD,EAAG,GAAGE,IAAMF,EAAG,GACpCG,IAAS,IAAInG,EAAI,EAAE,GACdS,IAAI,GAAGA,IAAIqF,EAAK,QAAQ,EAAErF,EAC/B,GAAE0F,EAAOL,EAAKrF,CAAA,IAAK,EAAA;AACvB,WAASA,IAAI,GAAGA,IAAIwF,EAAK,QAAQ,EAAExF,EAC/B,GAAE0F,EAAOF,EAAKxF,CAAA,IAAK,EAAA;AAGvB,WAFI2F,IAAKnD,GAAMkD,GAAQ,CAAC,GAAGE,IAAMD,EAAG,GAAGE,IAAOF,EAAG,GAC7CG,IAAO,IACJA,IAAO,KAAK,CAACF,EAAIjG,GAAKmG,IAAO,CAAA,CAAA,GAAK,EAAEA,EAAA;AAE3C,MAAIC,IAAQhB,IAAK,KAAM,GACnBiB,IAAQ9B,EAAKS,GAAIrD,CAAG,IAAI4C,EAAKU,GAAIrD,CAAG,IAAI1B,GACxCoG,IAAQ/B,EAAKS,GAAIK,CAAG,IAAId,EAAKU,GAAIM,CAAG,IAAIrF,IAAK,KAAK,IAAIiG,IAAO5B,EAAKwB,GAAQE,CAAG,IAAI,IAAIF,EAAO,EAAA,IAAM,IAAIA,EAAO,EAAA,IAAM,IAAIA,EAAO,EAAA;AAClI,MAAIZ,KAAM,KAAKiB,KAAQC,KAASD,KAAQE,EACpC,QAAO7B,GAAMC,GAAK1C,GAAG4C,EAAI,SAASO,GAAIA,IAAKC,CAAE,CAAC;AAClD,MAAImB,GAAIC,GAAIC,GAAIC;AAEhB,MADAjE,EAAMiC,GAAK1C,GAAG,KAAKsE,IAAQD,EAAM,GAAGrE,KAAK,GACrCsE,IAAQD,GAAO;AACf,IAAAE,IAAKvF,EAAKqE,GAAKC,GAAK,CAAC,GAAGkB,IAAKnB,GAAKoB,IAAKzF,EAAKuE,GAAKC,GAAK,CAAC,GAAGkB,IAAKnB;AAC/D,QAAIoB,KAAM3F,EAAKiF,GAAKC,GAAM,CAAC;AAC3B,IAAAzD,EAAMiC,GAAK1C,GAAG2D,IAAM,GAAG,GACvBlD,EAAMiC,GAAK1C,IAAI,GAAG8D,IAAM,CAAC,GACzBrD,EAAMiC,GAAK1C,IAAI,IAAImE,IAAO,CAAC,GAC3BnE,KAAK;AACL,aAAS3B,IAAI,GAAGA,IAAI8F,GAAM,EAAE9F,EACxB,CAAAoC,EAAMiC,GAAK1C,IAAI,IAAI3B,GAAG4F,EAAIjG,GAAKK,CAAA,CAAA,CAAG;AACtC,IAAA2B,KAAK,IAAImE;AAET,aADIS,IAAO,CAAClB,GAAMG,CAAI,GACbgB,IAAK,GAAGA,IAAK,GAAG,EAAEA;AAEvB,eADIC,IAAOF,EAAKC,CAAA,GACPxG,IAAI,GAAGA,IAAIyG,EAAK,QAAQ,EAAEzG,GAAG;AAClC,YAAI0G,IAAMD,EAAKzG,CAAA,IAAK;AACpB,QAAAoC,EAAMiC,GAAK1C,GAAG2E,GAAII,CAAA,CAAI,GAAG/E,KAAKiE,EAAIc,CAAA,GAC9BA,IAAM,OACNtE,EAAMiC,GAAK1C,GAAI8E,EAAKzG,CAAA,KAAM,IAAK,GAAG,GAAG2B,KAAK8E,EAAKzG,CAAA,KAAM;AAAA,MAC7D;AAAA,EAER,MAEI,CAAAkG,IAAK1E,IAAK2E,IAAK7E,GAAK8E,IAAK3E,IAAK4E,IAAK9E;AAEvC,WAASvB,IAAI,GAAGA,IAAI6E,GAAI,EAAE7E,GAAG;AACzB,QAAI2G,IAAMjC,EAAK1E,CAAA;AACf,QAAI2G,IAAM,KAAK;AACX,UAAID,IAAOC,KAAO,KAAM;AACxB,MAAApE,EAAQ8B,GAAK1C,GAAGuE,EAAGQ,IAAM,GAAA,CAAI,GAAG/E,KAAKwE,EAAGO,IAAM,GAAA,GAC1CA,IAAM,MACNtE,EAAMiC,GAAK1C,GAAIgF,KAAO,KAAM,EAAE,GAAGhF,KAAKlC,GAAKiH,CAAA;AAC/C,UAAIE,IAAMD,IAAM;AAChB,MAAApE,EAAQ8B,GAAK1C,GAAGyE,EAAGQ,CAAA,CAAI,GAAGjF,KAAK0E,EAAGO,CAAA,GAC9BA,IAAM,MACNrE,EAAQ8B,GAAK1C,GAAIgF,KAAO,IAAK,IAAI,GAAGhF,KAAKjC,GAAKkH,CAAA;AAAA,IACtD,MAEI,CAAArE,EAAQ8B,GAAK1C,GAAGuE,EAAGS,CAAA,CAAI,GAAGhF,KAAKwE,EAAGQ,CAAA;AAAA,EAE1C;AACA,SAAApE,EAAQ8B,GAAK1C,GAAGuE,EAAG,GAAA,CAAI,GAChBvE,IAAIwE,EAAG,GAAA;AAClB,GAEIU,KAAoB,oBAAIrH,GAAI;AAAA,EAAC;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAS;AAAA,EAAS;AAAO,CAAC,GAEvGmD,KAAmB,oBAAIrD,EAAG,CAAC,GAE3BwH,KAAO,SAAUvC,GAAKwC,GAAKC,GAAMC,GAAKC,GAAMC,GAAI;AAChD,MAAItF,IAAIsF,EAAG,KAAK5C,EAAI,QAChBjC,IAAI,IAAIhD,EAAG2H,IAAMpF,IAAI,KAAK,IAAI,KAAK,KAAKA,IAAI,GAAI,KAAKqF,CAAI,GAEzDjD,IAAI3B,EAAE,SAAS2E,GAAK3E,EAAE,SAAS4E,CAAI,GACnCE,IAAMD,EAAG,GACT7C,KAAO6C,EAAG,KAAK,KAAK;AACxB,MAAIJ,GAAK;AACL,IAAIzC,MACAL,EAAE,CAAA,IAAKkD,EAAG,KAAK;AAenB,aAdIE,IAAMR,GAAIE,IAAM,CAAA,GAChBrD,IAAI2D,KAAO,IAAIzD,IAAIyD,IAAM,MACzBC,KAAS,KAAKN,KAAQ,GAEtBO,IAAOJ,EAAG,KAAK,IAAI5H,EAAI,KAAK,GAAGiI,IAAOL,EAAG,KAAK,IAAI5H,EAAI+H,IAAQ,CAAC,GAC/DG,IAAQ,KAAK,KAAKT,IAAO,CAAC,GAAGU,IAAQ,IAAID,GACzCE,IAAM,SAAU3H,IAAG;AAAE,cAAQuE,EAAIvE,EAAA,IAAMuE,EAAIvE,KAAI,CAAA,KAAMyH,IAAUlD,EAAIvE,KAAI,CAAA,KAAM0H,KAAUJ;AAAA,IAAO,GAG9F5C,IAAO,IAAIlF,GAAI,IAAK,GAEpBmF,IAAK,IAAIpF,EAAI,GAAG,GAAGqF,IAAK,IAAIrF,EAAI,EAAE,GAElCqI,IAAO,GAAG/H,IAAK,GAAGG,IAAImH,EAAG,KAAK,GAAGtC,IAAK,GAAGgD,IAAKV,EAAG,KAAK,GAAGrC,IAAK,GAC3D9E,IAAI,IAAI6B,GAAG,EAAE7B,GAAG;AAEnB,UAAI8H,IAAKH,EAAI3H,CAAC,GAEV+H,IAAO/H,IAAI,OAAOgI,IAAQR,EAAKM,CAAA;AAKnC,UAJAP,EAAKQ,CAAA,IAAQC,GACbR,EAAKM,CAAA,IAAMC,GAGPF,KAAM7H,GAAG;AAET,YAAIiI,IAAMpG,IAAI7B;AACd,aAAK4H,IAAO,OAAQ/C,IAAK,WAAWoD,IAAM,OAAO,CAACb,IAAM;AACpD,UAAA9C,IAAME,GAAKD,GAAKN,GAAG,GAAGS,GAAMC,GAAIC,GAAI/E,GAAIgF,GAAIC,GAAI9E,IAAI8E,GAAIR,CAAG,GAC3DO,IAAK+C,IAAO/H,IAAK,GAAGiF,IAAK9E;AACzB,mBAASE,IAAI,GAAGA,IAAI,KAAK,EAAEA,EACvB,CAAAyE,EAAGzE,CAAA,IAAK;AACZ,mBAASA,IAAI,GAAGA,IAAI,IAAI,EAAEA,EACtB,CAAA0E,EAAG1E,CAAA,IAAK;AAAA,QAChB;AAEA,YAAIY,IAAI,GAAGuB,IAAI,GAAG6F,KAAOtE,GAAGuE,IAAMJ,IAAOC,IAAQ;AACjD,YAAIC,IAAM,KAAKH,KAAMH,EAAI3H,IAAImI,CAAG;AAM5B,mBALIC,IAAO,KAAK,IAAI1E,GAAGuE,CAAG,IAAI,GAC1BI,IAAO,KAAK,IAAI,OAAOrI,CAAC,GAGxBsI,IAAK,KAAK,IAAI,KAAKL,CAAG,GACnBE,KAAOE,KAAQ,EAAEH,MAAQH,KAAQC,KAAO;AAC3C,gBAAIzD,EAAIvE,IAAIc,CAAA,KAAMyD,EAAIvE,IAAIc,IAAIqH,CAAA,GAAM;AAEhC,uBADII,IAAK,GACFA,IAAKD,KAAM/D,EAAIvE,IAAIuI,CAAA,KAAOhE,EAAIvE,IAAIuI,IAAKJ,CAAA,GAAM,EAAEI,EAAA;AAEtD,kBAAIA,IAAKzH,GAAG;AAGR,oBAFAA,IAAIyH,GAAIlG,IAAI8F,GAERI,IAAKH,EACL;AAMJ,yBAFII,IAAM,KAAK,IAAIL,GAAKI,IAAK,CAAC,GAC1BE,KAAK,GACAvI,IAAI,GAAGA,IAAIsI,GAAK,EAAEtI,GAAG;AAC1B,sBAAIwI,KAAK1I,IAAImI,IAAMjI,IAAI,OAEnBU,KAAK8H,KADCnB,EAAKmB,EAAA,IACK;AACpB,kBAAI9H,KAAK6H,OACLA,KAAK7H,IAAIoH,IAAQU;AAAA,gBACzB;AAAA,cACJ;AAAA,YACJ;AAEA,YAAAX,IAAOC,GAAOA,IAAQT,EAAKQ,CAAA,GAC3BI,KAAOJ,IAAOC,IAAQ;AAAA,UAC1B;AAGJ,YAAI3F,GAAG;AAGH,UAAAqC,EAAKG,GAAA,IAAQ,YAAaxE,GAAMS,CAAA,KAAM,KAAMN,GAAM6B,CAAA;AAClD,cAAIsG,KAAMtI,GAAMS,CAAA,IAAK,IAAI8H,KAAMpI,GAAM6B,CAAA,IAAK;AAC1C,UAAAxC,KAAMJ,GAAKkJ,EAAA,IAAOjJ,GAAKkJ,EAAA,GACvB,EAAEjE,EAAG,MAAMgE,EAAA,GACX,EAAE/D,EAAGgE,EAAA,GACLf,IAAK7H,IAAIc,GACT,EAAE8G;AAAA,QACN;AAEI,UAAAlD,EAAKG,GAAA,IAAQN,EAAIvE,CAAA,GACjB,EAAE2E,EAAGJ,EAAIvE,CAAA,CAAA;AAAA,MAEjB;AAAA,IACJ;AACA,SAAKA,IAAI,KAAK,IAAIA,GAAG6H,CAAE,GAAG7H,IAAI6B,GAAG,EAAE7B;AAC/B,MAAA0E,EAAKG,GAAA,IAAQN,EAAIvE,CAAA,GACjB,EAAE2E,EAAGJ,EAAIvE,CAAA,CAAA;AAEb,IAAAsE,IAAME,GAAKD,GAAKN,GAAGmD,GAAK1C,GAAMC,GAAIC,GAAI/E,GAAIgF,GAAIC,GAAI9E,IAAI8E,GAAIR,CAAG,GACxD8C,MACDD,EAAG,IAAK7C,IAAM,IAAKL,EAAGK,IAAM,IAAK,CAAA,KAAM,GAEvCA,KAAO,GACP6C,EAAG,IAAIK,GAAML,EAAG,IAAII,GAAMJ,EAAG,IAAInH,GAAGmH,EAAG,IAAIU;AAAA,EAEnD,OACK;AACD,aAAS7H,IAAImH,EAAG,KAAK,GAAGnH,IAAI6B,IAAIuF,GAAKpH,KAAK,OAAO;AAE7C,UAAI8B,KAAI9B,IAAI;AACZ,MAAI8B,MAAKD,MAELoC,EAAGK,IAAM,IAAK,CAAA,IAAK8C,GACnBtF,KAAID,IAERyC,IAAMF,GAAMH,GAAGK,IAAM,GAAGC,EAAI,SAASvE,GAAG8B,EAAC,CAAC;AAAA,IAC9C;AACA,IAAAqF,EAAG,IAAItF;AAAA,EACX;AACA,SAAOD,GAAIU,GAAG,GAAG2E,IAAMvF,GAAK4C,CAAG,IAAI4C,CAAI;AAC3C,GAEI2B,KAAsB,4BAAY;AAElC,WADIpG,IAAI,oBAAI,WAAW,GAAG,GACjBzC,IAAI,GAAGA,IAAI,KAAK,EAAEA,GAAG;AAE1B,aADI4D,IAAI5D,GAAG8I,IAAI,GACR,EAAEA,IACL,CAAAlF,KAAMA,IAAI,KAAM,cAAeA,MAAM;AACzC,IAAAnB,EAAEzC,CAAA,IAAK4D;AAAA,EACX;AACA,SAAOnB;AACX,GAAG,GAECsG,KAAM,WAAY;AAClB,MAAInF,IAAI;AACR,SAAO;AAAA,IACH,GAAG,SAAUvB,GAAG;AAGZ,eADI2G,IAAKpF,GACA5D,IAAI,GAAGA,IAAIqC,EAAE,QAAQ,EAAErC,EAC5B,CAAAgJ,IAAKH,GAAMG,IAAK,MAAO3G,EAAErC,CAAA,CAAA,IAAOgJ,MAAO;AAC3C,MAAApF,IAAIoF;AAAA,IACR;AAAA,IACA,GAAG,WAAY;AAAE,aAAO,CAACpF;AAAA,IAAG;AAAA,EAChC;AACJ,GAyBIqF,KAAO,SAAU1E,GAAK8C,GAAKJ,GAAKC,GAAMC,GAAI;AAC1C,MAAI,CAACA,MACDA,IAAK,EAAE,GAAG,EAAE,GACRE,EAAI,aAAY;AAChB,QAAI6B,IAAO7B,EAAI,WAAW,SAAS,MAAM,GACrC8B,IAAS,IAAI7J,EAAG4J,EAAK,SAAS3E,EAAI,MAAM;AAC5C,IAAA4E,EAAO,IAAID,CAAI,GACfC,EAAO,IAAI5E,GAAK2E,EAAK,MAAM,GAC3B3E,IAAM4E,GACNhC,EAAG,IAAI+B,EAAK;AAAA,EAChB;AAEJ,SAAOpC,GAAKvC,GAAK8C,EAAI,SAAS,OAAO,IAAIA,EAAI,OAAOA,EAAI,OAAO,OAAQF,EAAG,IAAI,KAAK,KAAK,KAAK,IAAI,GAAG,KAAK,IAAI,IAAI,KAAK,IAAI5C,EAAI,MAAM,CAAC,CAAC,IAAI,GAAG,IAAI,KAAO,KAAK8C,EAAI,KAAMJ,GAAKC,GAAMC,CAAE;AACxL,GAEIiC,KAAM,SAAUxG,GAAG7C,GAAG;AACtB,MAAIuC,IAAI,CAAC;AACT,WAASwG,KAAKlG,EACV,CAAAN,EAAEwG,CAAA,IAAKlG,EAAEkG,CAAA;AACb,WAASA,KAAK/I,EACV,CAAAuC,EAAEwG,CAAA,IAAK/I,EAAE+I,CAAA;AACb,SAAOxG;AACX,GA4II+G,IAAS,SAAUhH,GAAGtC,GAAGqB,GAAG;AAC5B,SAAOA,GAAG,EAAErB,EACR,CAAAsC,EAAEtC,CAAA,IAAKqB,GAAGA,OAAO;AACzB;AAqLA,SAAgBkI,GAAYC,GAAMC,GAAM;AACpC,SAAOP,GAAKM,GAAMC,KAAQ,CAAC,GAAG,GAAG,CAAC;AACtC;AAkfA,IAAIC,KAAO,SAAUpH,GAAGV,GAAGc,GAAGH,GAAG;AAC7B,WAASwG,KAAKzG,GAAG;AACb,QAAIqH,IAAMrH,EAAEyG,CAAA,GAAIpF,IAAI/B,IAAImH,GAAGa,IAAKrH;AAChC,IAAI,MAAM,QAAQoH,CAAG,MACjBC,IAAKP,GAAI9G,GAAGoH,EAAI,CAAA,CAAE,GAAGA,IAAMA,EAAI,CAAA,IAC/B,YAAY,OAAOA,CAAG,IACtBjH,EAAEiB,CAAA,IAAK,CAACgG,GAAKC,CAAE,KAEflH,EAAEiB,KAAK,GAAA,IAAO,CAAC,IAAIpE,EAAG,CAAC,GAAGqK,CAAE,GAC5BF,GAAKC,GAAKhG,GAAGjB,GAAGH,CAAC;AAAA,EAEzB;AACJ,GAEIsH,KAAK,OAAO,cAAe,OAA6B,oBAAI,YAAY,GAExEC,KAAK,OAAO,cAAe,OAA6B,oBAAI,YAAY,GAExEC,KAAM;AACV,IAAI;AACA,EAAAD,GAAG,OAAOlH,IAAI,EAAE,QAAQ,GAAK,CAAC,GAC9BmH,KAAM;AACV,QACU;AAAE;AAwGZ,SAAgBC,GAAQC,GAAKC,GAAQ;AACjC,MAAIA,GAAQ;AAER,aADIC,IAAO,IAAI5K,EAAG0K,EAAI,MAAM,GACnBhK,IAAI,GAAGA,IAAIgK,EAAI,QAAQ,EAAEhK,EAC9B,CAAAkK,EAAKlK,CAAA,IAAKgK,EAAI,WAAWhK,CAAC;AAC9B,WAAOkK;AAAA,EACX;AACA,MAAIN,GACA,QAAOA,GAAG,OAAOI,CAAG;AAKxB,WAJIlJ,IAAIkJ,EAAI,QACRG,IAAK,IAAI7K,EAAG0K,EAAI,UAAUA,EAAI,UAAU,EAAE,GAC1CI,IAAK,GACLnG,IAAI,SAAU7C,GAAG;AAAE,IAAA+I,EAAGC,GAAA,IAAQhJ;AAAA,EAAG,GAC5BpB,IAAI,GAAGA,IAAIc,GAAG,EAAEd,GAAG;AACxB,QAAIoK,IAAK,IAAID,EAAG,QAAQ;AACpB,UAAIzG,IAAI,IAAIpE,EAAG8K,IAAK,KAAMtJ,IAAId,KAAM,EAAE;AACtC,MAAA0D,EAAE,IAAIyG,CAAE,GACRA,IAAKzG;AAAA,IACT;AACA,QAAI,IAAIsG,EAAI,WAAWhK,CAAC;AACxB,IAAI,IAAI,OAAOiK,IACXhG,EAAE,CAAC,IACE,IAAI,QACTA,EAAE,MAAO,KAAK,CAAE,GAAGA,EAAE,MAAO,IAAI,EAAG,KAC9B,IAAI,SAAS,IAAI,SACtB,IAAI,SAAS,IAAI,WAAe+F,EAAI,WAAW,EAAEhK,CAAC,IAAI,MAClDiE,EAAE,MAAO,KAAK,EAAG,GAAGA,EAAE,MAAQ,KAAK,KAAM,EAAG,GAAGA,EAAE,MAAQ,KAAK,IAAK,EAAG,GAAGA,EAAE,MAAO,IAAI,EAAG,MAE7FA,EAAE,MAAO,KAAK,EAAG,GAAGA,EAAE,MAAQ,KAAK,IAAK,EAAG,GAAGA,EAAE,MAAO,IAAI,EAAG;AAAA,EACtE;AACA,SAAOrC,GAAIuI,GAAI,GAAGC,CAAE;AACxB;AA0DA,IAAIC,KAAO,SAAUC,GAAI;AACrB,MAAIvJ,IAAK;AACT,MAAIuJ,EACA,UAASxB,KAAKwB,GAAI;AACd,QAAIxJ,IAAIwJ,EAAGxB,CAAA,EAAG;AACd,IAAIhI,IAAI,SACJkB,EAAI,CAAC,GACTjB,KAAMD,IAAI;AAAA,EACd;AAEJ,SAAOC;AACX,GAEIwJ,KAAM,SAAUlI,GAAGtC,GAAGyK,GAAGC,GAAIC,GAAG9G,GAAG+G,GAAI3J,GAAI;AAC3C,MAAIZ,IAAKqK,EAAG,QAAQH,IAAKE,EAAE,OAAOI,IAAM5J,KAAMA,EAAG,QAC7C6J,IAAMR,GAAKC,CAAE;AACjB,EAAAjB,EAAOhH,GAAGtC,GAAG4K,KAAM,OAAO,WAAY,QAAS,GAAG5K,KAAK,GACnD4K,KAAM,SACNtI,EAAEtC,GAAA,IAAO,IAAIsC,EAAEtC,GAAA,IAAOyK,EAAE,KAC5BnI,EAAEtC,CAAA,IAAK,IAAIA,KAAK,GAChBsC,EAAEtC,GAAA,IAAQyK,EAAE,QAAQ,KAAM5G,IAAI,KAAK,IAAIvB,EAAEtC,GAAA,IAAO2K,KAAK,GACrDrI,EAAEtC,GAAA,IAAOyK,EAAE,cAAc,KAAKnI,EAAEtC,GAAA,IAAOyK,EAAE,eAAe;AACxD,MAAIpH,IAAK,IAAI,KAAKoH,EAAE,SAAS,OAAO,KAAK,IAAI,IAAIA,EAAE,KAAK,GAAGM,IAAI1H,EAAG,YAAY,IAAI;AAkBlF,OAjBI0H,IAAI,KAAKA,IAAI,QACb9I,EAAI,EAAE,GACVqH,EAAOhH,GAAGtC,GAAI+K,KAAK,KAAQ1H,EAAG,SAAS,IAAI,KAAM,KAAOA,EAAG,QAAQ,KAAK,KAAOA,EAAG,SAAS,KAAK,KAAOA,EAAG,WAAW,KAAK,IAAMA,EAAG,WAAW,KAAK,CAAE,GAAGrD,KAAK,GACzJ6D,KAAK,OACLyF,EAAOhH,GAAGtC,GAAGyK,EAAE,GAAG,GAClBnB,EAAOhH,GAAGtC,IAAI,GAAG6D,IAAI,IAAI,CAACA,IAAI,IAAIA,CAAC,GACnCyF,EAAOhH,GAAGtC,IAAI,GAAGyK,EAAE,IAAI,IAE3BnB,EAAOhH,GAAGtC,IAAI,IAAIK,CAAE,GACpBiJ,EAAOhH,GAAGtC,IAAI,IAAI8K,CAAG,GAAG9K,KAAK,IACzB4K,KAAM,SACNtB,EAAOhH,GAAGtC,GAAG6K,CAAG,GAChBvB,EAAOhH,GAAGtC,IAAI,GAAGyK,EAAE,KAAK,GACxBnB,EAAOhH,GAAGtC,IAAI,IAAI4K,CAAE,GAAG5K,KAAK,KAEhCsC,EAAE,IAAIoI,GAAI1K,CAAC,GACXA,KAAKK,GACDyK,EACA,UAAS/B,KAAKwB,GAAI;AACd,QAAIS,IAAMT,EAAGxB,CAAA,GAAIhI,IAAIiK,EAAI;AACzB,IAAA1B,EAAOhH,GAAGtC,GAAG,CAAC+I,CAAC,GACfO,EAAOhH,GAAGtC,IAAI,GAAGe,CAAC,GAClBuB,EAAE,IAAI0I,GAAKhL,IAAI,CAAC,GAAGA,KAAK,IAAIe;AAAA,EAChC;AAEJ,SAAI8J,MACAvI,EAAE,IAAIrB,GAAIjB,CAAC,GAAGA,KAAK6K,IAChB7K;AACX,GAEIiL,KAAM,SAAU1I,GAAGvC,GAAG6D,GAAGvB,GAAGP,GAAG;AAC/B,EAAAuH,EAAO/G,GAAGvC,GAAG,SAAS,GACtBsJ,EAAO/G,GAAGvC,IAAI,GAAG6D,CAAC,GAClByF,EAAO/G,GAAGvC,IAAI,IAAI6D,CAAC,GACnByF,EAAO/G,GAAGvC,IAAI,IAAIsC,CAAC,GACnBgH,EAAO/G,GAAGvC,IAAI,IAAI+B,CAAC;AACvB;AAoXA,SAAgBmJ,GAAQ1B,GAAMC,GAAM;AAChC,EAAKA,MACDA,IAAO,CAAC;AACZ,MAAI,IAAI,CAAC,GACL0B,IAAQ,CAAC;AACb,EAAAzB,GAAKF,GAAM,IAAI,GAAGC,CAAI;AACtB,MAAIlH,IAAI,GACJ6I,IAAM;AACV,WAASV,KAAM,GAAG;AACd,QAAItK,IAAK,EAAEsK,CAAA,GAAKW,IAAOjL,EAAG,CAAA,GAAIwB,IAAIxB,EAAG,CAAA,GACjCkL,IAAc1J,EAAE,SAAS,IAAI,IAAI,GACjC6I,IAAIT,GAAQU,CAAE,GAAG5I,IAAI2I,EAAE,QACvBc,IAAM3J,EAAE,SAASN,IAAIiK,KAAOvB,GAAQuB,CAAG,GAAGC,IAAKlK,KAAKA,EAAE,QACtDwJ,IAAMR,GAAK1I,EAAE,KAAK;AACtB,IAAIE,IAAI,SACJG,EAAI,EAAE;AACV,QAAIK,IAAIgJ,IAAc/B,GAAY8B,GAAMzJ,CAAC,IAAIyJ,GAAMtK,IAAIuB,EAAE,QACrDuB,IAAImF,GAAI;AACZ,IAAAnF,EAAE,EAAEwH,CAAI,GACRF,EAAM,KAAK9B,GAAIzH,GAAG;AAAA,MACd,MAAMyJ,EAAK;AAAA,MACX,KAAKxH,EAAE,EAAE;AAAA,MACT,GAAGvB;AAAA,MACA,GAAAmI;AAAA,MACA,GAAAnJ;AAAA,MACH,GAAGQ,KAAK4I,EAAG,UAAWpJ,KAAMiK,EAAI,UAAUC;AAAA,MACvC,GAAAjJ;AAAA,MACU,aAAA+I;AAAA,IACjB,CAAC,CAAC,GACF/I,KAAK,KAAKT,IAAIgJ,IAAM/J,GACpBqK,KAAO,KAAK,KAAKtJ,IAAIgJ,MAAQU,KAAM,KAAKzK;AAAA,EAC5C;AAEA,WADIuD,IAAM,IAAI/E,EAAG6L,IAAM,EAAE,GAAGK,IAAKlJ,GAAGmJ,IAAMN,IAAM7I,GACvCtC,IAAI,GAAGA,IAAIkL,EAAM,QAAQ,EAAElL,GAAG;AACnC,QAAIwK,IAAIU,EAAMlL,CAAA;AACd,IAAAuK,GAAIlG,GAAKmG,EAAE,GAAGA,GAAGA,EAAE,GAAGA,EAAE,GAAGA,EAAE,EAAE,MAAM;AACrC,QAAIkB,IAAO,KAAKlB,EAAE,EAAE,SAASH,GAAKG,EAAE,KAAK;AACzC,IAAAnG,EAAI,IAAImG,EAAE,GAAGA,EAAE,IAAIkB,CAAI,GACvBnB,GAAIlG,GAAK/B,GAAGkI,GAAGA,EAAE,GAAGA,EAAE,GAAGA,EAAE,EAAE,QAAQA,EAAE,GAAGA,EAAE,CAAC,GAAGlI,KAAK,KAAKoJ,KAAQlB,EAAE,IAAIA,EAAE,EAAE,SAAS;AAAA,EACzF;AACA,SAAAQ,GAAI3G,GAAK/B,GAAG4I,EAAM,QAAQO,GAAKD,CAAE,GAC1BnH;AACX;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;A,GCpxEMiJ,KAAUrO,GAAI,SAmBdsO,KAAoC;AAAA,EACtC,MAAM;AAAA,EACN,MAAM;AAAA,EACN,KAAK;AAAA,EACL,KAAK;AAAA,EACL,KAAK;AAAA,EACL,MAAM;AAAA,EACN,KAAK;AAAA,EACL,KAAK;AAAA,EACL,KAAK;AAAA,EACL,MAAM;AAAA,EACN,KAAK;AAAA,EACL,MAAM;AAAA,EACN,KAAK;AAAA,EACL,KAAK;AAAA,EACL,KAAK;AAAA,EACL,KAAK;AAAA,EACL,MAAM;AAAA,EACN,KAAK;AAAA,EACL,MAAM;AAAA,EACN,KAAK;AAAA,EACL,KAAK;AAAA,EACL,KAAK;AAAA,EACL,MAAM;AAAA,EACN,KAAK;AAAA,EACL,KAAK;AAAA,EACL,KAAK;AAAA,EACL,MAAM;AAAA,EACN,OAAO;AAAA,EACP,KAAK;AAAA,EACL,MAAM;AAAA,EACN,KAAK;AACT,GAEaC,KAAA,CAAeC,MACxBF,GAAUE,EAAK,MAAM,GAAG,EAAE,IAAI,GAAG,YAAY,KAAK,EAAA,KAAO,4BAIhDC,KAAA,CAAsBD,MAAiB;AAChD,QAAME,IAAaF,EAAK,QAAQ,OAAO,GAAG,EAAE,QAAQ,YAAY,EAAE;AAClE,MAAI,CAACE,KAAcA,EAAW,WAAW,GAAG,KAAK,WAAW,KAAKA,CAAU,KAAKA,EAAW,MAAM,GAAG,EAAE,SAAS,IAAI,EAC/G,OAAM,IAAI,MAAM,uBAAuBF,CAAA,EAAM;AAEjD,SAAOE;AACX,GAEMC,KAAA,CAAYC,MAAsB;AACpC,MAAIC,IAAS;AAEb,WAASC,IAAI,GAAGA,IAAIF,EAAM,QAAQE,KAAK,MACnC,CAAAD,KAAU,OAAO,aAAa,GAAGD,EAAM,SAASE,GAAGA,IAAI,KAAS,CAAC;AAErE,SAAO,KAAKD,CAAM;AACtB,GAGME,KAAA,CAAkBC,MAAmB,KAAK,UAAUA,CAAK,EAAE,QAAQ,MAAM,SAAS,GAE3EC,KAAgB,OAAOC,GAAuBC,IAA+C,OAA4B;AAElI,QAAMC,IAA0B,OAAOD,KAAuB,YACxD,EAAE,WAAWA,EAAmB,IAChCA,GAEAE,IAAiC,CAAC,GAClCC,IAASJ,EAAM,UAAU,GAEzBK,IAAc;AAAA;AAAA,uBAAgClB,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAC9CmB,IAAaF,EAAO,gBAAgB,IAAA,CAAIG,MAAU,gBAAgBA,CAAA,cAAmB,EAAE,KAAK;AAAA,CAAI,GAChGC,IAAiBJ,EAAO,oBAAoB,IAAA,CAAIK,MAAS,gCAAgCA,CAAA,KAAU,EAAE,KAAK;AAAA,CAAI,GAC9GC,IAAc3P,GAAW,SAAS,IAAI;AAAA;AAAA,IAASC,GAAQ,SAAS,GAEhE6P,IAAU,MAAMb,EAAM,MAAM,GAE5Bc,IAAqC,CAAC;AAC5C,aAAW,CAACxB,GAAMI,CAAA,KAAU,OAAO,QAAQQ,EAAQ,UAAU,CAAC,CAAC,EAC3D,CAAAY,EAAOvB,GAAmBD,CAAI,CAAA,IAAKI;AAEvC,QAAMqB,IAAY,OAAO,KAAKD,CAAM,EAAE,SAAS;AAC/C,MAAIE,IAAe,IAKfC,GACAC,GACAC;AAEJ,MAAIjB,EAAQ;AAMR,QAJAe,IAAe;AAAA,IAAcP,IAAc;AAAA,eAC3CQ,IAAiB;AAAA,IAAejQ,KAAiB;AAAA,iBACjDkQ,IAAe;AAAA,IAAeN,IAAU;AAAA,iBAEpCE,GAAW;AAEX,YAAMM,IAAW,OAAO,YAAY,OAAO,QAAQP,CAAM,EAAE,IAAA,CAAK,CAACxB,GAAMI,CAAA,MACnE,CAACJ,GAAM,QAAQD,GAAYC,CAAI,CAAA,WAAYG,GAASC,CAAK,CAAA,EAAG,CAAC,CAAC;AAClE,MAAAyB,KAAgB;AAAA;AAAA,2BAA4CtB,GAAewB,CAAQ,IAAI;AAAA,iBACvFL,IAAe;AAAA,IACnB;AAAA;AAGA,IAAAC,IAAe,6CACfC,IAAiB,sDACjBC,IAAe,qCAEfhB,EAAO,UAAA,IAAcU,GACrBV,EAAO,2BAAA,IAA+BlP,IACtCkP,EAAO,WAAA,IAAeO;AAG1B,MAAIY,IAAWpQ,GAAiB,SAAS;AACzC,SAAAoQ,IAAWA,EAAS,QAAQ,iBAAA,MAAuBjB,CAAW,GAC9DiB,IAAWA,EAAS,QAAQ,kBAAA,MAAwBlB,EAAO,KAAK,GAChEkB,IAAWA,EAAS,QAAQ,oBAAA,MAA0BhB,CAAU,GAChEgB,IAAWA,EAAS,QAAQ,wBAAA,MAA8Bd,CAAc,GACxEc,IAAWA,EAAS,QAAQ,0BAAA,MAAgCL,CAAY,GACxEK,IAAWA,EAAS,QAAQ,4BAAA,MAAkCJ,CAAc,GAC5EI,IAAWA,EAAS,QAAQ,0BAAA,MAAgCH,CAAY,GACxEG,IAAWA,EAAS,QAAQ,qCAAA,CAAsCE,GAAGC,MAAmBT,IAAe;AAAA,IAAOS,IAAST,IAAe,EAAE,GAExIb,EAAO,YAAA,IAAgBmB,GAEhB;AAAA,IACH,OAAOnB;AAAA,IACP,KAAMD,EAAQ,YAAwBwB,GAAQ;AAAA,MAE1C,GAAIxB,EAAQ,aAAa,CAAC,IAAIY;AAAA,MAE9B,GAAG,OAAO,YACN,OAAO,QAAQX,CAAM,EAAE,IAAA,CAAK,CAACzB,GAAMiD,CAAA,MAAU,CAACjD,GAAMkD,GAAQD,CAAI,CAAC,CAAC,CACtE;AAAA,IACJ,CAAC,IAPyB;AAAA,EAQ9B;AACJ"}
1
+ {"version":3,"file":"packager.js","names":["version","pkg","pkg","runtimeCss","pageCss","squiffyRuntime","htmlTemplateFile","u8","u16","i32","fleb","fdeb","clim","freb","eb","start","b","i","j","_a","fl","revfl","_b","fd","revfd","rev","x","hMap","cd","mb","r","s","l","le","co","rvb","sv","r_1","v","m","flt","fdt","flm","fdm","shft","p","slc","e","ec","err","ind","msg","nt","wbits","d","o","wbits16","hTree","t2","et","a","i0","i1","i2","maxSym","tr","mbt","ln","dt","lft","cst","i2_1","i2_2","i2_3","n","lc","c","cl","cli","cln","cls","w","clen","cf","wfblk","out","pos","dat","wblk","final","syms","lf","df","li","bs","bl","dlt","mlb","ddt","mdb","_c","lclt","nlc","_d","lcdt","ndc","lcfreq","_e","lct","mlcb","nlcc","flen","ftlen","dtlen","lm","ll","dm","dl","llm","lcts","it","clct","len","sym","dst","deo","dflt","lvl","plvl","pre","post","st","lst","opt","msk_1","prev","head","bs1_1","bs2_1","hsh","lc_1","wi","hv","imod","pimod","rem","ch_1","dif","maxn","maxd","ml","nl","mmd","md","ti","lin","din","crct","t","k","crc","cr","dopt","dict","newDat","mrg","wbytes","deflateSync","data","opts","fltn","val","op","te","td","tds","strToU8","str","latin1","ar_1","ar","ai","exfl","ex","wzh","f","fn","u","ce","col","exl","y","exf","wzf","zipSync","files","tot","file","compression","com","ms","oe","cdl","badd","noBrackets","nested","inner","balancedTarget","PAGE_STRINGS","name$1","version$3","description$1","author$1","contributors$1","repository$1","devDependencies$1","scripts$1","main$1","types$1","exports","files$1","type$1","package_default$1","name$1","version$3","description$1","author$1","contributors$1","repository$1","version$2","ParseError","tokenize","source","tokens","i","c","value","j","m","two","op","keywords","ScriptParser","names","offset","text","t","inBlock","result","body","start","stmt","e","depth","startToken","first","last","src","branches","otherwise","cases","values","second","twoWord","args","save","target","fn","callback","end","items","level","left","best","name","parts","words","w","squiffy_runtime_global_default","squiffy_runtime_default","index_template_default","squiffy_page_default","version$1","repository","publishConfig","main","types","scripts","author","contributors","dependencies","devDependencies","files","type","package_default","name","version$1","repository","publishConfig","main","types","scripts","author","contributors","version","mimeTypes","getMimeType","path","normaliseAssetPath","normalised","toBase64","bytes","binary","i","escapeAttribute","text","c","scriptSafeJson","value","createPackage","input","createZipOrOptions","options","output","uiInfo","infoComment","combinedCss","squiffy_runtime_default","squiffy_page_default","storyJs","assets","inlined","inlineText","scriptData","script","stylesheetData","sheet","assetOptions","styleContent","runtimeContent","storyContent","squiffy_runtime_global_default","dataUris","htmlData","index_template_default","_","button","strings","PAGE_STRINGS","match","indent","zipSync","strToU8"],"sources":["../../node_modules/fflate/esm/browser.js","../../compiler/dist/text.js","../../compiler/dist/project.js","../../compiler/dist/emit.js","../../compiler/dist/quest/script.js","../src/packager.ts"],"sourcesContent":["// DEFLATE is a complex format; to read this code, you should probably check the RFC first:\n// https://tools.ietf.org/html/rfc1951\n// You may also wish to take a look at the guide I made about this program:\n// https://gist.github.com/101arrowz/253f31eb5abc3d9275ab943003ffecad\n// Some of the following code is similar to that of UZIP.js:\n// https://github.com/photopea/UZIP.js\n// However, the vast majority of the codebase has diverged from UZIP.js to increase performance and reduce bundle size.\n// Sometimes 0 will appear where -1 would be more appropriate. This is because using a uint\n// is better for memory in most engines (I *think*).\nvar ch2 = {};\nvar wk = (function (c, id, msg, transfer, cb) {\n var w = new Worker(ch2[id] || (ch2[id] = URL.createObjectURL(new Blob([\n c + ';addEventListener(\"error\",function(e){e=e.error;postMessage({$e$:[e.message,e.code,e.stack]})})'\n ], { type: 'text/javascript' }))));\n w.onmessage = function (e) {\n var d = e.data, ed = d.$e$;\n if (ed) {\n var err = new Error(ed[0]);\n err['code'] = ed[1];\n err.stack = ed[2];\n cb(err, null);\n }\n else\n cb(null, d);\n };\n w.postMessage(msg, transfer);\n return w;\n});\n\n// aliases for shorter compressed code (most minifers don't do this)\nvar u8 = Uint8Array, u16 = Uint16Array, i32 = Int32Array;\n// fixed length extra bits\nvar fleb = new u8([0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0, /* unused */ 0, 0, /* impossible */ 0]);\n// fixed distance extra bits\nvar fdeb = new u8([0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, /* unused */ 0, 0]);\n// code length index map\nvar clim = new u8([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]);\n// get base, reverse index map from extra bits\nvar freb = function (eb, start) {\n var b = new u16(31);\n for (var i = 0; i < 31; ++i) {\n b[i] = start += 1 << eb[i - 1];\n }\n // numbers here are at max 18 bits\n var r = new i32(b[30]);\n for (var i = 1; i < 30; ++i) {\n for (var j = b[i]; j < b[i + 1]; ++j) {\n r[j] = ((j - b[i]) << 5) | i;\n }\n }\n return { b: b, r: r };\n};\nvar _a = freb(fleb, 2), fl = _a.b, revfl = _a.r;\n// we can ignore the fact that the other numbers are wrong; they never happen anyway\nfl[28] = 258, revfl[258] = 28;\nvar _b = freb(fdeb, 0), fd = _b.b, revfd = _b.r;\n// map of value to reverse (assuming 16 bits)\nvar rev = new u16(32768);\nfor (var i = 0; i < 32768; ++i) {\n // reverse table algorithm from SO\n var x = ((i & 0xAAAA) >> 1) | ((i & 0x5555) << 1);\n x = ((x & 0xCCCC) >> 2) | ((x & 0x3333) << 2);\n x = ((x & 0xF0F0) >> 4) | ((x & 0x0F0F) << 4);\n rev[i] = (((x & 0xFF00) >> 8) | ((x & 0x00FF) << 8)) >> 1;\n}\n// create huffman tree from u8 \"map\": index -> code length for code index\n// mb (max bits) must be at most 15\n// TODO: optimize/split up?\nvar hMap = (function (cd, mb, r) {\n var s = cd.length;\n // index\n var i = 0;\n // u16 \"map\": index -> # of codes with bit length = index\n var l = new u16(mb);\n // length of cd must be 288 (total # of codes)\n for (; i < s; ++i) {\n if (cd[i])\n ++l[cd[i] - 1];\n }\n // u16 \"map\": index -> minimum code for bit length = index\n var le = new u16(mb);\n for (i = 1; i < mb; ++i) {\n le[i] = (le[i - 1] + l[i - 1]) << 1;\n }\n var co;\n if (r) {\n // u16 \"map\": index -> number of actual bits, symbol for code\n co = new u16(1 << mb);\n // bits to remove for reverser\n var rvb = 15 - mb;\n for (i = 0; i < s; ++i) {\n // ignore 0 lengths\n if (cd[i]) {\n // num encoding both symbol and bits read\n var sv = (i << 4) | cd[i];\n // free bits\n var r_1 = mb - cd[i];\n // start value\n var v = le[cd[i] - 1]++ << r_1;\n // m is end value\n for (var m = v | ((1 << r_1) - 1); v <= m; ++v) {\n // every 16 bit value starting with the code yields the same result\n co[rev[v] >> rvb] = sv;\n }\n }\n }\n }\n else {\n co = new u16(s);\n for (i = 0; i < s; ++i) {\n if (cd[i]) {\n co[i] = rev[le[cd[i] - 1]++] >> (15 - cd[i]);\n }\n }\n }\n return co;\n});\n// fixed length tree\nvar flt = new u8(288);\nfor (var i = 0; i < 144; ++i)\n flt[i] = 8;\nfor (var i = 144; i < 256; ++i)\n flt[i] = 9;\nfor (var i = 256; i < 280; ++i)\n flt[i] = 7;\nfor (var i = 280; i < 288; ++i)\n flt[i] = 8;\n// fixed distance tree\nvar fdt = new u8(32);\nfor (var i = 0; i < 32; ++i)\n fdt[i] = 5;\n// fixed length map\nvar flm = /*#__PURE__*/ hMap(flt, 9, 0), flrm = /*#__PURE__*/ hMap(flt, 9, 1);\n// fixed distance map\nvar fdm = /*#__PURE__*/ hMap(fdt, 5, 0), fdrm = /*#__PURE__*/ hMap(fdt, 5, 1);\n// find max of array\nvar max = function (a) {\n var m = a[0];\n for (var i = 1; i < a.length; ++i) {\n if (a[i] > m)\n m = a[i];\n }\n return m;\n};\n// read d, starting at bit p and mask with m\nvar bits = function (d, p, m) {\n var o = (p / 8) | 0;\n return ((d[o] | (d[o + 1] << 8)) >> (p & 7)) & m;\n};\n// read d, starting at bit p continuing for at least 16 bits\nvar bits16 = function (d, p) {\n var o = (p / 8) | 0;\n return ((d[o] | (d[o + 1] << 8) | (d[o + 2] << 16)) >> (p & 7));\n};\n// get end of byte\nvar shft = function (p) { return ((p + 7) / 8) | 0; };\n// typed array slice - allows garbage collector to free original reference,\n// while being more compatible than .slice\nvar slc = function (v, s, e) {\n if (s == null || s < 0)\n s = 0;\n if (e == null || e > v.length)\n e = v.length;\n // can't use .constructor in case user-supplied\n return new u8(v.subarray(s, e));\n};\n/**\n * Codes for errors generated within this library\n */\nexport var FlateErrorCode = {\n UnexpectedEOF: 0,\n InvalidBlockType: 1,\n InvalidLengthLiteral: 2,\n InvalidDistance: 3,\n StreamFinished: 4,\n NoStreamHandler: 5,\n InvalidHeader: 6,\n NoCallback: 7,\n InvalidUTF8: 8,\n ExtraFieldTooLong: 9,\n InvalidDate: 10,\n FilenameTooLong: 11,\n StreamFinishing: 12,\n InvalidZipData: 13,\n UnknownCompressionMethod: 14\n};\n// error codes\nvar ec = [\n 'unexpected EOF',\n 'invalid block type',\n 'invalid length/literal',\n 'invalid distance',\n 'stream finished',\n 'no stream handler',\n , // determined by compression function\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[0]) {\n strm.push(ev.data[0], ev.data[1]);\n postMessage([ev.data[0].length]);\n }\n else\n strm.flush(ev.data[1]);\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 // can fail for cross-realm Uint8Array, but ok - only a small performance penalty\n w.postMessage([d, t = f], d.buffer instanceof ArrayBuffer ? [d.buffer] : []);\n };\n strm.terminate = function () { w.terminate(); };\n if (flush) {\n strm.flush = function (sync) { w.postMessage([0, sync]); };\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; };\n// read 8 bytes\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 if (final) {\n // cleanup unneeded buffers/state to reduce memory usage\n this.s = this.o = {};\n this.b = et;\n }\n };\n /**\n * Flushes buffered uncompressed data. Useful to immediately retrieve the\n * deflated output for small inputs.\n * @param sync Whether to flush to a byte boundary. A sync flush takes 4-5\n * extra bytes, but guarantees all pushed data is immediately\n * decompressible. A separate DEFLATE stream may be concatenated\n * with the current output after a sync flush.\n */\n Deflate.prototype.flush = function (sync) {\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 // could technically skip writing the type-0 block for (this.s.r & 7) == 0,\n // but the deterministic trailer (00 00 FF FF) is useful in some situations\n if (sync) {\n var c = new u8(6);\n c[0] = this.s.r >> 3;\n // write empty, non-final type-0 block\n var ep = wfblk(c, this.s.r, et);\n this.s.r = 0;\n this.ondata(c.subarray(0, ep >> 3), false);\n }\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}\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 * @param sync Whether to flush to a byte boundary. A sync flush takes 4-5\n * extra bytes, but guarantees all pushed data is immediately\n * decompressible.\n */\n Gzip.prototype.flush = function (sync) {\n Deflate.prototype.flush.call(this, sync);\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, 0);\n // process concatenated GZIP\n if (this.s.f && !this.s.l) {\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 else if (final) {\n Inflate.prototype.c.call(this, 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}\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 * @param sync Whether to flush to a byte boundary. A sync flush takes 4-5\n * extra bytes, but guarantees all pushed data is immediately\n * decompressible.\n */\n Zlib.prototype.flush = function (sync) {\n Deflate.prototype.flush.call(this, sync);\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}\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 (ArrayBuffer.isView(val))\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), efl = b2(d, b + 30), fn = strFromU8(d.subarray(b + 46, b + 46 + fnl), !(b2(d, b + 8) & 2048)), es = b + 46 + fnl;\n var _a = z64hs(d, es, efl, z, b4(d, b + 20), b4(d, b + 24), b4(d, b + 42)), sc = _a[0], su = _a[1], off = _a[2];\n return [b2(d, b + 10), sc, su, fn, es + efl + b2(d, b + 32), off];\n};\n// read zip64 header sizes\nvar z64hs = function (d, b, l, z, sc, su, off) {\n var nsc = sc == 4294967295, nsu = su == 4294967295, noff = off == 4294967295, e = b + l;\n var nf = nsc + nsu + noff;\n if (z && nf) {\n for (; b + 4 < e; b += 4 + b2(d, b + 2)) {\n if (b2(d, b) == 1) {\n return [\n nsc ? b8(d, b + 4 + 8 * nsu) : sc,\n nsu ? b8(d, b + 4) : su,\n noff ? b8(d, b + 4 + 8 * (nsu + nsc)) : off,\n 1\n ];\n }\n }\n // z == 2 for unknown whether or not zip64\n if (z < 2)\n err(13);\n }\n return [sc, su, off, 0];\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 // we shouldn't really do this cast, but properly handling ArrayBufferLike\n // makes the API unergonomic with Buffer\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 (chunk, final) {\n // same as ZipPassThrough: cast to retain Buffer ergonomics\n this.ondata(null, chunk, 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 (chunk, final) {\n try {\n this.i.push(chunk, 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 (chunk, final) {\n if (this.i.terminate)\n chunk = slc(chunk, 0);\n this.i.push(chunk, 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 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 lsc = b4(buf, i + 18), lsu = b4(buf, i + 22);\n var fn_1 = strFromU8(buf.subarray(i + 30, i += 30 + fnl), !u);\n var _a = z64hs(buf, i, es, 2, lsc, lsu, 0), sc_1 = _a[0], su_1 = _a[1], z64 = _a[3];\n if (dd)\n sc_1 = -1 - z64;\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 = b4(data, e - 20) == 0x7064B50;\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 = b4(data, e - 20) == 0x7064B50;\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","// Converts the links in a section's or passage's text into Handlebars helpers, and records\n// where each link and embed was in the original text.\n//\n// The conversion is a series of regex replacements, each running on the output of the one\n// before, and the exact order matters (for example, [[a]](b) has to be converted before [a](b)\n// would match inside it). So rather than parse links some other way, this runs exactly those\n// replacements, and keeps a map from each position in the current string back to the original\n// text, so that what each regex matched can be traced to where it was written.\nclass MappedString {\n constructor(original) {\n Object.defineProperty(this, \"original\", {\n enumerable: true,\n configurable: true,\n writable: true,\n value: original\n });\n Object.defineProperty(this, \"value\", {\n enumerable: true,\n configurable: true,\n writable: true,\n value: void 0\n });\n Object.defineProperty(this, \"segments\", {\n enumerable: true,\n configurable: true,\n writable: true,\n value: void 0\n });\n this.value = original;\n this.segments = original.length\n ? [{ start: 0, end: original.length, origStart: 0, origEnd: original.length, copied: true }]\n : [];\n }\n // Like String.replace with a global regex, except the callback gets the match's offset.\n replace(regex, replacer) {\n const replacements = [];\n this.value = this.value.replace(regex, (...args) => {\n // The callback's arguments are the match, the groups, the offset and the whole string.\n // None of these regexes have named groups, so there's no groups object after those.\n const offset = args[args.length - 2];\n const match = args.slice(0, args.length - 2);\n const text = replacer(match, offset);\n replacements.push({ start: offset, end: offset + match[0].length, text });\n return text;\n });\n if (replacements.length) {\n this.applyToSegments(replacements);\n }\n }\n applyToSegments(replacements) {\n const segments = [];\n let newPos = 0;\n const copyRange = (from, to) => {\n for (const s of this.segments) {\n const start = Math.max(s.start, from);\n const end = Math.min(s.end, to);\n if (start >= end)\n continue;\n const length = end - start;\n segments.push(s.copied\n ? { start: newPos, end: newPos + length, origStart: s.origStart + start - s.start, origEnd: s.origStart + end - s.start, copied: true }\n : { start: newPos, end: newPos + length, origStart: s.origStart, origEnd: s.origEnd, copied: false });\n newPos += length;\n }\n };\n let oldPos = 0;\n for (const r of replacements) {\n copyRange(oldPos, r.start);\n const origStart = this.mapStart(r.start);\n const origEnd = this.mapEnd(r.end);\n if (r.text.length) {\n segments.push({\n start: newPos,\n end: newPos + r.text.length,\n origStart,\n origEnd,\n copied: r.text === this.original.substring(origStart, origEnd),\n });\n newPos += r.text.length;\n }\n oldPos = r.end;\n }\n copyRange(oldPos, Infinity);\n this.segments = segments;\n }\n // Maps the start of a range in the current string to the original string.\n mapStart(pos) {\n const s = this.find(seg => seg.end > pos);\n if (!s)\n return this.original.length;\n if (pos < s.start)\n return s.origStart;\n return s.copied ? s.origStart + pos - s.start : s.origStart;\n }\n // Maps the (exclusive) end of a range in the current string to the original string.\n mapEnd(pos) {\n const s = this.find(seg => seg.end >= pos);\n if (!s)\n return this.original.length;\n if (pos <= s.start)\n return s.origStart;\n return s.copied ? s.origStart + pos - s.start : s.origEnd;\n }\n // Binary search for the first segment matching a predicate that's monotonic in segment order.\n find(predicate) {\n let low = 0;\n let high = this.segments.length;\n while (low < high) {\n const mid = (low + high) >> 1;\n if (predicate(this.segments[mid]))\n high = mid;\n else\n low = mid + 1;\n }\n return this.segments[low];\n }\n}\n// The target is everything before the first comma, and the setters everything after it. With\n// expressions, they're kept as written, since a setter can contain commas in quotes, and the\n// runtime splits them. Without, a space is added after each comma, as Squiffy 6 did.\nfunction extractLinkFunctions(link, expressions) {\n if (!expressions) {\n const fragments = link.split(\",\");\n return {\n target: fragments[0].trim(),\n setters: fragments.slice(1).join(\", \")\n };\n }\n const comma = link.indexOf(\",\");\n return {\n target: (comma == -1 ? link : link.substring(0, comma)).trim(),\n setters: comma == -1 ? \"\" : link.substring(comma + 1),\n };\n}\nfunction getAdditionalLinkParameters(link, expressions) {\n const functions = extractLinkFunctions(link, expressions);\n let additionalParameters = \"\";\n if (functions.setters.trim().length > 0) {\n additionalParameters += ` set=\"${escapeForHandlebarsString(functions.setters)}\"`;\n }\n return {\n target: functions.target,\n additionalParameters\n };\n}\n// Text with balanced brackets, nested up to three deep, as few characters as possible\nconst noBrackets = \"[^()]\";\nconst nested = (inner) => `\\\\((?:${noBrackets}|${inner})*\\\\)`;\nexport const balancedTarget = `(?:${noBrackets}|${nested(nested(nested(noBrackets)))})*?`;\nfunction escapeForHandlebarsString(s) {\n return s.replace(/\\\\/g, \"\\\\\\\\\").replace(/\"/g, '\\\\\"');\n}\n// getNextSectionName returns the section after this one, for [[text>]] links, or null if\n// there isn't one.\n// expressions: whether link setters take expressions (see AnalyseSettings.expressions)\nexport function transformText(text, getNextSectionName, expressions = false) {\n const input = new MappedString(text);\n const links = [];\n const embeds = [];\n const noNextSection = [];\n // Records a link, given the offset of its match and of its target group in the current string.\n const addLink = (link, matchStart, matchLength, targetStart, targetLength) => {\n links.push({\n ...link,\n start: input.mapStart(matchStart),\n end: input.mapEnd(matchStart + matchLength),\n targetStart: input.mapStart(targetStart),\n targetEnd: input.mapEnd(targetStart + targetLength),\n });\n };\n // Handlebars expressions can contain square brackets that aren't links, such as\n // {{someArray.[1]}} or {{someHelper \"[x]\"}}, so swap each one for a placeholder while\n // converting links. Text between block helpers like {{#if x}}...{{/if}} is still converted. A\n // comment ends at --}}, and can have }} and links in it before that.\n const mustaches = [];\n input.replace(/\\{\\{!--[\\s\\S]*?--\\}\\}|\\{\\{\\{[\\s\\S]*?\\}\\}\\}|\\{\\{[\\s\\S]*?\\}\\}/g, ([match]) => {\n mustaches.push(match);\n return `${mustaches.length - 1}`;\n });\n const restore = (s) => s.replace(/(\\d+)/g, (_match, i) => mustaches[Number(i)]);\n // A link's target, inside its (...). With expressions, a setter can have brackets in it, e.g.\n // [[Buy]](shop, gold -= (price - 1) * 2), so the target can contain balanced brackets, up to\n // three deep. Without, it ends at the first \")\", as in Squiffy 6.\n const target = expressions ? balancedTarget : \"(?:.*?)\";\n // nextSectionLinkRegex matches [[text>]] - a link to the next section. Followed by a (target),\n // it's a named link whose text ends with >, such as [[<i>Go in</i>]](cave).\n const nextSectionLinkRegex = /\\[\\[([^\\]]*?)>\\]\\](?!\\()/g;\n input.replace(nextSectionLinkRegex, ([match, rawText], offset) => {\n const text = restore(rawText);\n const nextSectionName = getNextSectionName();\n if (!nextSectionName) {\n noNextSection.push({ display: `[[${text}>]]`, start: input.mapStart(offset), end: input.mapEnd(offset + match.length) });\n return `[[${text}]]`; // fallback\n }\n addLink({ linkType: \"section\", form: \"next\", text, target: \"\" }, offset, match.length, offset + 2 + rawText.length, 0);\n return `{{section \"${escapeForHandlebarsString(nextSectionName)}\" text=\"${escapeForHandlebarsString(text)}\"}}`;\n });\n // namedNextSectionLinkRegex matches [[text]](>) or [[text]](>, setter=value)\n // - a named link where target starts with >\n const namedNextSectionLinkRegex = new RegExp(`\\\\[\\\\[([^\\\\]]*?)\\\\]\\\\]\\\\(>(${target})\\\\)`, \"g\");\n input.replace(namedNextSectionLinkRegex, ([match, rawText, rawRest], offset) => {\n const text = restore(rawText);\n const rest = restore(rawRest);\n const nextSectionName = getNextSectionName();\n if (!nextSectionName) {\n noNextSection.push({ display: `[[${text}]](>)`, start: input.mapStart(offset), end: input.mapEnd(offset + match.length) });\n return `[[${text}]]`; // fallback\n }\n addLink({ linkType: \"section\", form: \"next\", text, target: rest }, offset, match.length, offset + 2 + rawText.length + 4, rawRest.length);\n // rest could be empty or \", setter=value\"\n const parsedName = getAdditionalLinkParameters(nextSectionName + rest, expressions);\n return `{{section \"${escapeForHandlebarsString(parsedName.target)}\" text=\"${escapeForHandlebarsString(text)}\"${parsedName.additionalParameters}}}`;\n });\n // namedSectionLinkRegex matches:\n // open [[\n // any text - the link text\n // closing ]]\n // open bracket\n // any text - the name of the section\n // closing bracket\n const namedSectionLinkRegex = new RegExp(`\\\\[\\\\[([^\\\\]]*?)\\\\]\\\\]\\\\((${target})\\\\)`, \"g\");\n input.replace(namedSectionLinkRegex, ([match, rawText, rawName], offset) => {\n const text = restore(rawText);\n const name = restore(rawName);\n addLink({ linkType: \"section\", form: \"named\", text, target: name }, offset, match.length, offset + 2 + rawText.length + 3, rawName.length);\n const parsedName = getAdditionalLinkParameters(name, expressions);\n return `{{section \"${escapeForHandlebarsString(parsedName.target)}\" text=\"${escapeForHandlebarsString(text)}\"${parsedName.additionalParameters}}}`;\n });\n // namedPassageLinkRegex matches:\n // not preceded by ! (to avoid matching image links like ![alt](src))\n // open [\n // any text - the link text\n // closing ]\n // open bracket, but not http(s):// after it\n // any text - the name of the passage\n // closing bracket\n const namedPassageLinkRegex = new RegExp(`(?<!!)\\\\[([^\\\\]]*?)\\\\]\\\\(((?!https?:\\\\/\\\\/)${target})\\\\)`, \"g\");\n input.replace(namedPassageLinkRegex, ([match, rawText, rawName], offset) => {\n const text = restore(rawText);\n const name = restore(rawName);\n addLink({ linkType: \"passage\", form: \"named\", text, target: name }, offset, match.length, offset + 1 + rawText.length + 2, rawName.length);\n const parsedName = getAdditionalLinkParameters(name, expressions);\n return `{{passage \"${escapeForHandlebarsString(parsedName.target)}\" text=\"${escapeForHandlebarsString(text)}\"${parsedName.additionalParameters}}}`;\n });\n // unnamedSectionLinkRegex matches:\n // open [[\n // any text - the link text\n // closing ]]\n const unnamedSectionLinkRegex = /\\[\\[(.*?)\\]\\]/g;\n input.replace(unnamedSectionLinkRegex, ([match, rawName], offset) => {\n const name = restore(rawName);\n addLink({ linkType: \"section\", form: \"unnamed\", target: name }, offset, match.length, offset + 2, rawName.length);\n return `{{section \"${escapeForHandlebarsString(name)}\"}}`;\n });\n // unnamedPassageLinkRegex matches:\n // not preceded by ! (to avoid matching image links like ![alt])\n // open [\n // any text - the link text\n // closing ]\n // no bracket after\n const unnamedPassageLinkRegex = /(?<!!)\\[(.*?)\\]([^(]|$)/g;\n input.replace(unnamedPassageLinkRegex, ([match, rawName, suffix], offset) => {\n const name = restore(rawName);\n addLink({ linkType: \"passage\", form: \"unnamed\", target: name }, offset, match.length - suffix.length, offset + 1, rawName.length);\n return `{{passage \"${escapeForHandlebarsString(name)}\"}}${suffix}`;\n });\n input.replace(/(\\d+)/g, ([, i]) => mustaches[Number(i)]);\n // Matches {{embed \"name\"}} or {{goto 'name'}} with a literal name.\n const findNamed = (helper) => {\n const result = [];\n const regex = new RegExp(`\\\\{\\\\{~?\\\\s*${helper}\\\\s+([\"'])(.*?)\\\\1`, \"g\");\n let match;\n while ((match = regex.exec(input.value))) {\n const start = match.index;\n const end = start + match[0].length;\n const nameEnd = end - 1;\n const nameStart = nameEnd - match[2].length;\n result.push({\n name: match[2],\n start: input.mapStart(start),\n end: input.mapEnd(end),\n nameStart: input.mapStart(nameStart),\n nameEnd: input.mapEnd(nameEnd),\n });\n }\n return result;\n };\n embeds.push(...findNamed(\"embed\"));\n return { output: input.value, links, embeds, gotos: findNamed(\"goto\"), deactivates: findNamed(\"deactivate\"), noNextSection };\n}\n// Returns a function that converts an offset into lines.join(\"\\n\") to a position in the source file.\nexport function positionMapper(lines, lineLengths) {\n const starts = [];\n let pos = 0;\n for (const length of lineLengths) {\n starts.push(pos);\n pos += length + 1;\n }\n return (offset) => {\n let low = 0;\n let high = starts.length - 1;\n while (low < high) {\n const mid = (low + high + 1) >> 1;\n if (starts[mid] <= offset)\n low = mid;\n else\n high = mid - 1;\n }\n const source = lines[low];\n if (!source)\n return { line: 0, character: 0 };\n return { line: source.line, character: Math.min(offset - starts[low], source.length) };\n };\n}\n","// The squiffy.json project file, which makes a folder of .squiffy files one story:\n//\n// { \"version\": 1, \"main\": \"story.squiffy\", \"exclude\": [\"drafts/**\"] }\n//\n// Without it, a story is its main file plus whatever that @imports. With it, the story is every\n// .squiffy, .css and .js file in the folder and its subfolders, except those `exclude` matches:\n// the main file first, then the rest in path order. These are the rules the CLI, the Vite plugin,\n// the language service and the editor all share. They're pure functions, so each can supply its own file list.\nexport const PROJECT_FILENAME = \"squiffy.json\";\n// The newest project file format this version of Squiffy understands. It counts the file\n// format, not the Squiffy release, and only goes up when the meaning of a project changes.\nexport const PROJECT_FILE_VERSION = 1;\n// Where the project file's JSON schema is published\nexport const PROJECT_SCHEMA_URL = \"https://squiffystory.com/schema/squiffy.json\";\n// The icons a panel's button can have. The runtime has the same list (PANEL_ICONS).\nexport const PANEL_ICONS = [\"bag\", \"person\", \"map\", \"help\", \"info\", \"list\", \"book\", \"star\", \"heart\"];\n// The published page's text in English, which squiffy.json's \"strings\" can replace\nexport const PAGE_STRINGS = {\n back: \"Back\",\n restart: \"Restart\",\n restartConfirm: \"Are you sure you want to restart?\",\n switchToDark: \"Switch to dark mode\",\n switchToLight: \"Switch to light mode\",\n // The Saved games dialog, opened by the Save button. [name] and [time] are filled in.\n saves: \"Saved games\",\n saveName: \"Name (optional)\",\n save: \"Save\",\n noSaves: \"No saved games yet.\",\n savedGame: \"Saved game\",\n savedToday: \"Today, [time]\",\n savedYesterday: \"Yesterday, [time]\",\n load: \"Load\",\n loadConfirm: \"Load \\\"[name]\\\"? You'll lose anything you've done since you last saved.\",\n saveOptions: \"Options for [name]\",\n overwrite: \"Overwrite\",\n overwriteConfirm: \"Overwrite \\\"[name]\\\"?\",\n rename: \"Rename\",\n newName: \"New name\",\n saveToFile: \"Save to file\",\n loadFromFile: \"Load from file\",\n delete: \"Delete\",\n deleteConfirm: \"Delete \\\"[name]\\\"? This can't be undone.\",\n cancel: \"Cancel\",\n close: \"Close\",\n wrongStory: \"This saved game is for a different story.\",\n notASave: \"This file isn't a saved game.\",\n cantSave: \"The game couldn't be saved. Try Save to file instead.\",\n};\n// Parses and checks a squiffy.json. An error is a sentence to show the author as is.\nexport function parseProjectFile(text) {\n const fail = (error) => ({ success: false, error });\n let json;\n try {\n json = JSON.parse(text);\n }\n catch (e) {\n return fail(`${PROJECT_FILENAME} isn't valid JSON: ${e instanceof Error ? e.message : String(e)}`);\n }\n if (!json || typeof json != \"object\" || Array.isArray(json)) {\n return fail(`${PROJECT_FILENAME} should contain an object, such as { \"version\": 1, \"main\": \"story.squiffy\" }.`);\n }\n const data = json;\n const version = data.version;\n if (version === undefined) {\n return fail(`${PROJECT_FILENAME} needs a \"version\", which should be ${PROJECT_FILE_VERSION}.`);\n }\n if (typeof version != \"number\" || !Number.isInteger(version) || version < 1) {\n return fail(`${PROJECT_FILENAME}'s \"version\" should be a whole number, such as ${PROJECT_FILE_VERSION}.`);\n }\n if (version > PROJECT_FILE_VERSION) {\n return fail(`This story's ${PROJECT_FILENAME} is version ${version}, which needs a newer version of Squiffy.`);\n }\n const main = data.main;\n if (main === undefined) {\n return fail(`${PROJECT_FILENAME} needs a \"main\" file, such as \"main\": \"story.squiffy\".`);\n }\n if (typeof main != \"string\" || !main.trim()) {\n return fail(`${PROJECT_FILENAME}'s \"main\" should be the name of a .squiffy file, such as \"story.squiffy\".`);\n }\n const mainPath = normalisePath(main);\n if (mainPath === null) {\n return fail(`${PROJECT_FILENAME}'s \"main\" should be a path inside the project's folder, not \"${main}\".`);\n }\n if (!mainPath.endsWith(\".squiffy\")) {\n return fail(`${PROJECT_FILENAME}'s \"main\" should be a .squiffy file, not \"${main}\".`);\n }\n const exclude = data.exclude ?? [];\n if (!Array.isArray(exclude) || exclude.some(pattern => typeof pattern != \"string\")) {\n return fail(`${PROJECT_FILENAME}'s \"exclude\" should be a list of file patterns, such as [\"drafts/**\"].`);\n }\n const id = data.id;\n if (id !== undefined && (typeof id != \"string\" || !id.trim())) {\n return fail(`${PROJECT_FILENAME}'s \"id\" should be text that identifies the story, such as \"${EXAMPLE_ID}\".`);\n }\n const backButton = data.backButton;\n if (backButton !== undefined && typeof backButton != \"boolean\") {\n return fail(`${PROJECT_FILENAME}'s \"backButton\" should be true or false.`);\n }\n const saveButton = data.saveButton;\n if (saveButton !== undefined && typeof saveButton != \"boolean\") {\n return fail(`${PROJECT_FILENAME}'s \"saveButton\" should be true or false.`);\n }\n const strings = data.strings;\n if (strings !== undefined && (!isObject(strings) || Object.values(strings).some(value => typeof value != \"string\"))) {\n return fail(`${PROJECT_FILENAME}'s \"strings\" should be an object of text, such as { \"restart\": \"Recommencer\" }.`);\n }\n const panels = parsePanels(data.panels);\n if (typeof panels == \"string\")\n return fail(panels);\n const map = parseMapPositions(data.map);\n return {\n success: true,\n project: {\n version, main: mainPath, exclude: exclude,\n ...(id !== undefined ? { id: id.trim() } : {}),\n ...(map ? { map } : {}),\n ...(backButton !== undefined ? { backButton } : {}),\n ...(saveButton !== undefined ? { saveButton } : {}),\n ...(strings !== undefined ? { strings: pickPageStrings(strings) } : {}),\n ...(panels !== undefined ? { panels } : {}),\n },\n };\n}\n// The page strings Squiffy knows about. Others are left out, so a story written for a newer Squiffy,\n// with strings this one doesn't have, still builds.\nfunction pickPageStrings(strings) {\n return Object.fromEntries(Object.entries(strings).filter(([name]) => Object.prototype.hasOwnProperty.call(PAGE_STRINGS, name)));\n}\n// squiffy.json's \"panels\", or an error to show the author\nfunction parsePanels(value) {\n if (value === undefined)\n return undefined;\n const example = \"{ \\\"passage\\\": \\\"inventory\\\", \\\"label\\\": \\\"Inventory\\\" }\";\n if (!Array.isArray(value))\n return `${PROJECT_FILENAME}'s \"panels\" should be a list, such as [${example}].`;\n const panels = [];\n for (const [i, item] of value.entries()) {\n const which = `${PROJECT_FILENAME}'s panel ${i + 1}`;\n if (!isObject(item))\n return `${which} should be an object, such as ${example}.`;\n if (typeof item.passage != \"string\" || !item.passage.trim()) {\n return `${which} needs a \"passage\": the name of a passage in the master section [[]].`;\n }\n if (typeof item.label != \"string\" || !item.label.trim()) {\n return `${which} needs a \"label\", for its button, such as \"Inventory\".`;\n }\n if (item.position !== undefined && item.position !== \"side\" && item.position !== \"button\") {\n return `${which}'s \"position\" should be \"side\" or \"button\".`;\n }\n if (item.icon !== undefined && !PANEL_ICONS.includes(item.icon)) {\n return `${which}'s \"icon\" should be one of ${PANEL_ICONS.map(icon => `\"${icon}\"`).join(\", \")}.`;\n }\n panels.push({\n passage: item.passage.trim(),\n label: item.label.trim(),\n ...(item.position !== undefined ? { position: item.position } : {}),\n ...(item.icon !== undefined ? { icon: item.icon } : {}),\n });\n }\n return panels;\n}\nconst EXAMPLE_ID = \"0b7c6d9e-3f1a-4e2b-9c5d-8a7f6e5d4c3b\";\nconst isPosition = (value) => Array.isArray(value) && value.length == 2 && value.every(n => typeof n == \"number\" && Number.isFinite(n));\nconst isObject = (value) => !!value && typeof value == \"object\" && !Array.isArray(value);\n// The story map's positions. Only the editor uses them, so anything that isn't a position is\n// left out rather than stopping the story from building.\nfunction parseMapPositions(value) {\n if (!isObject(value))\n return undefined;\n const sections = {};\n const passages = {};\n if (isObject(value.sections)) {\n for (const [name, position] of Object.entries(value.sections)) {\n if (isPosition(position))\n sections[name] = position;\n }\n }\n if (isObject(value.passages)) {\n for (const [section, byName] of Object.entries(value.passages)) {\n if (!isObject(byName))\n continue;\n for (const [name, position] of Object.entries(byName)) {\n if (isPosition(position))\n (passages[section] ?? (passages[section] = {}))[name] = position;\n }\n }\n }\n return { sections, passages };\n}\n// A project path with \"/\" separators and no \".\" segments, or null if it goes outside the folder\n// or is absolute.\nfunction normalisePath(path) {\n const slashes = path.replace(/\\\\/g, \"/\");\n if (slashes.startsWith(\"/\") || /^[a-zA-Z]:/.test(slashes))\n return null;\n const parts = [];\n for (const part of slashes.split(\"/\")) {\n if (part == \"\" || part == \".\")\n continue;\n if (part == \"..\")\n return null;\n parts.push(part);\n }\n return parts.length ? parts.join(\"/\") : null;\n}\n// \"*\" and \"?\" match within one path segment; \"**\" matches across segments.\nexport function globToRegExp(pattern) {\n let out = \"\";\n for (let i = 0; i < pattern.length; i++) {\n const c = pattern[i];\n if (c == \"*\") {\n if (pattern[i + 1] == \"*\") {\n i++;\n if (pattern[i + 1] == \"/\") {\n i++;\n out += \"(?:.*/)?\";\n }\n else {\n out += \".*\";\n }\n }\n else {\n out += \"[^/]*\";\n }\n }\n else if (c == \"?\") {\n out += \"[^/]\";\n }\n else {\n out += c.replace(/[.+^${}()|[\\]\\\\]/g, \"\\\\$&\");\n }\n }\n return new RegExp(`^${out}$`);\n}\n// Whether `exclude` leaves a file out of the story: a pattern matches it or one of its folders.\nexport function isExcluded(path, exclude) {\n const parts = path.split(\"/\");\n return exclude.some(pattern => {\n const normalised = normalisePath(pattern.trim());\n if (normalised === null)\n return false;\n const regex = globToRegExp(normalised);\n for (let i = 1; i <= parts.length; i++) {\n if (regex.test(parts.slice(0, i).join(\"/\")))\n return true;\n }\n return false;\n });\n}\n// Folders whose files are never part of a story, whatever `exclude` says: node_modules, and\n// folders whose names start with \".\" (.git, .vscode and the like).\nexport function isAlwaysSkipped(path) {\n const folders = path.split(\"/\").slice(0, -1);\n return folders.some(folder => folder == \"node_modules\" || folder.startsWith(\".\"));\n}\n// The folder, next to squiffy.json, that the CLI builds a project's published files into. Its\n// files are never part of the story.\nexport const BUILD_FOLDER = \"build\";\n// The files that Squiffy 6, and Squiffy 7 without a squiffy.json, write next to the main file\n// when publishing a story, with its index.html. With an index.html beside them, they're taken to\n// be an old build, and aren't part of the story unless it @imports them.\nconst OLD_BUILD_FILES = [\"story.js\", \"style.css\", \"squiffy.runtime.js\", \"squiffy.runtime.global.js\"];\n// The kinds of file that are part of a story\nexport const isSquiffyPath = (path) => path.endsWith(\".squiffy\");\nexport const isStylesheetPath = (path) => path.endsWith(\".css\");\nexport const isScriptPath = (path) => path.endsWith(\".js\");\nexport const isStoryFilePath = (path) => isSquiffyPath(path) || isStylesheetPath(path) || isScriptPath(path);\n// Sorts paths by code point, so the order is the same everywhere, whatever the locale.\nexport const comparePaths = (a, b) => a < b ? -1 : a > b ? 1 : 0;\n// Which of a project's files make up the story: its .squiffy files, stylesheets and scripts.\n// `paths` are relative to the project file's folder, with \"/\" separators, as from a recursive\n// listing of the folder; files of other kinds are ignored. Pass `skip` to leave out more files\n// or folders, such as a build's output folder.\nexport function getStoryFiles(project, paths, skip = []) {\n const included = [];\n const stylesheets = [];\n const scripts = [];\n const excluded = [];\n const all = new Set(paths);\n const skipped = [BUILD_FOLDER, ...skip].map(folder => normalisePath(folder)).filter(folder => folder !== null);\n const mainSlash = project.main.lastIndexOf(\"/\");\n const mainFolder = mainSlash < 0 ? \"\" : project.main.substring(0, mainSlash + 1);\n const oldBuild = all.has(mainFolder + \"index.html\") ? new Set(OLD_BUILD_FILES.map(file => mainFolder + file)) : new Set();\n for (const path of all) {\n if (!isStoryFilePath(path) || path == project.main || isAlwaysSkipped(path) || oldBuild.has(path))\n continue;\n if (skipped.some(folder => path == folder || path.startsWith(folder + \"/\")))\n continue;\n if (isExcluded(path, project.exclude))\n excluded.push(path);\n else if (isSquiffyPath(path))\n included.push(path);\n else if (isStylesheetPath(path))\n stylesheets.push(path);\n else\n scripts.push(path);\n }\n return {\n main: project.main,\n included: included.sort(comparePaths),\n stylesheets: stylesheets.sort(comparePaths),\n scripts: scripts.sort(comparePaths),\n excluded: excluded.sort(comparePaths),\n };\n}\n// The story's files after the main file, in the order the compiler takes them (see\n// AnalyseSettings.storyFiles): its .squiffy files, then its stylesheets, then its scripts.\nexport const storyFileList = (story) => [...story.included, ...story.stylesheets, ...story.scripts];\n// The text of a new project file. It's given a new random id, unless one is passed in.\nexport function formatProjectFile(project) {\n const json = {\n $schema: PROJECT_SCHEMA_URL,\n version: PROJECT_FILE_VERSION,\n id: project.id ?? crypto.randomUUID(),\n main: project.main,\n };\n if (project.exclude?.length)\n json.exclude = project.exclude;\n if (project.panels?.length)\n json.panels = project.panels;\n const text = JSON.stringify(json, null, 2) + \"\\n\";\n return project.map ? updateProjectFile(text, { map: project.map }) : text;\n}\n// Changes a project file's text, keeping any other properties it has. Returns undefined if the\n// text isn't a JSON object. A `map` with no positions removes it.\nexport function updateProjectFile(text, changes) {\n let json;\n try {\n json = JSON.parse(text);\n }\n catch {\n return undefined;\n }\n if (!json || typeof json != \"object\" || Array.isArray(json))\n return undefined;\n const data = { ...json };\n if (changes.main !== undefined)\n data.main = changes.main;\n if (changes.exclude !== undefined) {\n if (changes.exclude.length)\n data.exclude = changes.exclude;\n else\n delete data.exclude;\n }\n if (changes.map !== undefined) {\n const { sections, passages } = changes.map;\n const used = Object.fromEntries(Object.entries(passages).filter(([, byName]) => Object.keys(byName).length));\n // Anything else that's in \"map\" stays, but empty lists of positions don't\n const map = { ...(isObject(data.map) ? data.map : {}) };\n delete map.sections;\n delete map.passages;\n if (Object.keys(sections).length)\n map.sections = sections;\n if (Object.keys(used).length)\n map.passages = used;\n if (Object.keys(map).length)\n data.map = map;\n else\n delete data.map;\n }\n const indent = /^\\{\\s*\\n([ \\t]+)/.exec(text)?.[1] ?? 2;\n // Each position on one line, rather than an x and a y on lines of their own\n return JSON.stringify(data, null, indent).replace(/\\[\\s+(-?[\\d.e+-]+),\\s+(-?[\\d.e+-]+)\\s+\\]/g, \"[$1, $2]\") + \"\\n\";\n}\n","import pkg from \"../package.json\" with { type: \"json\" };\nimport { analysisInternals } from \"./analyse.js\";\nconst version = pkg.version;\n// Produces the story data and JavaScript for an analysis that succeeded.\nexport function emit(analysis, settings = {}) {\n const internals = analysisInternals.get(analysis);\n if (!internals) {\n throw new Error(\"emit() needs the result of analyse()\");\n }\n if (!analysis.success) {\n throw new Error(\"Can't emit a story whose analysis has errors\");\n }\n const story = internals.story;\n const output = {\n story: {\n start: story.start,\n id: story.id,\n sections: {},\n },\n js: [],\n };\n if (analysis.expressions) {\n output.story.expressions = true;\n }\n if (settings.projectId) {\n output.story.projectId = settings.projectId;\n }\n if (settings.panels?.length) {\n output.story.panels = settings.panels;\n }\n if (story.uiJs.length > 0) {\n output.js.push(story.uiJs);\n output.story.uiJsIndex = output.js.length - 1;\n }\n for (const sectionName of Object.keys(story.sections)) {\n const section = story.sections[sectionName];\n const outputSection = {};\n output.story.sections[sectionName] = outputSection;\n if (section.clear) {\n outputSection.clear = true;\n }\n outputSection.text = section.output;\n if (section.attributes.length > 0) {\n outputSection.attributes = section.attributes;\n }\n if (section.js.length > 0) {\n output.js.push(section.js);\n outputSection.jsIndex = output.js.length - 1;\n }\n if (\"@last\" in section.passages) {\n let passageCount = 0;\n for (const passageName of Object.keys(section.passages)) {\n // A passage with @repeat doesn't count, as clicking it doesn't use it up\n if (passageName.length > 0 && passageName?.substring(0, 1) !== \"@\" && !section.passages[passageName].repeat) {\n passageCount++;\n }\n }\n outputSection.passageCount = passageCount;\n }\n if (Object.keys(section.passages).length == 0)\n continue;\n outputSection.passages = {};\n for (const passageName of Object.keys(section.passages)) {\n const passage = section.passages[passageName];\n const outputPassage = {};\n outputSection.passages[passageName] = outputPassage;\n if (passage.clear) {\n outputPassage.clear = true;\n }\n if (passage.repeat) {\n outputPassage.repeat = true;\n }\n outputPassage.text = passage.output;\n if (passage.attributes.length > 0) {\n outputPassage.attributes = passage.attributes;\n }\n if (passage.js.length > 0) {\n output.js.push(passage.js);\n outputPassage.jsIndex = output.js.length - 1;\n }\n }\n }\n const getJs = async (excludeHeader) => {\n const outputJs = [];\n if (!excludeHeader) {\n outputJs.push(`// Created with Squiffy ${version}`);\n outputJs.push(\"// https://github.com/textadventures/squiffy\");\n }\n if (settings.globalJs) {\n outputJs.push(\"var story = {};\");\n }\n else {\n outputJs.push(\"export const story = {};\");\n }\n outputJs.push(`story.id = ${JSON.stringify(output.story.id, null, 4)};`);\n if (output.story.projectId) {\n outputJs.push(`story.projectId = ${JSON.stringify(output.story.projectId)};`);\n }\n if (output.story.uiJsIndex !== undefined) {\n outputJs.push(`story.uiJsIndex = ${output.story.uiJsIndex};`);\n }\n if (output.story.expressions) {\n outputJs.push(\"story.expressions = true;\");\n }\n if (output.story.panels) {\n outputJs.push(`story.panels = ${JSON.stringify(output.story.panels, null, 4)};`);\n }\n outputJs.push(`story.start = ${JSON.stringify(output.story.start, null, 4)};`);\n outputJs.push(`story.sections = ${JSON.stringify(output.story.sections, null, 4)};`);\n outputJs.push(\"story.js = [\");\n for (const js of output.js) {\n writeJs(outputJs, 1, js);\n }\n outputJs.push(\"];\");\n return outputJs.join(\"\\n\");\n };\n return {\n success: true,\n output,\n getJs: (excludeHeader) => getJs(excludeHeader || false),\n getUiInfo: () => ({\n title: story.title,\n externalScripts: story.scripts,\n externalStylesheets: story.stylesheets,\n }),\n diagnostics: analysis.diagnostics,\n };\n}\nfunction writeJs(outputJsFile, tabCount, js) {\n const tabs = new Array(tabCount + 1).join(\"\\t\");\n outputJsFile.push(`${tabs}(squiffy, get, set) => {`);\n for (const jsLine of js) {\n outputJsFile.push(`${tabs}\\t${jsLine}`);\n }\n outputJsFile.push(`${tabs}},`);\n}\n","// Reads Quest's script language (ASL), as it's written in a gamebook's page scripts: statements\n// such as msg (\"...\"), if (...) { } else { }, firsttime { }, and calls to the gamebook's functions,\n// such as SetFlagOn (\"lamp\") or MovePlayer (Page2). Anything it can't read is kept as a \"raw\"\n// statement, with its source, so the converter can report it rather than lose it.\nclass ParseError extends Error {\n}\nfunction tokenize(source) {\n const tokens = [];\n let i = 0;\n while (i < source.length) {\n const c = source[i];\n if (c == \"\\n\") {\n tokens.push({ type: \"nl\", text: \"\\n\", start: i, end: i + 1 });\n i++;\n }\n else if (/\\s/.test(c)) {\n i++;\n }\n else if (c == \"/\" && source[i + 1] == \"/\") {\n while (i < source.length && source[i] != \"\\n\")\n i++;\n }\n else if (c == \"\\\"\") {\n let value = \"\";\n let j = i + 1;\n for (; j < source.length && source[j] != \"\\\"\"; j++) {\n if (source[j] == \"\\\\\" && j + 1 < source.length) {\n j++;\n value += source[j] == \"n\" ? \"\\n\" : source[j];\n }\n else {\n value += source[j];\n }\n }\n tokens.push({ type: \"str\", text: source.substring(i, j + 1), value, start: i, end: j + 1 });\n i = j + 1;\n }\n else if (/\\d/.test(c)) {\n // A number, or a name that starts with one, such as 1B in the page name Option 1B\n const m = /^\\d+\\.\\d+(?![\\p{L}_])|^[\\p{L}\\p{N}_]+/u.exec(source.substring(i));\n tokens.push({ type: /^[\\d.]+$/.test(m[0]) ? \"num\" : \"word\", text: m[0], start: i, end: i + m[0].length });\n i += m[0].length;\n }\n else if (/[\\p{L}_]/u.test(c)) {\n const m = /^[\\p{L}\\p{N}_]+/u.exec(source.substring(i));\n tokens.push({ type: \"word\", text: m[0], start: i, end: i + m[0].length });\n i += m[0].length;\n }\n else {\n const two = source.substring(i, i + 2);\n const op = [\"<=\", \">=\", \"<>\", \"!=\", \"==\", \"&&\", \"||\"].includes(two) ? two : c;\n tokens.push({ type: \"+-*/%=<>(){},.[]!\".includes(op) || op.length == 2 ? \"op\" : \"other\", text: op, start: i, end: i + op.length });\n i += op.length;\n }\n }\n return tokens;\n}\nconst keywords = new Set([\"and\", \"or\", \"not\", \"true\", \"false\", \"null\", \"if\", \"else\", \"firsttime\", \"otherwise\", \"switch\", \"case\", \"default\"]);\nexport class ScriptParser {\n // names: the names of the game's objects, such as its pages, which can have spaces in them\n constructor(source, names) {\n Object.defineProperty(this, \"source\", {\n enumerable: true,\n configurable: true,\n writable: true,\n value: source\n });\n Object.defineProperty(this, \"names\", {\n enumerable: true,\n configurable: true,\n writable: true,\n value: names\n });\n Object.defineProperty(this, \"tokens\", {\n enumerable: true,\n configurable: true,\n writable: true,\n value: void 0\n });\n Object.defineProperty(this, \"pos\", {\n enumerable: true,\n configurable: true,\n writable: true,\n value: 0\n });\n this.tokens = tokenize(source);\n }\n static parse(source, names) {\n const parser = new ScriptParser(source, names);\n const body = parser.statements(false);\n return body;\n }\n peek(offset = 0) {\n return this.tokens[this.pos + offset];\n }\n is(text, offset = 0) {\n const t = this.peek(offset);\n return !!t && t.type != \"str\" && t.text == text;\n }\n expect(text) {\n const t = this.peek();\n if (!t || t.type == \"str\" || t.text != text)\n throw new ParseError(`expected \"${text}\"`);\n this.pos++;\n return t;\n }\n skipNewlines() {\n while (this.peek()?.type == \"nl\")\n this.pos++;\n }\n // Statements, up to the end of the script, or the } that ends a block\n statements(inBlock) {\n const result = [];\n for (;;) {\n this.skipNewlines();\n const t = this.peek();\n if (!t) {\n if (inBlock)\n throw new ParseError(\"a block with no }\");\n return result;\n }\n if (inBlock && this.is(\"}\"))\n return result;\n result.push(this.statement());\n }\n }\n block() {\n this.skipNewlines();\n this.expect(\"{\");\n const body = this.statements(true);\n this.expect(\"}\");\n return body;\n }\n // One statement. If it can't be read, it's kept as raw text, up to the end of its line (and\n // any block that starts on it).\n statement() {\n const start = this.pos;\n try {\n const stmt = this.statementOrThrow();\n this.endOfStatement();\n return stmt;\n }\n catch (e) {\n if (!(e instanceof ParseError))\n throw e;\n this.pos = start;\n this.skipRawStatement();\n return { k: \"raw\", src: this.sourceFrom(start) };\n }\n }\n endOfStatement() {\n const t = this.peek();\n if (t && t.type != \"nl\" && !this.is(\"}\"))\n throw new ParseError(\"more after the end of a statement\");\n }\n skipRawStatement() {\n let depth = 0;\n while (this.peek()) {\n const t = this.peek();\n if (t.type == \"nl\" && depth <= 0)\n return;\n if (t.type == \"op\" && (t.text == \"{\" || t.text == \"(\"))\n depth++;\n if (t.type == \"op\" && (t.text == \"}\" || t.text == \")\")) {\n if (depth <= 0)\n return;\n depth--;\n this.pos++;\n // A block ends the statement, unless else or otherwise follows it\n if (depth == 0 && t.text == \"}\") {\n let j = 0;\n while (this.peek(j)?.type == \"nl\")\n j++;\n if (!this.is(\"else\", j) && !this.is(\"otherwise\", j))\n return;\n }\n continue;\n }\n this.pos++;\n }\n }\n sourceFrom(startToken) {\n const first = this.tokens[startToken];\n const last = this.tokens[this.pos - 1];\n if (!first || !last || this.pos <= startToken)\n return \"\";\n return this.source.substring(first.start, last.end).trim();\n }\n statementOrThrow() {\n const start = this.pos;\n const t = this.peek();\n const src = () => this.sourceFrom(start);\n if (t.type != \"word\")\n throw new ParseError(\"a statement that doesn't start with a name\");\n if (t.text == \"if\") {\n const branches = [];\n let otherwise;\n this.pos++;\n branches.push({ cond: this.condition(), body: this.block() });\n for (;;) {\n let j = 0;\n while (this.peek(j)?.type == \"nl\")\n j++;\n if (!this.is(\"else\", j))\n break;\n this.pos += j + 1;\n if (this.is(\"if\")) {\n this.pos++;\n branches.push({ cond: this.condition(), body: this.block() });\n }\n else {\n otherwise = this.block();\n break;\n }\n }\n return { k: \"if\", branches, otherwise, src: src() };\n }\n if (t.text == \"firsttime\") {\n this.pos++;\n const body = this.block();\n let j = 0;\n while (this.peek(j)?.type == \"nl\")\n j++;\n let otherwise;\n if (this.is(\"otherwise\", j)) {\n this.pos += j + 1;\n otherwise = this.block();\n }\n return { k: \"firsttime\", body, otherwise, src: src() };\n }\n if (t.text == \"switch\") {\n this.pos++;\n const value = this.condition();\n this.skipNewlines();\n this.expect(\"{\");\n const cases = [];\n let otherwise;\n for (;;) {\n this.skipNewlines();\n if (this.is(\"}\"))\n break;\n if (this.is(\"case\")) {\n this.pos++;\n this.expect(\"(\");\n const values = this.expressionList(\")\");\n this.expect(\")\");\n cases.push({ values, body: this.block() });\n }\n else if (this.is(\"default\")) {\n this.pos++;\n otherwise = this.block();\n }\n else {\n throw new ParseError(\"expected case or default\");\n }\n }\n this.expect(\"}\");\n return { k: \"switch\", value, cases, otherwise, src: src() };\n }\n // Two-word commands\n const second = this.peek(1);\n const twoWord = second?.type == \"word\" && { play: [\"sound\"], stop: [\"sound\"], list: [\"add\", \"remove\"], dictionary: [\"add\", \"remove\"], on: [\"ready\"] }[t.text]?.includes(second.text);\n if (twoWord && t.text == \"on\") {\n this.pos += 2;\n return { k: \"call\", fn: \"on ready\", args: [], callback: this.block(), src: src() };\n }\n if (twoWord) {\n this.pos += 2;\n const args = this.is(\"(\") ? this.arguments() : [];\n return { k: \"call\", fn: `${t.text} ${second.text}`, args, src: src() };\n }\n // An assignment, such as game.lamp = true, or a local variable, such as x = 1\n const save = this.pos;\n if (!keywords.has(t.text)) {\n try {\n const target = this.path();\n if (this.is(\"=\")) {\n this.pos++;\n const value = this.expression();\n return { k: \"assign\", target, value, src: src() };\n }\n }\n catch (e) {\n if (!(e instanceof ParseError))\n throw e;\n }\n }\n this.pos = save;\n // A call, with or without brackets, and a callback if it has one. Its name can have dots\n // in it, such as JS.eval.\n let fn = t.text;\n this.pos++;\n while (this.is(\".\") && this.peek(1)?.type == \"word\") {\n fn += \".\" + this.peek(1).text;\n this.pos += 2;\n }\n const args = this.is(\"(\") ? this.arguments() : [];\n let callback;\n let j = 0;\n while (this.peek(j)?.type == \"nl\")\n j++;\n if (this.is(\"{\", j) && (j == 0 || t.text == \"GetInput\" || t.text == \"ShowMenu\")) {\n callback = this.block();\n }\n return { k: \"call\", fn, args, callback, src: src() };\n }\n condition() {\n this.expect(\"(\");\n const e = this.expression();\n this.expect(\")\");\n return e;\n }\n arguments() {\n this.expect(\"(\");\n const args = this.expressionList(\")\");\n this.expect(\")\");\n return args;\n }\n expressionList(end) {\n const items = [];\n this.skipNewlines();\n if (this.is(end))\n return items;\n for (;;) {\n this.skipNewlines();\n items.push(this.expression());\n this.skipNewlines();\n if (!this.is(\",\"))\n return items;\n this.pos++;\n }\n }\n expression() {\n return this.binary(0);\n }\n binary(level) {\n if (level >= ScriptParser.levels.length)\n return this.unary();\n let left = this.binary(level + 1);\n for (;;) {\n const t = this.peek();\n if (!t || t.type == \"str\" || !ScriptParser.levels[level].includes(t.text))\n return left;\n this.pos++;\n this.skipNewlines();\n const op = t.text == \"||\" ? \"or\" : t.text == \"&&\" ? \"and\" : t.text == \"==\" ? \"=\" : t.text == \"!=\" ? \"<>\" : t.text;\n left = { k: \"bin\", op, l: left, r: this.binary(level + 1) };\n }\n }\n unary() {\n if (this.is(\"not\") || this.is(\"!\")) {\n this.pos++;\n return { k: \"not\", e: this.unary() };\n }\n if (this.is(\"-\")) {\n this.pos++;\n return { k: \"neg\", e: this.unary() };\n }\n return this.primary();\n }\n primary() {\n const t = this.peek();\n if (!t)\n throw new ParseError(\"an expression that ends too soon\");\n if (t.type == \"str\") {\n this.pos++;\n return { k: \"str\", v: t.value };\n }\n if (t.type == \"num\" && !this.objectName()) {\n this.pos++;\n return { k: \"num\", v: Number(t.text) };\n }\n if (this.is(\"(\")) {\n this.pos++;\n const e = this.expression();\n this.expect(\")\");\n return e;\n }\n if (t.type == \"word\" && (t.text == \"true\" || t.text == \"false\")) {\n this.pos++;\n return { k: \"bool\", v: t.text == \"true\" };\n }\n if (t.type == \"word\" && t.text == \"null\") {\n this.pos++;\n return { k: \"null\" };\n }\n if ((t.type == \"word\" || t.type == \"num\") && !keywords.has(t.text)) {\n // A function call, such as GetBoolean (game, \"lamp\")\n if (t.type == \"word\" && this.is(\"(\", 1) && !this.objectName()) {\n this.pos++;\n const args = this.arguments();\n return { k: \"call\", fn: t.text, args };\n }\n return this.path();\n }\n throw new ParseError(`unexpected \"${t.text}\"`);\n }\n // The name of one of the game's objects at the current token, which can be several words,\n // e.g. Room 551 Weather. Returns how many tokens it is, or 0.\n objectName() {\n let best = 0;\n let name = \"\";\n for (let n = 0; n < 12; n++) {\n const t = this.peek(n);\n if (!t || (t.type != \"word\" && t.type != \"num\"))\n break;\n if (n > 0) {\n const gap = this.source.substring(this.peek(n - 1).end, t.start);\n if (gap != \" \")\n break;\n }\n name += (n > 0 ? \" \" : \"\") + t.text;\n if (this.names.has(name))\n best = n + 1;\n }\n return best;\n }\n // A name, or a dotted path such as player.parent or game.lamp\n path() {\n const parts = [];\n for (;;) {\n const t = this.peek();\n if (!t || (t.type != \"word\" && t.type != \"num\") || keywords.has(t.text))\n throw new ParseError(\"expected a name\");\n const words = this.objectName();\n if (words > 1) {\n parts.push(this.tokens.slice(this.pos, this.pos + words).map(w => w.text).join(\" \"));\n this.pos += words;\n }\n else {\n if (t.type == \"num\" && parts.length == 0 && words == 0)\n throw new ParseError(\"expected a name\");\n parts.push(t.text);\n this.pos++;\n }\n if (!this.is(\".\"))\n return { k: \"path\", parts };\n this.pos++;\n }\n }\n}\nObject.defineProperty(ScriptParser, \"levels\", {\n enumerable: true,\n configurable: true,\n writable: true,\n value: [\n [\"or\", \"||\"],\n [\"and\", \"&&\"],\n [\"=\", \"==\", \"<>\", \"!=\", \"<\", \">\", \"<=\", \">=\"],\n [\"+\", \"-\"],\n [\"*\", \"/\", \"%\"],\n ]\n});\n","import { strToU8, zipSync } from \"fflate\";\nimport { CompileSuccess, PAGE_STRINGS, type PageStrings } from \"squiffy-compiler\";\n\nimport squiffyRuntime from \"squiffy-runtime/dist/squiffy.runtime.global.js?raw\";\nimport runtimeCss from \"squiffy-runtime/dist/squiffy.runtime.css?raw\";\nimport htmlTemplateFile from \"./index.template.html?raw\";\nimport pageCss from \"squiffy-runtime/dist/squiffy.page.css?raw\";\n\nimport pkg from \"../package.json\" with {type: \"json\"};\n\nconst version = pkg.version;\n\nexport interface Package {\n files: Record<string, string>;\n zip?: Uint8Array;\n}\n\nexport interface PackageOptions {\n createZip?: boolean;\n inlineHtml?: boolean;\n /**\n * Asset files used by the story (images, audio etc.), keyed by their path relative to the story,\n * e.g. \"cat.png\" or \"images/cat.png\". They're added to the zip at those paths. With inlineHtml,\n * they're embedded in index.html as data: URIs, which the runtime uses via its resolveAssetUrl option.\n * They're not added to Package.files, as those are text files, and the caller already has the assets.\n * With inlineHtml, the story's own stylesheets and scripts (@import of .css and .js files) are looked\n * for here too, and included in index.html as <style> and <script> elements.\n */\n assets?: Record<string, Uint8Array>;\n /**\n * Whether the page has a Back button, which takes the player back a section or passage at a time.\n * On unless this is false: the story's squiffy.json can turn it off with \"backButton\": false.\n */\n backButton?: boolean;\n /**\n * Whether the page has a Save button, which opens the Saved games dialog, where the player can\n * keep saved games and save them to files. On unless this is false: the story's squiffy.json\n * can turn it off with \"saveButton\": false.\n */\n saveButton?: boolean;\n /**\n * The page's own text, such as the Restart button's tooltip, from the story's squiffy.json's\n * \"strings\". Anything left out is in English.\n */\n strings?: PageStrings;\n}\n\nconst mimeTypes: Record<string, string> = {\n apng: \"image/apng\",\n avif: \"image/avif\",\n bmp: \"image/bmp\",\n gif: \"image/gif\",\n ico: \"image/x-icon\",\n jpeg: \"image/jpeg\",\n jpg: \"image/jpeg\",\n png: \"image/png\",\n svg: \"image/svg+xml\",\n webp: \"image/webp\",\n aac: \"audio/aac\",\n flac: \"audio/flac\",\n m4a: \"audio/mp4\",\n mp3: \"audio/mpeg\",\n oga: \"audio/ogg\",\n ogg: \"audio/ogg\",\n opus: \"audio/ogg\",\n wav: \"audio/wav\",\n weba: \"audio/webm\",\n m4v: \"video/mp4\",\n mp4: \"video/mp4\",\n ogv: \"video/ogg\",\n webm: \"video/webm\",\n vtt: \"text/vtt\",\n otf: \"font/otf\",\n ttf: \"font/ttf\",\n woff: \"font/woff\",\n woff2: \"font/woff2\",\n pdf: \"application/pdf\",\n json: \"application/json\",\n txt: \"text/plain\",\n};\n\nexport const getMimeType = (path: string) =>\n mimeTypes[path.split(\".\").pop()?.toLowerCase() ?? \"\"] ?? \"application/octet-stream\";\n\n// Normalises an asset path to the form the runtime will see it in story output, e.g. \"./images\\\\cat.png\" -> \"images/cat.png\".\n// Throws for paths that would end up outside the package.\nexport const normaliseAssetPath = (path: string) => {\n const normalised = path.replace(/\\\\/g, \"/\").replace(/^(\\.\\/)+/, \"\");\n if (!normalised || normalised.startsWith(\"/\") || /^[a-z]:/i.test(normalised) || normalised.split(\"/\").includes(\"..\")) {\n throw new Error(`Invalid asset path: ${path}`);\n }\n return normalised;\n};\n\nconst toBase64 = (bytes: Uint8Array) => {\n let binary = \"\";\n const chunkSize = 0x8000;\n for (let i = 0; i < bytes.length; i += chunkSize) {\n binary += String.fromCharCode(...bytes.subarray(i, i + chunkSize));\n }\n return btoa(binary);\n};\n\n// Escapes text so that it's safe inside a quoted HTML attribute.\nconst escapeAttribute = (text: string) => text.replace(/[&<>\"']/g, c => `&#${c.charCodeAt(0)};`);\n\n// Escapes JSON so that it's safe inside a <script> element.\nconst scriptSafeJson = (value: unknown) => JSON.stringify(value).replace(/</g, \"\\\\u003c\");\n\nexport const createPackage = async (input: CompileSuccess, createZipOrOptions: boolean | PackageOptions = false): Promise<Package> => {\n // Handle both old boolean signature and new options object\n const options: PackageOptions = typeof createZipOrOptions === \"boolean\"\n ? { createZip: createZipOrOptions }\n : createZipOrOptions;\n\n const output: Record<string, string> = {};\n const uiInfo = input.getUiInfo();\n\n const infoComment = `<!--\\n\\nCreated with Squiffy ${version}\\n\\nhttps://squiffystory.com\\nhttps://github.com/textadventures/squiffy\\n\\n-->`;\n const combinedCss = runtimeCss.toString() + \"\\n\\n\" + pageCss.toString();\n\n const storyJs = await input.getJs();\n\n const assets: Record<string, Uint8Array> = {};\n for (const [path, bytes] of Object.entries(options.assets ?? {})) {\n assets[normaliseAssetPath(path)] = bytes;\n }\n\n // The story's own stylesheets and scripts. A single-file export includes the ones it has the\n // contents of, as it can't refer to separate files, and links to any others as before.\n const inlined = new Set<string>();\n const inlineText = (path: string) => {\n if (!options.inlineHtml) return undefined;\n let normalised: string;\n try {\n normalised = normaliseAssetPath(path);\n } catch {\n return undefined;\n }\n const bytes = assets[normalised];\n if (!bytes) return undefined;\n inlined.add(normalised);\n return new TextDecoder().decode(bytes);\n };\n const scriptData = uiInfo.externalScripts.map(script => {\n const text = inlineText(script);\n return text === undefined\n ? `<script src=\"${script}\"></script>`\n : \"<script>\\n\" + text.replace(/<\\/(script)/gi, \"<\\\\/$1\") + \"\\n </script>\";\n }).join(\"\\n\");\n const stylesheetData = uiInfo.externalStylesheets.map(sheet => {\n const text = inlineText(sheet);\n return text === undefined\n ? `<link rel=\"stylesheet\" href=\"${sheet}\"/>`\n : \"<style>\\n\" + text.replace(/<\\/(style)/gi, \"<\\\\/$1\") + \"\\n </style>\";\n }).join(\"\\n\");\n let assetOptions = \"\";\n\n // Generate content for placeholders based on inline vs external mode\n // Note: We use arrow functions as replacements to prevent $-pattern interpretation\n // (e.g., $& or ${...} in the replacement string would otherwise be treated specially)\n let styleContent: string;\n let runtimeContent: string;\n let storyContent: string;\n\n if (options.inlineHtml) {\n // Inline everything into the HTML\n styleContent = \"<style>\\n\" + combinedCss + \"\\n </style>\";\n runtimeContent = \"<script>\\n\" + squiffyRuntime + \"\\n </script>\";\n storyContent = \"<script>\\n\" + storyJs + \"\\n </script>\";\n\n if (Object.keys(assets).some(path => !inlined.has(path))) {\n // A single-file export can't refer to separate asset files, so embed them as data: URIs.\n const dataUris = Object.fromEntries(Object.entries(assets).filter(([path]) => !inlined.has(path)).map(([path, bytes]) =>\n [path, `data:${getMimeType(path)};base64,${toBase64(bytes)}`]));\n storyContent += \"\\n <script>\\nvar squiffyAssetUrls = \" + scriptSafeJson(dataUris) + \";\\n </script>\";\n assetOptions = \"resolveAssetUrl: function (path) { return squiffyAssetUrls[path.replace(/^(\\\\.\\\\/)+/, \\\"\\\")] || path; },\";\n }\n } else {\n // Reference external files\n styleContent = \"<link rel=\\\"stylesheet\\\" href=\\\"style.css\\\"/>\";\n runtimeContent = \"<script src=\\\"squiffy.runtime.global.js\\\"></script>\";\n storyContent = \"<script src=\\\"story.js\\\"></script>\";\n\n output[\"story.js\"] = storyJs;\n output[\"squiffy.runtime.global.js\"] = squiffyRuntime;\n output[\"style.css\"] = combinedCss;\n }\n\n let htmlData = htmlTemplateFile.toString();\n // The Back button and the page's own text go in first, before anything from the story, which\n // could contain {{...}} of its own\n htmlData = htmlData.replace(/[ \\t]*<!-- BACK_BUTTON -->\\n([^]*?)[ \\t]*<!-- \\/BACK_BUTTON -->\\n/,\n (_, button: string) => options.backButton === false ? \"\" : button);\n htmlData = htmlData.replace(/[ \\t]*<!-- SAVE_BUTTON -->\\n([^]*?)[ \\t]*<!-- \\/SAVE_BUTTON -->\\n/,\n (_, button: string) => options.saveButton === false ? \"\" : button);\n const strings: Record<string, string> = { ...PAGE_STRINGS, ...options.strings };\n htmlData = htmlData.replace(/\\{\\{(\\w+)\\}\\}/g, (match, name: string) =>\n Object.prototype.hasOwnProperty.call(strings, name) ? escapeAttribute(strings[name]) : match);\n // The page's text, which its script gives to the Saved games dialog and the panels\n htmlData = htmlData.replace(\"/* PAGE_STRINGS */\", () => scriptSafeJson(strings));\n htmlData = htmlData.replace(\"<!-- INFO -->\", () => infoComment);\n htmlData = htmlData.replace(\"<!-- TITLE -->\", () => uiInfo.title);\n htmlData = htmlData.replace(\"<!-- SCRIPTS -->\", () => scriptData);\n htmlData = htmlData.replace(\"<!-- STYLESHEETS -->\", () => stylesheetData);\n htmlData = htmlData.replace(\"<!-- STYLE_CONTENT -->\", () => styleContent);\n htmlData = htmlData.replace(\"<!-- RUNTIME_CONTENT -->\", () => runtimeContent);\n htmlData = htmlData.replace(\"<!-- STORY_CONTENT -->\", () => storyContent);\n htmlData = htmlData.replace(/\\n([ \\t]*)\\/\\* ASSET_OPTIONS \\*\\//, (_, indent: string) => assetOptions ? \"\\n\" + indent + assetOptions : \"\");\n\n output[\"index.html\"] = htmlData;\n\n return {\n files: output,\n zip: !options.createZip ? undefined : zipSync({\n // Assets are already embedded in index.html when inlining\n ...(options.inlineHtml ? {} : assets),\n // Generated files take precedence over any asset with the same name\n ...Object.fromEntries(\n Object.entries(output).map(([name, text]) => [name, strToU8(text)])\n )\n })\n };\n};"],"ignoreList":[0],"mappings":"AA8BA,IAAIO,IAAK,YAAYC,IAAM,aAAaC,KAAM,YAE1CC,KAAO,IAAIH,EAAG;AAAA,EAAC;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAgB;AAAA,EAAG;AAAA,EAAoB;AAAC,CAAC,GAE5II,KAAO,IAAIJ,EAAG;AAAA,EAAC;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAiB;AAAA,EAAG;AAAC,CAAC,GAEnIK,KAAO,IAAIL,EAAG;AAAA,EAAC;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAI;AAAA,EAAG;AAAA,EAAI;AAAA,EAAG;AAAA,EAAI;AAAA,EAAG;AAAA,EAAI;AAAA,EAAG;AAAA,EAAI;AAAA,EAAG;AAAE,CAAC,GAEhFM,KAAO,SAAUC,GAAIC,GAAO;AAE5B,WADIC,IAAI,IAAIR,EAAI,EAAE,GACTS,IAAI,GAAGA,IAAI,IAAI,EAAEA,EACtB,CAAAD,EAAEC,CAAA,IAAKF,KAAS,KAAKD,EAAGG,IAAI,CAAA;AAIhC,WADI,IAAI,IAAIR,GAAIO,EAAE,EAAA,CAAG,GACZC,IAAI,GAAGA,IAAI,IAAI,EAAEA,EACtB,UAASC,IAAIF,EAAEC,CAAA,GAAIC,IAAIF,EAAEC,IAAI,CAAA,GAAI,EAAEC,EAC/B,GAAEA,CAAA,IAAOA,IAAIF,EAAEC,CAAA,KAAO,IAAKA;AAGnC,SAAO;AAAA,IAAK,GAAAD;AAAA,IAAM;AAAA,EAAE;AACxB,GACIG,KAAKN,GAAKH,IAAM,CAAC,GAAGU,KAAKD,GAAG,GAAGE,KAAQF,GAAG;AAE9CC,GAAG,EAAA,IAAM,KAAKC,GAAM,GAAA,IAAO;AAC3B,IAAIC,KAAKT,GAAKF,IAAM,CAAC,GAAGY,KAAKD,GAAG,GAAGE,KAAQF,GAAG,GAE1CG,KAAM,IAAIjB,EAAI,KAAK;AACvB,SAASS,IAAI,GAAGA,IAAI,OAAO,EAAEA,GAAG;AAE5B,MAAIS,KAAMT,IAAI,UAAW,KAAOA,IAAI,UAAW;AAC/C,EAAAS,KAAMA,IAAI,UAAW,KAAOA,IAAI,UAAW,GAC3CA,KAAMA,IAAI,UAAW,KAAOA,IAAI,SAAW,GAC3CD,GAAIR,CAAA,MAAQS,IAAI,UAAW,KAAOA,IAAI,QAAW,MAAO;AAC5D;AAIA,IAAIC,KAAQ,SAAUC,GAAIC,GAAIC,GAAG;AAO7B,WANIC,IAAIH,EAAG,QAEPX,IAAI,GAEJe,IAAI,IAAIxB,EAAIqB,CAAE,GAEXZ,IAAIc,GAAG,EAAEd,EACZ,CAAIW,EAAGX,CAAA,KACH,EAAEe,EAAEJ,EAAGX,CAAA,IAAK,CAAA;AAGpB,MAAIgB,IAAK,IAAIzB,EAAIqB,CAAE;AACnB,OAAKZ,IAAI,GAAGA,IAAIY,GAAI,EAAEZ,EAClB,CAAAgB,EAAGhB,CAAA,IAAMgB,EAAGhB,IAAI,CAAA,IAAKe,EAAEf,IAAI,CAAA,KAAO;AAEtC,MAAIiB;AACJ,MAAIJ,GAAG;AAEH,IAAAI,IAAK,IAAI1B,EAAI,KAAKqB,CAAE;AAEpB,QAAIM,IAAM,KAAKN;AACf,SAAKZ,IAAI,GAAGA,IAAIc,GAAG,EAAEd,EAEjB,KAAIW,EAAGX,CAAA;AAQH,eANImB,IAAMnB,KAAK,IAAKW,EAAGX,CAAA,GAEnBoB,IAAMR,IAAKD,EAAGX,CAAA,GAEdqB,IAAIL,EAAGL,EAAGX,CAAA,IAAK,CAAA,OAAQoB,GAElBE,IAAID,KAAM,KAAKD,KAAO,GAAIC,KAAKC,GAAG,EAAED,EAEzC,CAAAJ,EAAGT,GAAIa,CAAA,KAAMH,CAAA,IAAOC;AAAA,EAIpC;AAGI,SADAF,IAAK,IAAI1B,EAAIuB,CAAC,GACTd,IAAI,GAAGA,IAAIc,GAAG,EAAEd,EACjB,CAAIW,EAAGX,CAAA,MACHiB,EAAGjB,CAAA,IAAKQ,GAAIQ,EAAGL,EAAGX,CAAA,IAAK,CAAA,GAAE,KAAQ,KAAKW,EAAGX,CAAA;AAIrD,SAAOiB;AACX,IAEIM,IAAM,IAAIjC,EAAG,GAAG;AACpB,SAASU,IAAI,GAAGA,IAAI,KAAK,EAAEA,EACvB,CAAAuB,EAAIvB,CAAA,IAAK;AACb,SAASA,IAAI,KAAKA,IAAI,KAAK,EAAEA,EACzB,CAAAuB,EAAIvB,CAAA,IAAK;AACb,SAASA,IAAI,KAAKA,IAAI,KAAK,EAAEA,EACzB,CAAAuB,EAAIvB,CAAA,IAAK;AACb,SAASA,IAAI,KAAKA,IAAI,KAAK,EAAEA,EACzB,CAAAuB,EAAIvB,CAAA,IAAK;AAEb,IAAIwB,KAAM,IAAIlC,EAAG,EAAE;AACnB,SAASU,IAAI,GAAGA,IAAI,IAAI,EAAEA,EACtB,CAAAwB,GAAIxB,CAAA,IAAK;AAEb,IAAIyB,KAAoB,gBAAAf,EAAKa,GAAK,GAAG,CAAC,GAElCG,KAAoB,gBAAAhB,EAAKc,IAAK,GAAG,CAAC,GAqBlCG,KAAO,SAAUC,GAAG;AAAE,UAASA,IAAI,KAAK,IAAK;AAAG,GAGhDC,KAAM,SAAUR,GAAGP,GAAGgB,GAAG;AACzB,UAAIhB,KAAK,QAAQA,IAAI,OACjBA,IAAI,KACJgB,KAAK,QAAQA,IAAIT,EAAE,YACnBS,IAAIT,EAAE,SAEH,IAAI/B,EAAG+B,EAAE,SAASP,GAAGgB,CAAC,CAAC;AAClC,GAsBIC,KAAK;AAAA,EACL;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,E;A,EAEA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAEJ,GAEIC,KAAM,SAAUC,GAAKC,GAAKC,GAAI;AAC9B,MAAIL,IAAI,IAAI,MAAMI,KAAOH,GAAGE,CAAA,CAAI;AAIhC,MAHAH,EAAE,OAAOG,GACL,MAAM,qBACN,MAAM,kBAAkBH,GAAGE,EAAG,GAC9B,CAACG,EACD,OAAML;AACV,SAAOA;AACX,GAuLIM,IAAQ,SAAUC,GAAGT,GAAGP,GAAG;AAC3B,EAAAA,MAAMO,IAAI;AACV,MAAIU,IAAKV,IAAI,IAAK;AAClB,EAAAS,EAAEC,CAAA,KAAMjB,GACRgB,EAAEC,IAAI,CAAA,KAAMjB,KAAK;AACrB,GAEIkB,IAAU,SAAUF,GAAGT,GAAGP,GAAG;AAC7B,EAAAA,MAAMO,IAAI;AACV,MAAIU,IAAKV,IAAI,IAAK;AAClB,EAAAS,EAAEC,CAAA,KAAMjB,GACRgB,EAAEC,IAAI,CAAA,KAAMjB,KAAK,GACjBgB,EAAEC,IAAI,CAAA,KAAMjB,KAAK;AACrB,GAEImB,KAAQ,SAAUH,GAAGzB,GAAI;AAGzB,WADI,IAAI,CAAC,GACAZ,IAAI,GAAGA,IAAIqC,EAAE,QAAQ,EAAErC,EAC5B,CAAIqC,EAAErC,CAAA,KACF,EAAE,KAAK;AAAA,IAAE,GAAGA;AAAA,IAAG,GAAGqC,EAAErC,CAAA;AAAA,EAAG,CAAC;AAEhC,MAAIc,IAAI,EAAE,QACN2B,IAAK,EAAE,MAAM;AACjB,MAAI,CAAC3B,EACD,QAAO;AAAA,IAAE,GAAG4B;AAAA,IAAI,GAAG;AAAA,EAAE;AACzB,MAAI5B,KAAK,GAAG;AACR,QAAIO,IAAI,IAAI/B,EAAG,EAAE,CAAA,EAAG,IAAI,CAAC;AACzB,WAAA+B,EAAE,EAAE,CAAA,EAAG,CAAA,IAAK,GACL;AAAA,MAAE,GAAGA;AAAA,MAAG,GAAG;AAAA,IAAE;AAAA,EACxB;AACA,IAAE,KAAK,SAAUsB,GAAG5C,GAAG;AAAE,WAAO4C,EAAE,IAAI5C,EAAE;AAAA,EAAG,CAAC,GAG5C,EAAE,KAAK;AAAA,IAAE,GAAG;AAAA,IAAI,GAAG;AAAA,EAAM,CAAC;AAC1B,MAAIgB,IAAI,EAAE,CAAA,GAAIF,IAAI,EAAE,CAAA,GAAI+B,IAAK,GAAGC,IAAK,GAAGC,IAAK;AAO7C,OANA,EAAE,CAAA,IAAK;AAAA,IAAE,GAAG;AAAA,IAAI,GAAG/B,EAAE,IAAIF,EAAE;AAAA,IAAM,GAAAE;AAAA,IAAM,GAAAF;AAAA,EAAE,GAMlCgC,KAAM/B,IAAI;AACb,IAAAC,IAAI,EAAE,EAAE6B,CAAA,EAAI,IAAI,EAAEE,CAAA,EAAI,IAAIF,MAAOE,GAAA,GACjCjC,IAAI,EAAE+B,KAAMC,KAAM,EAAED,CAAA,EAAI,IAAI,EAAEE,CAAA,EAAI,IAAIF,MAAOE,GAAA,GAC7C,EAAED,GAAA,IAAQ;AAAA,MAAE,GAAG;AAAA,MAAI,GAAG9B,EAAE,IAAIF,EAAE;AAAA,MAAM,GAAAE;AAAA,MAAM,GAAAF;AAAA,IAAE;AAGhD,WADIkC,IAASN,EAAG,CAAA,EAAG,GACVzC,IAAI,GAAGA,IAAIc,GAAG,EAAEd,EACrB,CAAIyC,EAAGzC,CAAA,EAAG,IAAI+C,MACVA,IAASN,EAAGzC,CAAA,EAAG;AAGvB,MAAIgD,IAAK,IAAIzD,EAAIwD,IAAS,CAAC,GAEvBE,IAAMC,GAAG,EAAEL,IAAK,CAAA,GAAIG,GAAI,CAAC;AAC7B,MAAIC,IAAMrC,GAAI;AAIV,QAAIZ,IAAI,GAAGmD,IAAK,GAEZC,IAAMH,IAAMrC,GAAIyC,IAAM,KAAKD;AAE/B,SADAX,EAAG,KAAK,SAAUE,GAAG5C,GAAG;AAAE,aAAOiD,EAAGjD,EAAE,CAAA,IAAKiD,EAAGL,EAAE,CAAA,KAAMA,EAAE,IAAI5C,EAAE;AAAA,IAAG,CAAC,GAC3DC,IAAIc,GAAG,EAAEd,GAAG;AACf,UAAIsD,IAAOb,EAAGzC,CAAA,EAAG;AACjB,UAAIgD,EAAGM,CAAA,IAAQ1C;AACX,QAAAuC,KAAME,KAAO,KAAMJ,IAAMD,EAAGM,CAAA,IAC5BN,EAAGM,CAAA,IAAQ1C;AAAA,UAGX;AAAA,IACR;AAEA,SADAuC,MAAOC,GACAD,IAAK,KAAG;AACX,UAAII,IAAOd,EAAGzC,CAAA,EAAG;AACjB,MAAIgD,EAAGO,CAAA,IAAQ3C,IACXuC,KAAM,KAAMvC,IAAKoC,EAAGO,CAAA,MAAU,IAE9B,EAAEvD;AAAA,IACV;AACA,WAAOA,KAAK,KAAKmD,GAAI,EAAEnD,GAAG;AACtB,UAAIwD,IAAOf,EAAGzC,CAAA,EAAG;AACjB,MAAIgD,EAAGQ,CAAA,KAAS5C,MACZ,EAAEoC,EAAGQ,CAAA,GACL,EAAEL;AAAA,IAEV;AACA,IAAAF,IAAMrC;AAAA,EACV;AACA,SAAO;AAAA,IAAE,GAAG,IAAItB,EAAG0D,CAAE;AAAA,IAAG,GAAGC;AAAA,EAAI;AACnC,GAEIC,KAAK,SAAUO,GAAG1C,GAAGsB,GAAG;AACxB,SAAOoB,EAAE,KAAK,KACR,KAAK,IAAIP,GAAGO,EAAE,GAAG1C,GAAGsB,IAAI,CAAC,GAAGa,GAAGO,EAAE,GAAG1C,GAAGsB,IAAI,CAAC,CAAC,IAC5CtB,EAAE0C,EAAE,CAAA,IAAKpB;AACpB,GAEIqB,KAAK,SAAUC,GAAG;AAGlB,WAFI7C,IAAI6C,EAAE,QAEH7C,KAAK,CAAC6C,EAAE,EAAE7C,CAAA,IAAA;AAMjB,WAJI8C,IAAK,IAAIrE,EAAI,EAAEuB,CAAC,GAEhB+C,IAAM,GAAGC,IAAMH,EAAE,CAAA,GAAII,IAAM,GAC3BC,IAAI,SAAU3C,GAAG;AAAE,IAAAuC,EAAGC,GAAA,IAASxC;AAAA,EAAG,GAC7BrB,IAAI,GAAGA,KAAKc,GAAG,EAAEd,EACtB,KAAI2D,EAAE3D,CAAA,KAAM8D,KAAO9D,KAAKc,EACpB,GAAEiD;AAAA,OACD;AACD,QAAI,CAACD,KAAOC,IAAM,GAAG;AACjB,aAAOA,IAAM,KAAKA,KAAO,IACrB,CAAAC,EAAE,KAAK;AACX,MAAID,IAAM,MACNC,EAAED,IAAM,KAAOA,IAAM,MAAO,IAAK,QAAUA,IAAM,KAAM,IAAK,KAAK,GACjEA,IAAM;AAAA,IAEd,WACSA,IAAM,GAAG;AAEd,WADAC,EAAEF,CAAG,GAAG,EAAEC,GACHA,IAAM,GAAGA,KAAO,EACnB,CAAAC,EAAE,IAAI;AACV,MAAID,IAAM,MACNC,EAAID,IAAM,KAAM,IAAK,IAAI,GAAGA,IAAM;AAAA,IAC1C;AACA,WAAOA,MACH,CAAAC,EAAEF,CAAG;AACT,IAAAC,IAAM,GACND,IAAMH,EAAE3D,CAAA;AAAA,EACZ;AAEJ,SAAO;AAAA,IAAE,GAAG4D,EAAG,SAAS,GAAGC,CAAG;AAAA,IAAG,GAAG/C;AAAA,EAAE;AAC1C,GAEImD,IAAO,SAAUC,GAAIN,GAAI;AAEzB,WADI7C,IAAI,GACCf,IAAI,GAAGA,IAAI4D,EAAG,QAAQ,EAAE5D,EAC7B,CAAAe,KAAKmD,EAAGlE,CAAA,IAAK4D,EAAG5D,CAAA;AACpB,SAAOe;AACX,GAGIoD,KAAQ,SAAUC,GAAKC,GAAKC,GAAK;AAEjC,MAAIxD,IAAIwD,EAAI,QACRhC,IAAIX,GAAK0C,IAAM,CAAC;AACpB,EAAAD,EAAI9B,CAAA,IAAKxB,IAAI,KACbsD,EAAI9B,IAAI,CAAA,IAAKxB,KAAK,GAClBsD,EAAI9B,IAAI,CAAA,IAAK8B,EAAI9B,CAAA,IAAK,KACtB8B,EAAI9B,IAAI,CAAA,IAAK8B,EAAI9B,IAAI,CAAA,IAAK;AAC1B,WAAS,IAAI,GAAG,IAAIxB,GAAG,EAAE,EACrB,CAAAsD,EAAI9B,IAAI,IAAI,CAAA,IAAKgC,EAAI,CAAA;AACzB,UAAQhC,IAAI,IAAIxB,KAAK;AACzB,GAEIyD,KAAO,SAAUD,GAAKF,GAAKI,GAAOC,GAAMC,GAAIC,GAAI9E,GAAI+E,GAAIC,GAAIC,GAAIlD,GAAG;AACnE,EAAAQ,EAAMgC,GAAKxC,KAAK4C,CAAK,GACrB,EAAEE,EAAG,GAAA;AAML,WALIxE,IAAKsC,GAAMkC,GAAI,EAAE,GAAGK,IAAM7E,EAAG,GAAG8E,IAAM9E,EAAG,GACzCG,IAAKmC,GAAMmC,GAAI,EAAE,GAAGM,IAAM5E,EAAG,GAAG6E,IAAM7E,EAAG,GACzC8E,IAAKzB,GAAGqB,CAAG,GAAGK,IAAOD,EAAG,GAAGE,IAAMF,EAAG,GACpCG,IAAK5B,GAAGuB,CAAG,GAAGM,IAAOD,EAAG,GAAGE,IAAMF,EAAG,GACpCG,IAAS,IAAIlG,EAAI,EAAE,GACdS,IAAI,GAAGA,IAAIoF,EAAK,QAAQ,EAAEpF,EAC/B,GAAEyF,EAAOL,EAAKpF,CAAA,IAAK,EAAA;AACvB,WAASA,IAAI,GAAGA,IAAIuF,EAAK,QAAQ,EAAEvF,EAC/B,GAAEyF,EAAOF,EAAKvF,CAAA,IAAK,EAAA;AAGvB,WAFI0F,IAAKlD,GAAMiD,GAAQ,CAAC,GAAGE,IAAMD,EAAG,GAAGE,IAAOF,EAAG,GAC7CG,IAAO,IACJA,IAAO,KAAK,CAACF,EAAIhG,GAAKkG,IAAO,CAAA,CAAA,GAAK,EAAEA,EAAA;AAE3C,MAAIC,IAAQhB,IAAK,KAAM,GACnBiB,IAAQ9B,EAAKS,GAAInD,CAAG,IAAI0C,EAAKU,GAAInD,EAAG,IAAI3B,GACxCmG,IAAQ/B,EAAKS,GAAIK,CAAG,IAAId,EAAKU,GAAIM,CAAG,IAAIpF,IAAK,KAAK,IAAIgG,IAAO5B,EAAKwB,GAAQE,CAAG,IAAI,IAAIF,EAAO,EAAA,IAAM,IAAIA,EAAO,EAAA,IAAM,IAAIA,EAAO,EAAA;AAClI,MAAIZ,KAAM,KAAKiB,KAAQC,KAASD,KAAQE,EACpC,QAAO7B,GAAMC,GAAKxC,GAAG0C,EAAI,SAASO,GAAIA,IAAKC,CAAE,CAAC;AAClD,MAAImB,GAAIC,GAAIC,GAAIC;AAEhB,MADAhE,EAAMgC,GAAKxC,GAAG,KAAKoE,IAAQD,EAAM,GAAGnE,KAAK,GACrCoE,IAAQD,GAAO;AACf,IAAAE,IAAKvF,EAAKqE,GAAKC,GAAK,CAAC,GAAGkB,IAAKnB,GAAKoB,IAAKzF,EAAKuE,GAAKC,GAAK,CAAC,GAAGkB,IAAKnB;AAC/D,QAAIoB,KAAM3F,EAAKiF,GAAKC,GAAM,CAAC;AAC3B,IAAAxD,EAAMgC,GAAKxC,GAAGyD,IAAM,GAAG,GACvBjD,EAAMgC,GAAKxC,IAAI,GAAG4D,IAAM,CAAC,GACzBpD,EAAMgC,GAAKxC,IAAI,IAAIiE,IAAO,CAAC,GAC3BjE,KAAK;AACL,aAAS5B,IAAI,GAAGA,IAAI6F,GAAM,EAAE7F,EACxB,CAAAoC,EAAMgC,GAAKxC,IAAI,IAAI5B,GAAG2F,EAAIhG,GAAKK,CAAA,CAAA,CAAG;AACtC,IAAA4B,KAAK,IAAIiE;AAET,aADIS,IAAO,CAAClB,GAAMG,CAAI,GACbgB,IAAK,GAAGA,IAAK,GAAG,EAAEA;AAEvB,eADIC,IAAOF,EAAKC,CAAA,GACPvG,IAAI,GAAGA,IAAIwG,EAAK,QAAQ,EAAExG,GAAG;AAClC,YAAIyG,IAAMD,EAAKxG,CAAA,IAAK;AACpB,QAAAoC,EAAMgC,GAAKxC,GAAGyE,GAAII,CAAA,CAAI,GAAG7E,KAAK+D,EAAIc,CAAA,GAC9BA,IAAM,OACNrE,EAAMgC,GAAKxC,GAAI4E,EAAKxG,CAAA,KAAM,IAAK,GAAG,GAAG4B,KAAK4E,EAAKxG,CAAA,KAAM;AAAA,MAC7D;AAAA,EAER,MAEI,CAAAiG,IAAKxE,IAAKyE,IAAK3E,GAAK4E,IAAKzE,IAAK0E,IAAK5E;AAEvC,WAASxB,IAAI,GAAGA,IAAI4E,GAAI,EAAE5E,GAAG;AACzB,QAAI0G,IAAMjC,EAAKzE,CAAA;AACf,QAAI0G,IAAM,KAAK;AACX,UAAID,IAAOC,KAAO,KAAM;AACxB,MAAAnE,EAAQ6B,GAAKxC,GAAGqE,EAAGQ,IAAM,GAAA,CAAI,GAAG7E,KAAKsE,EAAGO,IAAM,GAAA,GAC1CA,IAAM,MACNrE,EAAMgC,GAAKxC,GAAI8E,KAAO,KAAM,EAAE,GAAG9E,KAAKnC,GAAKgH,CAAA;AAC/C,UAAIE,IAAMD,IAAM;AAChB,MAAAnE,EAAQ6B,GAAKxC,GAAGuE,EAAGQ,CAAA,CAAI,GAAG/E,KAAKwE,EAAGO,CAAA,GAC9BA,IAAM,MACNpE,EAAQ6B,GAAKxC,GAAI8E,KAAO,IAAK,IAAI,GAAG9E,KAAKlC,GAAKiH,CAAA;AAAA,IACtD,MAEI,CAAApE,EAAQ6B,GAAKxC,GAAGqE,EAAGS,CAAA,CAAI,GAAG9E,KAAKsE,EAAGQ,CAAA;AAAA,EAE1C;AACA,SAAAnE,EAAQ6B,GAAKxC,GAAGqE,EAAG,GAAA,CAAI,GAChBrE,IAAIsE,EAAG,GAAA;AAClB,GAEIU,KAAoB,oBAAIpH,GAAI;AAAA,EAAC;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAS;AAAA,EAAS;AAAO,CAAC,GAEvGkD,KAAmB,oBAAIpD,EAAG,CAAC,GAE3BuH,KAAO,SAAUvC,GAAKwC,GAAKC,GAAMC,GAAKC,GAAMC,GAAI;AAChD,MAAIpG,IAAIoG,EAAG,KAAK5C,EAAI,QAChBhC,IAAI,IAAIhD,EAAG0H,IAAMlG,IAAI,KAAK,IAAI,KAAK,KAAKA,IAAI,GAAI,KAAKmG,CAAI,GAEzDjD,IAAI1B,EAAE,SAAS0E,GAAK1E,EAAE,SAAS2E,CAAI,GACnCE,IAAMD,EAAG,GACT7C,KAAO6C,EAAG,KAAK,KAAK;AACxB,MAAIJ,GAAK;AACL,IAAIzC,MACAL,EAAE,CAAA,IAAKkD,EAAG,KAAK;AAenB,aAdIE,IAAMR,GAAIE,IAAM,CAAA,GAChBrD,IAAI2D,KAAO,IAAIzD,IAAIyD,IAAM,MACzBC,KAAS,KAAKN,KAAQ,GAEtBO,IAAOJ,EAAG,KAAK,IAAI3H,EAAI,KAAK,GAAGgI,IAAOL,EAAG,KAAK,IAAI3H,EAAI8H,IAAQ,CAAC,GAC/DG,IAAQ,KAAK,KAAKT,IAAO,CAAC,GAAGU,IAAQ,IAAID,GACzCE,IAAM,SAAU1H,IAAG;AAAE,cAAQsE,EAAItE,EAAA,IAAMsE,EAAItE,KAAI,CAAA,KAAMwH,IAAUlD,EAAItE,KAAI,CAAA,KAAMyH,KAAUJ;AAAA,IAAO,GAG9F5C,IAAO,IAAIjF,GAAI,IAAK,GAEpBkF,IAAK,IAAInF,EAAI,GAAG,GAAGoF,IAAK,IAAIpF,EAAI,EAAE,GAElCoI,IAAO,GAAG9H,IAAK,GAAGG,IAAIkH,EAAG,KAAK,GAAGtC,IAAK,GAAGgD,IAAKV,EAAG,KAAK,GAAGrC,IAAK,GAC3D7E,IAAI,IAAIc,GAAG,EAAEd,GAAG;AAEnB,UAAI6H,IAAKH,EAAI1H,CAAC,GAEV8H,IAAO9H,IAAI,OAAO+H,IAAQR,EAAKM,CAAA;AAKnC,UAJAP,EAAKQ,CAAA,IAAQC,GACbR,EAAKM,CAAA,IAAMC,GAGPF,KAAM5H,GAAG;AAET,YAAIgI,IAAMlH,IAAId;AACd,aAAK2H,IAAO,OAAQ/C,IAAK,WAAWoD,IAAM,OAAO,CAACb,IAAM;AACpD,UAAA9C,IAAME,GAAKD,GAAKN,GAAG,GAAGS,GAAMC,GAAIC,GAAI9E,GAAI+E,GAAIC,GAAI7E,IAAI6E,GAAIR,CAAG,GAC3DO,IAAK+C,IAAO9H,IAAK,GAAGgF,IAAK7E;AACzB,mBAASC,IAAI,GAAGA,IAAI,KAAK,EAAEA,EACvB,CAAAyE,EAAGzE,CAAA,IAAK;AACZ,mBAASA,IAAI,GAAGA,IAAI,IAAI,EAAEA,EACtB,CAAA0E,EAAG1E,CAAA,IAAK;AAAA,QAChB;AAEA,YAAIc,IAAI,GAAGsB,IAAI,GAAG4F,KAAOtE,GAAGuE,IAAMJ,IAAOC,IAAQ;AACjD,YAAIC,IAAM,KAAKH,KAAMH,EAAI1H,IAAIkI,CAAG;AAM5B,mBALIC,IAAO,KAAK,IAAI1E,GAAGuE,CAAG,IAAI,GAC1BI,IAAO,KAAK,IAAI,OAAOpI,CAAC,GAGxBqI,IAAK,KAAK,IAAI,KAAKL,CAAG,GACnBE,KAAOE,KAAQ,EAAEH,MAAQH,KAAQC,KAAO;AAC3C,gBAAIzD,EAAItE,IAAIe,CAAA,KAAMuD,EAAItE,IAAIe,IAAImH,CAAA,GAAM;AAEhC,uBADII,IAAK,GACFA,IAAKD,KAAM/D,EAAItE,IAAIsI,CAAA,KAAOhE,EAAItE,IAAIsI,IAAKJ,CAAA,GAAM,EAAEI,EAAA;AAEtD,kBAAIA,IAAKvH,GAAG;AAGR,oBAFAA,IAAIuH,GAAIjG,IAAI6F,GAERI,IAAKH,EACL;AAMJ,yBAFII,IAAM,KAAK,IAAIL,GAAKI,IAAK,CAAC,GAC1BE,KAAK,GACAvI,IAAI,GAAGA,IAAIsI,GAAK,EAAEtI,GAAG;AAC1B,sBAAIwI,KAAKzI,IAAIkI,IAAMjI,IAAI,OAEnBU,KAAK8H,KADCnB,EAAKmB,EAAA,IACK;AACpB,kBAAI9H,KAAK6H,OACLA,KAAK7H,IAAIoH,IAAQU;AAAA,gBACzB;AAAA,cACJ;AAAA,YACJ;AAEA,YAAAX,IAAOC,GAAOA,IAAQT,EAAKQ,CAAA,GAC3BI,KAAOJ,IAAOC,IAAQ;AAAA,UAC1B;AAGJ,YAAI1F,GAAG;AAGH,UAAAoC,EAAKG,GAAA,IAAQ,YAAaxE,GAAMW,CAAA,KAAM,KAAMR,GAAM8B,CAAA;AAClD,cAAIqG,KAAMtI,GAAMW,CAAA,IAAK,IAAI4H,KAAMpI,GAAM8B,CAAA,IAAK;AAC1C,UAAAxC,KAAMJ,GAAKiJ,EAAA,IAAOhJ,GAAKiJ,EAAA,GACvB,EAAEjE,EAAG,MAAMgE,EAAA,GACX,EAAE/D,EAAGgE,EAAA,GACLf,IAAK5H,IAAIe,GACT,EAAE4G;AAAA,QACN;AAEI,UAAAlD,EAAKG,GAAA,IAAQN,EAAItE,CAAA,GACjB,EAAE0E,EAAGJ,EAAItE,CAAA,CAAA;AAAA,MAEjB;AAAA,IACJ;AACA,SAAKA,IAAI,KAAK,IAAIA,GAAG4H,CAAE,GAAG5H,IAAIc,GAAG,EAAEd;AAC/B,MAAAyE,EAAKG,GAAA,IAAQN,EAAItE,CAAA,GACjB,EAAE0E,EAAGJ,EAAItE,CAAA,CAAA;AAEb,IAAAqE,IAAME,GAAKD,GAAKN,GAAGmD,GAAK1C,GAAMC,GAAIC,GAAI9E,GAAI+E,GAAIC,GAAI7E,IAAI6E,GAAIR,CAAG,GACxD8C,MACDD,EAAG,IAAK7C,IAAM,IAAKL,EAAGK,IAAM,IAAK,CAAA,KAAM,GAEvCA,KAAO,GACP6C,EAAG,IAAIK,GAAML,EAAG,IAAII,GAAMJ,EAAG,IAAIlH,GAAGkH,EAAG,IAAIU;AAAA,EAEnD,OACK;AACD,aAAS5H,IAAIkH,EAAG,KAAK,GAAGlH,IAAIc,IAAIqG,GAAKnH,KAAK,OAAO;AAE7C,UAAI8B,KAAI9B,IAAI;AACZ,MAAI8B,MAAKhB,MAELkD,EAAGK,IAAM,IAAK,CAAA,IAAK8C,GACnBrF,KAAIhB,IAERuD,IAAMF,GAAMH,GAAGK,IAAM,GAAGC,EAAI,SAAStE,GAAG8B,EAAC,CAAC;AAAA,IAC9C;AACA,IAAAoF,EAAG,IAAIpG;AAAA,EACX;AACA,SAAOe,GAAIS,GAAG,GAAG0E,IAAMrF,GAAK0C,CAAG,IAAI4C,CAAI;AAC3C,GAEI2B,KAAsB,4BAAY;AAElC,WADIC,IAAI,oBAAI,WAAW,GAAG,GACjB7I,IAAI,GAAGA,IAAI,KAAK,EAAEA,GAAG;AAE1B,aADI2D,IAAI3D,GAAG8I,IAAI,GACR,EAAEA,IACL,CAAAnF,KAAMA,IAAI,KAAM,cAAeA,MAAM;AACzC,IAAAkF,EAAE7I,CAAA,IAAK2D;AAAA,EACX;AACA,SAAOkF;AACX,GAAG,GAECE,KAAM,WAAY;AAClB,MAAIpF,IAAI;AACR,SAAO;AAAA,IACH,GAAG,SAAUtB,GAAG;AAGZ,eADI2G,IAAKrF,GACA3D,IAAI,GAAGA,IAAIqC,EAAE,QAAQ,EAAErC,EAC5B,CAAAgJ,IAAKJ,GAAMI,IAAK,MAAO3G,EAAErC,CAAA,CAAA,IAAOgJ,MAAO;AAC3C,MAAArF,IAAIqF;AAAA,IACR;AAAA,IACA,GAAG,WAAY;AAAE,aAAO,CAACrF;AAAA,IAAG;AAAA,EAChC;AACJ,GAyBIsF,KAAO,SAAU3E,GAAK8C,GAAKJ,GAAKC,GAAMC,GAAI;AAC1C,MAAI,CAACA,MACDA,IAAK,EAAE,GAAG,EAAE,GACRE,EAAI,aAAY;AAChB,QAAI8B,IAAO9B,EAAI,WAAW,SAAS,MAAM,GACrC+B,IAAS,IAAI7J,EAAG4J,EAAK,SAAS5E,EAAI,MAAM;AAC5C,IAAA6E,EAAO,IAAID,CAAI,GACfC,EAAO,IAAI7E,GAAK4E,EAAK,MAAM,GAC3B5E,IAAM6E,GACNjC,EAAG,IAAIgC,EAAK;AAAA,EAChB;AAEJ,SAAOrC,GAAKvC,GAAK8C,EAAI,SAAS,OAAO,IAAIA,EAAI,OAAOA,EAAI,OAAO,OAAQF,EAAG,IAAI,KAAK,KAAK,KAAK,IAAI,GAAG,KAAK,IAAI,IAAI,KAAK,IAAI5C,EAAI,MAAM,CAAC,CAAC,IAAI,GAAG,IAAI,KAAO,KAAK8C,EAAI,KAAMJ,GAAKC,GAAMC,CAAE;AACxL,GAEIkC,KAAM,SAAUzG,GAAG5C,GAAG;AACtB,MAAIuC,IAAI,CAAC;AACT,WAASwG,KAAKnG,EACV,CAAAL,EAAEwG,CAAA,IAAKnG,EAAEmG,CAAA;AACb,WAASA,KAAK/I,EACV,CAAAuC,EAAEwG,CAAA,IAAK/I,EAAE+I,CAAA;AACb,SAAOxG;AACX,GA4II+G,IAAS,SAAUhH,GAAGtC,GAAGsB,GAAG;AAC5B,SAAOA,GAAG,EAAEtB,EACR,CAAAsC,EAAEtC,CAAA,IAAKsB,GAAGA,OAAO;AACzB;AAqLA,SAAgBiI,GAAYC,GAAMC,GAAM;AACpC,SAAOP,GAAKM,GAAMC,KAAQ,CAAC,GAAG,GAAG,CAAC;AACtC;AAkfA,IAAIC,KAAO,SAAUpH,GAAGT,GAAG,GAAGU,GAAG;AAC7B,WAASwG,KAAKzG,GAAG;AACb,QAAIqH,IAAMrH,EAAEyG,CAAA,GAAIrF,IAAI7B,IAAIkH,GAAGa,IAAKrH;AAChC,IAAI,MAAM,QAAQoH,CAAG,MACjBC,IAAKP,GAAI9G,GAAGoH,EAAI,CAAA,CAAE,GAAGA,IAAMA,EAAI,CAAA,IAC/B,YAAY,OAAOA,CAAG,IACtB,EAAEjG,CAAA,IAAK,CAACiG,GAAKC,CAAE,KAEf,EAAElG,KAAK,GAAA,IAAO,CAAC,IAAInE,EAAG,CAAC,GAAGqK,CAAE,GAC5BF,GAAKC,GAAKjG,GAAG,GAAGnB,CAAC;AAAA,EAEzB;AACJ,GAEIsH,KAAK,OAAO,cAAe,OAA6B,oBAAI,YAAY,GAExEC,KAAK,OAAO,cAAe,OAA6B,oBAAI,YAAY,GAExEC,KAAM;AACV,IAAI;AACA,EAAAD,GAAG,OAAOnH,IAAI,EAAE,QAAQ,GAAK,CAAC,GAC9BoH,KAAM;AACV,QACU;AAAE;AAwGZ,SAAgBC,GAAQC,GAAKC,GAAQ;AACjC,MAAIA,GAAQ;AAER,aADIC,IAAO,IAAI5K,EAAG0K,EAAI,MAAM,GACnBhK,IAAI,GAAGA,IAAIgK,EAAI,QAAQ,EAAEhK,EAC9B,CAAAkK,EAAKlK,CAAA,IAAKgK,EAAI,WAAWhK,CAAC;AAC9B,WAAOkK;AAAA,EACX;AACA,MAAIN,GACA,QAAOA,GAAG,OAAOI,CAAG;AAKxB,WAJIjJ,IAAIiJ,EAAI,QACRG,IAAK,IAAI7K,EAAG0K,EAAI,UAAUA,EAAI,UAAU,EAAE,GAC1CI,IAAK,GACLpG,IAAI,SAAU3C,GAAG;AAAE,IAAA8I,EAAGC,GAAA,IAAQ/I;AAAA,EAAG,GAC5BrB,IAAI,GAAGA,IAAIe,GAAG,EAAEf,GAAG;AACxB,QAAIoK,IAAK,IAAID,EAAG,QAAQ;AACpB,UAAI1G,IAAI,IAAInE,EAAG8K,IAAK,KAAMrJ,IAAIf,KAAM,EAAE;AACtC,MAAAyD,EAAE,IAAI0G,CAAE,GACRA,IAAK1G;AAAA,IACT;AACA,QAAIE,IAAIqG,EAAI,WAAWhK,CAAC;AACxB,IAAI2D,IAAI,OAAOsG,IACXjG,EAAEL,CAAC,IACEA,IAAI,QACTK,EAAE,MAAOL,KAAK,CAAE,GAAGK,EAAE,MAAOL,IAAI,EAAG,KAC9BA,IAAI,SAASA,IAAI,SACtBA,IAAI,SAASA,IAAI,WAAeqG,EAAI,WAAW,EAAEhK,CAAC,IAAI,MAClDgE,EAAE,MAAOL,KAAK,EAAG,GAAGK,EAAE,MAAQL,KAAK,KAAM,EAAG,GAAGK,EAAE,MAAQL,KAAK,IAAK,EAAG,GAAGK,EAAE,MAAOL,IAAI,EAAG,MAE7FK,EAAE,MAAOL,KAAK,EAAG,GAAGK,EAAE,MAAQL,KAAK,IAAK,EAAG,GAAGK,EAAE,MAAOL,IAAI,EAAG;AAAA,EACtE;AACA,SAAO9B,GAAIsI,GAAI,GAAGC,CAAE;AACxB;AA0DA,IAAIC,KAAO,SAAUC,GAAI;AACrB,MAAItJ,IAAK;AACT,MAAIsJ,EACA,UAASxB,KAAKwB,GAAI;AACd,QAAIvJ,IAAIuJ,EAAGxB,CAAA,EAAG;AACd,IAAI/H,IAAI,SACJiB,GAAI,CAAC,GACThB,KAAMD,IAAI;AAAA,EACd;AAEJ,SAAOC;AACX,GAEIuJ,KAAM,SAAUlI,GAAGtC,GAAGyK,GAAGC,GAAIC,GAAG/G,GAAGgH,GAAI1J,GAAI;AAC3C,MAAId,IAAKsK,EAAG,QAAQH,IAAKE,EAAE,OAAOI,IAAM3J,KAAMA,EAAG,QAC7C4J,IAAMR,GAAKC,CAAE;AACjB,EAAAjB,EAAOhH,GAAGtC,GAAG4K,KAAM,OAAO,WAAY,QAAS,GAAG5K,KAAK,GACnD4K,KAAM,SACNtI,EAAEtC,GAAA,IAAO,IAAIsC,EAAEtC,GAAA,IAAOyK,EAAE,KAC5BnI,EAAEtC,CAAA,IAAK,IAAIA,KAAK,GAChBsC,EAAEtC,GAAA,IAAQyK,EAAE,QAAQ,KAAM7G,IAAI,KAAK,IAAItB,EAAEtC,GAAA,IAAO2K,KAAK,GACrDrI,EAAEtC,GAAA,IAAOyK,EAAE,cAAc,KAAKnI,EAAEtC,GAAA,IAAOyK,EAAE,eAAe;AACxD,MAAIrH,IAAK,IAAI,KAAKqH,EAAE,SAAS,OAAO,KAAK,IAAI,IAAIA,EAAE,KAAK,GAAGM,IAAI3H,EAAG,YAAY,IAAI;AAkBlF,OAjBI2H,IAAI,KAAKA,IAAI,QACb9I,GAAI,EAAE,GACVqH,EAAOhH,GAAGtC,GAAI+K,KAAK,KAAQ3H,EAAG,SAAS,IAAI,KAAM,KAAOA,EAAG,QAAQ,KAAK,KAAOA,EAAG,SAAS,KAAK,KAAOA,EAAG,WAAW,KAAK,IAAMA,EAAG,WAAW,KAAK,CAAE,GAAGpD,KAAK,GACzJ4D,KAAK,OACL0F,EAAOhH,GAAGtC,GAAGyK,EAAE,GAAG,GAClBnB,EAAOhH,GAAGtC,IAAI,GAAG4D,IAAI,IAAI,CAACA,IAAI,IAAIA,CAAC,GACnC0F,EAAOhH,GAAGtC,IAAI,GAAGyK,EAAE,IAAI,IAE3BnB,EAAOhH,GAAGtC,IAAI,IAAII,CAAE,GACpBkJ,EAAOhH,GAAGtC,IAAI,IAAI8K,CAAG,GAAG9K,KAAK,IACzB4K,KAAM,SACNtB,EAAOhH,GAAGtC,GAAG6K,CAAG,GAChBvB,EAAOhH,GAAGtC,IAAI,GAAGyK,EAAE,KAAK,GACxBnB,EAAOhH,GAAGtC,IAAI,IAAI4K,CAAE,GAAG5K,KAAK,KAEhCsC,EAAE,IAAIoI,GAAI1K,CAAC,GACXA,KAAKI,GACD0K,EACA,UAAS,KAAKP,GAAI;AACd,QAAIS,IAAMT,EAAG,CAAA,GAAIvJ,IAAIgK,EAAI;AACzB,IAAA1B,EAAOhH,GAAGtC,GAAG,CAAC,CAAC,GACfsJ,EAAOhH,GAAGtC,IAAI,GAAGgB,CAAC,GAClBsB,EAAE,IAAI0I,GAAKhL,IAAI,CAAC,GAAGA,KAAK,IAAIgB;AAAA,EAChC;AAEJ,SAAI6J,MACAvI,EAAE,IAAIpB,GAAIlB,CAAC,GAAGA,KAAK6K,IAChB7K;AACX,GAEIiL,KAAM,SAAU1I,GAAGvC,GAAG4D,GAAGtB,GAAGP,GAAG;AAC/B,EAAAuH,EAAO/G,GAAGvC,GAAG,SAAS,GACtBsJ,EAAO/G,GAAGvC,IAAI,GAAG4D,CAAC,GAClB0F,EAAO/G,GAAGvC,IAAI,IAAI4D,CAAC,GACnB0F,EAAO/G,GAAGvC,IAAI,IAAIsC,CAAC,GACnBgH,EAAO/G,GAAGvC,IAAI,IAAI+B,CAAC;AACvB;AAoXA,SAAgBmJ,GAAQ1B,GAAMC,GAAM;AAChC,EAAKA,MACDA,IAAO,CAAC;AACZ,MAAI3I,IAAI,CAAC,GACLqK,IAAQ,CAAC;AACb,EAAAzB,GAAKF,GAAM,IAAI1I,GAAG2I,CAAI;AACtB,MAAIlH,IAAI,GACJ6I,IAAM;AACV,WAASV,KAAM5J,GAAG;AACd,QAAIX,IAAKW,EAAE4J,CAAA,GAAKW,IAAOlL,EAAG,CAAA,GAAI0B,IAAI1B,EAAG,CAAA,GACjCmL,IAAczJ,EAAE,SAAS,IAAI,IAAI,GACjC4I,IAAIT,GAAQU,CAAE,GAAG3J,IAAI0J,EAAE,QACvBc,IAAM1J,EAAE,SAASN,IAAIgK,KAAOvB,GAAQuB,CAAG,GAAGC,IAAKjK,KAAKA,EAAE,QACtDuJ,IAAMR,GAAKzI,EAAE,KAAK;AACtB,IAAId,IAAI,SACJkB,GAAI,EAAE;AACV,QAAIK,IAAIgJ,IAAc/B,GAAY8B,GAAMxJ,CAAC,IAAIwJ,GAAMrK,IAAIsB,EAAE,QACrDsB,IAAIoF,GAAI;AACZ,IAAApF,EAAE,EAAEyH,CAAI,GACRF,EAAM,KAAK9B,GAAIxH,GAAG;AAAA,MACd,MAAMwJ,EAAK;AAAA,MACX,KAAKzH,EAAE,EAAE;AAAA,MACT,GAAGtB;AAAA,MACA,GAAAmI;AAAA,MACA,GAAAlJ;AAAA,MACH,GAAGR,KAAK2J,EAAG,UAAWnJ,KAAMgK,EAAI,UAAUC;AAAA,MACvC,GAAAjJ;AAAA,MACU,aAAA+I;AAAA,IACjB,CAAC,CAAC,GACF/I,KAAK,KAAKxB,IAAI+J,IAAM9J,GACpBoK,KAAO,KAAK,KAAKrK,IAAI+J,MAAQU,KAAM,KAAKxK;AAAA,EAC5C;AAEA,WADIqD,IAAM,IAAI9E,EAAG6L,IAAM,EAAE,GAAGK,IAAKlJ,GAAGmJ,IAAMN,IAAM7I,GACvCtC,IAAI,GAAGA,IAAIkL,EAAM,QAAQ,EAAElL,GAAG;AACnC,QAAIwK,IAAIU,EAAMlL,CAAA;AACd,IAAAuK,GAAInG,GAAKoG,EAAE,GAAGA,GAAGA,EAAE,GAAGA,EAAE,GAAGA,EAAE,EAAE,MAAM;AACrC,QAAIkB,IAAO,KAAKlB,EAAE,EAAE,SAASH,GAAKG,EAAE,KAAK;AACzC,IAAApG,EAAI,IAAIoG,EAAE,GAAGA,EAAE,IAAIkB,CAAI,GACvBnB,GAAInG,GAAK9B,GAAGkI,GAAGA,EAAE,GAAGA,EAAE,GAAGA,EAAE,EAAE,QAAQA,EAAE,GAAGA,EAAE,CAAC,GAAGlI,KAAK,KAAKoJ,KAAQlB,EAAE,IAAIA,EAAE,EAAE,SAAS;AAAA,EACzF;AACA,SAAAQ,GAAI5G,GAAK9B,GAAG4I,EAAM,QAAQO,GAAKD,CAAE,GAC1BpH;AACX;AC5oEA,IAAMuH,KAAa,SACbC,KAAA,CAAUC,MAAU,SAASF,EAAA,IAAcE,CAAA,SACpCC,KAAiB,MAAMH,EAAA,IAAcC,GAAOA,GAAOA,GAAOD,EAAU,CAAC,CAAC,CAAA,OCnItEI,KAAe;AAAA,EACxB,MAAM;AAAA,EACN,SAAS;AAAA,EACT,gBAAgB;AAAA,EAChB,cAAc;AAAA,EACd,eAAe;AAAA,EAEf,OAAO;AAAA,EACP,UAAU;AAAA,EACV,MAAM;AAAA,EACN,SAAS;AAAA,EACT,WAAW;AAAA,EACX,YAAY;AAAA,EACZ,gBAAgB;AAAA,EAChB,MAAM;AAAA,EACN,aAAa;AAAA,EACb,aAAa;AAAA,EACb,WAAW;AAAA,EACX,kBAAkB;AAAA,EAClB,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,YAAY;AAAA,EACZ,cAAc;AAAA,EACd,QAAQ;AAAA,EACR,eAAe;AAAA,EACf,QAAQ;AAAA,EACR,OAAO;AAAA,EACP,YAAY;AAAA,EACZ,UAAU;AAAA,EACV,UAAU;AACd,G;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;A,GC7CMhN,KAAUC,GAAI,SCEdqO,IAAN,cAAyB,MAAM;AAC/B;AACA,SAASC,GAASC,GAAQ;AACtB,QAAMC,IAAS,CAAC;AAChB,MAAIC,IAAI;AACR,SAAOA,IAAIF,EAAO,UAAQ;AACtB,UAAMG,IAAIH,EAAOE,CAAA;AACjB,QAAIC,KAAK;AAAA;AACL,MAAAF,EAAO,KAAK;AAAA,QAAE,MAAM;AAAA,QAAM,MAAM;AAAA;AAAA,QAAM,OAAOC;AAAA,QAAG,KAAKA,IAAI;AAAA,MAAE,CAAC,GAC5DA;AAAA,aAEK,KAAK,KAAKC,CAAC,EAChB,CAAAD;AAAA,aAEKC,KAAK,OAAOH,EAAOE,IAAI,CAAA,KAAM,IAClC,QAAOA,IAAIF,EAAO,UAAUA,EAAOE,CAAA,KAAM;AAAA,IACrC,CAAAA;AAAA,aAECC,KAAK,KAAM;AAChB,UAAIC,IAAQ,IACRC,IAAIH,IAAI;AACZ,aAAOG,IAAIL,EAAO,UAAUA,EAAOK,CAAA,KAAM,KAAMA,IAC3C,CAAIL,EAAOK,CAAA,KAAM,QAAQA,IAAI,IAAIL,EAAO,UACpCK,KACAD,KAASJ,EAAOK,CAAA,KAAM,MAAM;AAAA,IAAOL,EAAOK,CAAA,KAG1CD,KAASJ,EAAOK,CAAA;AAGxB,MAAAJ,EAAO,KAAK;AAAA,QAAE,MAAM;AAAA,QAAO,MAAMD,EAAO,UAAUE,GAAGG,IAAI,CAAC;AAAA,QAAG,OAAAD;AAAA,QAAO,OAAOF;AAAA,QAAG,KAAKG,IAAI;AAAA,MAAE,CAAC,GAC1FH,IAAIG,IAAI;AAAA,IACZ,WACS,KAAK,KAAKF,CAAC,GAAG;AAEnB,YAAMG,IAAI,yCAAyC,KAAKN,EAAO,UAAUE,CAAC,CAAC;AAC3E,MAAAD,EAAO,KAAK;AAAA,QAAE,MAAM,WAAW,KAAKK,EAAE,CAAA,CAAE,IAAI,QAAQ;AAAA,QAAQ,MAAMA,EAAE,CAAA;AAAA,QAAI,OAAOJ;AAAA,QAAG,KAAKA,IAAII,EAAE,CAAA,EAAG;AAAA,MAAO,CAAC,GACxGJ,KAAKI,EAAE,CAAA,EAAG;AAAA,IACd,WACS,YAAY,KAAKH,CAAC,GAAG;AAC1B,YAAMG,IAAI,mBAAmB,KAAKN,EAAO,UAAUE,CAAC,CAAC;AACrD,MAAAD,EAAO,KAAK;AAAA,QAAE,MAAM;AAAA,QAAQ,MAAMK,EAAE,CAAA;AAAA,QAAI,OAAOJ;AAAA,QAAG,KAAKA,IAAII,EAAE,CAAA,EAAG;AAAA,MAAO,CAAC,GACxEJ,KAAKI,EAAE,CAAA,EAAG;AAAA,IACd,OACK;AACD,YAAMC,IAAMP,EAAO,UAAUE,GAAGA,IAAI,CAAC,GAC/BM,IAAK;AAAA,QAAC;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,MAAI,EAAE,SAASD,CAAG,IAAIA,IAAMJ;AAC5E,MAAAF,EAAO,KAAK;AAAA,QAAE,MAAM,oBAAoB,SAASO,CAAE,KAAKA,EAAG,UAAU,IAAI,OAAO;AAAA,QAAS,MAAMA;AAAA,QAAI,OAAON;AAAA,QAAG,KAAKA,IAAIM,EAAG;AAAA,MAAO,CAAC,GACjIN,KAAKM,EAAG;AAAA,IACZ;AAAA,EACJ;AACA,SAAOP;AACX;AACA,IAAMQ,KAAW,oBAAI,IAAI;AAAA,EAAC;AAAA,EAAO;AAAA,EAAM;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAQ;AAAA,EAAM;AAAA,EAAQ;AAAA,EAAa;AAAA,EAAa;AAAA,EAAU;AAAA,EAAQ;AAAS,CAAC,GAC9HC,KAAb,MAAaA,EAAa;AAAA,EAEtB,YAAYV,GAAQW,GAAO;AACvB,WAAO,eAAe,MAAM,UAAU;AAAA,MAClC,YAAY;AAAA,MACZ,cAAc;AAAA,MACd,UAAU;AAAA,MACV,OAAOX;AAAA,IACX,CAAC,GACD,OAAO,eAAe,MAAM,SAAS;AAAA,MACjC,YAAY;AAAA,MACZ,cAAc;AAAA,MACd,UAAU;AAAA,MACV,OAAOW;AAAA,IACX,CAAC,GACD,OAAO,eAAe,MAAM,UAAU;AAAA,MAClC,YAAY;AAAA,MACZ,cAAc;AAAA,MACd,UAAU;AAAA,MACV,OAAO;AAAA,IACX,CAAC,GACD,OAAO,eAAe,MAAM,OAAO;AAAA,MAC/B,YAAY;AAAA,MACZ,cAAc;AAAA,MACd,UAAU;AAAA,MACV,OAAO;AAAA,IACX,CAAC,GACD,KAAK,SAASZ,GAASC,CAAM;AAAA,EACjC;AAAA,EACA,OAAO,MAAMA,GAAQW,GAAO;AAGxB,WADa,IADMD,EAAaV,GAAQW,CACtB,EAAE,WAAW,EACrB;AAAA,EACd;AAAA,EACA,KAAKC,IAAS,GAAG;AACb,WAAO,KAAK,OAAO,KAAK,MAAMA,CAAA;AAAA,EAClC;AAAA,EACA,GAAGC,GAAMD,IAAS,GAAG;AACjB,UAAME,IAAI,KAAK,KAAKF,CAAM;AAC1B,WAAO,CAAC,CAACE,KAAKA,EAAE,QAAQ,SAASA,EAAE,QAAQD;AAAA,EAC/C;AAAA,EACA,OAAOA,GAAM;AACT,UAAM,IAAI,KAAK,KAAK;AACpB,QAAI,CAAC,KAAK,EAAE,QAAQ,SAAS,EAAE,QAAQA,EACnC,OAAM,IAAIf,EAAW,aAAae,CAAA,GAAO;AAC7C,gBAAK,OACE;AAAA,EACX;AAAA,EACA,eAAe;AACX,WAAO,KAAK,KAAK,GAAG,QAAQ,OACxB,MAAK;AAAA,EACb;AAAA,EAEA,WAAWE,GAAS;AAChB,UAAMC,IAAS,CAAC;AAChB,eAAS;AAGL,UAFA,KAAK,aAAa,GAEd,CADM,KAAK,KACV,GAAG;AACJ,YAAID,EACA,OAAM,IAAIjB,EAAW,mBAAmB;AAC5C,eAAOkB;AAAA,MACX;AACA,UAAID,KAAW,KAAK,GAAG,GAAG,EACtB,QAAOC;AACX,MAAAA,EAAO,KAAK,KAAK,UAAU,CAAC;AAAA,IAChC;AAAA,EACJ;AAAA,EACA,QAAQ;AACJ,SAAK,aAAa,GAClB,KAAK,OAAO,GAAG;AACf,UAAMC,IAAO,KAAK,WAAW,EAAI;AACjC,gBAAK,OAAO,GAAG,GACRA;AAAA,EACX;AAAA,EAGA,YAAY;AACR,UAAMC,IAAQ,KAAK;AACnB,QAAI;AACA,YAAMC,IAAO,KAAK,iBAAiB;AACnC,kBAAK,eAAe,GACbA;AAAA,IACX,SACOC,GAAG;AACN,UAAI,EAAEA,aAAatB,GACf,OAAMsB;AACV,kBAAK,MAAMF,GACX,KAAK,iBAAiB,GACf;AAAA,QAAE,GAAG;AAAA,QAAO,KAAK,KAAK,WAAWA,CAAK;AAAA,MAAE;AAAA,IACnD;AAAA,EACJ;AAAA,EACA,iBAAiB;AACb,UAAMJ,IAAI,KAAK,KAAK;AACpB,QAAIA,KAAKA,EAAE,QAAQ,QAAQ,CAAC,KAAK,GAAG,GAAG,EACnC,OAAM,IAAIhB,EAAW,mCAAmC;AAAA,EAChE;AAAA,EACA,mBAAmB;AACf,QAAIuB,IAAQ;AACZ,WAAO,KAAK,KAAK,KAAG;AAChB,YAAM,IAAI,KAAK,KAAK;AACpB,UAAI,EAAE,QAAQ,QAAQA,KAAS,EAC3B;AAGJ,UAFI,EAAE,QAAQ,SAAS,EAAE,QAAQ,OAAO,EAAE,QAAQ,QAC9CA,KACA,EAAE,QAAQ,SAAS,EAAE,QAAQ,OAAO,EAAE,QAAQ,MAAM;AACpD,YAAIA,KAAS,EACT;AAIJ,YAHAA,KACA,KAAK,OAEDA,KAAS,KAAK,EAAE,QAAQ,KAAK;AAC7B,cAAIhB,IAAI;AACR,iBAAO,KAAK,KAAKA,CAAC,GAAG,QAAQ,OACzB,CAAAA;AACJ,cAAI,CAAC,KAAK,GAAG,QAAQA,CAAC,KAAK,CAAC,KAAK,GAAG,aAAaA,CAAC,EAC9C;AAAA,QACR;AACA;AAAA,MACJ;AACA,WAAK;AAAA,IACT;AAAA,EACJ;AAAA,EACA,WAAWiB,GAAY;AACnB,UAAMC,IAAQ,KAAK,OAAOD,CAAA,GACpBE,IAAO,KAAK,OAAO,KAAK,MAAM,CAAA;AACpC,WAAI,CAACD,KAAS,CAACC,KAAQ,KAAK,OAAOF,IACxB,KACJ,KAAK,OAAO,UAAUC,EAAM,OAAOC,EAAK,GAAG,EAAE,KAAK;AAAA,EAC7D;AAAA,EACA,mBAAmB;AACf,UAAMN,IAAQ,KAAK,KACb,IAAI,KAAK,KAAK,GACdO,IAAA,MAAY,KAAK,WAAWP,CAAK;AACvC,QAAI,EAAE,QAAQ,OACV,OAAM,IAAIpB,EAAW,4CAA4C;AACrE,QAAI,EAAE,QAAQ,MAAM;AAChB,YAAM4B,IAAW,CAAC;AAClB,UAAIC;AAGJ,WAFA,KAAK,OACLD,EAAS,KAAK;AAAA,QAAE,MAAM,KAAK,UAAU;AAAA,QAAG,MAAM,KAAK,MAAM;AAAA,MAAE,CAAC,OACnD;AACL,YAAIrB,IAAI;AACR,eAAO,KAAK,KAAKA,CAAC,GAAG,QAAQ,OACzB,CAAAA;AACJ,YAAI,CAAC,KAAK,GAAG,QAAQA,CAAC,EAClB;AAEJ,YADA,KAAK,OAAOA,IAAI,GACZ,KAAK,GAAG,IAAI;AACZ,eAAK,OACLqB,EAAS,KAAK;AAAA,YAAE,MAAM,KAAK,UAAU;AAAA,YAAG,MAAM,KAAK,MAAM;AAAA,UAAE,CAAC;AAAA,aAE3D;AACD,UAAAC,IAAY,KAAK,MAAM;AACvB;AAAA,QACJ;AAAA,MACJ;AACA,aAAO;AAAA,QAAE,GAAG;AAAA,QAAM,UAAAD;AAAA,QAAU,WAAAC;AAAA,QAAW,KAAKF,EAAI;AAAA,MAAE;AAAA,IACtD;AACA,QAAI,EAAE,QAAQ,aAAa;AACvB,WAAK;AACL,YAAMR,IAAO,KAAK,MAAM;AACxB,UAAIZ,IAAI;AACR,aAAO,KAAK,KAAKA,CAAC,GAAG,QAAQ,OACzB,CAAAA;AACJ,UAAIsB;AACJ,aAAI,KAAK,GAAG,aAAatB,CAAC,MACtB,KAAK,OAAOA,IAAI,GAChBsB,IAAY,KAAK,MAAM,IAEpB;AAAA,QAAE,GAAG;AAAA,QAAa,MAAAV;AAAA,QAAM,WAAAU;AAAA,QAAW,KAAKF,EAAI;AAAA,MAAE;AAAA,IACzD;AACA,QAAI,EAAE,QAAQ,UAAU;AACpB,WAAK;AACL,YAAMrB,IAAQ,KAAK,UAAU;AAC7B,WAAK,aAAa,GAClB,KAAK,OAAO,GAAG;AACf,YAAMwB,IAAQ,CAAC;AACf,UAAID;AACJ,aACI,KAAK,aAAa,GACd,MAAK,GAAG,GAAG;AAEf,YAAI,KAAK,GAAG,MAAM,GAAG;AACjB,eAAK,OACL,KAAK,OAAO,GAAG;AACf,gBAAME,IAAS,KAAK,eAAe,GAAG;AACtC,eAAK,OAAO,GAAG,GACfD,EAAM,KAAK;AAAA,YAAE,QAAAC;AAAA,YAAQ,MAAM,KAAK,MAAM;AAAA,UAAE,CAAC;AAAA,QAC7C,WACS,KAAK,GAAG,SAAS;AACtB,eAAK,OACLF,IAAY,KAAK,MAAM;AAAA,YAGvB,OAAM,IAAI7B,EAAW,0BAA0B;AAGvD,kBAAK,OAAO,GAAG,GACR;AAAA,QAAE,GAAG;AAAA,QAAU,OAAAM;AAAA,QAAO,OAAAwB;AAAA,QAAO,WAAAD;AAAA,QAAW,KAAKF,EAAI;AAAA,MAAE;AAAA,IAC9D;AAEA,UAAMK,IAAS,KAAK,KAAK,CAAC,GACpBC,IAAUD,GAAQ,QAAQ,UAAU;AAAA,MAAE,MAAM,CAAC,OAAO;AAAA,MAAG,MAAM,CAAC,OAAO;AAAA,MAAG,MAAM,CAAC,OAAO,QAAQ;AAAA,MAAG,YAAY,CAAC,OAAO,QAAQ;AAAA,MAAG,IAAI,CAAC,OAAO;AAAA,IAAE,EAAE,EAAE,IAAA,GAAO,SAASA,EAAO,IAAI;AACnL,QAAIC,KAAW,EAAE,QAAQ;AACrB,kBAAK,OAAO,GACL;AAAA,QAAE,GAAG;AAAA,QAAQ,IAAI;AAAA,QAAY,MAAM,CAAC;AAAA,QAAG,UAAU,KAAK,MAAM;AAAA,QAAG,KAAKN,EAAI;AAAA,MAAE;AAErF,QAAIM,GAAS;AACT,WAAK,OAAO;AACZ,YAAMC,IAAO,KAAK,GAAG,GAAG,IAAI,KAAK,UAAU,IAAI,CAAC;AAChD,aAAO;AAAA,QAAE,GAAG;AAAA,QAAQ,IAAI,GAAG,EAAE,IAAA,IAAQF,EAAO,IAAA;AAAA,QAAQ,MAAAE;AAAA,QAAM,KAAKP,EAAI;AAAA,MAAE;AAAA,IACzE;AAEA,UAAMQ,IAAO,KAAK;AAClB,QAAI,CAACxB,GAAS,IAAI,EAAE,IAAI,EACpB,KAAI;AACA,YAAMyB,IAAS,KAAK,KAAK;AACzB,UAAI,KAAK,GAAG,GAAG;AACX,oBAAK,OAEE;AAAA,UAAE,GAAG;AAAA,UAAU,QAAAA;AAAA,UAAQ,OADhB,KAAK,WACe;AAAA,UAAG,KAAKT,EAAI;AAAA,QAAE;AAAA,IAExD,SACOL,GAAG;AACN,UAAI,EAAEA,aAAatB,GACf,OAAMsB;AAAA,IACd;AAEJ,SAAK,MAAMa;AAGX,QAAIE,IAAK,EAAE;AAEX,SADA,KAAK,OACE,KAAK,GAAG,GAAG,KAAK,KAAK,KAAK,CAAC,GAAG,QAAQ;AACzC,MAAAA,KAAM,MAAM,KAAK,KAAK,CAAC,EAAE,MACzB,KAAK,OAAO;AAEhB,UAAMH,IAAO,KAAK,GAAG,GAAG,IAAI,KAAK,UAAU,IAAI,CAAC;AAChD,QAAII,GACA/B,IAAI;AACR,WAAO,KAAK,KAAKA,CAAC,GAAG,QAAQ,OACzB,CAAAA;AACJ,WAAI,KAAK,GAAG,KAAKA,CAAC,MAAMA,KAAK,KAAK,EAAE,QAAQ,cAAc,EAAE,QAAQ,gBAChE+B,IAAW,KAAK,MAAM,IAEnB;AAAA,MAAE,GAAG;AAAA,MAAQ,IAAAD;AAAA,MAAI,MAAAH;AAAA,MAAM,UAAAI;AAAA,MAAU,KAAKX,EAAI;AAAA,IAAE;AAAA,EACvD;AAAA,EACA,YAAY;AACR,SAAK,OAAO,GAAG;AACf,UAAM,IAAI,KAAK,WAAW;AAC1B,gBAAK,OAAO,GAAG,GACR;AAAA,EACX;AAAA,EACA,YAAY;AACR,SAAK,OAAO,GAAG;AACf,UAAMO,IAAO,KAAK,eAAe,GAAG;AACpC,gBAAK,OAAO,GAAG,GACRA;AAAA,EACX;AAAA,EACA,eAAeK,GAAK;AAChB,UAAMC,IAAQ,CAAC;AAEf,QADA,KAAK,aAAa,GACd,KAAK,GAAGD,CAAG,EACX,QAAOC;AACX,eAAS;AAIL,UAHA,KAAK,aAAa,GAClBA,EAAM,KAAK,KAAK,WAAW,CAAC,GAC5B,KAAK,aAAa,GACd,CAAC,KAAK,GAAG,GAAG,EACZ,QAAOA;AACX,WAAK;AAAA,IACT;AAAA,EACJ;AAAA,EACA,aAAa;AACT,WAAO,KAAK,OAAO,CAAC;AAAA,EACxB;AAAA,EACA,OAAOC,GAAO;AACV,QAAIA,KAAS7B,EAAa,OAAO,OAC7B,QAAO,KAAK,MAAM;AACtB,QAAI8B,IAAO,KAAK,OAAOD,IAAQ,CAAC;AAChC,eAAS;AACL,YAAMzB,IAAI,KAAK,KAAK;AACpB,UAAI,CAACA,KAAKA,EAAE,QAAQ,SAAS,CAACJ,EAAa,OAAO6B,CAAA,EAAO,SAASzB,EAAE,IAAI,EACpE,QAAO0B;AACX,WAAK,OACL,KAAK,aAAa,GAElBA,IAAO;AAAA,QAAE,GAAG;AAAA,QAAO,IADR1B,EAAE,QAAQ,OAAO,OAAOA,EAAE,QAAQ,OAAO,QAAQA,EAAE,QAAQ,OAAO,MAAMA,EAAE,QAAQ,OAAO,OAAOA,EAAE;AAAA,QACtF,GAAG0B;AAAA,QAAM,GAAG,KAAK,OAAOD,IAAQ,CAAC;AAAA,MAAE;AAAA,IAC9D;AAAA,EACJ;AAAA,EACA,QAAQ;AACJ,WAAI,KAAK,GAAG,KAAK,KAAK,KAAK,GAAG,GAAG,KAC7B,KAAK,OACE;AAAA,MAAE,GAAG;AAAA,MAAO,GAAG,KAAK,MAAM;AAAA,IAAE,KAEnC,KAAK,GAAG,GAAG,KACX,KAAK,OACE;AAAA,MAAE,GAAG;AAAA,MAAO,GAAG,KAAK,MAAM;AAAA,IAAE,KAEhC,KAAK,QAAQ;AAAA,EACxB;AAAA,EACA,UAAU;AACN,UAAMzB,IAAI,KAAK,KAAK;AACpB,QAAI,CAACA,EACD,OAAM,IAAIhB,EAAW,kCAAkC;AAC3D,QAAIgB,EAAE,QAAQ;AACV,kBAAK,OACE;AAAA,QAAE,GAAG;AAAA,QAAO,GAAGA,EAAE;AAAA,MAAM;AAElC,QAAIA,EAAE,QAAQ,SAAS,CAAC,KAAK,WAAW;AACpC,kBAAK,OACE;AAAA,QAAE,GAAG;AAAA,QAAO,GAAG,OAAOA,EAAE,IAAI;AAAA,MAAE;AAEzC,QAAI,KAAK,GAAG,GAAG,GAAG;AACd,WAAK;AACL,YAAMM,IAAI,KAAK,WAAW;AAC1B,kBAAK,OAAO,GAAG,GACRA;AAAA,IACX;AACA,QAAIN,EAAE,QAAQ,WAAWA,EAAE,QAAQ,UAAUA,EAAE,QAAQ;AACnD,kBAAK,OACE;AAAA,QAAE,GAAG;AAAA,QAAQ,GAAGA,EAAE,QAAQ;AAAA,MAAO;AAE5C,QAAIA,EAAE,QAAQ,UAAUA,EAAE,QAAQ;AAC9B,kBAAK,OACE,EAAE,GAAG,OAAO;AAEvB,SAAKA,EAAE,QAAQ,UAAUA,EAAE,QAAQ,UAAU,CAACL,GAAS,IAAIK,EAAE,IAAI,GAAG;AAEhE,UAAIA,EAAE,QAAQ,UAAU,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,WAAW,GAAG;AAC3D,aAAK;AACL,cAAMkB,IAAO,KAAK,UAAU;AAC5B,eAAO;AAAA,UAAE,GAAG;AAAA,UAAQ,IAAIlB,EAAE;AAAA,UAAM,MAAAkB;AAAA,QAAK;AAAA,MACzC;AACA,aAAO,KAAK,KAAK;AAAA,IACrB;AACA,UAAM,IAAIlC,EAAW,eAAegB,EAAE,IAAA,GAAO;AAAA,EACjD;AAAA,EAGA,aAAa;AACT,QAAI2B,IAAO,GACPC,IAAO;AACX,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AACzB,YAAM5B,IAAI,KAAK,KAAK,CAAC;AAGrB,UAFI,CAACA,KAAMA,EAAE,QAAQ,UAAUA,EAAE,QAAQ,SAErC,IAAI,KACQ,KAAK,OAAO,UAAU,KAAK,KAAK,IAAI,CAAC,EAAE,KAAKA,EAAE,KACpD,KAAK;AACP;AAER,MAAA4B,MAAS,IAAI,IAAI,MAAM,MAAM5B,EAAE,MAC3B,KAAK,MAAM,IAAI4B,CAAI,MACnBD,IAAO,IAAI;AAAA,IACnB;AACA,WAAOA;AAAA,EACX;AAAA,EAEA,OAAO;AACH,UAAME,IAAQ,CAAC;AACf,eAAS;AACL,YAAM,IAAI,KAAK,KAAK;AACpB,UAAI,CAAC,KAAM,EAAE,QAAQ,UAAU,EAAE,QAAQ,SAAUlC,GAAS,IAAI,EAAE,IAAI,EAClE,OAAM,IAAIX,EAAW,iBAAiB;AAC1C,YAAM8C,IAAQ,KAAK,WAAW;AAC9B,UAAIA,IAAQ;AACR,QAAAD,EAAM,KAAK,KAAK,OAAO,MAAM,KAAK,KAAK,KAAK,MAAMC,CAAK,EAAE,IAAA,CAAIC,MAAKA,EAAE,IAAI,EAAE,KAAK,GAAG,CAAC,GACnF,KAAK,OAAOD;AAAA,WAEX;AACD,YAAI,EAAE,QAAQ,SAASD,EAAM,UAAU,KAAKC,KAAS,EACjD,OAAM,IAAI9C,EAAW,iBAAiB;AAC1C,QAAA6C,EAAM,KAAK,EAAE,IAAI,GACjB,KAAK;AAAA,MACT;AACA,UAAI,CAAC,KAAK,GAAG,GAAG,EACZ,QAAO;AAAA,QAAE,GAAG;AAAA,QAAQ,OAAAA;AAAA,MAAM;AAC9B,WAAK;AAAA,IACT;AAAA,EACJ;AACJ;AACA,OAAO,eAAejC,IAAc,UAAU;AAAA,EAC1C,YAAY;AAAA,EACZ,cAAc;AAAA,EACd,UAAU;AAAA,EACV,OAAO;AAAA,IACH,CAAC,MAAM,IAAI;AAAA,IACX,CAAC,OAAO,IAAI;AAAA,IACZ;AAAA,MAAC;AAAA,MAAK;AAAA,MAAM;AAAA,MAAM;AAAA,MAAM;AAAA,MAAK;AAAA,MAAK;AAAA,MAAM;AAAA,IAAI;AAAA,IAC5C,CAAC,KAAK,GAAG;AAAA,IACT;AAAA,MAAC;AAAA,MAAK;AAAA,MAAK;AAAA,IAAG;AAAA,EAClB;AACJ,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;A,GC1bK8D,KAAU9S,GAAI,SAqCd+S,KAAoC;AAAA,EACtC,MAAM;AAAA,EACN,MAAM;AAAA,EACN,KAAK;AAAA,EACL,KAAK;AAAA,EACL,KAAK;AAAA,EACL,MAAM;AAAA,EACN,KAAK;AAAA,EACL,KAAK;AAAA,EACL,KAAK;AAAA,EACL,MAAM;AAAA,EACN,KAAK;AAAA,EACL,MAAM;AAAA,EACN,KAAK;AAAA,EACL,KAAK;AAAA,EACL,KAAK;AAAA,EACL,KAAK;AAAA,EACL,MAAM;AAAA,EACN,KAAK;AAAA,EACL,MAAM;AAAA,EACN,KAAK;AAAA,EACL,KAAK;AAAA,EACL,KAAK;AAAA,EACL,MAAM;AAAA,EACN,KAAK;AAAA,EACL,KAAK;AAAA,EACL,KAAK;AAAA,EACL,MAAM;AAAA,EACN,OAAO;AAAA,EACP,KAAK;AAAA,EACL,MAAM;AAAA,EACN,KAAK;AACT,GAEaC,KAAA,CAAeC,MACxBF,GAAUE,EAAK,MAAM,GAAG,EAAE,IAAI,GAAG,YAAY,KAAK,EAAA,KAAO,4BAIhDC,KAAA,CAAsBD,MAAiB;AAChD,QAAME,IAAaF,EAAK,QAAQ,OAAO,GAAG,EAAE,QAAQ,YAAY,EAAE;AAClE,MAAI,CAACE,KAAcA,EAAW,WAAW,GAAG,KAAK,WAAW,KAAKA,CAAU,KAAKA,EAAW,MAAM,GAAG,EAAE,SAAS,IAAI,EAC/G,OAAM,IAAI,MAAM,uBAAuBF,CAAA,EAAM;AAEjD,SAAOE;AACX,GAEMC,KAAA,CAAYC,MAAsB;AACpC,MAAIC,IAAS;AAEb,WAASC,IAAI,GAAGA,IAAIF,EAAM,QAAQE,KAAK,MACnC,CAAAD,KAAU,OAAO,aAAa,GAAGD,EAAM,SAASE,GAAGA,IAAI,KAAS,CAAC;AAErE,SAAO,KAAKD,CAAM;AACtB,GAGME,KAAA,CAAmBC,MAAiBA,EAAK,QAAQ,YAAA,CAAYC,MAAK,KAAKA,EAAE,WAAW,CAAC,CAAA,GAAI,GAGzFC,KAAA,CAAkBC,MAAmB,KAAK,UAAUA,CAAK,EAAE,QAAQ,MAAM,SAAS,GAE3EC,KAAgB,OAAOC,GAAuBC,IAA+C,OAA4B;AAElI,QAAMC,IAA0B,OAAOD,KAAuB,YACxD,EAAE,WAAWA,EAAmB,IAChCA,GAEAE,IAAiC,CAAC,GAClCC,IAASJ,EAAM,UAAU,GAEzBK,IAAc;AAAA;AAAA,uBAAgCrB,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAC9CsB,IAAcnU,GAAW,SAAS,IAAI;AAAA;AAAA,IAASC,GAAQ,SAAS,GAEhEqU,IAAU,MAAMT,EAAM,MAAM,GAE5BU,IAAqC,CAAC;AAC5C,aAAW,CAACvB,GAAMI,CAAA,KAAU,OAAO,QAAQW,EAAQ,UAAU,CAAC,CAAC,EAC3D,CAAAQ,EAAOtB,GAAmBD,CAAI,CAAA,IAAKI;AAKvC,QAAMoB,IAAU,oBAAI,IAAY,GAC1BC,IAAA,CAAczB,MAAiB;AACjC,QAAI,CAACe,EAAQ,WAAY;AACzB,QAAIb;AACJ,QAAI;AACA,MAAAA,IAAaD,GAAmBD,CAAI;AAAA,IACxC,QAAQ;AACJ;AAAA,IACJ;AACA,UAAMI,IAAQmB,EAAOrB,CAAA;AACrB,QAAKE;AACL,aAAAoB,EAAQ,IAAItB,CAAU,GACf,IAAI,YAAY,EAAE,OAAOE,CAAK;AAAA,EACzC,GACMsB,IAAaT,EAAO,gBAAgB,IAAA,CAAIU,MAAU;AACpD,UAAMnB,IAAOiB,EAAWE,CAAM;AAC9B,WAAOnB,MAAS,SACV,gBAAgBmB,CAAA,iBAChB;AAAA,IAAenB,EAAK,QAAQ,iBAAiB,QAAQ,IAAI;AAAA;AAAA,EACnE,CAAC,EAAE,KAAK;AAAA,CAAI,GACNoB,IAAiBX,EAAO,oBAAoB,IAAA,CAAIY,MAAS;AAC3D,UAAMrB,IAAOiB,EAAWI,CAAK;AAC7B,WAAOrB,MAAS,SACV,gCAAgCqB,CAAA,QAChC;AAAA,IAAcrB,EAAK,QAAQ,gBAAgB,QAAQ,IAAI;AAAA;AAAA,EACjE,CAAC,EAAE,KAAK;AAAA,CAAI;AACZ,MAAIsB,IAAe,IAKfC,GACAC,GACAC;AAEJ,MAAIlB,EAAQ;AAMR,QAJAgB,IAAe;AAAA,IAAcZ,IAAc;AAAA,eAC3Ca,IAAiB;AAAA,IAAe9U,KAAiB;AAAA,iBACjD+U,IAAe;AAAA,IAAeX,IAAU;AAAA,iBAEpC,OAAO,KAAKC,CAAM,EAAE,KAAA,CAAKvB,MAAQ,CAACwB,EAAQ,IAAIxB,CAAI,CAAC,GAAG;AAEtD,YAAMmC,IAAW,OAAO,YAAY,OAAO,QAAQZ,CAAM,EAAE,OAAA,CAAQ,CAACvB,CAAA,MAAU,CAACwB,EAAQ,IAAIxB,CAAI,CAAC,EAAE,IAAA,CAAK,CAACA,GAAMI,CAAA,MAC1G,CAACJ,GAAM,QAAQD,GAAYC,CAAI,CAAA,WAAYG,GAASC,CAAK,CAAA,EAAG,CAAC,CAAC;AAClE,MAAA6B,KAAgB;AAAA;AAAA,2BAA4CvB,GAAeyB,CAAQ,IAAI;AAAA,iBACvFL,IAAe;AAAA,IACnB;AAAA;AAGA,IAAAC,IAAe,6CACfC,IAAiB,sDACjBC,IAAe,qCAEfjB,EAAO,UAAA,IAAcM,GACrBN,EAAO,2BAAA,IAA+B9T,IACtC8T,EAAO,WAAA,IAAeG;AAG1B,MAAIiB,IAAWjV,GAAiB,SAAS;AAGzC,EAAAiV,IAAWA,EAAS,QAAQ,qEAAA,CACvBE,GAAGC,MAAmBxB,EAAQ,eAAe,KAAQ,KAAKwB,CAAM,GACrEH,IAAWA,EAAS,QAAQ,qEAAA,CACvBE,GAAGC,MAAmBxB,EAAQ,eAAe,KAAQ,KAAKwB,CAAM;AACrE,QAAMC,IAAkC;AAAA,IAAE,GAAGC;AAAA,IAAc,GAAG1B,EAAQ;AAAA,EAAQ;AAC9E,SAAAqB,IAAWA,EAAS,QAAQ,kBAAA,CAAmBM,GAAOtD,MAClD,OAAO,UAAU,eAAe,KAAKoD,GAASpD,CAAI,IAAImB,GAAgBiC,EAAQpD,CAAA,CAAK,IAAIsD,CAAK,GAEhGN,IAAWA,EAAS,QAAQ,sBAAA,MAA4B1B,GAAe8B,CAAO,CAAC,GAC/EJ,IAAWA,EAAS,QAAQ,iBAAA,MAAuBlB,CAAW,GAC9DkB,IAAWA,EAAS,QAAQ,kBAAA,MAAwBnB,EAAO,KAAK,GAChEmB,IAAWA,EAAS,QAAQ,oBAAA,MAA0BV,CAAU,GAChEU,IAAWA,EAAS,QAAQ,wBAAA,MAA8BR,CAAc,GACxEQ,IAAWA,EAAS,QAAQ,0BAAA,MAAgCL,CAAY,GACxEK,IAAWA,EAAS,QAAQ,4BAAA,MAAkCJ,CAAc,GAC5EI,IAAWA,EAAS,QAAQ,0BAAA,MAAgCH,CAAY,GACxEG,IAAWA,EAAS,QAAQ,qCAAA,CAAsCE,GAAGK,MAAmBb,IAAe;AAAA,IAAOa,IAASb,IAAe,EAAE,GAExId,EAAO,YAAA,IAAgBoB,GAEhB;AAAA,IACH,OAAOpB;AAAA,IACP,KAAMD,EAAQ,YAAwB6B,GAAQ;AAAA,MAE1C,GAAI7B,EAAQ,aAAa,CAAC,IAAIQ;AAAA,MAE9B,GAAG,OAAO,YACN,OAAO,QAAQP,CAAM,EAAE,IAAA,CAAK,CAAC5B,GAAMoB,CAAA,MAAU,CAACpB,GAAMyD,GAAQrC,CAAI,CAAC,CAAC,CACtE;AAAA,IACJ,CAAC,IAPyB;AAAA,EAQ9B;AACJ"}