@5ss/ai-tools 2.11.2 → 2.11.3

package/dist/esm-BDrCssjb.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"esm-BDrCssjb.js","names":[],"sources":["../node_modules/fflate/esm/index.mjs"],"sourcesContent":["import { createRequire } from 'module';\nvar require = createRequire('/');\n// DEFLATE is a complex format; to read this code, you should probably check the RFC first:\n// https://tools.ietf.org/html/rfc1951\n// You may also wish to take a look at the guide I made about this program:\n// https://gist.github.com/101arrowz/253f31eb5abc3d9275ab943003ffecad\n// Some of the following code is similar to that of UZIP.js:\n// https://github.com/photopea/UZIP.js\n// However, the vast majority of the codebase has diverged from UZIP.js to increase performance and reduce bundle size.\n// Sometimes 0 will appear where -1 would be more appropriate. This is because using a uint\n// is better for memory in most engines (I *think*).\nvar _a;\n// Mediocre shim\nvar Worker;\nvar isMarkedAsUntransferable;\nvar workerAdd = \";var __w=require('worker_threads');__w.parentPort.on('message',function(m){onmessage({data:m})}),postMessage=function(m,t){__w.parentPort.postMessage(m,t)},close=process.exit;self=global\";\ntry {\n    (_a = require('worker_threads'), Worker = _a.Worker, isMarkedAsUntransferable = _a.isMarkedAsUntransferable);\n}\ncatch (e) {\n}\nvar wk = Worker ? function (c, _, msg, transfer, cb) {\n    var done = false;\n    var w = new Worker(c + workerAdd, { eval: true })\n        .on('error', function (e) { return cb(e, null); })\n        .on('message', function (m) { return cb(null, m); })\n        .on('exit', function (c) {\n        if (c && !done)\n            cb(new Error('exited with code ' + c), null);\n    });\n    if (isMarkedAsUntransferable)\n        transfer = transfer.filter(function (t) { return !isMarkedAsUntransferable(t); });\n    w.postMessage(msg, transfer);\n    w.terminate = function () {\n        done = true;\n        return Worker.prototype.terminate.call(w);\n    };\n    return w;\n} : function (_, __, ___, ____, cb) {\n    setImmediate(function () { return cb(new Error('async operations unsupported - update to Node 12+ (or Node 10-11 with the --experimental-worker CLI flag)'), null); });\n    var NOP = function () { };\n    return {\n        terminate: NOP,\n        postMessage: NOP\n    };\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"],"x_google_ignoreList":[0],"mappings":";;AACA,IAAI,UAAU,cAAc,GAAG;AAU/B,IAAI;AAKJ,IAAI;CACA,KAAM,QAAQ,gBAAgB,GAAY,GAAG,QAAmC,GAAG;AACvF,SACO,GAAG,CACV;AA4BA,IAAI,KAAK;AAAY,IAAA,MAAM;AAAa,IAAA,MAAM;AAE9C,IAAI,OAAO,IAAI,GAAG;CAAC;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAgB;CAAG;CAAoB;AAAC,CAAC;AAEhJ,IAAI,OAAO,IAAI,GAAG;CAAC;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAI;CAAI;CAAI;CAAI;CAAI;CAAI;CAAI;CAAiB;CAAG;AAAC,CAAC;AAEvI,IAAI,OAAO,IAAI,GAAG;CAAC;CAAI;CAAI;CAAI;CAAG;CAAG;CAAG;CAAG;CAAG;CAAI;CAAG;CAAI;CAAG;CAAI;CAAG;CAAI;CAAG;CAAI;CAAG;AAAE,CAAC;AAEpF,IAAI,OAAO,SAAU,IAAI,OAAO;CAC5B,IAAI,IAAI,IAAI,IAAI,EAAE;CAClB,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE,GACtB,EAAE,KAAK,SAAS,KAAK,GAAG,IAAI;CAGhC,IAAI,IAAI,IAAI,IAAI,EAAE,GAAG;CACrB,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE,GACtB,KAAK,IAAI,IAAI,EAAE,IAAI,IAAI,EAAE,IAAI,IAAI,EAAE,GAC/B,EAAE,KAAO,IAAI,EAAE,MAAO,IAAK;CAGnC,OAAO;EAAK;EAAM;CAAE;AACxB;AACA,IAAI,KAAK,KAAK,MAAM,CAAC;AAAG,IAAA,KAAK,GAAG;AAAG,IAAA,QAAQ,GAAG;AAE9C,GAAG,MAAM,KAAK,MAAM,OAAO;AAC3B,IAAI,KAAK,KAAK,MAAM,CAAC;AAAG,IAAA,KAAK,GAAG;AAAG,IAAA,QAAQ,GAAG;AAE9C,IAAI,MAAM,IAAI,IAAI,KAAK;AACvB,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,EAAE,GAAG;CAE5B,IAAI,KAAM,IAAI,UAAW,KAAO,IAAI,UAAW;CAC/C,KAAM,IAAI,UAAW,KAAO,IAAI,UAAW;CAC3C,KAAM,IAAI,UAAW,KAAO,IAAI,SAAW;CAC3C,IAAI,OAAQ,IAAI,UAAW,KAAO,IAAI,QAAW,MAAO;AAC5D;AAIA,IAAI,QAAQ,SAAU,IAAI,IAAI,GAAG;CAC7B,IAAI,IAAI,GAAG;CAEX,IAAI,IAAI;CAER,IAAI,IAAI,IAAI,IAAI,EAAE;CAElB,OAAO,IAAI,GAAG,EAAE,GACZ,IAAI,GAAG,IACH,EAAE,EAAE,GAAG,KAAK;CAGpB,IAAI,KAAK,IAAI,IAAI,EAAE;CACnB,KAAK,IAAI,GAAG,IAAI,IAAI,EAAE,GAClB,GAAG,KAAM,GAAG,IAAI,KAAK,EAAE,IAAI,MAAO;CAEtC,IAAI;CACJ,IAAI,GAAG;EAEH,KAAK,IAAI,IAAI,KAAK,EAAE;EAEpB,IAAI,MAAM,KAAK;EACf,KAAK,IAAI,GAAG,IAAI,GAAG,EAAE,GAEjB,IAAI,GAAG,IAAI;GAEP,IAAI,KAAM,KAAK,IAAK,GAAG;GAEvB,IAAI,MAAM,KAAK,GAAG;GAElB,IAAI,IAAI,GAAG,GAAG,KAAK,EAAE,MAAM;GAE3B,KAAK,IAAI,IAAI,KAAM,KAAK,OAAO,GAAI,KAAK,GAAG,EAAE,GAEzC,GAAG,IAAI,MAAM,OAAO;EAE5B;CAER,OACK;EACD,KAAK,IAAI,IAAI,CAAC;EACd,KAAK,IAAI,GAAG,IAAI,GAAG,EAAE,GACjB,IAAI,GAAG,IACH,GAAG,KAAK,IAAI,GAAG,GAAG,KAAK,EAAE,OAAQ,KAAK,GAAG;CAGrD;CACA,OAAO;AACX;AAEA,IAAI,MAAM,IAAI,GAAG,GAAG;AACpB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,EAAE,GACvB,IAAI,KAAK;AACb,KAAK,IAAI,IAAI,KAAK,IAAI,KAAK,EAAE,GACzB,IAAI,KAAK;AACb,KAAK,IAAI,IAAI,KAAK,IAAI,KAAK,EAAE,GACzB,IAAI,KAAK;AACb,KAAK,IAAI,IAAI,KAAK,IAAI,KAAK,EAAE,GACzB,IAAI,KAAK;AAEb,IAAI,MAAM,IAAI,GAAG,EAAE;AACnB,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE,GACtB,IAAI,KAAK;AAEb,IAAI,MAAoB,mBAAK,KAAK,GAAG,CAAC;AAAG,IAAA,OAAqB,mBAAK,KAAK,GAAG,CAAC;AAE5E,IAAI,MAAoB,mBAAK,KAAK,GAAG,CAAC;AAAG,IAAA,OAAqB,mBAAK,KAAK,GAAG,CAAC;AAE5E,IAAI,MAAM,SAAU,GAAG;CACnB,IAAI,IAAI,EAAE;CACV,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,EAAE,GAC5B,IAAI,EAAE,KAAK,GACP,IAAI,EAAE;CAEd,OAAO;AACX;AAEA,IAAI,OAAO,SAAU,GAAG,GAAG,GAAG;CAC1B,IAAI,IAAK,IAAI,IAAK;CAClB,QAAS,EAAE,KAAM,EAAE,IAAI,MAAM,OAAQ,IAAI,KAAM;AACnD;AAEA,IAAI,SAAS,SAAU,GAAG,GAAG;CACzB,IAAI,IAAK,IAAI,IAAK;CAClB,QAAS,EAAE,KAAM,EAAE,IAAI,MAAM,IAAM,EAAE,IAAI,MAAM,QAAS,IAAI;AAChE;AAEA,IAAI,OAAO,SAAU,GAAG;CAAE,QAAS,IAAI,KAAK,IAAK;AAAG;AAGpD,IAAI,MAAM,SAAU,GAAG,GAAG,GAAG;CACzB,IAAI,KAAK,QAAQ,IAAI,GACjB,IAAI;CACR,IAAI,KAAK,QAAQ,IAAI,EAAE,QACnB,IAAI,EAAE;CAEV,OAAO,IAAI,GAAG,EAAE,SAAS,GAAG,CAAC,CAAC;AAClC;AAsBA,IAAI,KAAK;CACL;CACA;CACA;CACA;CACA;CACA;;CAEA;CACA;CACA;CACA;CACA;CACA;CACA;AAEJ;AAEA,IAAI,MAAM,SAAU,KAAK,KAAK,IAAI;CAC9B,IAAI,IAAI,IAAI,MAAM,OAAO,GAAG,IAAI;CAChC,EAAE,OAAO;CACT,IAAI,MAAM,mBACN,MAAM,kBAAkB,GAAG,GAAG;CAClC,IAAI,CAAC,IACD,MAAM;CACV,OAAO;AACX;AAEA,IAAI,QAAQ,SAAU,KAAK,IAAI,KAAK,MAAM;CAEtC,IAAI,KAAK,IAAI,QAAQ,KAAK,OAAO,KAAK,SAAS;CAC/C,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,GAAG,GACnB,OAAO,OAAO,IAAI,GAAG,CAAC;CAC1B,IAAI,QAAQ,CAAC;CAEb,IAAI,SAAS,SAAS,GAAG,KAAK;CAE9B,IAAI,OAAO,GAAG;CAEd,IAAI,OACA,MAAM,IAAI,GAAG,KAAK,CAAC;CAEvB,IAAI,OAAO,SAAU,GAAG;EACpB,IAAI,KAAK,IAAI;EAEb,IAAI,IAAI,IAAI;GAER,IAAI,OAAO,IAAI,GAAG,KAAK,IAAI,KAAK,GAAG,CAAC,CAAC;GACrC,KAAK,IAAI,GAAG;GACZ,MAAM;EACV;CACJ;CAEA,IAAI,QAAQ,GAAG,KAAK,GAAG,MAAM,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,GAAG,KAAK,GAAG,GAAG,MAAM,GAAG,GAAG,MAAM,GAAG;CAEnG,IAAI,OAAO,KAAK;CAChB,GAAG;EACC,IAAI,CAAC,IAAI;GAEL,QAAQ,KAAK,KAAK,KAAK,CAAC;GAExB,IAAI,OAAO,KAAK,KAAK,MAAM,GAAG,CAAC;GAC/B,OAAO;GACP,IAAI,CAAC,MAAM;IAEP,IAAI,IAAI,KAAK,GAAG,IAAI,GAAG,IAAI,IAAI,IAAI,KAAM,IAAI,IAAI,MAAM,GAAI,IAAI,IAAI;IACnE,IAAI,IAAI,IAAI;KACR,IAAI,MACA,IAAI,CAAC;KACT;IACJ;IAEA,IAAI,QACA,KAAK,KAAK,CAAC;IAEf,IAAI,IAAI,IAAI,SAAS,GAAG,CAAC,GAAG,EAAE;IAE9B,GAAG,IAAI,MAAM,GAAG,GAAG,IAAI,MAAM,IAAI,GAAG,GAAG,IAAI;IAC3C;GACJ,OACK,IAAI,QAAQ,GACb,KAAK,MAAM,KAAK,MAAM,MAAM,GAAG,MAAM;QACpC,IAAI,QAAQ,GAAG;IAEhB,IAAI,OAAO,KAAK,KAAK,KAAK,EAAE,IAAI,KAAK,QAAQ,KAAK,KAAK,MAAM,IAAI,EAAE,IAAI;IACvE,IAAI,KAAK,OAAO,KAAK,KAAK,MAAM,GAAG,EAAE,IAAI;IACzC,OAAO;IAEP,IAAI,MAAM,IAAI,GAAG,EAAE;IAEnB,IAAI,MAAM,IAAI,GAAG,EAAE;IACnB,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,EAAE,GAEzB,IAAI,KAAK,MAAM,KAAK,KAAK,MAAM,IAAI,GAAG,CAAC;IAE3C,OAAO,QAAQ;IAEf,IAAI,MAAM,IAAI,GAAG,GAAG,UAAU,KAAK,OAAO;IAE1C,IAAI,MAAM,KAAK,KAAK,KAAK,CAAC;IAC1B,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK;KACrB,IAAI,IAAI,IAAI,KAAK,KAAK,KAAK,MAAM;KAEjC,OAAO,IAAI;KAEX,IAAI,IAAI,KAAK;KAEb,IAAI,IAAI,IACJ,IAAI,OAAO;UAEV;MAED,IAAI,IAAI,GAAG,IAAI;MACf,IAAI,KAAK,IACL,IAAI,IAAI,KAAK,KAAK,KAAK,CAAC,GAAG,OAAO,GAAG,IAAI,IAAI,IAAI;WAChD,IAAI,KAAK,IACV,IAAI,IAAI,KAAK,KAAK,KAAK,CAAC,GAAG,OAAO;WACjC,IAAI,KAAK,IACV,IAAI,KAAK,KAAK,KAAK,KAAK,GAAG,GAAG,OAAO;MACzC,OAAO,KACH,IAAI,OAAO;KACnB;IACJ;IAEA,IAAI,KAAK,IAAI,SAAS,GAAG,IAAI,GAAG,KAAK,IAAI,SAAS,IAAI;IAEtD,MAAM,IAAI,EAAE;IAEZ,MAAM,IAAI,EAAE;IACZ,KAAK,KAAK,IAAI,KAAK,CAAC;IACpB,KAAK,KAAK,IAAI,KAAK,CAAC;GACxB,OAEI,IAAI,CAAC;GACT,IAAI,MAAM,MAAM;IACZ,IAAI,MACA,IAAI,CAAC;IACT;GACJ;EACJ;EAGA,IAAI,QACA,KAAK,KAAK,MAAM;EACpB,IAAI,OAAO,KAAK,OAAO,GAAG,OAAO,KAAK,OAAO;EAC7C,IAAI,OAAO;EACX,QAAQ,OAAO,KAAK;GAEhB,IAAI,IAAI,GAAG,OAAO,KAAK,GAAG,IAAI,MAAM,MAAM,KAAK;GAC/C,OAAO,IAAI;GACX,IAAI,MAAM,MAAM;IACZ,IAAI,MACA,IAAI,CAAC;IACT;GACJ;GACA,IAAI,CAAC,GACD,IAAI,CAAC;GACT,IAAI,MAAM,KACN,IAAI,QAAQ;QACX,IAAI,OAAO,KAAK;IACjB,OAAO,KAAK,KAAK;IACjB;GACJ,OACK;IACD,IAAI,MAAM,MAAM;IAEhB,IAAI,MAAM,KAAK;KAEX,IAAI,IAAI,MAAM,KAAK,IAAI,KAAK;KAC5B,MAAM,KAAK,KAAK,MAAM,KAAK,KAAK,CAAC,IAAI,GAAG;KACxC,OAAO;IACX;IAEA,IAAI,IAAI,GAAG,OAAO,KAAK,GAAG,IAAI,MAAM,OAAO,KAAK;IAChD,IAAI,CAAC,GACD,IAAI,CAAC;IACT,OAAO,IAAI;IACX,IAAI,KAAK,GAAG;IACZ,IAAI,OAAO,GAAG;KACV,IAAI,IAAI,KAAK;KACb,MAAM,OAAO,KAAK,GAAG,KAAK,KAAK,KAAK,GAAG,OAAO;IAClD;IACA,IAAI,MAAM,MAAM;KACZ,IAAI,MACA,IAAI,CAAC;KACT;IACJ;IACA,IAAI,QACA,KAAK,KAAK,MAAM;IACpB,IAAI,MAAM,KAAK;IACf,IAAI,KAAK,IAAI;KACT,IAAI,QAAQ,KAAK,IAAI,OAAO,KAAK,IAAI,IAAI,GAAG;KAC5C,IAAI,QAAQ,KAAK,GACb,IAAI,CAAC;KACT,OAAO,KAAK,MAAM,EAAE,IAChB,IAAI,MAAM,KAAK,QAAQ;IAC/B;IACA,OAAO,KAAK,KAAK,EAAE,IACf,IAAI,MAAM,IAAI,KAAK;GAC3B;EACJ;EACA,GAAG,IAAI,IAAI,GAAG,IAAI,MAAM,GAAG,IAAI,IAAI,GAAG,IAAI;EAC1C,IAAI,IACA,QAAQ,GAAG,GAAG,IAAI,KAAK,GAAG,IAAI,IAAI,GAAG,IAAI;CACjD,SAAS,CAAC;CAEV,OAAO,MAAM,IAAI,UAAU,QAAQ,IAAI,KAAK,GAAG,EAAE,IAAI,IAAI,SAAS,GAAG,EAAE;AAC3E;AAEA,IAAI,QAAQ,SAAU,GAAG,GAAG,GAAG;CAC3B,MAAM,IAAI;CACV,IAAI,IAAK,IAAI,IAAK;CAClB,EAAE,MAAM;CACR,EAAE,IAAI,MAAM,KAAK;AACrB;AAEA,IAAI,UAAU,SAAU,GAAG,GAAG,GAAG;CAC7B,MAAM,IAAI;CACV,IAAI,IAAK,IAAI,IAAK;CAClB,EAAE,MAAM;CACR,EAAE,IAAI,MAAM,KAAK;CACjB,EAAE,IAAI,MAAM,KAAK;AACrB;AAEA,IAAI,QAAQ,SAAU,GAAG,IAAI;CAEzB,IAAI,IAAI,CAAC;CACT,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,EAAE,GAC5B,IAAI,EAAE,IACF,EAAE,KAAK;EAAE,GAAG;EAAG,GAAG,EAAE;CAAG,CAAC;CAEhC,IAAI,IAAI,EAAE;CACV,IAAI,KAAK,EAAE,MAAM;CACjB,IAAI,CAAC,GACD,OAAO;EAAE,GAAG;EAAI,GAAG;CAAE;CACzB,IAAI,KAAK,GAAG;EACR,IAAI,IAAI,IAAI,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC;EACzB,EAAE,EAAE,EAAE,CAAC,KAAK;EACZ,OAAO;GAAE,GAAG;GAAG,GAAG;EAAE;CACxB;CACA,EAAE,KAAK,SAAU,GAAG,GAAG;EAAE,OAAO,EAAE,IAAI,EAAE;CAAG,CAAC;CAG5C,EAAE,KAAK;EAAE,GAAG;EAAI,GAAG;CAAM,CAAC;CAC1B,IAAI,IAAI,EAAE,IAAI,IAAI,EAAE,IAAI,KAAK,GAAG,KAAK,GAAG,KAAK;CAC7C,EAAE,KAAK;EAAE,GAAG;EAAI,GAAG,EAAE,IAAI,EAAE;EAAM;EAAM;CAAE;CAMzC,OAAO,MAAM,IAAI,GAAG;EAChB,IAAI,EAAE,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,OAAO;EACjC,IAAI,EAAE,MAAM,MAAM,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,OAAO;EAC7C,EAAE,QAAQ;GAAE,GAAG;GAAI,GAAG,EAAE,IAAI,EAAE;GAAM;GAAM;EAAE;CAChD;CACA,IAAI,SAAS,GAAG,EAAE,CAAC;CACnB,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,EAAE,GACrB,IAAI,GAAG,EAAE,CAAC,IAAI,QACV,SAAS,GAAG,EAAE,CAAC;CAGvB,IAAI,KAAK,IAAI,IAAI,SAAS,CAAC;CAE3B,IAAI,MAAM,GAAG,EAAE,KAAK,IAAI,IAAI,CAAC;CAC7B,IAAI,MAAM,IAAI;EAIV,IAAI,IAAI,GAAG,KAAK;EAEhB,IAAI,MAAM,MAAM,IAAI,MAAM,KAAK;EAC/B,GAAG,KAAK,SAAU,GAAG,GAAG;GAAE,OAAO,GAAG,EAAE,KAAK,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE;EAAG,CAAC;EAClE,OAAO,IAAI,GAAG,EAAE,GAAG;GACf,IAAI,OAAO,GAAG,EAAE,CAAC;GACjB,IAAI,GAAG,QAAQ,IAAI;IACf,MAAM,OAAO,KAAM,MAAM,GAAG;IAC5B,GAAG,QAAQ;GACf,OAEI;EACR;EACA,OAAO;EACP,OAAO,KAAK,GAAG;GACX,IAAI,OAAO,GAAG,EAAE,CAAC;GACjB,IAAI,GAAG,QAAQ,IACX,MAAM,KAAM,KAAK,GAAG,KAAK,KAAK;QAE9B,EAAE;EACV;EACA,OAAO,KAAK,KAAK,IAAI,EAAE,GAAG;GACtB,IAAI,OAAO,GAAG,EAAE,CAAC;GACjB,IAAI,GAAG,SAAS,IAAI;IAChB,EAAE,GAAG;IACL,EAAE;GACN;EACJ;EACA,MAAM;CACV;CACA,OAAO;EAAE,GAAG,IAAI,GAAG,EAAE;EAAG,GAAG;CAAI;AACnC;AAEA,IAAI,KAAK,SAAU,GAAG,GAAG,GAAG;CACxB,OAAO,EAAE,KAAK,KACR,KAAK,IAAI,GAAG,EAAE,GAAG,GAAG,IAAI,CAAC,GAAG,GAAG,EAAE,GAAG,GAAG,IAAI,CAAC,CAAC,IAC5C,EAAE,EAAE,KAAK;AACpB;AAEA,IAAI,KAAK,SAAU,GAAG;CAClB,IAAI,IAAI,EAAE;CAEV,OAAO,KAAK,CAAC,EAAE,EAAE;CAEjB,IAAI,KAAK,IAAI,IAAI,EAAE,CAAC;CAEpB,IAAI,MAAM,GAAG,MAAM,EAAE,IAAI,MAAM;CAC/B,IAAI,IAAI,SAAU,GAAG;EAAE,GAAG,SAAS;CAAG;CACtC,KAAK,IAAI,IAAI,GAAG,KAAK,GAAG,EAAE,GACtB,IAAI,EAAE,MAAM,OAAO,KAAK,GACpB,EAAE;MACD;EACD,IAAI,CAAC,OAAO,MAAM,GAAG;GACjB,OAAO,MAAM,KAAK,OAAO,KACrB,EAAE,KAAK;GACX,IAAI,MAAM,GAAG;IACT,EAAE,MAAM,KAAO,MAAM,MAAO,IAAK,QAAU,MAAM,KAAM,IAAK,KAAK;IACjE,MAAM;GACV;EACJ,OACK,IAAI,MAAM,GAAG;GACd,EAAE,GAAG,GAAG,EAAE;GACV,OAAO,MAAM,GAAG,OAAO,GACnB,EAAE,IAAI;GACV,IAAI,MAAM,GACN,EAAI,MAAM,KAAM,IAAK,IAAI,GAAG,MAAM;EAC1C;EACA,OAAO,OACH,EAAE,GAAG;EACT,MAAM;EACN,MAAM,EAAE;CACZ;CAEJ,OAAO;EAAE,GAAG,GAAG,SAAS,GAAG,GAAG;EAAG,GAAG;CAAE;AAC1C;AAEA,IAAI,OAAO,SAAU,IAAI,IAAI;CACzB,IAAI,IAAI;CACR,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,QAAQ,EAAE,GAC7B,KAAK,GAAG,KAAK,GAAG;CACpB,OAAO;AACX;AAGA,IAAI,QAAQ,SAAU,KAAK,KAAK,KAAK;CAEjC,IAAI,IAAI,IAAI;CACZ,IAAI,IAAI,KAAK,MAAM,CAAC;CACpB,IAAI,KAAK,IAAI;CACb,IAAI,IAAI,KAAK,KAAK;CAClB,IAAI,IAAI,KAAK,IAAI,KAAK;CACtB,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK;CAC1B,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,EAAE,GACrB,IAAI,IAAI,IAAI,KAAK,IAAI;CACzB,QAAQ,IAAI,IAAI,KAAK;AACzB;AAEA,IAAI,OAAO,SAAU,KAAK,KAAK,OAAO,MAAM,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG;CACnE,MAAM,KAAK,KAAK,KAAK;CACrB,EAAE,GAAG;CACL,IAAI,KAAK,MAAM,IAAI,EAAE,GAAG,MAAM,GAAG,GAAG,MAAM,GAAG;CAC7C,IAAI,KAAK,MAAM,IAAI,EAAE,GAAG,MAAM,GAAG,GAAG,MAAM,GAAG;CAC7C,IAAI,KAAK,GAAG,GAAG,GAAG,OAAO,GAAG,GAAG,MAAM,GAAG;CACxC,IAAI,KAAK,GAAG,GAAG,GAAG,OAAO,GAAG,GAAG,MAAM,GAAG;CACxC,IAAI,SAAS,IAAI,IAAI,EAAE;CACvB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,EAAE,GAC/B,EAAE,OAAO,KAAK,KAAK;CACvB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,EAAE,GAC/B,EAAE,OAAO,KAAK,KAAK;CACvB,IAAI,KAAK,MAAM,QAAQ,CAAC,GAAG,MAAM,GAAG,GAAG,OAAO,GAAG;CACjD,IAAI,OAAO;CACX,OAAO,OAAO,KAAK,CAAC,IAAI,KAAK,OAAO,KAAK,EAAE;CAE3C,IAAI,OAAQ,KAAK,KAAM;CACvB,IAAI,QAAQ,KAAK,IAAI,GAAG,IAAI,KAAK,IAAI,GAAG,IAAI;CAC5C,IAAI,QAAQ,KAAK,IAAI,GAAG,IAAI,KAAK,IAAI,GAAG,IAAI,KAAK,KAAK,IAAI,OAAO,KAAK,QAAQ,GAAG,IAAI,IAAI,OAAO,MAAM,IAAI,OAAO,MAAM,IAAI,OAAO;CAClI,IAAI,MAAM,KAAK,QAAQ,SAAS,QAAQ,OACpC,OAAO,MAAM,KAAK,GAAG,IAAI,SAAS,IAAI,KAAK,EAAE,CAAC;CAClD,IAAI,IAAI,IAAI,IAAI;CAChB,MAAM,KAAK,GAAG,KAAK,QAAQ,MAAM,GAAG,KAAK;CACzC,IAAI,QAAQ,OAAO;EACf,KAAK,KAAK,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,CAAC,GAAG,KAAK;EAC/D,IAAI,MAAM,KAAK,KAAK,MAAM,CAAC;EAC3B,MAAM,KAAK,GAAG,MAAM,GAAG;EACvB,MAAM,KAAK,IAAI,GAAG,MAAM,CAAC;EACzB,MAAM,KAAK,IAAI,IAAI,OAAO,CAAC;EAC3B,KAAK;EACL,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,EAAE,GACxB,MAAM,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,GAAG;EACtC,KAAK,IAAI;EACT,IAAI,OAAO,CAAC,MAAM,IAAI;EACtB,KAAK,IAAI,KAAK,GAAG,KAAK,GAAG,EAAE,IAAI;GAC3B,IAAI,OAAO,KAAK;GAChB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,EAAE,GAAG;IAClC,IAAI,MAAM,KAAK,KAAK;IACpB,MAAM,KAAK,GAAG,IAAI,IAAI,GAAG,KAAK,IAAI;IAClC,IAAI,MAAM,IACN,MAAM,KAAK,GAAI,KAAK,MAAM,IAAK,GAAG,GAAG,KAAK,KAAK,MAAM;GAC7D;EACJ;CACJ,OAEI,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK;CAEvC,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG;EACzB,IAAI,MAAM,KAAK;EACf,IAAI,MAAM,KAAK;GACX,IAAI,MAAO,OAAO,KAAM;GACxB,QAAQ,KAAK,GAAG,GAAG,MAAM,IAAI,GAAG,KAAK,GAAG,MAAM;GAC9C,IAAI,MAAM,GACN,MAAM,KAAK,GAAI,OAAO,KAAM,EAAE,GAAG,KAAK,KAAK;GAC/C,IAAI,MAAM,MAAM;GAChB,QAAQ,KAAK,GAAG,GAAG,IAAI,GAAG,KAAK,GAAG;GAClC,IAAI,MAAM,GACN,QAAQ,KAAK,GAAI,OAAO,IAAK,IAAI,GAAG,KAAK,KAAK;EACtD,OAEI,QAAQ,KAAK,GAAG,GAAG,IAAI,GAAG,KAAK,GAAG;CAE1C;CACA,QAAQ,KAAK,GAAG,GAAG,IAAI;CACvB,OAAO,IAAI,GAAG;AAClB;AAEA,IAAI,oBAAoB,IAAI,IAAI;CAAC;CAAO;CAAQ;CAAQ;CAAQ;CAAQ;CAAS;CAAS;CAAS;AAAO,CAAC;AAE3G,IAAI,mBAAmB,IAAI,GAAG,CAAC;AAE/B,IAAI,OAAO,SAAU,KAAK,KAAK,MAAM,KAAK,MAAM,IAAI;CAChD,IAAI,IAAI,GAAG,KAAK,IAAI;CACpB,IAAI,IAAI,IAAI,GAAG,MAAM,IAAI,KAAK,IAAI,KAAK,KAAK,IAAI,GAAI,KAAK,IAAI;CAE7D,IAAI,IAAI,EAAE,SAAS,KAAK,EAAE,SAAS,IAAI;CACvC,IAAI,MAAM,GAAG;CACb,IAAI,OAAO,GAAG,KAAK,KAAK;CACxB,IAAI,KAAK;EACL,IAAI,KACA,EAAE,KAAK,GAAG,KAAK;EACnB,IAAI,MAAM,IAAI,MAAM;EACpB,IAAI,IAAI,OAAO,IAAI,IAAI,MAAM;EAC7B,IAAI,SAAS,KAAK,QAAQ;EAE1B,IAAI,OAAO,GAAG,KAAK,IAAI,IAAI,KAAK,GAAG,OAAO,GAAG,KAAK,IAAI,IAAI,QAAQ,CAAC;EACnE,IAAI,QAAQ,KAAK,KAAK,OAAO,CAAC,GAAG,QAAQ,IAAI;EAC7C,IAAI,MAAM,SAAU,GAAG;GAAE,QAAQ,IAAI,KAAM,IAAI,IAAI,MAAM,QAAU,IAAI,IAAI,MAAM,SAAU;EAAO;EAGlG,IAAI,OAAO,IAAI,IAAI,IAAK;EAExB,IAAI,KAAK,IAAI,IAAI,GAAG,GAAG,KAAK,IAAI,IAAI,EAAE;EAEtC,IAAI,OAAO,GAAG,KAAK,GAAG,IAAI,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK;EAClE,OAAO,IAAI,IAAI,GAAG,EAAE,GAAG;GAEnB,IAAI,KAAK,IAAI,CAAC;GAEd,IAAI,OAAO,IAAI,OAAO,QAAQ,KAAK;GACnC,KAAK,QAAQ;GACb,KAAK,MAAM;GAGX,IAAI,MAAM,GAAG;IAET,IAAI,MAAM,IAAI;IACd,KAAK,OAAO,OAAQ,KAAK,WAAW,MAAM,OAAO,CAAC,MAAM;KACpD,MAAM,KAAK,KAAK,GAAG,GAAG,MAAM,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG;KAC3D,KAAK,OAAO,KAAK,GAAG,KAAK;KACzB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,EAAE,GACvB,GAAG,KAAK;KACZ,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE,GACtB,GAAG,KAAK;IAChB;IAEA,IAAI,IAAI,GAAG,IAAI,GAAG,OAAO,GAAG,MAAM,OAAO,QAAQ;IACjD,IAAI,MAAM,KAAK,MAAM,IAAI,IAAI,GAAG,GAAG;KAC/B,IAAI,OAAO,KAAK,IAAI,GAAG,GAAG,IAAI;KAC9B,IAAI,OAAO,KAAK,IAAI,OAAO,CAAC;KAG5B,IAAI,KAAK,KAAK,IAAI,KAAK,GAAG;KAC1B,OAAO,OAAO,QAAQ,EAAE,QAAQ,QAAQ,OAAO;MAC3C,IAAI,IAAI,IAAI,MAAM,IAAI,IAAI,IAAI,MAAM;OAChC,IAAI,KAAK;OACT,OAAO,KAAK,MAAM,IAAI,IAAI,OAAO,IAAI,IAAI,KAAK,MAAM,EAAE;OAEtD,IAAI,KAAK,GAAG;QACR,IAAI,IAAI,IAAI;QAEZ,IAAI,KAAK,MACL;QAIJ,IAAI,MAAM,KAAK,IAAI,KAAK,KAAK,CAAC;QAC9B,IAAI,KAAK;QACT,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,EAAE,GAAG;SAC1B,IAAI,KAAK,IAAI,MAAM,IAAI;SAEvB,IAAI,KAAK,KADC,KAAK,MACK;SACpB,IAAI,KAAK,IACL,KAAK,IAAI,QAAQ;QACzB;OACJ;MACJ;MAEA,OAAO,OAAO,QAAQ,KAAK;MAC3B,OAAO,OAAO,QAAQ;KAC1B;IACJ;IAEA,IAAI,GAAG;KAGH,KAAK,QAAQ,YAAa,MAAM,MAAM,KAAM,MAAM;KAClD,IAAI,MAAM,MAAM,KAAK,IAAI,MAAM,MAAM,KAAK;KAC1C,MAAM,KAAK,OAAO,KAAK;KACvB,EAAE,GAAG,MAAM;KACX,EAAE,GAAG;KACL,KAAK,IAAI;KACT,EAAE;IACN,OACK;KACD,KAAK,QAAQ,IAAI;KACjB,EAAE,GAAG,IAAI;IACb;GACJ;EACJ;EACA,KAAK,IAAI,KAAK,IAAI,GAAG,EAAE,GAAG,IAAI,GAAG,EAAE,GAAG;GAClC,KAAK,QAAQ,IAAI;GACjB,EAAE,GAAG,IAAI;EACb;EACA,MAAM,KAAK,KAAK,GAAG,KAAK,MAAM,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG;EAC7D,IAAI,CAAC,KAAK;GACN,GAAG,IAAK,MAAM,IAAK,EAAG,MAAM,IAAK,MAAM;GAEvC,OAAO;GACP,GAAG,IAAI,MAAM,GAAG,IAAI,MAAM,GAAG,IAAI,GAAG,GAAG,IAAI;EAC/C;CACJ,OACK;EACD,KAAK,IAAI,IAAI,GAAG,KAAK,GAAG,IAAI,IAAI,KAAK,KAAK,OAAO;GAE7C,IAAI,IAAI,IAAI;GACZ,IAAI,KAAK,GAAG;IAER,EAAG,MAAM,IAAK,KAAK;IACnB,IAAI;GACR;GACA,MAAM,MAAM,GAAG,MAAM,GAAG,IAAI,SAAS,GAAG,CAAC,CAAC;EAC9C;EACA,GAAG,IAAI;CACX;CACA,OAAO,IAAI,GAAG,GAAG,MAAM,KAAK,GAAG,IAAI,IAAI;AAC3C;AAEA,IAAI,OAAqB,eAAC,WAAY;CAClC,IAAI,oBAAI,IAAI,WAAW,GAAG;CAC1B,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,EAAE,GAAG;EAC1B,IAAI,IAAI,GAAG,IAAI;EACf,OAAO,EAAE,GACL,KAAM,IAAI,KAAM,cAAe,MAAM;EACzC,EAAE,KAAK;CACX;CACA,OAAO;AACX,EAAA,CAAG;AAEH,IAAI,MAAM,WAAY;CAClB,IAAI,IAAI;CACR,OAAO;EACH,GAAG,SAAU,GAAG;GAEZ,IAAI,KAAK;GACT,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,EAAE,GAC5B,KAAK,KAAM,KAAK,MAAO,EAAE,MAAO,OAAO;GAC3C,IAAI;EACR;EACA,GAAG,WAAY;GAAE,OAAO,CAAC;EAAG;CAChC;AACJ;AAyBA,IAAI,OAAO,SAAU,KAAK,KAAK,KAAK,MAAM,IAAI;CAC1C,IAAI,CAAC,IAAI;EACL,KAAK,EAAE,GAAG,EAAE;EACZ,IAAI,IAAI,YAAY;GAChB,IAAI,OAAO,IAAI,WAAW,SAAS,MAAM;GACzC,IAAI,SAAS,IAAI,GAAG,KAAK,SAAS,IAAI,MAAM;GAC5C,OAAO,IAAI,IAAI;GACf,OAAO,IAAI,KAAK,KAAK,MAAM;GAC3B,MAAM;GACN,GAAG,IAAI,KAAK;EAChB;CACJ;CACA,OAAO,KAAK,KAAK,IAAI,SAAS,OAAO,IAAI,IAAI,OAAO,IAAI,OAAO,OAAQ,GAAG,IAAI,KAAK,KAAK,KAAK,IAAI,GAAG,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,MAAM,CAAC,CAAC,IAAI,GAAG,IAAI,KAAO,KAAK,IAAI,KAAM,KAAK,MAAM,EAAE;AACxL;AAEA,IAAI,MAAM,SAAU,GAAG,GAAG;CACtB,IAAI,IAAI,CAAC;CACT,KAAK,IAAI,KAAK,GACV,EAAE,KAAK,EAAE;CACb,KAAK,IAAI,KAAK,GACV,EAAE,KAAK,EAAE;CACb,OAAO;AACX;AAsIA,IAAI,KAAK,SAAU,GAAG,GAAG;CAAE,OAAO,EAAE,KAAM,EAAE,IAAI,MAAM;AAAI;AAE1D,IAAI,KAAK,SAAU,GAAG,GAAG;CAAE,QAAQ,EAAE,KAAM,EAAE,IAAI,MAAM,IAAM,EAAE,IAAI,MAAM,KAAO,EAAE,IAAI,MAAM,QAAS;AAAG;AAExG,IAAI,KAAK,SAAU,GAAG,GAAG;CAAE,OAAO,GAAG,GAAG,CAAC,IAAK,GAAG,GAAG,IAAI,CAAC,IAAI;AAAa;AAE1E,IAAI,SAAS,SAAU,GAAG,GAAG,GAAG;CAC5B,OAAO,GAAG,EAAE,GACR,EAAE,KAAK,GAAG,OAAO;AACzB;AAeA,IAAI,MAAM,SAAU,GAAG;CACnB,IAAI,EAAE,MAAM,MAAM,EAAE,MAAM,OAAO,EAAE,MAAM,GACrC,IAAI,GAAG,mBAAmB;CAC9B,IAAI,MAAM,EAAE;CACZ,IAAI,KAAK;CACT,IAAI,MAAM,GACN,OAAO,EAAE,MAAM,EAAE,OAAO,KAAK;CACjC,KAAK,IAAI,MAAM,OAAO,IAAI,MAAM,OAAO,IAAI,IAAI,KAAK,GAAG,MAAM,CAAC,EAAE;CAEhE,OAAO,MAAM,MAAM;AACvB;AAEA,IAAI,MAAM,SAAU,GAAG;CACnB,IAAI,IAAI,EAAE;CACV,QAAQ,EAAE,IAAI,KAAK,EAAE,IAAI,MAAM,IAAI,EAAE,IAAI,MAAM,KAAK,EAAE,IAAI,MAAM,QAAQ;AAC5E;;;;;;;AAuJA,SAAgB,YAAY,MAAM,MAAM;CACpC,OAAO,KAAK,MAAM,QAAQ,CAAC,GAAG,GAAG,CAAC;AACtC;AAyEA,SAAgB,YAAY,MAAM,MAAM;CACpC,OAAO,MAAM,MAAM,EAAE,GAAG,EAAE,GAAG,QAAQ,KAAK,KAAK,QAAQ,KAAK,UAAU;AAC1E;AAiKA,SAAgB,WAAW,MAAM,MAAM;CACnC,IAAI,KAAK,IAAI,IAAI;CACjB,IAAI,KAAK,IAAI,KAAK,QACd,IAAI,GAAG,mBAAmB;CAC9B,OAAO,MAAM,KAAK,SAAS,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,QAAQ,KAAK,OAAO,IAAI,GAAG,IAAI,IAAI,CAAC,GAAG,QAAQ,KAAK,UAAU;AAChH;AAiQA,IAAI,OAAO,SAAU,GAAG,GAAG,GAAG,GAAG;CAC7B,KAAK,IAAI,KAAK,GAAG;EACb,IAAI,MAAM,EAAE,IAAI,IAAI,IAAI,GAAG,KAAK;EAChC,IAAI,MAAM,QAAQ,GAAG,GACjB,KAAK,IAAI,GAAG,IAAI,EAAE,GAAG,MAAM,IAAI;EACnC,IAAI,YAAY,OAAO,GAAG,GACtB,EAAE,KAAK,CAAC,KAAK,EAAE;OACd;GACD,EAAE,KAAK,OAAO,CAAC,IAAI,GAAG,CAAC,GAAG,EAAE;GAC5B,KAAK,KAAK,GAAG,GAAG,CAAC;EACrB;CACJ;AACJ;AAEA,IAAI,KAAK,OAAO,eAAe,6BAA6B,IAAI,YAAY;AAE5E,IAAI,KAAK,OAAO,eAAe,6BAA6B,IAAI,YAAY;AAG5E,IAAI;CACA,GAAG,OAAO,IAAI,EAAE,QAAQ,KAAK,CAAC;AAElC,SACO,GAAG,CAAE;AAEZ,IAAI,QAAQ,SAAU,GAAG;CACrB,KAAK,IAAI,IAAI,IAAI,IAAI,KAAK;EACtB,IAAI,IAAI,EAAE;EACV,IAAI,MAAM,IAAI,QAAQ,IAAI,QAAQ,IAAI;EACtC,IAAI,IAAI,KAAK,EAAE,QACX,OAAO;GAAE,GAAG;GAAG,GAAG,IAAI,GAAG,IAAI,CAAC;EAAE;EACpC,IAAI,CAAC,IACD,KAAK,OAAO,aAAa,CAAC;OACzB,IAAI,MAAM,GACX,MAAM,IAAI,OAAO,MAAM,EAAE,OAAO,OAAO,MAAM,EAAE,OAAO,OAAO,IAAK,EAAE,OAAO,MAAO,OAC9E,KAAK,OAAO,aAAa,QAAS,KAAK,IAAK,QAAS,IAAI,IAAK;OAEjE,IAAI,KAAK,GACV,KAAK,OAAO,cAAc,IAAI,OAAO,IAAK,EAAE,OAAO,EAAG;OAEtD,KAAK,OAAO,cAAc,IAAI,OAAO,MAAM,EAAE,OAAO,OAAO,IAAK,EAAE,OAAO,EAAG;CACpF;AACJ;;;;;;;;AAqFA,SAAgB,QAAQ,KAAK,QAAQ;CACjC,IAAI,QAAQ;EACR,IAAI,OAAO,IAAI,GAAG,IAAI,MAAM;EAC5B,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,EAAE,GAC9B,KAAK,KAAK,IAAI,WAAW,CAAC;EAC9B,OAAO;CACX;CACA,IAAI,IACA,OAAO,GAAG,OAAO,GAAG;CACxB,IAAI,IAAI,IAAI;CACZ,IAAI,KAAK,IAAI,GAAG,IAAI,UAAU,IAAI,UAAU,EAAE;CAC9C,IAAI,KAAK;CACT,IAAI,IAAI,SAAU,GAAG;EAAE,GAAG,QAAQ;CAAG;CACrC,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,EAAE,GAAG;EACxB,IAAI,KAAK,IAAI,GAAG,QAAQ;GACpB,IAAI,IAAI,IAAI,GAAG,KAAK,KAAM,IAAI,KAAM,EAAE;GACtC,EAAE,IAAI,EAAE;GACR,KAAK;EACT;EACA,IAAI,IAAI,IAAI,WAAW,CAAC;EACxB,IAAI,IAAI,OAAO,QACX,EAAE,CAAC;OACF,IAAI,IAAI,MACT,EAAE,MAAO,KAAK,CAAE,GAAG,EAAE,MAAO,IAAI,EAAG;OAClC,IAAI,IAAI,SAAS,IAAI,OACtB,IAAI,SAAS,IAAI,WAAe,IAAI,WAAW,EAAE,CAAC,IAAI,MAClD,EAAE,MAAO,KAAK,EAAG,GAAG,EAAE,MAAQ,KAAK,KAAM,EAAG,GAAG,EAAE,MAAQ,KAAK,IAAK,EAAG,GAAG,EAAE,MAAO,IAAI,EAAG;OAE7F,EAAE,MAAO,KAAK,EAAG,GAAG,EAAE,MAAQ,KAAK,IAAK,EAAG,GAAG,EAAE,MAAO,IAAI,EAAG;CACtE;CACA,OAAO,IAAI,IAAI,GAAG,EAAE;AACxB;;;;;;;;AAQA,SAAgB,UAAU,KAAK,QAAQ;CACnC,IAAI,QAAQ;EACR,IAAI,IAAI;EACR,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK,OACjC,KAAK,OAAO,aAAa,MAAM,MAAM,IAAI,SAAS,GAAG,IAAI,KAAK,CAAC;EACnE,OAAO;CACX,OACK,IAAI,IACL,OAAO,GAAG,OAAO,GAAG;MAEnB;EACD,IAAI,KAAK,MAAM,GAAG,GAAG,IAAI,GAAG,GAAG,IAAI,GAAG;EACtC,IAAI,EAAE,QACF,IAAI,CAAC;EACT,OAAO;CACX;AACJ;AAKA,IAAI,OAAO,SAAU,GAAG,GAAG;CAAE,OAAO,IAAI,KAAK,GAAG,GAAG,IAAI,EAAE,IAAI,GAAG,GAAG,IAAI,EAAE;AAAG;AAE5E,IAAI,KAAK,SAAU,GAAG,GAAG,GAAG;CACxB,IAAI,MAAM,GAAG,GAAG,IAAI,EAAE,GAAG,MAAM,GAAG,GAAG,IAAI,EAAE,GAAG,KAAK,UAAU,EAAE,SAAS,IAAI,IAAI,IAAI,KAAK,GAAG,GAAG,EAAE,GAAG,GAAG,IAAI,CAAC,IAAI,KAAK,GAAG,KAAK,IAAI,KAAK;CACtI,IAAI,KAAK,MAAM,GAAG,IAAI,KAAK,GAAG,GAAG,GAAG,IAAI,EAAE,GAAG,GAAG,GAAG,IAAI,EAAE,GAAG,GAAG,GAAG,IAAI,EAAE,CAAC,GAAG,KAAK,GAAG,IAAI,KAAK,GAAG,IAAI,MAAM,GAAG;CAC7G,OAAO;EAAC,GAAG,GAAG,IAAI,EAAE;EAAG;EAAI;EAAI;EAAI,KAAK,MAAM,GAAG,GAAG,IAAI,EAAE;EAAG;CAAG;AACpE;AAEA,IAAI,QAAQ,SAAU,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,KAAK;CAC3C,IAAI,MAAM,MAAM,YAAY,MAAM,MAAM,YAAY,OAAO,OAAO,YAAY,IAAI,IAAI;CACtF,IAAI,KAAK,MAAM,MAAM;CACrB,IAAI,KAAK,IAAI;EACT,OAAO,IAAI,IAAI,GAAG,KAAK,IAAI,GAAG,GAAG,IAAI,CAAC,GAClC,IAAI,GAAG,GAAG,CAAC,KAAK,GACZ,OAAO;GACH,MAAM,GAAG,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI;GAC/B,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI;GACrB,OAAO,GAAG,GAAG,IAAI,IAAI,KAAK,MAAM,IAAI,IAAI;GACxC;EACJ;EAIR,IAAI,IAAI,GACJ,IAAI,EAAE;CACd;CACA,OAAO;EAAC;EAAI;EAAI;EAAK;CAAC;AAC1B;AAEA,IAAI,OAAO,SAAU,IAAI;CACrB,IAAI,KAAK;CACT,IAAI,IACA,KAAK,IAAI,KAAK,IAAI;EACd,IAAI,IAAI,GAAG,EAAE,CAAC;EACd,IAAI,IAAI,OACJ,IAAI,CAAC;EACT,MAAM,IAAI;CACd;CAEJ,OAAO;AACX;AAEA,IAAI,MAAM,SAAU,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,IAAI,IAAI;CAC3C,IAAI,KAAK,GAAG,QAAQ,KAAK,EAAE,OAAO,MAAM,MAAM,GAAG;CACjD,IAAI,MAAM,KAAK,EAAE;CACjB,OAAO,GAAG,GAAG,MAAM,OAAO,WAAY,QAAS,GAAG,KAAK;CACvD,IAAI,MAAM,MACN,EAAE,OAAO,IAAI,EAAE,OAAO,EAAE;CAC5B,EAAE,KAAK,IAAI,KAAK;CAChB,EAAE,OAAQ,EAAE,QAAQ,KAAM,IAAI,KAAK,IAAI,EAAE,OAAO,KAAK;CACrD,EAAE,OAAO,EAAE,cAAc,KAAK,EAAE,OAAO,EAAE,eAAe;CACxD,IAAI,KAAK,IAAI,KAAK,EAAE,SAAS,OAAO,KAAK,IAAI,IAAI,EAAE,KAAK,GAAG,IAAI,GAAG,YAAY,IAAI;CAClF,IAAI,IAAI,KAAK,IAAI,KACb,IAAI,EAAE;CACV,OAAO,GAAG,GAAI,KAAK,KAAQ,GAAG,SAAS,IAAI,KAAM,KAAO,GAAG,QAAQ,KAAK,KAAO,GAAG,SAAS,KAAK,KAAO,GAAG,WAAW,KAAK,IAAM,GAAG,WAAW,KAAK,CAAE,GAAG,KAAK;CAC7J,IAAI,KAAK,IAAI;EACT,OAAO,GAAG,GAAG,EAAE,GAAG;EAClB,OAAO,GAAG,IAAI,GAAG,IAAI,IAAI,CAAC,IAAI,IAAI,CAAC;EACnC,OAAO,GAAG,IAAI,GAAG,EAAE,IAAI;CAC3B;CACA,OAAO,GAAG,IAAI,IAAI,EAAE;CACpB,OAAO,GAAG,IAAI,IAAI,GAAG,GAAG,KAAK;CAC7B,IAAI,MAAM,MAAM;EACZ,OAAO,GAAG,GAAG,GAAG;EAChB,OAAO,GAAG,IAAI,GAAG,EAAE,KAAK;EACxB,OAAO,GAAG,IAAI,IAAI,EAAE,GAAG,KAAK;CAChC;CACA,EAAE,IAAI,IAAI,CAAC;CACX,KAAK;CACL,IAAI,KACA,KAAK,IAAI,KAAK,IAAI;EACd,IAAI,MAAM,GAAG,IAAI,IAAI,IAAI;EACzB,OAAO,GAAG,GAAG,CAAC,CAAC;EACf,OAAO,GAAG,IAAI,GAAG,CAAC;EAClB,EAAE,IAAI,KAAK,IAAI,CAAC,GAAG,KAAK,IAAI;CAChC;CAEJ,IAAI,KACA,EAAE,IAAI,IAAI,CAAC,GAAG,KAAK;CACvB,OAAO;AACX;AAEA,IAAI,MAAM,SAAU,GAAG,GAAG,GAAG,GAAG,GAAG;CAC/B,OAAO,GAAG,GAAG,SAAS;CACtB,OAAO,GAAG,IAAI,GAAG,CAAC;CAClB,OAAO,GAAG,IAAI,IAAI,CAAC;CACnB,OAAO,GAAG,IAAI,IAAI,CAAC;CACnB,OAAO,GAAG,IAAI,IAAI,CAAC;AACvB;;;;;;;;AAoXA,SAAgB,QAAQ,MAAM,MAAM;CAChC,IAAI,CAAC,MACD,OAAO,CAAC;CACZ,IAAI,IAAI,CAAC;CACT,IAAI,QAAQ,CAAC;CACb,KAAK,MAAM,IAAI,GAAG,IAAI;CACtB,IAAI,IAAI;CACR,IAAI,MAAM;CACV,KAAK,IAAI,MAAM,GAAG;EACd,IAAI,KAAK,EAAE,KAAK,OAAO,GAAG,IAAI,IAAI,GAAG;EACrC,IAAI,cAAc,EAAE,SAAS,IAAI,IAAI;EACrC,IAAI,IAAI,QAAQ,EAAE,GAAG,IAAI,EAAE;EAC3B,IAAI,MAAM,EAAE,SAAS,IAAI,OAAO,QAAQ,GAAG,GAAG,KAAK,KAAK,EAAE;EAC1D,IAAI,MAAM,KAAK,EAAE,KAAK;EACtB,IAAI,IAAI,OACJ,IAAI,EAAE;EACV,IAAI,IAAI,cAAc,YAAY,MAAM,CAAC,IAAI,MAAM,IAAI,EAAE;EACzD,IAAI,IAAI,IAAI;EACZ,EAAE,EAAE,IAAI;EACR,MAAM,KAAK,IAAI,GAAG;GACd,MAAM,KAAK;GACX,KAAK,EAAE,EAAE;GACT,GAAG;GACA;GACA;GACH,GAAG,KAAK,GAAG,UAAW,KAAM,IAAI,UAAU;GACvC;GACU;EACjB,CAAC,CAAC;EACF,KAAK,KAAK,IAAI,MAAM;EACpB,OAAO,KAAK,KAAK,IAAI,QAAQ,MAAM,KAAK;CAC5C;CACA,IAAI,MAAM,IAAI,GAAG,MAAM,EAAE,GAAG,KAAK,GAAG,MAAM,MAAM;CAChD,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,EAAE,GAAG;EACnC,IAAI,IAAI,MAAM;EACd,IAAI,KAAK,EAAE,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,MAAM;EACrC,IAAI,OAAO,KAAK,EAAE,EAAE,SAAS,KAAK,EAAE,KAAK;EACzC,IAAI,IAAI,EAAE,GAAG,EAAE,IAAI,IAAI;EACvB,IAAI,KAAK,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,GAAG,KAAK,KAAK,QAAQ,EAAE,IAAI,EAAE,EAAE,SAAS;CACzF;CACA,IAAI,KAAK,GAAG,MAAM,QAAQ,KAAK,EAAE;CACjC,OAAO;AACX;;;;;;;;AA6TA,SAAgB,UAAU,MAAM,MAAM;CAClC,IAAI,QAAQ,CAAC;CACb,IAAI,IAAI,KAAK,SAAS;CACtB,OAAO,GAAG,MAAM,CAAC,KAAK,WAAW,EAAE,GAC/B,IAAI,CAAC,KAAK,KAAK,SAAS,IAAI,OACxB,IAAI,EAAE;CAGd,IAAI,IAAI,GAAG,MAAM,IAAI,CAAC;CACtB,IAAI,CAAC,GACD,OAAO,CAAC;CACZ,IAAI,IAAI,GAAG,MAAM,IAAI,EAAE;CACvB,IAAI,IAAI,GAAG,MAAM,IAAI,EAAE,KAAK;CAC5B,IAAI,GAAG;EACH,IAAI,KAAK,GAAG,MAAM,IAAI,EAAE;EACxB,IAAI,GAAG,MAAM,EAAE,KAAK;EACpB,IAAI,GAAG;GACH,IAAI,GAAG,MAAM,KAAK,EAAE;GACpB,IAAI,GAAG,MAAM,KAAK,EAAE;EACxB;CACJ;CACA,IAAI,OAAO,QAAQ,KAAK;CACxB,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,EAAE,GAAG;EACxB,IAAI,KAAK,GAAG,MAAM,GAAG,CAAC,GAAG,MAAM,GAAG,IAAI,KAAK,GAAG,IAAI,KAAK,GAAG,IAAI,KAAK,GAAG,IAAI,KAAK,GAAG,IAAI,MAAM,GAAG,IAAI,IAAI,KAAK,MAAM,GAAG;EACrH,IAAI;EACJ,IAAI,CAAC,QAAQ,KAAK;GACd,MAAM;GACN,MAAM;GACN,cAAc;GACd,aAAa;EACjB,CAAC,GACG,IAAI,CAAC,KACD,MAAM,MAAM,IAAI,MAAM,GAAG,IAAI,EAAE;OAC9B,IAAI,OAAO,GACZ,MAAM,MAAM,YAAY,KAAK,SAAS,GAAG,IAAI,EAAE,GAAG,EAAE,KAAK,IAAI,GAAG,EAAE,EAAE,CAAC;OAErE,IAAI,IAAI,8BAA8B,GAAG;CAErD;CACA,OAAO;AACX"}

package/dist/http/index.d.ts

@@ -1,5 +1,5 @@
 import { n as ToolErrorCode } from "../errors-aKhko9T1.js";
-import { a as HttpQueryResult, i as HttpCallOptions, n as HttpBytesOptions, o as HttpService, r as HttpBytesResult, s as HttpServiceOptions, t as HttpBody } from "../http-service-T7E5UjP8.js";
+import { a as HttpQueryResult, i as HttpCallOptions, n as HttpBytesOptions, o as HttpService, r as HttpBytesResult, s as HttpServiceOptions, t as HttpBody } from "../http-service-CerzWwQO.js";
 //#region src/transport/aws-service.d.ts
 type AwsCredentials = {
   accessKeyId: string;

package/dist/{http-service-T7E5UjP8.d.ts → http-service-CerzWwQO.d.ts}

@@ -22,8 +22,9 @@ type HttpServiceOptions = {
  * (including empty objects); FormData/Blob/string live under BodyInit.
  */
 type HttpBody = BodyInit | object | null;
+type HttpQueryValue = string | number | boolean | readonly (string | number | boolean)[] | undefined;
 type HttpCallOptions = {
-  query?: Record<string, string | number | boolean | undefined>;
+  query?: Record<string, HttpQueryValue>;
   body?: HttpBody;
   headers?: Record<string, string>;
   /** Status codes returned without throwing. */
@@ -77,4 +78,4 @@ declare class HttpService {
 }
 //#endregion
 export { HttpQueryResult as a, HttpCallOptions as i, HttpBytesOptions as n, HttpService as o, HttpBytesResult as r, HttpServiceOptions as s, HttpBody as t };
-//# sourceMappingURL=http-service-T7E5UjP8.d.ts.map
+//# sourceMappingURL=http-service-CerzWwQO.d.ts.map

package/dist/http-service-CerzWwQO.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"http-service-CerzWwQO.d.ts","names":[],"sources":["../src/transport/http-service.ts"],"mappings":";;KAaY;;EAEX;;EAEA,UAAU;;EAEV;;;;;EAKA,QAAQ;;EAER,SAAS;;EAET;;;;;;KAOW,WAAW;KAEX;KAEA;EACX,QAAQ,eAAe;EACvB,OAAO;EACP,UAAU;;EAEV;;EAEA;EACA;EACA,SAAS;;EAET;;KAGW,mBAAmB;;EAE9B;;KAGW;EACX;EACA;EACA,SAAS;EACT;;EAEA;;KAGW;EACX;EACA;EACA,SAAS;EACT;EACA,OAAO;;;;;;cASK;;EAKZ,YAAY,UAAS;;EAwBf,MAAM,gBAAgB,cAAc,UAAS,kBAAuB,QAAQ;;;;;EAQ5E,MAAM,gBAAgB,cAAc,UAAS,mBAAwB,QAAQ;EAyBnF,IAAI,cAAc,UAAS,kBAAuB,QAAQ;EAI1D,KAAK,cAAc,OAAO,UAAU,UAAS,kBAAuB,QAAQ;EAI5E,IAAI,cAAc,OAAO,UAAU,UAAS,kBAAuB,QAAQ;EAI3E,MAAM,cAAc,OAAO,UAAU,UAAS,kBAAuB,QAAQ;EAI7E,OAAO,cAAc,UAAS,kBAAuB,QAAQ;EAI7D,KAAK,cAAc,UAAS,kBAAuB,QAAQ"}

package/dist/http-service-DDNCO1s4.js.map

@@ -1 +1 @@
-{"version":3,"file":"http-service-DDNCO1s4.js","names":["#http","#defaultLabel","#defaultSignal","#raw"],"sources":["../src/transport/errors.ts","../src/transport/http-service.ts"],"sourcesContent":["/**\n * HTTP status / network → ToolError for HttpService and AwsService.\n */\n\nimport { isError, isNumber } from 'es-toolkit'\nimport { FetchError } from 'ofetch'\n\nimport { ToolError } from '../core/errors'\nimport type { ToolErrorCode } from '../core/errors'\n\nexport type StatusThrowOptions = {\n\tallowStatuses?: readonly number[]\n\t/** When true, non-2xx does not throw. */\n\tnoThrow?: boolean\n}\n\n/** Map common HTTP status codes to stable ToolError codes. */\nexport function httpErrorCode(status: number): ToolErrorCode {\n\tif (status === 401) return 'bad_auth'\n\tif (status === 403) return 'forbidden'\n\tif (status === 404) return 'not_found'\n\tif (status === 429) return 'rate_limited'\n\tif (status === 413) return 'too_large'\n\treturn 'upstream'\n}\n\nexport function throwHttpStatus(operation: string, status: number, retryAfterMs?: number): never {\n\tconst code = httpErrorCode(status)\n\tthrow new ToolError(`${operation} failed with HTTP ${status}`, {\n\t\tcode,\n\t\tretryable: status >= 500 || status === 429,\n\t\tdetails: {\n\t\t\tstatus,\n\t\t\t...(retryAfterMs !== undefined && { retry_after_ms: retryAfterMs })\n\t\t}\n\t})\n}\n\n/** Parse Retry-After header (seconds or HTTP-date) into milliseconds when possible. */\nexport function retryAfterMsFromHeader(value: string | null): number | undefined {\n\tif (value === null || value.length === 0) return undefined\n\tconst asSeconds = Number.parseInt(value, 10)\n\tif (Number.isFinite(asSeconds) && asSeconds >= 0) return asSeconds * 1000\n\tconst asDate = Date.parse(value)\n\tif (Number.isFinite(asDate)) {\n\t\tconst delta = asDate - Date.now()\n\t\treturn delta > 0 ? delta : 0\n\t}\n\treturn undefined\n}\n\n/** Default: throw ToolError on non-2xx (404 → not_found). */\nexport function assertHttpStatusOk(\n\tlabel: string,\n\tstatus: number,\n\theaders: Headers,\n\toptions: StatusThrowOptions = {}\n): void {\n\tif (options.noThrow === true) return\n\tif (status >= 200 && status < 300) return\n\tif (options.allowStatuses && options.allowStatuses.includes(status)) return\n\tif (status === 404) {\n\t\tthrow new ToolError('Not found', { code: 'not_found', details: { status } })\n\t}\n\tthrowHttpStatus(label, status, retryAfterMsFromHeader(headers.get('retry-after')))\n}\n\n/** True if error or any nested `cause` is an AbortError (ofetch wraps abort in FetchError). */\nexport function isAbortErrorChain(error: unknown): boolean {\n\tlet current: unknown = error\n\tconst seen = new Set<unknown>()\n\twhile (current !== undefined && current !== null && !seen.has(current)) {\n\t\tseen.add(current)\n\t\tif (isError(current) && (current.name === 'AbortError' || current.name === 'TimeoutError')) {\n\t\t\treturn true\n\t\t}\n\t\tif (isError(current) && 'cause' in current) {\n\t\t\tcurrent = current.cause\n\t\t\tcontinue\n\t\t}\n\t\tbreak\n\t}\n\treturn false\n}\n\n/** Map ofetch / AbortError / unknown network failures to ToolError. */\nexport function mapTransportNetworkError(error: unknown, label: string): never {\n\tif (error instanceof ToolError) throw error\n\tif (isAbortErrorChain(error)) {\n\t\tthrow new ToolError(`${label} request was aborted`, {\n\t\t\tcode: 'timeout',\n\t\t\tretryable: true,\n\t\t\tcause: error\n\t\t})\n\t}\n\tif (error instanceof FetchError) {\n\t\tconst status = error.statusCode ?? error.response?.status\n\t\tif (isNumber(status) && Number.isFinite(status)) {\n\t\t\tconst retryAfter = retryAfterMsFromHeader(error.response?.headers.get('retry-after') ?? null)\n\t\t\tthrowHttpStatus(label, status, retryAfter)\n\t\t}\n\t\tthrow new ToolError(error.message || `${label} request failed`, {\n\t\t\tcode: 'upstream',\n\t\t\tretryable: true,\n\t\t\tcause: error\n\t\t})\n\t}\n\tthrow new ToolError(`${label} request failed`, {\n\t\tcode: 'upstream',\n\t\tretryable: true,\n\t\tcause: error\n\t})\n}\n","/**\n * Shared HTTP transport (ofetch under the hood).\n * Product clients construct this and call query/bytes/get/post/….\n */\n\nimport { createFetch } from 'ofetch'\nimport type { CreateFetchOptions, FetchOptions } from 'ofetch'\nimport { trimEnd } from 'es-toolkit'\n\nimport { ToolError } from '../core/errors'\nimport type { FetchLike } from '../core/types'\nimport { assertHttpStatusOk, mapTransportNetworkError } from './errors'\n\nexport type HttpServiceOptions = {\n\t/** Absolute origin or base path. Omit for free-form absolute URLs. */\n\tbaseURL?: string\n\t/** Default headers (Authorization, Content-Type, …). */\n\theaders?: Record<string, string>\n\t/** Default timeout ms. */\n\ttimeout?: number\n\t/**\n\t * Injectable fetch (tests via ToolContext / runTool).\n\t * Passed straight to ofetch — no preconnect wrapper.\n\t */\n\tfetch?: FetchLike\n\t/** Default abort signal. */\n\tsignal?: AbortSignal\n\t/** Prefix for ToolError messages (e.g. \"Resend\"). */\n\tlabel?: string\n}\n\n/**\n * Bodies ofetch accepts. `object` covers plain JSON payloads from tool input\n * (including empty objects); FormData/Blob/string live under BodyInit.\n */\nexport type HttpBody = BodyInit | object | null\n\nexport type HttpCallOptions = {\n\tquery?: Record<string, string | number | boolean | undefined>\n\tbody?: HttpBody\n\theaders?: Record<string, string>\n\t/** Status codes returned without throwing. */\n\tallowStatuses?: readonly number[]\n\t/** When true, non-2xx is returned instead of throwing. Default false. */\n\tnoThrow?: boolean\n\ttimeout?: number\n\tsignal?: AbortSignal\n\t/** Override error label for this call. */\n\tlabel?: string\n}\n\nexport type HttpBytesOptions = HttpCallOptions & {\n\t/** Stop reading and throw `too_large` once the response exceeds this many bytes. */\n\tmaxBytes?: number\n}\n\nexport type HttpQueryResult = {\n\tstatus: number\n\tok: boolean\n\theaders: Headers\n\turl: string\n\t/** Parsed body (JSON/text per ofetch). */\n\tdata: unknown\n}\n\nexport type HttpBytesResult = {\n\tstatus: number\n\tok: boolean\n\theaders: Headers\n\turl: string\n\tbytes: Uint8Array\n}\n\ntype OfetchInstance = ReturnType<typeof createFetch>\n\n/**\n * HTTP client: query (parsed), bytes, get/post/put/patch/delete/head.\n * Non-2xx → ToolError by default.\n */\nexport class HttpService {\n\treadonly #http: OfetchInstance\n\treadonly #defaultLabel: string\n\treadonly #defaultSignal: AbortSignal | undefined\n\n\tconstructor(options: HttpServiceOptions = {}) {\n\t\tthis.#defaultLabel = options.label ?? 'HTTP'\n\t\tthis.#defaultSignal = options.signal\n\t\tthis.#http = createOfetch(options)\n\t}\n\n\t/** Shared ofetch.raw + status assert + error map. */\n\tasync #raw(method: string, path: string, options: HttpCallOptions, extra?: FetchOptions) {\n\t\tconst label = options.label ?? this.#defaultLabel\n\t\ttry {\n\t\t\tconst res = await this.#http.raw(path, {\n\t\t\t\tsignal: this.#defaultSignal ?? null,\n\t\t\t\tmethod,\n\t\t\t\t...options,\n\t\t\t\t...extra\n\t\t\t})\n\t\t\tassertHttpStatusOk(label, res.status, res.headers, options)\n\t\t\treturn { status: res.status, ok: res.ok, headers: res.headers, url: res.url, data: res._data }\n\t\t} catch (error) {\n\t\t\tmapTransportNetworkError(error, label)\n\t\t}\n\t}\n\n\t/** Parsed body (JSON/text). ofetch parses JSON responses by default. */\n\tasync query(method: string, path: string, options: HttpCallOptions = {}): Promise<HttpQueryResult> {\n\t\treturn this.#raw(method, path, options)\n\t}\n\n\t/**\n\t * Binary body. `maxBytes` switches to streaming and cancels before an\n\t * oversized response is materialized.\n\t */\n\tasync bytes(method: string, path: string, options: HttpBytesOptions = {}): Promise<HttpBytesResult> {\n\t\tconst { maxBytes, ...requestOptions } = options\n\t\tif (maxBytes !== undefined && (!Number.isSafeInteger(maxBytes) || maxBytes < 0)) {\n\t\t\tthrow new ToolError('Response byte limit must be a non-negative safe integer', { code: 'bad_input' })\n\t\t}\n\n\t\tconst res = await this.#raw(method, path, requestOptions, {\n\t\t\tresponseType: maxBytes === undefined ? 'arrayBuffer' : 'stream'\n\t\t})\n\t\tif (maxBytes === undefined) {\n\t\t\treturn {\n\t\t\t\t...res,\n\t\t\t\tbytes: new Uint8Array(res.data)\n\t\t\t}\n\t\t}\n\n\t\tconst label = options.label ?? this.#defaultLabel\n\t\ttry {\n\t\t\tconst bytes = await readBoundedBytes(res.data, res.headers, maxBytes, label)\n\t\t\treturn { ...res, bytes }\n\t\t} catch (error) {\n\t\t\tmapTransportNetworkError(error, label)\n\t\t}\n\t}\n\n\tget(path: string, options: HttpCallOptions = {}): Promise<HttpQueryResult> {\n\t\treturn this.query('GET', path, options)\n\t}\n\n\tpost(path: string, body?: HttpBody, options: HttpCallOptions = {}): Promise<HttpQueryResult> {\n\t\treturn this.query('POST', path, body === undefined ? options : { ...options, body })\n\t}\n\n\tput(path: string, body?: HttpBody, options: HttpCallOptions = {}): Promise<HttpQueryResult> {\n\t\treturn this.query('PUT', path, body === undefined ? options : { ...options, body })\n\t}\n\n\tpatch(path: string, body?: HttpBody, options: HttpCallOptions = {}): Promise<HttpQueryResult> {\n\t\treturn this.query('PATCH', path, body === undefined ? options : { ...options, body })\n\t}\n\n\tdelete(path: string, options: HttpCallOptions = {}): Promise<HttpQueryResult> {\n\t\treturn this.query('DELETE', path, options)\n\t}\n\n\thead(path: string, options: HttpCallOptions = {}): Promise<HttpQueryResult> {\n\t\treturn this.query('HEAD', path, options)\n\t}\n}\n\nfunction isReadableByteStream(value: unknown): value is ReadableStream<unknown> {\n\treturn value instanceof ReadableStream\n}\n\nfunction contentLength(headers: Headers): number | undefined {\n\tconst value = headers.get('content-length')\n\tif (value === null || !/^\\d+$/.test(value)) return undefined\n\tconst parsed = Number(value)\n\treturn Number.isSafeInteger(parsed) ? parsed : undefined\n}\n\nfunction responseTooLarge(label: string, maxBytes: number, observedBytes: number): never {\n\tthrow new ToolError(`${label} response exceeds byte limit`, {\n\t\tcode: 'too_large',\n\t\tdetails: { max_bytes: maxBytes, content_length: observedBytes }\n\t})\n}\n\nasync function readBoundedBytes(data: unknown, headers: Headers, maxBytes: number, label: string): Promise<Uint8Array> {\n\tconst declaredLength = contentLength(headers)\n\tif (declaredLength !== undefined && declaredLength > maxBytes) {\n\t\tif (isReadableByteStream(data)) {\n\t\t\ttry {\n\t\t\t\tawait data.cancel()\n\t\t\t} catch {\n\t\t\t\t// Preserve the stable too_large error.\n\t\t\t}\n\t\t}\n\t\tresponseTooLarge(label, maxBytes, declaredLength)\n\t}\n\tif (data === null || data === undefined) return new Uint8Array()\n\tif (!isReadableByteStream(data)) {\n\t\tthrow new ToolError(`${label} returned an invalid byte stream`, { code: 'upstream' })\n\t}\n\n\tconst reader = data.getReader()\n\tconst chunks: Uint8Array[] = []\n\tlet total = 0\n\ttry {\n\t\twhile (true) {\n\t\t\tconst chunk = await reader.read()\n\t\t\tif (chunk.done) break\n\t\t\tif (!(chunk.value instanceof Uint8Array)) {\n\t\t\t\tthrow new ToolError(`${label} returned an invalid byte chunk`, { code: 'upstream' })\n\t\t\t}\n\t\t\ttotal += chunk.value.byteLength\n\t\t\tif (total > maxBytes) {\n\t\t\t\ttry {\n\t\t\t\t\tawait reader.cancel()\n\t\t\t\t} catch {\n\t\t\t\t\t// Preserve the stable too_large error.\n\t\t\t\t}\n\t\t\t\tresponseTooLarge(label, maxBytes, declaredLength ?? total)\n\t\t\t}\n\t\t\tchunks.push(chunk.value)\n\t\t}\n\t} finally {\n\t\treader.releaseLock()\n\t}\n\n\tconst bytes = new Uint8Array(total)\n\tlet offset = 0\n\tfor (const chunk of chunks) {\n\t\tbytes.set(chunk, offset)\n\t\toffset += chunk.byteLength\n\t}\n\treturn bytes\n}\n\nfunction createOfetch(options: HttpServiceOptions): OfetchInstance {\n\tconst defaults: FetchOptions = {\n\t\t...options,\n\t\tretry: false,\n\t\tignoreResponseError: true\n\t}\n\tif (defaults.baseURL) {\n\t\tdefaults.baseURL = trimEnd(defaults.baseURL, '/')\n\t}\n\tconst createOptions: CreateFetchOptions = { defaults }\n\tif (options.fetch) {\n\t\tObject.assign(createOptions, { fetch: options.fetch })\n\t}\n\treturn createFetch(createOptions)\n}\n"],"mappings":";;;;;;;;AAiBA,SAAgB,cAAc,QAA+B;CAC5D,IAAI,WAAW,KAAK,OAAO;CAC3B,IAAI,WAAW,KAAK,OAAO;CAC3B,IAAI,WAAW,KAAK,OAAO;CAC3B,IAAI,WAAW,KAAK,OAAO;CAC3B,IAAI,WAAW,KAAK,OAAO;CAC3B,OAAO;AACR;AAEA,SAAgB,gBAAgB,WAAmB,QAAgB,cAA8B;CAChG,MAAM,OAAO,cAAc,MAAM;CACjC,MAAM,IAAI,UAAU,GAAG,UAAU,oBAAoB,UAAU;EAC9D;EACA,WAAW,UAAU,OAAO,WAAW;EACvC,SAAS;GACR;GACA,GAAI,iBAAiB,KAAA,KAAa,EAAE,gBAAgB,aAAa;EAClE;CACD,CAAC;AACF;;AAGA,SAAgB,uBAAuB,OAA0C;CAChF,IAAI,UAAU,QAAQ,MAAM,WAAW,GAAG,OAAO,KAAA;CACjD,MAAM,YAAY,OAAO,SAAS,OAAO,EAAE;CAC3C,IAAI,OAAO,SAAS,SAAS,KAAK,aAAa,GAAG,OAAO,YAAY;CACrE,MAAM,SAAS,KAAK,MAAM,KAAK;CAC/B,IAAI,OAAO,SAAS,MAAM,GAAG;EAC5B,MAAM,QAAQ,SAAS,KAAK,IAAI;EAChC,OAAO,QAAQ,IAAI,QAAQ;CAC5B;AAED;;AAGA,SAAgB,mBACf,OACA,QACA,SACA,UAA8B,CAAC,GACxB;CACP,IAAI,QAAQ,YAAY,MAAM;CAC9B,IAAI,UAAU,OAAO,SAAS,KAAK;CACnC,IAAI,QAAQ,iBAAiB,QAAQ,cAAc,SAAS,MAAM,GAAG;CACrE,IAAI,WAAW,KACd,MAAM,IAAI,UAAU,aAAa;EAAE,MAAM;EAAa,SAAS,EAAE,OAAO;CAAE,CAAC;CAE5E,gBAAgB,OAAO,QAAQ,uBAAuB,QAAQ,IAAI,aAAa,CAAC,CAAC;AAClF;;AAGA,SAAgB,kBAAkB,OAAyB;CAC1D,IAAI,UAAmB;CACvB,MAAM,uBAAO,IAAI,IAAa;CAC9B,OAAO,YAAY,KAAA,KAAa,YAAY,QAAQ,CAAC,KAAK,IAAI,OAAO,GAAG;EACvE,KAAK,IAAI,OAAO;EAChB,IAAI,QAAQ,OAAO,MAAM,QAAQ,SAAS,gBAAgB,QAAQ,SAAS,iBAC1E,OAAO;EAER,IAAI,QAAQ,OAAO,KAAK,WAAW,SAAS;GAC3C,UAAU,QAAQ;GAClB;EACD;EACA;CACD;CACA,OAAO;AACR;;AAGA,SAAgB,yBAAyB,OAAgB,OAAsB;CAC9E,IAAI,iBAAiB,WAAW,MAAM;CACtC,IAAI,kBAAkB,KAAK,GAC1B,MAAM,IAAI,UAAU,GAAG,MAAM,uBAAuB;EACnD,MAAM;EACN,WAAW;EACX,OAAO;CACR,CAAC;CAEF,IAAI,iBAAiB,YAAY;EAChC,MAAM,SAAS,MAAM,cAAc,MAAM,UAAU;EACnD,IAAI,SAAS,MAAM,KAAK,OAAO,SAAS,MAAM,GAE7C,gBAAgB,OAAO,QADJ,uBAAuB,MAAM,UAAU,QAAQ,IAAI,aAAa,KAAK,IAChD,CAAC;EAE1C,MAAM,IAAI,UAAU,MAAM,WAAW,GAAG,MAAM,kBAAkB;GAC/D,MAAM;GACN,WAAW;GACX,OAAO;EACR,CAAC;CACF;CACA,MAAM,IAAI,UAAU,GAAG,MAAM,kBAAkB;EAC9C,MAAM;EACN,WAAW;EACX,OAAO;CACR,CAAC;AACF;;;;;;;;;;;ACjCA,IAAa,cAAb,MAAyB;CACxB;CACA;CACA;CAEA,YAAY,UAA8B,CAAC,GAAG;EAC7C,KAAKC,gBAAgB,QAAQ,SAAS;EACtC,KAAKC,iBAAiB,QAAQ;EAC9B,KAAKF,QAAQ,aAAa,OAAO;CAClC;;CAGA,MAAMG,KAAK,QAAgB,MAAc,SAA0B,OAAsB;EACxF,MAAM,QAAQ,QAAQ,SAAS,KAAKF;EACpC,IAAI;GACH,MAAM,MAAM,MAAM,KAAKD,MAAM,IAAI,MAAM;IACtC,QAAQ,KAAKE,kBAAkB;IAC/B;IACA,GAAG;IACH,GAAG;GACJ,CAAC;GACD,mBAAmB,OAAO,IAAI,QAAQ,IAAI,SAAS,OAAO;GAC1D,OAAO;IAAE,QAAQ,IAAI;IAAQ,IAAI,IAAI;IAAI,SAAS,IAAI;IAAS,KAAK,IAAI;IAAK,MAAM,IAAI;GAAM;EAC9F,SAAS,OAAO;GACf,yBAAyB,OAAO,KAAK;EACtC;CACD;;CAGA,MAAM,MAAM,QAAgB,MAAc,UAA2B,CAAC,GAA6B;EAClG,OAAO,KAAKC,KAAK,QAAQ,MAAM,OAAO;CACvC;;;;;CAMA,MAAM,MAAM,QAAgB,MAAc,UAA4B,CAAC,GAA6B;EACnG,MAAM,EAAE,UAAU,GAAG,mBAAmB;EACxC,IAAI,aAAa,KAAA,MAAc,CAAC,OAAO,cAAc,QAAQ,KAAK,WAAW,IAC5E,MAAM,IAAI,UAAU,2DAA2D,EAAE,MAAM,YAAY,CAAC;EAGrG,MAAM,MAAM,MAAM,KAAKA,KAAK,QAAQ,MAAM,gBAAgB,EACzD,cAAc,aAAa,KAAA,IAAY,gBAAgB,SACxD,CAAC;EACD,IAAI,aAAa,KAAA,GAChB,OAAO;GACN,GAAG;GACH,OAAO,IAAI,WAAW,IAAI,IAAI;EAC/B;EAGD,MAAM,QAAQ,QAAQ,SAAS,KAAKF;EACpC,IAAI;GACH,MAAM,QAAQ,MAAM,iBAAiB,IAAI,MAAM,IAAI,SAAS,UAAU,KAAK;GAC3E,OAAO;IAAE,GAAG;IAAK;GAAM;EACxB,SAAS,OAAO;GACf,yBAAyB,OAAO,KAAK;EACtC;CACD;CAEA,IAAI,MAAc,UAA2B,CAAC,GAA6B;EAC1E,OAAO,KAAK,MAAM,OAAO,MAAM,OAAO;CACvC;CAEA,KAAK,MAAc,MAAiB,UAA2B,CAAC,GAA6B;EAC5F,OAAO,KAAK,MAAM,QAAQ,MAAM,SAAS,KAAA,IAAY,UAAU;GAAE,GAAG;GAAS;EAAK,CAAC;CACpF;CAEA,IAAI,MAAc,MAAiB,UAA2B,CAAC,GAA6B;EAC3F,OAAO,KAAK,MAAM,OAAO,MAAM,SAAS,KAAA,IAAY,UAAU;GAAE,GAAG;GAAS;EAAK,CAAC;CACnF;CAEA,MAAM,MAAc,MAAiB,UAA2B,CAAC,GAA6B;EAC7F,OAAO,KAAK,MAAM,SAAS,MAAM,SAAS,KAAA,IAAY,UAAU;GAAE,GAAG;GAAS;EAAK,CAAC;CACrF;CAEA,OAAO,MAAc,UAA2B,CAAC,GAA6B;EAC7E,OAAO,KAAK,MAAM,UAAU,MAAM,OAAO;CAC1C;CAEA,KAAK,MAAc,UAA2B,CAAC,GAA6B;EAC3E,OAAO,KAAK,MAAM,QAAQ,MAAM,OAAO;CACxC;AACD;AAEA,SAAS,qBAAqB,OAAkD;CAC/E,OAAO,iBAAiB;AACzB;AAEA,SAAS,cAAc,SAAsC;CAC5D,MAAM,QAAQ,QAAQ,IAAI,gBAAgB;CAC1C,IAAI,UAAU,QAAQ,CAAC,QAAQ,KAAK,KAAK,GAAG,OAAO,KAAA;CACnD,MAAM,SAAS,OAAO,KAAK;CAC3B,OAAO,OAAO,cAAc,MAAM,IAAI,SAAS,KAAA;AAChD;AAEA,SAAS,iBAAiB,OAAe,UAAkB,eAA8B;CACxF,MAAM,IAAI,UAAU,GAAG,MAAM,+BAA+B;EAC3D,MAAM;EACN,SAAS;GAAE,WAAW;GAAU,gBAAgB;EAAc;CAC/D,CAAC;AACF;AAEA,eAAe,iBAAiB,MAAe,SAAkB,UAAkB,OAAoC;CACtH,MAAM,iBAAiB,cAAc,OAAO;CAC5C,IAAI,mBAAmB,KAAA,KAAa,iBAAiB,UAAU;EAC9D,IAAI,qBAAqB,IAAI,GAC5B,IAAI;GACH,MAAM,KAAK,OAAO;EACnB,QAAQ,CAER;EAED,iBAAiB,OAAO,UAAU,cAAc;CACjD;CACA,IAAI,SAAS,QAAQ,SAAS,KAAA,GAAW,uBAAO,IAAI,WAAW;CAC/D,IAAI,CAAC,qBAAqB,IAAI,GAC7B,MAAM,IAAI,UAAU,GAAG,MAAM,mCAAmC,EAAE,MAAM,WAAW,CAAC;CAGrF,MAAM,SAAS,KAAK,UAAU;CAC9B,MAAM,SAAuB,CAAC;CAC9B,IAAI,QAAQ;CACZ,IAAI;EACH,OAAO,MAAM;GACZ,MAAM,QAAQ,MAAM,OAAO,KAAK;GAChC,IAAI,MAAM,MAAM;GAChB,IAAI,EAAE,MAAM,iBAAiB,aAC5B,MAAM,IAAI,UAAU,GAAG,MAAM,kCAAkC,EAAE,MAAM,WAAW,CAAC;GAEpF,SAAS,MAAM,MAAM;GACrB,IAAI,QAAQ,UAAU;IACrB,IAAI;KACH,MAAM,OAAO,OAAO;IACrB,QAAQ,CAER;IACA,iBAAiB,OAAO,UAAU,kBAAkB,KAAK;GAC1D;GACA,OAAO,KAAK,MAAM,KAAK;EACxB;CACD,UAAU;EACT,OAAO,YAAY;CACpB;CAEA,MAAM,QAAQ,IAAI,WAAW,KAAK;CAClC,IAAI,SAAS;CACb,KAAK,MAAM,SAAS,QAAQ;EAC3B,MAAM,IAAI,OAAO,MAAM;EACvB,UAAU,MAAM;CACjB;CACA,OAAO;AACR;AAEA,SAAS,aAAa,SAA6C;CAClE,MAAM,WAAyB;EAC9B,GAAG;EACH,OAAO;EACP,qBAAqB;CACtB;CACA,IAAI,SAAS,SACZ,SAAS,UAAU,QAAQ,SAAS,SAAS,GAAG;CAEjD,MAAM,gBAAoC,EAAE,SAAS;CACrD,IAAI,QAAQ,OACX,OAAO,OAAO,eAAe,EAAE,OAAO,QAAQ,MAAM,CAAC;CAEtD,OAAO,YAAY,aAAa;AACjC"}
+{"version":3,"file":"http-service-DDNCO1s4.js","names":["#http","#defaultLabel","#defaultSignal","#raw"],"sources":["../src/transport/errors.ts","../src/transport/http-service.ts"],"sourcesContent":["/**\n * HTTP status / network → ToolError for HttpService and AwsService.\n */\n\nimport { isError, isNumber } from 'es-toolkit'\nimport { FetchError } from 'ofetch'\n\nimport { ToolError } from '../core/errors'\nimport type { ToolErrorCode } from '../core/errors'\n\nexport type StatusThrowOptions = {\n\tallowStatuses?: readonly number[]\n\t/** When true, non-2xx does not throw. */\n\tnoThrow?: boolean\n}\n\n/** Map common HTTP status codes to stable ToolError codes. */\nexport function httpErrorCode(status: number): ToolErrorCode {\n\tif (status === 401) return 'bad_auth'\n\tif (status === 403) return 'forbidden'\n\tif (status === 404) return 'not_found'\n\tif (status === 429) return 'rate_limited'\n\tif (status === 413) return 'too_large'\n\treturn 'upstream'\n}\n\nexport function throwHttpStatus(operation: string, status: number, retryAfterMs?: number): never {\n\tconst code = httpErrorCode(status)\n\tthrow new ToolError(`${operation} failed with HTTP ${status}`, {\n\t\tcode,\n\t\tretryable: status >= 500 || status === 429,\n\t\tdetails: {\n\t\t\tstatus,\n\t\t\t...(retryAfterMs !== undefined && { retry_after_ms: retryAfterMs })\n\t\t}\n\t})\n}\n\n/** Parse Retry-After header (seconds or HTTP-date) into milliseconds when possible. */\nexport function retryAfterMsFromHeader(value: string | null): number | undefined {\n\tif (value === null || value.length === 0) return undefined\n\tconst asSeconds = Number.parseInt(value, 10)\n\tif (Number.isFinite(asSeconds) && asSeconds >= 0) return asSeconds * 1000\n\tconst asDate = Date.parse(value)\n\tif (Number.isFinite(asDate)) {\n\t\tconst delta = asDate - Date.now()\n\t\treturn delta > 0 ? delta : 0\n\t}\n\treturn undefined\n}\n\n/** Default: throw ToolError on non-2xx (404 → not_found). */\nexport function assertHttpStatusOk(\n\tlabel: string,\n\tstatus: number,\n\theaders: Headers,\n\toptions: StatusThrowOptions = {}\n): void {\n\tif (options.noThrow === true) return\n\tif (status >= 200 && status < 300) return\n\tif (options.allowStatuses && options.allowStatuses.includes(status)) return\n\tif (status === 404) {\n\t\tthrow new ToolError('Not found', { code: 'not_found', details: { status } })\n\t}\n\tthrowHttpStatus(label, status, retryAfterMsFromHeader(headers.get('retry-after')))\n}\n\n/** True if error or any nested `cause` is an AbortError (ofetch wraps abort in FetchError). */\nexport function isAbortErrorChain(error: unknown): boolean {\n\tlet current: unknown = error\n\tconst seen = new Set<unknown>()\n\twhile (current !== undefined && current !== null && !seen.has(current)) {\n\t\tseen.add(current)\n\t\tif (isError(current) && (current.name === 'AbortError' || current.name === 'TimeoutError')) {\n\t\t\treturn true\n\t\t}\n\t\tif (isError(current) && 'cause' in current) {\n\t\t\tcurrent = current.cause\n\t\t\tcontinue\n\t\t}\n\t\tbreak\n\t}\n\treturn false\n}\n\n/** Map ofetch / AbortError / unknown network failures to ToolError. */\nexport function mapTransportNetworkError(error: unknown, label: string): never {\n\tif (error instanceof ToolError) throw error\n\tif (isAbortErrorChain(error)) {\n\t\tthrow new ToolError(`${label} request was aborted`, {\n\t\t\tcode: 'timeout',\n\t\t\tretryable: true,\n\t\t\tcause: error\n\t\t})\n\t}\n\tif (error instanceof FetchError) {\n\t\tconst status = error.statusCode ?? error.response?.status\n\t\tif (isNumber(status) && Number.isFinite(status)) {\n\t\t\tconst retryAfter = retryAfterMsFromHeader(error.response?.headers.get('retry-after') ?? null)\n\t\t\tthrowHttpStatus(label, status, retryAfter)\n\t\t}\n\t\tthrow new ToolError(error.message || `${label} request failed`, {\n\t\t\tcode: 'upstream',\n\t\t\tretryable: true,\n\t\t\tcause: error\n\t\t})\n\t}\n\tthrow new ToolError(`${label} request failed`, {\n\t\tcode: 'upstream',\n\t\tretryable: true,\n\t\tcause: error\n\t})\n}\n","/**\n * Shared HTTP transport (ofetch under the hood).\n * Product clients construct this and call query/bytes/get/post/….\n */\n\nimport { createFetch } from 'ofetch'\nimport type { CreateFetchOptions, FetchOptions } from 'ofetch'\nimport { trimEnd } from 'es-toolkit'\n\nimport { ToolError } from '../core/errors'\nimport type { FetchLike } from '../core/types'\nimport { assertHttpStatusOk, mapTransportNetworkError } from './errors'\n\nexport type HttpServiceOptions = {\n\t/** Absolute origin or base path. Omit for free-form absolute URLs. */\n\tbaseURL?: string\n\t/** Default headers (Authorization, Content-Type, …). */\n\theaders?: Record<string, string>\n\t/** Default timeout ms. */\n\ttimeout?: number\n\t/**\n\t * Injectable fetch (tests via ToolContext / runTool).\n\t * Passed straight to ofetch — no preconnect wrapper.\n\t */\n\tfetch?: FetchLike\n\t/** Default abort signal. */\n\tsignal?: AbortSignal\n\t/** Prefix for ToolError messages (e.g. \"Resend\"). */\n\tlabel?: string\n}\n\n/**\n * Bodies ofetch accepts. `object` covers plain JSON payloads from tool input\n * (including empty objects); FormData/Blob/string live under BodyInit.\n */\nexport type HttpBody = BodyInit | object | null\n\nexport type HttpQueryValue = string | number | boolean | readonly (string | number | boolean)[] | undefined\n\nexport type HttpCallOptions = {\n\tquery?: Record<string, HttpQueryValue>\n\tbody?: HttpBody\n\theaders?: Record<string, string>\n\t/** Status codes returned without throwing. */\n\tallowStatuses?: readonly number[]\n\t/** When true, non-2xx is returned instead of throwing. Default false. */\n\tnoThrow?: boolean\n\ttimeout?: number\n\tsignal?: AbortSignal\n\t/** Override error label for this call. */\n\tlabel?: string\n}\n\nexport type HttpBytesOptions = HttpCallOptions & {\n\t/** Stop reading and throw `too_large` once the response exceeds this many bytes. */\n\tmaxBytes?: number\n}\n\nexport type HttpQueryResult = {\n\tstatus: number\n\tok: boolean\n\theaders: Headers\n\turl: string\n\t/** Parsed body (JSON/text per ofetch). */\n\tdata: unknown\n}\n\nexport type HttpBytesResult = {\n\tstatus: number\n\tok: boolean\n\theaders: Headers\n\turl: string\n\tbytes: Uint8Array\n}\n\ntype OfetchInstance = ReturnType<typeof createFetch>\n\n/**\n * HTTP client: query (parsed), bytes, get/post/put/patch/delete/head.\n * Non-2xx → ToolError by default.\n */\nexport class HttpService {\n\treadonly #http: OfetchInstance\n\treadonly #defaultLabel: string\n\treadonly #defaultSignal: AbortSignal | undefined\n\n\tconstructor(options: HttpServiceOptions = {}) {\n\t\tthis.#defaultLabel = options.label ?? 'HTTP'\n\t\tthis.#defaultSignal = options.signal\n\t\tthis.#http = createOfetch(options)\n\t}\n\n\t/** Shared ofetch.raw + status assert + error map. */\n\tasync #raw(method: string, path: string, options: HttpCallOptions, extra?: FetchOptions) {\n\t\tconst label = options.label ?? this.#defaultLabel\n\t\ttry {\n\t\t\tconst res = await this.#http.raw(path, {\n\t\t\t\tsignal: this.#defaultSignal ?? null,\n\t\t\t\tmethod,\n\t\t\t\t...options,\n\t\t\t\t...extra\n\t\t\t})\n\t\t\tassertHttpStatusOk(label, res.status, res.headers, options)\n\t\t\treturn { status: res.status, ok: res.ok, headers: res.headers, url: res.url, data: res._data }\n\t\t} catch (error) {\n\t\t\tmapTransportNetworkError(error, label)\n\t\t}\n\t}\n\n\t/** Parsed body (JSON/text). ofetch parses JSON responses by default. */\n\tasync query(method: string, path: string, options: HttpCallOptions = {}): Promise<HttpQueryResult> {\n\t\treturn this.#raw(method, path, options)\n\t}\n\n\t/**\n\t * Binary body. `maxBytes` switches to streaming and cancels before an\n\t * oversized response is materialized.\n\t */\n\tasync bytes(method: string, path: string, options: HttpBytesOptions = {}): Promise<HttpBytesResult> {\n\t\tconst { maxBytes, ...requestOptions } = options\n\t\tif (maxBytes !== undefined && (!Number.isSafeInteger(maxBytes) || maxBytes < 0)) {\n\t\t\tthrow new ToolError('Response byte limit must be a non-negative safe integer', { code: 'bad_input' })\n\t\t}\n\n\t\tconst res = await this.#raw(method, path, requestOptions, {\n\t\t\tresponseType: maxBytes === undefined ? 'arrayBuffer' : 'stream'\n\t\t})\n\t\tif (maxBytes === undefined) {\n\t\t\treturn {\n\t\t\t\t...res,\n\t\t\t\tbytes: new Uint8Array(res.data)\n\t\t\t}\n\t\t}\n\n\t\tconst label = options.label ?? this.#defaultLabel\n\t\ttry {\n\t\t\tconst bytes = await readBoundedBytes(res.data, res.headers, maxBytes, label)\n\t\t\treturn { ...res, bytes }\n\t\t} catch (error) {\n\t\t\tmapTransportNetworkError(error, label)\n\t\t}\n\t}\n\n\tget(path: string, options: HttpCallOptions = {}): Promise<HttpQueryResult> {\n\t\treturn this.query('GET', path, options)\n\t}\n\n\tpost(path: string, body?: HttpBody, options: HttpCallOptions = {}): Promise<HttpQueryResult> {\n\t\treturn this.query('POST', path, body === undefined ? options : { ...options, body })\n\t}\n\n\tput(path: string, body?: HttpBody, options: HttpCallOptions = {}): Promise<HttpQueryResult> {\n\t\treturn this.query('PUT', path, body === undefined ? options : { ...options, body })\n\t}\n\n\tpatch(path: string, body?: HttpBody, options: HttpCallOptions = {}): Promise<HttpQueryResult> {\n\t\treturn this.query('PATCH', path, body === undefined ? options : { ...options, body })\n\t}\n\n\tdelete(path: string, options: HttpCallOptions = {}): Promise<HttpQueryResult> {\n\t\treturn this.query('DELETE', path, options)\n\t}\n\n\thead(path: string, options: HttpCallOptions = {}): Promise<HttpQueryResult> {\n\t\treturn this.query('HEAD', path, options)\n\t}\n}\n\nfunction isReadableByteStream(value: unknown): value is ReadableStream<unknown> {\n\treturn value instanceof ReadableStream\n}\n\nfunction contentLength(headers: Headers): number | undefined {\n\tconst value = headers.get('content-length')\n\tif (value === null || !/^\\d+$/.test(value)) return undefined\n\tconst parsed = Number(value)\n\treturn Number.isSafeInteger(parsed) ? parsed : undefined\n}\n\nfunction responseTooLarge(label: string, maxBytes: number, observedBytes: number): never {\n\tthrow new ToolError(`${label} response exceeds byte limit`, {\n\t\tcode: 'too_large',\n\t\tdetails: { max_bytes: maxBytes, content_length: observedBytes }\n\t})\n}\n\nasync function readBoundedBytes(data: unknown, headers: Headers, maxBytes: number, label: string): Promise<Uint8Array> {\n\tconst declaredLength = contentLength(headers)\n\tif (declaredLength !== undefined && declaredLength > maxBytes) {\n\t\tif (isReadableByteStream(data)) {\n\t\t\ttry {\n\t\t\t\tawait data.cancel()\n\t\t\t} catch {\n\t\t\t\t// Preserve the stable too_large error.\n\t\t\t}\n\t\t}\n\t\tresponseTooLarge(label, maxBytes, declaredLength)\n\t}\n\tif (data === null || data === undefined) return new Uint8Array()\n\tif (!isReadableByteStream(data)) {\n\t\tthrow new ToolError(`${label} returned an invalid byte stream`, { code: 'upstream' })\n\t}\n\n\tconst reader = data.getReader()\n\tconst chunks: Uint8Array[] = []\n\tlet total = 0\n\ttry {\n\t\twhile (true) {\n\t\t\tconst chunk = await reader.read()\n\t\t\tif (chunk.done) break\n\t\t\tif (!(chunk.value instanceof Uint8Array)) {\n\t\t\t\tthrow new ToolError(`${label} returned an invalid byte chunk`, { code: 'upstream' })\n\t\t\t}\n\t\t\ttotal += chunk.value.byteLength\n\t\t\tif (total > maxBytes) {\n\t\t\t\ttry {\n\t\t\t\t\tawait reader.cancel()\n\t\t\t\t} catch {\n\t\t\t\t\t// Preserve the stable too_large error.\n\t\t\t\t}\n\t\t\t\tresponseTooLarge(label, maxBytes, declaredLength ?? total)\n\t\t\t}\n\t\t\tchunks.push(chunk.value)\n\t\t}\n\t} finally {\n\t\treader.releaseLock()\n\t}\n\n\tconst bytes = new Uint8Array(total)\n\tlet offset = 0\n\tfor (const chunk of chunks) {\n\t\tbytes.set(chunk, offset)\n\t\toffset += chunk.byteLength\n\t}\n\treturn bytes\n}\n\nfunction createOfetch(options: HttpServiceOptions): OfetchInstance {\n\tconst defaults: FetchOptions = {\n\t\t...options,\n\t\tretry: false,\n\t\tignoreResponseError: true\n\t}\n\tif (defaults.baseURL) {\n\t\tdefaults.baseURL = trimEnd(defaults.baseURL, '/')\n\t}\n\tconst createOptions: CreateFetchOptions = { defaults }\n\tif (options.fetch) {\n\t\tObject.assign(createOptions, { fetch: options.fetch })\n\t}\n\treturn createFetch(createOptions)\n}\n"],"mappings":";;;;;;;;AAiBA,SAAgB,cAAc,QAA+B;CAC5D,IAAI,WAAW,KAAK,OAAO;CAC3B,IAAI,WAAW,KAAK,OAAO;CAC3B,IAAI,WAAW,KAAK,OAAO;CAC3B,IAAI,WAAW,KAAK,OAAO;CAC3B,IAAI,WAAW,KAAK,OAAO;CAC3B,OAAO;AACR;AAEA,SAAgB,gBAAgB,WAAmB,QAAgB,cAA8B;CAChG,MAAM,OAAO,cAAc,MAAM;CACjC,MAAM,IAAI,UAAU,GAAG,UAAU,oBAAoB,UAAU;EAC9D;EACA,WAAW,UAAU,OAAO,WAAW;EACvC,SAAS;GACR;GACA,GAAI,iBAAiB,KAAA,KAAa,EAAE,gBAAgB,aAAa;EAClE;CACD,CAAC;AACF;;AAGA,SAAgB,uBAAuB,OAA0C;CAChF,IAAI,UAAU,QAAQ,MAAM,WAAW,GAAG,OAAO,KAAA;CACjD,MAAM,YAAY,OAAO,SAAS,OAAO,EAAE;CAC3C,IAAI,OAAO,SAAS,SAAS,KAAK,aAAa,GAAG,OAAO,YAAY;CACrE,MAAM,SAAS,KAAK,MAAM,KAAK;CAC/B,IAAI,OAAO,SAAS,MAAM,GAAG;EAC5B,MAAM,QAAQ,SAAS,KAAK,IAAI;EAChC,OAAO,QAAQ,IAAI,QAAQ;CAC5B;AAED;;AAGA,SAAgB,mBACf,OACA,QACA,SACA,UAA8B,CAAC,GACxB;CACP,IAAI,QAAQ,YAAY,MAAM;CAC9B,IAAI,UAAU,OAAO,SAAS,KAAK;CACnC,IAAI,QAAQ,iBAAiB,QAAQ,cAAc,SAAS,MAAM,GAAG;CACrE,IAAI,WAAW,KACd,MAAM,IAAI,UAAU,aAAa;EAAE,MAAM;EAAa,SAAS,EAAE,OAAO;CAAE,CAAC;CAE5E,gBAAgB,OAAO,QAAQ,uBAAuB,QAAQ,IAAI,aAAa,CAAC,CAAC;AAClF;;AAGA,SAAgB,kBAAkB,OAAyB;CAC1D,IAAI,UAAmB;CACvB,MAAM,uBAAO,IAAI,IAAa;CAC9B,OAAO,YAAY,KAAA,KAAa,YAAY,QAAQ,CAAC,KAAK,IAAI,OAAO,GAAG;EACvE,KAAK,IAAI,OAAO;EAChB,IAAI,QAAQ,OAAO,MAAM,QAAQ,SAAS,gBAAgB,QAAQ,SAAS,iBAC1E,OAAO;EAER,IAAI,QAAQ,OAAO,KAAK,WAAW,SAAS;GAC3C,UAAU,QAAQ;GAClB;EACD;EACA;CACD;CACA,OAAO;AACR;;AAGA,SAAgB,yBAAyB,OAAgB,OAAsB;CAC9E,IAAI,iBAAiB,WAAW,MAAM;CACtC,IAAI,kBAAkB,KAAK,GAC1B,MAAM,IAAI,UAAU,GAAG,MAAM,uBAAuB;EACnD,MAAM;EACN,WAAW;EACX,OAAO;CACR,CAAC;CAEF,IAAI,iBAAiB,YAAY;EAChC,MAAM,SAAS,MAAM,cAAc,MAAM,UAAU;EACnD,IAAI,SAAS,MAAM,KAAK,OAAO,SAAS,MAAM,GAE7C,gBAAgB,OAAO,QADJ,uBAAuB,MAAM,UAAU,QAAQ,IAAI,aAAa,KAAK,IAChD,CAAC;EAE1C,MAAM,IAAI,UAAU,MAAM,WAAW,GAAG,MAAM,kBAAkB;GAC/D,MAAM;GACN,WAAW;GACX,OAAO;EACR,CAAC;CACF;CACA,MAAM,IAAI,UAAU,GAAG,MAAM,kBAAkB;EAC9C,MAAM;EACN,WAAW;EACX,OAAO;CACR,CAAC;AACF;;;;;;;;;;;AC/BA,IAAa,cAAb,MAAyB;CACxB;CACA;CACA;CAEA,YAAY,UAA8B,CAAC,GAAG;EAC7C,KAAKC,gBAAgB,QAAQ,SAAS;EACtC,KAAKC,iBAAiB,QAAQ;EAC9B,KAAKF,QAAQ,aAAa,OAAO;CAClC;;CAGA,MAAMG,KAAK,QAAgB,MAAc,SAA0B,OAAsB;EACxF,MAAM,QAAQ,QAAQ,SAAS,KAAKF;EACpC,IAAI;GACH,MAAM,MAAM,MAAM,KAAKD,MAAM,IAAI,MAAM;IACtC,QAAQ,KAAKE,kBAAkB;IAC/B;IACA,GAAG;IACH,GAAG;GACJ,CAAC;GACD,mBAAmB,OAAO,IAAI,QAAQ,IAAI,SAAS,OAAO;GAC1D,OAAO;IAAE,QAAQ,IAAI;IAAQ,IAAI,IAAI;IAAI,SAAS,IAAI;IAAS,KAAK,IAAI;IAAK,MAAM,IAAI;GAAM;EAC9F,SAAS,OAAO;GACf,yBAAyB,OAAO,KAAK;EACtC;CACD;;CAGA,MAAM,MAAM,QAAgB,MAAc,UAA2B,CAAC,GAA6B;EAClG,OAAO,KAAKC,KAAK,QAAQ,MAAM,OAAO;CACvC;;;;;CAMA,MAAM,MAAM,QAAgB,MAAc,UAA4B,CAAC,GAA6B;EACnG,MAAM,EAAE,UAAU,GAAG,mBAAmB;EACxC,IAAI,aAAa,KAAA,MAAc,CAAC,OAAO,cAAc,QAAQ,KAAK,WAAW,IAC5E,MAAM,IAAI,UAAU,2DAA2D,EAAE,MAAM,YAAY,CAAC;EAGrG,MAAM,MAAM,MAAM,KAAKA,KAAK,QAAQ,MAAM,gBAAgB,EACzD,cAAc,aAAa,KAAA,IAAY,gBAAgB,SACxD,CAAC;EACD,IAAI,aAAa,KAAA,GAChB,OAAO;GACN,GAAG;GACH,OAAO,IAAI,WAAW,IAAI,IAAI;EAC/B;EAGD,MAAM,QAAQ,QAAQ,SAAS,KAAKF;EACpC,IAAI;GACH,MAAM,QAAQ,MAAM,iBAAiB,IAAI,MAAM,IAAI,SAAS,UAAU,KAAK;GAC3E,OAAO;IAAE,GAAG;IAAK;GAAM;EACxB,SAAS,OAAO;GACf,yBAAyB,OAAO,KAAK;EACtC;CACD;CAEA,IAAI,MAAc,UAA2B,CAAC,GAA6B;EAC1E,OAAO,KAAK,MAAM,OAAO,MAAM,OAAO;CACvC;CAEA,KAAK,MAAc,MAAiB,UAA2B,CAAC,GAA6B;EAC5F,OAAO,KAAK,MAAM,QAAQ,MAAM,SAAS,KAAA,IAAY,UAAU;GAAE,GAAG;GAAS;EAAK,CAAC;CACpF;CAEA,IAAI,MAAc,MAAiB,UAA2B,CAAC,GAA6B;EAC3F,OAAO,KAAK,MAAM,OAAO,MAAM,SAAS,KAAA,IAAY,UAAU;GAAE,GAAG;GAAS;EAAK,CAAC;CACnF;CAEA,MAAM,MAAc,MAAiB,UAA2B,CAAC,GAA6B;EAC7F,OAAO,KAAK,MAAM,SAAS,MAAM,SAAS,KAAA,IAAY,UAAU;GAAE,GAAG;GAAS;EAAK,CAAC;CACrF;CAEA,OAAO,MAAc,UAA2B,CAAC,GAA6B;EAC7E,OAAO,KAAK,MAAM,UAAU,MAAM,OAAO;CAC1C;CAEA,KAAK,MAAc,UAA2B,CAAC,GAA6B;EAC3E,OAAO,KAAK,MAAM,QAAQ,MAAM,OAAO;CACxC;AACD;AAEA,SAAS,qBAAqB,OAAkD;CAC/E,OAAO,iBAAiB;AACzB;AAEA,SAAS,cAAc,SAAsC;CAC5D,MAAM,QAAQ,QAAQ,IAAI,gBAAgB;CAC1C,IAAI,UAAU,QAAQ,CAAC,QAAQ,KAAK,KAAK,GAAG,OAAO,KAAA;CACnD,MAAM,SAAS,OAAO,KAAK;CAC3B,OAAO,OAAO,cAAc,MAAM,IAAI,SAAS,KAAA;AAChD;AAEA,SAAS,iBAAiB,OAAe,UAAkB,eAA8B;CACxF,MAAM,IAAI,UAAU,GAAG,MAAM,+BAA+B;EAC3D,MAAM;EACN,SAAS;GAAE,WAAW;GAAU,gBAAgB;EAAc;CAC/D,CAAC;AACF;AAEA,eAAe,iBAAiB,MAAe,SAAkB,UAAkB,OAAoC;CACtH,MAAM,iBAAiB,cAAc,OAAO;CAC5C,IAAI,mBAAmB,KAAA,KAAa,iBAAiB,UAAU;EAC9D,IAAI,qBAAqB,IAAI,GAC5B,IAAI;GACH,MAAM,KAAK,OAAO;EACnB,QAAQ,CAER;EAED,iBAAiB,OAAO,UAAU,cAAc;CACjD;CACA,IAAI,SAAS,QAAQ,SAAS,KAAA,GAAW,uBAAO,IAAI,WAAW;CAC/D,IAAI,CAAC,qBAAqB,IAAI,GAC7B,MAAM,IAAI,UAAU,GAAG,MAAM,mCAAmC,EAAE,MAAM,WAAW,CAAC;CAGrF,MAAM,SAAS,KAAK,UAAU;CAC9B,MAAM,SAAuB,CAAC;CAC9B,IAAI,QAAQ;CACZ,IAAI;EACH,OAAO,MAAM;GACZ,MAAM,QAAQ,MAAM,OAAO,KAAK;GAChC,IAAI,MAAM,MAAM;GAChB,IAAI,EAAE,MAAM,iBAAiB,aAC5B,MAAM,IAAI,UAAU,GAAG,MAAM,kCAAkC,EAAE,MAAM,WAAW,CAAC;GAEpF,SAAS,MAAM,MAAM;GACrB,IAAI,QAAQ,UAAU;IACrB,IAAI;KACH,MAAM,OAAO,OAAO;IACrB,QAAQ,CAER;IACA,iBAAiB,OAAO,UAAU,kBAAkB,KAAK;GAC1D;GACA,OAAO,KAAK,MAAM,KAAK;EACxB;CACD,UAAU;EACT,OAAO,YAAY;CACpB;CAEA,MAAM,QAAQ,IAAI,WAAW,KAAK;CAClC,IAAI,SAAS;CACb,KAAK,MAAM,SAAS,QAAQ;EAC3B,MAAM,IAAI,OAAO,MAAM;EACvB,UAAU,MAAM;CACjB;CACA,OAAO;AACR;AAEA,SAAS,aAAa,SAA6C;CAClE,MAAM,WAAyB;EAC9B,GAAG;EACH,OAAO;EACP,qBAAqB;CACtB;CACA,IAAI,SAAS,SACZ,SAAS,UAAU,QAAQ,SAAS,SAAS,GAAG;CAEjD,MAAM,gBAAoC,EAAE,SAAS;CACrD,IAAI,QAAQ,OACX,OAAO,OAAO,eAAe,EAAE,OAAO,QAAQ,MAAM,CAAC;CAEtD,OAAO,YAAY,aAAa;AACjC"}

package/dist/{index-Cuh6eMWc.d.ts → index-9oSRRNdR.d.ts}

@@ -1,6 +1,6 @@
 import { a as ModuleDefinition, o as ToolContext, s as ToolDefinition } from "./types-Ccb0DXY9.js";
 import "./index-CZX5OeOF.js";
-import { s as HttpServiceOptions } from "./http-service-T7E5UjP8.js";
+import { s as HttpServiceOptions } from "./http-service-CerzWwQO.js";
 import { z } from "zod";
 //#region src/vendors/cloudflare-browser/contracts.d.ts
 declare const MAX_HTML_CHARS = 2000000;
@@ -282,4 +282,4 @@ declare function titleFromHtml(html: string): string | undefined;
 declare function plainTextFromHtml(html: string): string;
 //#endregion
 export { cloudflareBrowserRenderOutputSchema as A, CloudflareBrowserSessionOutput as C, cloudflareBrowserAuthSchema as D, MAX_HTML_CHARS as E, cloudflareBrowserSessionIdInputSchema as F, cloudflareBrowserSessionOutputSchema as I, cloudflareBrowserStartSessionInputSchema as L, cloudflareBrowserRenderScreenshotInputSchema as M, cloudflareBrowserRenderSourceSchema as N, cloudflareBrowserClientAuthSchema as O, cloudflareBrowserSessionAuthSchema as P, cloudflareBrowserViewportSchema as R, CloudflareBrowserSessionIdInput as S, CloudflareBrowserViewport as T, CloudflareBrowserRenderOutput as _, cloudflareBrowserRenderPdfTool as a, CloudflareBrowserRenderSource as b, cloudflareBrowserStopSessionTool as c, mintCloudflareBrowserCdpConnection as d, CloudflareBrowserClient as f, CloudflareBrowserEngine as g, CloudflareBrowserClientAuth as h, cloudflareBrowserModule as i, cloudflareBrowserRenderPdfInputSchema as j, cloudflareBrowserEngineSchema as k, CloudflareBrowserCdpConnection as l, CloudflareBrowserAuth as m, titleFromHtml as n, cloudflareBrowserRenderScreenshotTool as o, CloudflareBrowserClientOptions as p, cloudflareBrowserGetSessionTool as r, cloudflareBrowserStartSessionTool as s, plainTextFromHtml as t, MintCloudflareBrowserCdpOptions as u, CloudflareBrowserRenderPdfInput as v, CloudflareBrowserStartSessionInput as w, CloudflareBrowserSessionAuth as x, CloudflareBrowserRenderScreenshotInput as y };
-//# sourceMappingURL=index-Cuh6eMWc.d.ts.map
+//# sourceMappingURL=index-9oSRRNdR.d.ts.map

package/dist/{index-Cuh6eMWc.d.ts.map → index-9oSRRNdR.d.ts.map}

@@ -1 +1 @@
-{"version":3,"file":"index-Cuh6eMWc.d.ts","names":[],"sources":["../src/vendors/cloudflare-browser/contracts.ts","../src/vendors/cloudflare-browser/client.ts","../src/vendors/cloudflare-browser/cdp.ts","../src/vendors/cloudflare-browser/module.ts","../src/vendors/cloudflare-browser/domain.ts"],"mappings":";;;;;cAKa;;;;;cAMA,+BAA6B,EAAA;;;;KAM9B,0BAA0B,EAAE,aAAa;cAExC,oCAAkC,EAAA;;;;;;;GAQ7C,EAAA,KAAA;cAEW,mCAAiC,EAAA;;;;;;;;;;;;;;;;GAE5C,EAAA,KAAA;cAEW,6BAA2B,EAAA;;;;;;;;;;;;;;;;GAEtC,EAAA,KAAA;KAEU,wBAAwB,EAAE,aAAa;KACvC,8BAA8B,EAAE,aAAa;KAC7C,+BAA+B,EAAE,aAAa;cAE7C,0CAAwC,EAAA;;;;;;GAQnD,EAAA,KAAA;cAEW,uCAAqC,EAAA;;GAEhD,EAAA,KAAA;cAEW,sCAAoC,EAAA;;;;;GAK/C,EAAA,KAAA;KAEU,qCAAqC,EAAE,aAAa;KACpD,kCAAkC,EAAE,aAAa;KACjD,iCAAiC,EAAE,aAAa;cAE/C,iCAA+B,EAAA;;;;GAI1C,EAAA,KAAA;cAEW,qCAAmC,EAAA;;;GAU7C,EAAA,KAAA;cAEU,uCAAqC,EAAA;;;;;;;;;;;GAKhD,EAAA,KAAA;cAEW,8CAA4C,EAAA;;;;;;;;;;;;;;;;GAMvD,EAAA,KAAA;cAEW,qCAAmC,EAAA;;;;;;;;;;;;;;;GAG9C,EAAA,KAAA;KAEU,4BAA4B,EAAE,aAAa;KAC3C,gCAAgC,EAAE,aAAa;KAC/C,kCAAkC,EAAE,aAAa;KACjD,yCAAyC,EAAE,aAAa;KACxD,gCAAgC,EAAE,aAAa;;;KCvE/C,iCAAiC,KAAK;cAErC;;EAKZ,YAAY,MAAM,6BAA6B,UAAS;SAqBjD,YAAY,KAAK,cAAc;EAQhC,aAAa,QAAO,qCAA0C,QAAQ;EAUtE,WAAW,OAAO,kCAAkC,QAAQ;EAK5D,YAAY,OAAO,kCAAkC,QAAQ;;EAQ7D,UAAU,OAAO,kCAAkC,QAAQ;;EAK3D,iBAAiB,OAAO,yCAAyC,QAAQ;;;;;EAQzE,aAAa;IAClB;IACA;IACA,UAAU;MACP;IAAU;IAAc;;;;;KCxGjB;EACX;EACA;;;;;;EAMA,SAAS;EACT;EACA;;KAGW;;EAEX;;EAEA,UAAU;;;;;EAKV,UAAU;;;;;iBAmBK,mCACf,SAAS,gCACT,UAAS,kCACP;;;cCzCU,gCAAA;;;;;;;;;;;;;;;;;;cAYA,uCAAA;;;;;;;;;;;;;;;;;;;;;;;cAYA,mCAAA;;;;;;;;;cAaA,iCAAA;;;;;;;;cAaA,kCAAA;;;;;;;;cAYA,yBAAA;;;;;;;;;;;;;;;;;iBCoBG,cAAc;;iBAMd,kBAAkB"}
+{"version":3,"file":"index-9oSRRNdR.d.ts","names":[],"sources":["../src/vendors/cloudflare-browser/contracts.ts","../src/vendors/cloudflare-browser/client.ts","../src/vendors/cloudflare-browser/cdp.ts","../src/vendors/cloudflare-browser/module.ts","../src/vendors/cloudflare-browser/domain.ts"],"mappings":";;;;;cAKa;;;;;cAMA,+BAA6B,EAAA;;;;KAM9B,0BAA0B,EAAE,aAAa;cAExC,oCAAkC,EAAA;;;;;;;GAQ7C,EAAA,KAAA;cAEW,mCAAiC,EAAA;;;;;;;;;;;;;;;;GAE5C,EAAA,KAAA;cAEW,6BAA2B,EAAA;;;;;;;;;;;;;;;;GAEtC,EAAA,KAAA;KAEU,wBAAwB,EAAE,aAAa;KACvC,8BAA8B,EAAE,aAAa;KAC7C,+BAA+B,EAAE,aAAa;cAE7C,0CAAwC,EAAA;;;;;;GAQnD,EAAA,KAAA;cAEW,uCAAqC,EAAA;;GAEhD,EAAA,KAAA;cAEW,sCAAoC,EAAA;;;;;GAK/C,EAAA,KAAA;KAEU,qCAAqC,EAAE,aAAa;KACpD,kCAAkC,EAAE,aAAa;KACjD,iCAAiC,EAAE,aAAa;cAE/C,iCAA+B,EAAA;;;;GAI1C,EAAA,KAAA;cAEW,qCAAmC,EAAA;;;GAU7C,EAAA,KAAA;cAEU,uCAAqC,EAAA;;;;;;;;;;;GAKhD,EAAA,KAAA;cAEW,8CAA4C,EAAA;;;;;;;;;;;;;;;;GAMvD,EAAA,KAAA;cAEW,qCAAmC,EAAA;;;;;;;;;;;;;;;GAG9C,EAAA,KAAA;KAEU,4BAA4B,EAAE,aAAa;KAC3C,gCAAgC,EAAE,aAAa;KAC/C,kCAAkC,EAAE,aAAa;KACjD,yCAAyC,EAAE,aAAa;KACxD,gCAAgC,EAAE,aAAa;;;KCvE/C,iCAAiC,KAAK;cAErC;;EAKZ,YAAY,MAAM,6BAA6B,UAAS;SAqBjD,YAAY,KAAK,cAAc;EAQhC,aAAa,QAAO,qCAA0C,QAAQ;EAUtE,WAAW,OAAO,kCAAkC,QAAQ;EAK5D,YAAY,OAAO,kCAAkC,QAAQ;;EAQ7D,UAAU,OAAO,kCAAkC,QAAQ;;EAK3D,iBAAiB,OAAO,yCAAyC,QAAQ;;;;;EAQzE,aAAa;IAClB;IACA;IACA,UAAU;MACP;IAAU;IAAc;;;;;KCxGjB;EACX;EACA;;;;;;EAMA,SAAS;EACT;EACA;;KAGW;;EAEX;;EAEA,UAAU;;;;;EAKV,UAAU;;;;;iBAmBK,mCACf,SAAS,gCACT,UAAS,kCACP;;;cCzCU,gCAAA;;;;;;;;;;;;;;;;;;cAYA,uCAAA;;;;;;;;;;;;;;;;;;;;;;;cAYA,mCAAA;;;;;;;;;cAaA,iCAAA;;;;;;;;cAaA,kCAAA;;;;;;;;cAYA,yBAAA;;;;;;;;;;;;;;;;;iBCoBG,cAAc;;iBAMd,kBAAkB"}

package/dist/{index-zK1ZwS4m.d.ts → index-ByHp3nZm.d.ts}

@@ -1,6 +1,6 @@
 import { a as ModuleDefinition, o as ToolContext, s as ToolDefinition } from "./types-Ccb0DXY9.js";
 import "./index-CZX5OeOF.js";
-import { s as HttpServiceOptions } from "./http-service-T7E5UjP8.js";
+import { s as HttpServiceOptions } from "./http-service-CerzWwQO.js";
 import { z } from "zod";
 //#region src/vendors/_storage/schemas.d.ts
 declare const MAX_OBJECT_BYTES: number;
@@ -344,4 +344,4 @@ declare const s3Module: ModuleDefinition<{
 }>;
 //#endregion
 export { deleteObjectInputSchema as $, GetObjectInput as A, PutObjectOutput as B, CopyObjectInput as C, DEFAULT_SIGNED_URL_SECONDS as D, CreateMultipartUploadOutput as E, ListObjectsOutput as F, abortMultipartUploadInputSchema as G, SignedUrlOutput as H, MAX_MULTIPART_PART_BYTES as I, completeMultipartUploadOutputSchema as J, abortMultipartUploadOutputSchema as K, MAX_OBJECT_BYTES as L, HeadObjectInput as M, HeadObjectOutput as N, DeleteObjectInput as O, ListObjectsInput as P, createMultipartUploadOutputSchema as Q, MAX_SIGNED_URL_SECONDS as R, CompleteMultipartUploadOutput as S, CreateMultipartUploadInput as T, UploadPartInput as U, SignedUrlInput as V, UploadPartOutput as W, copyObjectOutputSchema as X, copyObjectInputSchema as Y, createMultipartUploadInputSchema as Z, S3Auth as _, s3CreateSignedUrlTool as a, listObjectsInputSchema as at, AbortMultipartUploadOutput as b, s3HeadObjectTool as c, putObjectOutputSchema as ct, s3PutObjectTool as d, uploadPartInputSchema as dt, deleteObjectOutputSchema as et, s3UploadPartTool as f, uploadPartOutputSchema as ft, S3ClientOptions as g, S3Client as h, s3CreateMultipartUploadTool as i, headObjectOutputSchema as it, GetObjectOutput as j, DeleteObjectOutput as k, s3ListObjectsTool as l, signedUrlInputSchema as lt, S3ByteRangeResult as m, s3CompleteMultipartUploadTool as n, getObjectOutputSchema as nt, s3DeleteObjectTool as o, listObjectsOutputSchema as ot, S3ByteRange as p, completeMultipartUploadInputSchema as q, s3CopyObjectTool as r, headObjectInputSchema as rt, s3GetObjectTool as s, putObjectInputSchema as st, s3AbortMultipartUploadTool as t, getObjectInputSchema as tt, s3Module as u, signedUrlOutputSchema as ut, s3AuthSchema as v, CopyObjectOutput as w, CompleteMultipartUploadInput as x, AbortMultipartUploadInput as y, PutObjectInput as z };
-//# sourceMappingURL=index-zK1ZwS4m.d.ts.map
+//# sourceMappingURL=index-ByHp3nZm.d.ts.map

package/dist/{index-zK1ZwS4m.d.ts.map → index-ByHp3nZm.d.ts.map}

@@ -1 +1 @@
-{"version":3,"file":"index-zK1ZwS4m.d.ts","names":[],"sources":["../src/vendors/_storage/schemas.ts","../src/vendors/s3/contracts.ts","../src/vendors/s3/client.ts","../src/vendors/s3/module.ts"],"mappings":";;;;;cASa;cACA;cACA;cAEA;cASA,wBAAsB,EAAA;;;;;GAKjC,EAAA,KAAA;cAEW,yBAAuB,EAAA;;;;;;;;;;;GAMlC,EAAA,KAAA;cAEW,sBAAoB,EAAA;;;;;;GAG/B,EAAA,KAAA;cAEW,uBAAqB,EAAA;;;;;;;;;GAMhC,EAAA,KAAA;cAEW,sBAAoB,EAAA;;;;;;;;GAK/B,EAAA,KAAA;cAEW,uBAAqB,EAAA;;;;GAIhC,EAAA,KAAA;cAEW,yBAAuB,EAAA;;GAElC,EAAA,KAAA;cAEW,0BAAwB,EAAA;;;GAGnC,EAAA,KAAA;cAEW,uBAAqB,EAAA;;GAEhC,EAAA,KAAA;cAEW,wBAAsB,EAAA;;;;;;GAMjC,EAAA,KAAA;cAEW,uBAAqB,EAAA;;;;GAQhC,EAAA,KAAA;cAEW,wBAAsB,EAAA;;;;GAIjC,EAAA,KAAA;cAEW,sBAAoB,EAAA;;;;;;;;;GAY/B,EAAA,KAAA;cAEW,uBAAqB,EAAA;;;;;;;;;GAIhC,EAAA,KAAA;cAEW,kCAAgC,EAAA;;;GAG3C,EAAA,KAAA;cAEW,mCAAiC,EAAA;;;GAG5C,EAAA,KAAA;cAEW,uBAAqB,EAAA;;;;;;;;;GAMhC,EAAA,KAAA;cAEW,wBAAsB,EAAA;;;;;;GAMjC,EAAA,KAAA;cAOW,oCAAkC,EAAA;;;;;;;GAQ7C,EAAA,KAAA;cAEW,qCAAmC,EAAA;;;;GAI9C,EAAA,KAAA;cAEW,iCAA+B,EAAA;;;GAG1C,EAAA,KAAA;cAEW,kCAAgC,EAAA;;;;GAI3C,EAAA,KAAA;KAmBU,mBAAmB,EAAE,aAAa;KAClC,oBAAoB,EAAE,aAAa;KACnC,iBAAiB,EAAE,aAAa;KAChC,kBAAkB,EAAE,aAAa;KACjC,iBAAiB,EAAE,aAAa;KAChC,kBAAkB,EAAE,aAAa;KACjC,oBAAoB,EAAE,aAAa;KACnC,qBAAqB,EAAE,aAAa;KACpC,kBAAkB,EAAE,aAAa;KACjC,mBAAmB,EAAE,aAAa;KAClC,kBAAkB,EAAE,aAAa;KACjC,mBAAmB,EAAE,aAAa;KAClC,iBAAiB,EAAE,aAAa;KAChC,kBAAkB,EAAE,aAAa;KACjC,6BAA6B,EAAE,aAAa;KAC5C,8BAA8B,EAAE,aAAa;KAC7C,kBAAkB,EAAE,aAAa;KACjC,mBAAmB,EAAE,aAAa;KAClC,+BAA+B,EAAE,aAAa;KAC9C,gCAAgC,EAAE,aAAa;KAC/C,4BAA4B,EAAE,aAAa;KAC3C,6BAA6B,EAAE,aAAa;;;cC3J3C,cAAY,EAAA;;;;;;;;GAiBvB,EAAA,KAAA;KAEU,SAAS,EAAE,aAAa;;;KC1BxB,kBAAkB,KAAK;KAEvB;EACX;EACA;;KAGW;EACX,OAAO;EACP;EACA;EACA;EACA;;cA0BY;;EAMZ,YAAY,MAAM,QAAQ,UAAS;SAwB5B,YAAY,KAAK,cAAc;EA4BhC,KAAK,OAAO,mBAAmB,QAAQ;EAuHvC,IAAI,OAAO,iBAAiB,QAAQ;EA4BpC,IAAI,OAAO,iBAAiB,QAAQ;EA0BpC,OAAO,OAAO,oBAAoB,QAAQ;EAS1C,KAAK,OAAO,kBAAkB,QAAQ;EAItC,KAAK,OAAO,kBAAkB,QAAQ;EAwBtC,gBAAgB,OAAO,iBAAiB,QAAQ;EAgBhD,sBAAsB,OAAO,6BAA6B,QAAQ;EAkBlE,WAAW,OAAO,kBAAkB,QAAQ;EAiC5C,wBAAwB,OAAO,+BAA+B,QAAQ;EA4BtE,qBAAqB,OAAO,4BAA4B,QAAQ;;EAWhE,SAAS,aAAa;IAAW;MAA2B,QAAQ;EAepE,cAAc,aAAa,OAAO,cAAc,QAAQ;;EA8DxD,SAAS,aAAa,OAAO,YAAY,uBAAuB;;;;cCngB1D,mBAAA;;;;;;;;;;;;;;;;;cAYA,iBAAA;;;;;;;;;;cAYA,iBAAA;;;;;;;;;;cAYA,oBAAA;;;;;;cAWA,kBAAA;;;;;;;;;cAYA,kBAAA;;;;;;;;;cAYA,uBAAA;;;;;;;;;cAWA,6BAAA;;;;;;;cAYA,kBAAA;;;;;;;;;;;;;cAYA,+BAAA;;;;;;;;;;;;cAYA,4BAAA;;;;;;;;cAWA,UAAA"}
+{"version":3,"file":"index-ByHp3nZm.d.ts","names":[],"sources":["../src/vendors/_storage/schemas.ts","../src/vendors/s3/contracts.ts","../src/vendors/s3/client.ts","../src/vendors/s3/module.ts"],"mappings":";;;;;cASa;cACA;cACA;cAEA;cASA,wBAAsB,EAAA;;;;;GAKjC,EAAA,KAAA;cAEW,yBAAuB,EAAA;;;;;;;;;;;GAMlC,EAAA,KAAA;cAEW,sBAAoB,EAAA;;;;;;GAG/B,EAAA,KAAA;cAEW,uBAAqB,EAAA;;;;;;;;;GAMhC,EAAA,KAAA;cAEW,sBAAoB,EAAA;;;;;;;;GAK/B,EAAA,KAAA;cAEW,uBAAqB,EAAA;;;;GAIhC,EAAA,KAAA;cAEW,yBAAuB,EAAA;;GAElC,EAAA,KAAA;cAEW,0BAAwB,EAAA;;;GAGnC,EAAA,KAAA;cAEW,uBAAqB,EAAA;;GAEhC,EAAA,KAAA;cAEW,wBAAsB,EAAA;;;;;;GAMjC,EAAA,KAAA;cAEW,uBAAqB,EAAA;;;;GAQhC,EAAA,KAAA;cAEW,wBAAsB,EAAA;;;;GAIjC,EAAA,KAAA;cAEW,sBAAoB,EAAA;;;;;;;;;GAY/B,EAAA,KAAA;cAEW,uBAAqB,EAAA;;;;;;;;;GAIhC,EAAA,KAAA;cAEW,kCAAgC,EAAA;;;GAG3C,EAAA,KAAA;cAEW,mCAAiC,EAAA;;;GAG5C,EAAA,KAAA;cAEW,uBAAqB,EAAA;;;;;;;;;GAMhC,EAAA,KAAA;cAEW,wBAAsB,EAAA;;;;;;GAMjC,EAAA,KAAA;cAOW,oCAAkC,EAAA;;;;;;;GAQ7C,EAAA,KAAA;cAEW,qCAAmC,EAAA;;;;GAI9C,EAAA,KAAA;cAEW,iCAA+B,EAAA;;;GAG1C,EAAA,KAAA;cAEW,kCAAgC,EAAA;;;;GAI3C,EAAA,KAAA;KAmBU,mBAAmB,EAAE,aAAa;KAClC,oBAAoB,EAAE,aAAa;KACnC,iBAAiB,EAAE,aAAa;KAChC,kBAAkB,EAAE,aAAa;KACjC,iBAAiB,EAAE,aAAa;KAChC,kBAAkB,EAAE,aAAa;KACjC,oBAAoB,EAAE,aAAa;KACnC,qBAAqB,EAAE,aAAa;KACpC,kBAAkB,EAAE,aAAa;KACjC,mBAAmB,EAAE,aAAa;KAClC,kBAAkB,EAAE,aAAa;KACjC,mBAAmB,EAAE,aAAa;KAClC,iBAAiB,EAAE,aAAa;KAChC,kBAAkB,EAAE,aAAa;KACjC,6BAA6B,EAAE,aAAa;KAC5C,8BAA8B,EAAE,aAAa;KAC7C,kBAAkB,EAAE,aAAa;KACjC,mBAAmB,EAAE,aAAa;KAClC,+BAA+B,EAAE,aAAa;KAC9C,gCAAgC,EAAE,aAAa;KAC/C,4BAA4B,EAAE,aAAa;KAC3C,6BAA6B,EAAE,aAAa;;;cC3J3C,cAAY,EAAA;;;;;;;;GAiBvB,EAAA,KAAA;KAEU,SAAS,EAAE,aAAa;;;KC1BxB,kBAAkB,KAAK;KAEvB;EACX;EACA;;KAGW;EACX,OAAO;EACP;EACA;EACA;EACA;;cA0BY;;EAMZ,YAAY,MAAM,QAAQ,UAAS;SAwB5B,YAAY,KAAK,cAAc;EA4BhC,KAAK,OAAO,mBAAmB,QAAQ;EAuHvC,IAAI,OAAO,iBAAiB,QAAQ;EA4BpC,IAAI,OAAO,iBAAiB,QAAQ;EA0BpC,OAAO,OAAO,oBAAoB,QAAQ;EAS1C,KAAK,OAAO,kBAAkB,QAAQ;EAItC,KAAK,OAAO,kBAAkB,QAAQ;EAwBtC,gBAAgB,OAAO,iBAAiB,QAAQ;EAgBhD,sBAAsB,OAAO,6BAA6B,QAAQ;EAkBlE,WAAW,OAAO,kBAAkB,QAAQ;EAiC5C,wBAAwB,OAAO,+BAA+B,QAAQ;EA4BtE,qBAAqB,OAAO,4BAA4B,QAAQ;;EAWhE,SAAS,aAAa;IAAW;MAA2B,QAAQ;EAepE,cAAc,aAAa,OAAO,cAAc,QAAQ;;EA8DxD,SAAS,aAAa,OAAO,YAAY,uBAAuB;;;;cCngB1D,mBAAA;;;;;;;;;;;;;;;;;cAYA,iBAAA;;;;;;;;;;cAYA,iBAAA;;;;;;;;;;cAYA,oBAAA;;;;;;cAWA,kBAAA;;;;;;;;;cAYA,kBAAA;;;;;;;;;cAYA,uBAAA;;;;;;;;;cAWA,6BAAA;;;;;;;cAYA,kBAAA;;;;;;;;;;;;;cAYA,+BAAA;;;;;;;;;;;;cAYA,4BAAA;;;;;;;;cAWA,UAAA"}

package/dist/{index-BU4gmYO8.d.ts → index-C-Cuh9it.d.ts}

@@ -1,6 +1,6 @@
 import { a as ModuleDefinition, o as ToolContext, s as ToolDefinition } from "./types-Ccb0DXY9.js";
 import "./index-CZX5OeOF.js";
-import { s as HttpServiceOptions } from "./http-service-T7E5UjP8.js";
+import { s as HttpServiceOptions } from "./http-service-CerzWwQO.js";
 import "./index-CLmTrcu5.js";
 import { z } from "zod";
 //#region src/vendors/resend/contracts.d.ts
@@ -251,4 +251,4 @@ declare const resendModule: ModuleDefinition<{
 }>;
 //#endregion
 export { ResendClientOptions as a, ResendSendBatchOutput as c, resendAuthSchema as d, resendSendBatchInputSchema as f, resendSendOutputSchema as h, ResendClient as i, ResendSendInput as l, resendSendInputSchema as m, resendSendBatchTool as n, ResendAuth as o, resendSendBatchOutputSchema as p, resendSendTool as r, ResendSendBatchInput as s, resendModule as t, ResendSendOutput as u };
-//# sourceMappingURL=index-BU4gmYO8.d.ts.map
+//# sourceMappingURL=index-C-Cuh9it.d.ts.map

package/dist/{index-BU4gmYO8.d.ts.map → index-C-Cuh9it.d.ts.map}

@@ -1 +1 @@
-{"version":3,"file":"index-BU4gmYO8.d.ts","names":[],"sources":["../src/vendors/resend/contracts.ts","../src/vendors/resend/client.ts","../src/vendors/resend/module.ts"],"mappings":";;;;;;cASa,kBAAgB,EAAA;;GAE3B,EAAA,KAAA;KAEU,aAAa,EAAE,aAAa;cAE3B,uBAAqB,EAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2B/B,EAAA,KAAA;cAEU,wBAAsB,EAAA;;;GAGjC,EAAA,KAAA;cAEW,4BAA0B,EAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAErC,EAAA,KAAA;cAEW,6BAA2B,EAAA;;;;;;;;;;;;;;;;GAA4C,EAAA,KAAA;KAExE,kBAAkB,EAAE,aAAa;KACjC,mBAAmB,EAAE,aAAa;KAClC,uBAAuB,EAAE,aAAa;KACtC,wBAAwB,EAAE,aAAa;;;KCrCvC,sBAAsB,KAAK;cAE1B;;EAGZ,YAAY,MAAM,YAAY,UAAS;SAmBhC,YAAY,KAAK,cAAc;;EAShC,KAAK,OAAO,kBAAkB,QAAQ;;EAOtC,UAAU,OAAO,uBAAuB,QAAQ;;;;;cClD1C,gBAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;YAAA;;;;;;;;;;;;;cAaA,qBAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;cAAA;;;;;;;;;;;;;;;;;;;;;;;;;;cAWA,cAAA;EAAY"}
+{"version":3,"file":"index-C-Cuh9it.d.ts","names":[],"sources":["../src/vendors/resend/contracts.ts","../src/vendors/resend/client.ts","../src/vendors/resend/module.ts"],"mappings":";;;;;;cASa,kBAAgB,EAAA;;GAE3B,EAAA,KAAA;KAEU,aAAa,EAAE,aAAa;cAE3B,uBAAqB,EAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2B/B,EAAA,KAAA;cAEU,wBAAsB,EAAA;;;GAGjC,EAAA,KAAA;cAEW,4BAA0B,EAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAErC,EAAA,KAAA;cAEW,6BAA2B,EAAA;;;;;;;;;;;;;;;;GAA4C,EAAA,KAAA;KAExE,kBAAkB,EAAE,aAAa;KACjC,mBAAmB,EAAE,aAAa;KAClC,uBAAuB,EAAE,aAAa;KACtC,wBAAwB,EAAE,aAAa;;;KCrCvC,sBAAsB,KAAK;cAE1B;;EAGZ,YAAY,MAAM,YAAY,UAAS;SAmBhC,YAAY,KAAK,cAAc;;EAShC,KAAK,OAAO,kBAAkB,QAAQ;;EAOtC,UAAU,OAAO,uBAAuB,QAAQ;;;;;cClD1C,gBAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;YAAA;;;;;;;;;;;;;cAaA,qBAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;cAAA;;;;;;;;;;;;;;;;;;;;;;;;;;cAWA,cAAA;EAAY"}

package/dist/{index-CdFmEfZO.d.ts → index-CtfpOZWu.d.ts}

@@ -1,6 +1,6 @@
 import { a as ModuleDefinition, o as ToolContext, s as ToolDefinition } from "./types-Ccb0DXY9.js";
 import "./index-CZX5OeOF.js";
-import { s as HttpServiceOptions } from "./http-service-T7E5UjP8.js";
+import { s as HttpServiceOptions } from "./http-service-CerzWwQO.js";
 import { z } from "zod";
 //#region src/vendors/textract/contracts.d.ts
 declare const MAX_BATCH_EXTRACT = 10;
@@ -356,4 +356,4 @@ declare const textractModule: ModuleDefinition<{
 }>;
 //#endregion
 export { textractOutputModeSchema as A, TextractTextChunk as C, textractExtractTextBatchInputSchema as D, textractExtractResultSchema as E, textractTextChunkSchema as M, textractExtractTextBatchOutputSchema as O, TextractStatusInput as S, textractChunkOptionsSchema as T, TextractExtractResult as _, TextractClient as a, TextractExtractTextInput as b, DEFAULT_EXTRACT_CHUNK_OVERLAP as c, MAX_BATCH_EXTRACT as d, MAX_EXTRACT_CHUNK_MAX_CHARS as f, TextractAuth as g, MAX_POLL_TIMEOUT_MS as h, textractModule as i, textractStatusInputSchema as j, textractExtractTextInputSchema as k, DEFAULT_POLL_INTERVAL_MS as l, MAX_POLL_INTERVAL_MS as m, textractExtractTextTool as n, TextractClientOptions as o, MAX_INLINE_EXTRACT_CHARS as p, textractGetStatusTool as r, DEFAULT_EXTRACT_CHUNK_MAX_CHARS as s, textractExtractTextBatchTool as t, DEFAULT_POLL_TIMEOUT_MS as u, TextractExtractTextBatchInput as v, textractAuthSchema as w, TextractOutputMode as x, TextractExtractTextBatchOutput as y };
-//# sourceMappingURL=index-CdFmEfZO.d.ts.map
+//# sourceMappingURL=index-CtfpOZWu.d.ts.map

package/dist/{index-CdFmEfZO.d.ts.map → index-CtfpOZWu.d.ts.map}

@@ -1 +1 @@
-{"version":3,"file":"index-CdFmEfZO.d.ts","names":[],"sources":["../src/vendors/textract/contracts.ts","../src/vendors/textract/client.ts","../src/vendors/textract/module.ts"],"mappings":";;;;;cAKa;cACA;cACA;cACA;cACA;;cAGA;cACA;cACA;cACA;cAEA,oBAAkB,EAAA;;;;;;;;;GAyB7B,EAAA,KAAA;KAEU,eAAe,EAAE,aAAa;cAE7B,0BAAwB,EAAA;;;;;KAMzB,qBAAqB,EAAE,aAAa;cAEnC,4BAA0B,EAAA;;;GAarC,EAAA,KAAA;cAEW,yBAAuB,EAAA;;;;GAIlC,EAAA,KAAA;KAEU,oBAAoB,EAAE,aAAa;cAYlC,6BAA2B,EAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAetC,EAAA,KAAA;cAEW,gCAA8B,EAAA;;;;;;;;;;;;;;;;;;;;;GAGzC,EAAA,KAAA;cAEW,qCAAmC,EAAA;;;;;;;;;;;;;;;;;;;;;;GAY9C,EAAA,KAAA;cAEW,2BAAyB,EAAA;;;;;;;;;;;;GAGpC,EAAA,KAAA;cAEW,sCAAoC,EAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAAiD,EAAA,KAAA;KAEtF,wBAAwB,EAAE,aAAa;KACvC,2BAA2B,EAAE,aAAa;KAC1C,gCAAgC,EAAE,aAAa;KAC/C,sBAAsB,EAAE,aAAa;KACrC,iCAAiC,EAAE,aAAa;;;KClGhD,wBAAwB,KAAK;cAE5B;;EAQZ,YAAY,MAAM,cAAc,UAAS;SAkClC,YAAY,KAAK,cAAc;;EAShC,YAAY,OAAO,2BAA2B,QAAQ;;EAUtD,UAAU,OAAO,sBAAsB,QAAQ;EAS/C,iBAAiB,OAAO,gCAAgC,QAAQ;;;;cCjG1D,yBAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;cAYA,uBAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;cAYA,8BAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;cAYA,gBAAA"}
+{"version":3,"file":"index-CtfpOZWu.d.ts","names":[],"sources":["../src/vendors/textract/contracts.ts","../src/vendors/textract/client.ts","../src/vendors/textract/module.ts"],"mappings":";;;;;cAKa;cACA;cACA;cACA;cACA;;cAGA;cACA;cACA;cACA;cAEA,oBAAkB,EAAA;;;;;;;;;GAyB7B,EAAA,KAAA;KAEU,eAAe,EAAE,aAAa;cAE7B,0BAAwB,EAAA;;;;;KAMzB,qBAAqB,EAAE,aAAa;cAEnC,4BAA0B,EAAA;;;GAarC,EAAA,KAAA;cAEW,yBAAuB,EAAA;;;;GAIlC,EAAA,KAAA;KAEU,oBAAoB,EAAE,aAAa;cAYlC,6BAA2B,EAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAetC,EAAA,KAAA;cAEW,gCAA8B,EAAA;;;;;;;;;;;;;;;;;;;;;GAGzC,EAAA,KAAA;cAEW,qCAAmC,EAAA;;;;;;;;;;;;;;;;;;;;;;GAY9C,EAAA,KAAA;cAEW,2BAAyB,EAAA;;;;;;;;;;;;GAGpC,EAAA,KAAA;cAEW,sCAAoC,EAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAAiD,EAAA,KAAA;KAEtF,wBAAwB,EAAE,aAAa;KACvC,2BAA2B,EAAE,aAAa;KAC1C,gCAAgC,EAAE,aAAa;KAC/C,sBAAsB,EAAE,aAAa;KACrC,iCAAiC,EAAE,aAAa;;;KClGhD,wBAAwB,KAAK;cAE5B;;EAQZ,YAAY,MAAM,cAAc,UAAS;SAkClC,YAAY,KAAK,cAAc;;EAShC,YAAY,OAAO,2BAA2B,QAAQ;;EAUtD,UAAU,OAAO,sBAAsB,QAAQ;EAS/C,iBAAiB,OAAO,gCAAgC,QAAQ;;;;cCjG1D,yBAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;cAYA,uBAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;cAYA,8BAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;cAYA,gBAAA"}

package/dist/{index-n8JTpNf1.d.ts → index-DngnGGiS.d.ts}

@@ -1,6 +1,6 @@
 import { a as ModuleDefinition, o as ToolContext, s as ToolDefinition } from "./types-Ccb0DXY9.js";
 import "./index-CZX5OeOF.js";
-import { s as HttpServiceOptions } from "./http-service-T7E5UjP8.js";
+import { s as HttpServiceOptions } from "./http-service-CerzWwQO.js";
 import { z } from "zod";
 //#region src/vendors/eventbridge-scheduler/contracts.d.ts
 declare const MAX_SCHEDULE_NAME = 64;
@@ -244,4 +244,4 @@ declare const eventBridgeSchedulerModule: ModuleDefinition<{
 }>;
 //#endregion
 export { scheduleListInputSchema as A, ScheduleUpdateInput as C, scheduleDeleteOutputSchema as D, scheduleCreateInputSchema as E, scheduleUpdateInputSchema as F, scheduleWriteOutputSchema as I, scheduleNameInputSchema as M, scheduleStateSchema as N, scheduleDetailSchema as O, scheduleSummarySchema as P, ScheduleSummary as S, eventBridgeSchedulerAuthSchema as T, ScheduleGetOutput as _, eventBridgeSchedulerModule as a, ScheduleNameInput as b, EventBridgeSchedulerClientOptions as c, MAX_PAYLOAD_JSON as d, MAX_SCHEDULE_NAME as f, ScheduleDetail as g, ScheduleDeleteOutput as h, eventBridgeSchedulerListTool as i, scheduleListOutputSchema as j, scheduleGetOutputSchema as k, EventBridgeSchedulerAuth as l, ScheduleCreateInput as m, eventBridgeSchedulerDeleteTool as n, eventBridgeSchedulerUpdateTool as o, MAX_TASK_REF as p, eventBridgeSchedulerGetTool as r, EventBridgeSchedulerClient as s, eventBridgeSchedulerCreateTool as t, MAX_LIST as u, ScheduleListInput as v, ScheduleWriteOutput as w, ScheduleState as x, ScheduleListOutput as y };
-//# sourceMappingURL=index-n8JTpNf1.d.ts.map
+//# sourceMappingURL=index-DngnGGiS.d.ts.map

package/dist/{index-n8JTpNf1.d.ts.map → index-DngnGGiS.d.ts.map}

@@ -1 +1 @@
-{"version":3,"file":"index-n8JTpNf1.d.ts","names":[],"sources":["../src/vendors/eventbridge-scheduler/contracts.ts","../src/vendors/eventbridge-scheduler/client.ts","../src/vendors/eventbridge-scheduler/module.ts"],"mappings":";;;;;cAOa;cACA;cACA;cACA;cAQA,gCAA8B,EAAA;;;;;;;;;;;;GAiBzC,EAAA,KAAA;KAEU,2BAA2B,EAAE,aAAa;cAEzC,qBAAmB,EAAA;;;;KAEpB,gBAAgB,EAAE,aAAa;cAE9B,2BAAyB,EAAA;;;;;;;;;;;;;;;;;GAqBpC,EAAA,KAAA;cAEW,2BAAyB,EAAA;;;;;;;;;;;;;;;;;GAA4B,EAAA,KAAA;cAErD,yBAAuB,EAAA;;GAElC,EAAA,KAAA;cAEW,yBAAuB,EAAA;;;;;;;;GAKlC,EAAA,KAAA;cAEW,uBAAqB,EAAA;;;;;;;;;GAMhC,EAAA,KAAA;cAEW,sBAAoB,EAAA;;;;;;;;;;;;;;GAM/B,EAAA,KAAA;cAEW,2BAAyB,EAAA;;;GAGpC,EAAA,KAAA;cAEW,yBAAuB,EAAA;;;;;;;;;;;;;;;;GAElC,EAAA,KAAA;cAEW,0BAAwB,EAAA;;;;;;;;;;;;GAGnC,EAAA,KAAA;cAEW,4BAA0B,EAAA;;;GAGrC,EAAA,KAAA;KAEU,sBAAsB,EAAE,aAAa;KACrC,sBAAsB,EAAE,aAAa;KACrC,oBAAoB,EAAE,aAAa;KACnC,oBAAoB,EAAE,aAAa;KACnC,kBAAkB,EAAE,aAAa;KACjC,iBAAiB,EAAE,aAAa;KAChC,sBAAsB,EAAE,aAAa;KACrC,oBAAoB,EAAE,aAAa;KACnC,qBAAqB,EAAE,aAAa;KACpC,uBAAuB,EAAE,aAAa;;;KC/FtC,oCAAoC,KAAK;cAExC;;EAIZ,YAAY,MAAM,0BAA0B,UAAS;SAuB9C,YAAY,KAAK,cAAc;EAQhC,OAAO,OAAO,sBAAsB,QAAQ;EAM5C,OAAO,OAAO,sBAAsB,QAAQ;EAM5C,IAAI,OAAO,oBAAoB,QAAQ;EASvC,KAAK,QAAO,oBAAyB,QAAQ;EAmB7C,OAAO,OAAO,oBAAoB,QAAQ;;;;cC3FpC,gCAAA;;;;YAAA;;;;;;;;;;;cAYA,gCAAA;;;;YAAA;;;;;;;;;;;cAYA,6BAAA;;;;;;;;;;;;;;;;cAWA,8BAAA;;;;;;;;;;;;;;;cAWA,gCAAA;;;;;;cAWA,4BAAA"}
+{"version":3,"file":"index-DngnGGiS.d.ts","names":[],"sources":["../src/vendors/eventbridge-scheduler/contracts.ts","../src/vendors/eventbridge-scheduler/client.ts","../src/vendors/eventbridge-scheduler/module.ts"],"mappings":";;;;;cAOa;cACA;cACA;cACA;cAQA,gCAA8B,EAAA;;;;;;;;;;;;GAiBzC,EAAA,KAAA;KAEU,2BAA2B,EAAE,aAAa;cAEzC,qBAAmB,EAAA;;;;KAEpB,gBAAgB,EAAE,aAAa;cAE9B,2BAAyB,EAAA;;;;;;;;;;;;;;;;;GAqBpC,EAAA,KAAA;cAEW,2BAAyB,EAAA;;;;;;;;;;;;;;;;;GAA4B,EAAA,KAAA;cAErD,yBAAuB,EAAA;;GAElC,EAAA,KAAA;cAEW,yBAAuB,EAAA;;;;;;;;GAKlC,EAAA,KAAA;cAEW,uBAAqB,EAAA;;;;;;;;;GAMhC,EAAA,KAAA;cAEW,sBAAoB,EAAA;;;;;;;;;;;;;;GAM/B,EAAA,KAAA;cAEW,2BAAyB,EAAA;;;GAGpC,EAAA,KAAA;cAEW,yBAAuB,EAAA;;;;;;;;;;;;;;;;GAElC,EAAA,KAAA;cAEW,0BAAwB,EAAA;;;;;;;;;;;;GAGnC,EAAA,KAAA;cAEW,4BAA0B,EAAA;;;GAGrC,EAAA,KAAA;KAEU,sBAAsB,EAAE,aAAa;KACrC,sBAAsB,EAAE,aAAa;KACrC,oBAAoB,EAAE,aAAa;KACnC,oBAAoB,EAAE,aAAa;KACnC,kBAAkB,EAAE,aAAa;KACjC,iBAAiB,EAAE,aAAa;KAChC,sBAAsB,EAAE,aAAa;KACrC,oBAAoB,EAAE,aAAa;KACnC,qBAAqB,EAAE,aAAa;KACpC,uBAAuB,EAAE,aAAa;;;KC/FtC,oCAAoC,KAAK;cAExC;;EAIZ,YAAY,MAAM,0BAA0B,UAAS;SAuB9C,YAAY,KAAK,cAAc;EAQhC,OAAO,OAAO,sBAAsB,QAAQ;EAM5C,OAAO,OAAO,sBAAsB,QAAQ;EAM5C,IAAI,OAAO,oBAAoB,QAAQ;EASvC,KAAK,QAAO,oBAAyB,QAAQ;EAmB7C,OAAO,OAAO,oBAAoB,QAAQ;;;;cC3FpC,gCAAA;;;;YAAA;;;;;;;;;;;cAYA,gCAAA;;;;YAAA;;;;;;;;;;;cAYA,6BAAA;;;;;;;;;;;;;;;;cAWA,8BAAA;;;;;;;;;;;;;;;cAWA,gCAAA;;;;;;cAWA,4BAAA"}

package/dist/{index-DuOGj7vc.d.ts → index-DsTt2EbS.d.ts}

@@ -1,6 +1,6 @@
 import { a as ModuleDefinition, o as ToolContext, s as ToolDefinition } from "./types-Ccb0DXY9.js";
 import "./index-CZX5OeOF.js";
-import { s as HttpServiceOptions } from "./http-service-T7E5UjP8.js";
+import { s as HttpServiceOptions } from "./http-service-CerzWwQO.js";
 import { z } from "zod";
 //#region src/vendors/bedrock-agentcore-browser/contracts.d.ts
 declare const DEFAULT_BROWSER_ID = "aws.browser.v1";
@@ -104,4 +104,4 @@ declare const bedrockAgentCoreBrowserModule: ModuleDefinition<{
 }>;
 //#endregion
 export { BedrockAgentCoreBrowserClient as a, BrowserSessionIdInput as c, DEFAULT_BROWSER_ID as d, bedrockAgentCoreBrowserAuthSchema as f, browserStreamSchema as g, browserStartSessionInputSchema as h, bedrockAgentCoreBrowserStopSessionTool as i, BrowserSessionOutput as l, browserSessionOutputSchema as m, bedrockAgentCoreBrowserModule as n, BedrockAgentCoreBrowserClientOptions as o, browserSessionIdInputSchema as p, bedrockAgentCoreBrowserStartSessionTool as r, BedrockAgentCoreBrowserAuth as s, bedrockAgentCoreBrowserGetSessionTool as t, BrowserStartSessionInput as u };
-//# sourceMappingURL=index-DuOGj7vc.d.ts.map
+//# sourceMappingURL=index-DsTt2EbS.d.ts.map

package/dist/{index-DuOGj7vc.d.ts.map → index-DsTt2EbS.d.ts.map}

@@ -1 +1 @@
-{"version":3,"file":"index-DuOGj7vc.d.ts","names":[],"sources":["../src/vendors/bedrock-agentcore-browser/contracts.ts","../src/vendors/bedrock-agentcore-browser/client.ts","../src/vendors/bedrock-agentcore-browser/module.ts"],"mappings":";;;;;cAOa;cAEA,mCAAiC,EAAA;;;;;;GAM5C,EAAA,KAAA;KAEU,8BAA8B,EAAE,aAAa;cAI5C,gCAA8B,EAAA;;;;;GAKzC,EAAA,KAAA;cAEW,6BAA2B,EAAA;;GAEtC,EAAA,KAAA;cAEW,qBAAmB,EAAA;;;;GAI9B,EAAA,KAAA;cAEW,4BAA0B,EAAA;;;;;;;;;;GAMrC,EAAA,KAAA;KAEU,2BAA2B,EAAE,aAAa;KAC1C,wBAAwB,EAAE,aAAa;KACvC,uBAAuB,EAAE,aAAa;;;KC5BtC,uCAAuC,KAAK;cAE3C;;EAKZ,YAAY,MAAM,6BAA6B,UAAS;SAwBjD,YAAY,KAAK,cAAc;EAYhC,aAAa,QAAO,2BAAgC,QAAQ;EAc5D,YAAY,OAAO,wBAAwB,QAAQ;EAQnD,WAAW,OAAO,wBAAwB,QAAQ;;;;cC1E5C,yCAAA;;;;;;;;;;;;;;;;cAYA,wCAAA;;;;;;;;;;;;;cAWA,uCAAA;;;;;;;;;;;;;cAWA,+BAAA"}
+{"version":3,"file":"index-DsTt2EbS.d.ts","names":[],"sources":["../src/vendors/bedrock-agentcore-browser/contracts.ts","../src/vendors/bedrock-agentcore-browser/client.ts","../src/vendors/bedrock-agentcore-browser/module.ts"],"mappings":";;;;;cAOa;cAEA,mCAAiC,EAAA;;;;;;GAM5C,EAAA,KAAA;KAEU,8BAA8B,EAAE,aAAa;cAI5C,gCAA8B,EAAA;;;;;GAKzC,EAAA,KAAA;cAEW,6BAA2B,EAAA;;GAEtC,EAAA,KAAA;cAEW,qBAAmB,EAAA;;;;GAI9B,EAAA,KAAA;cAEW,4BAA0B,EAAA;;;;;;;;;;GAMrC,EAAA,KAAA;KAEU,2BAA2B,EAAE,aAAa;KAC1C,wBAAwB,EAAE,aAAa;KACvC,uBAAuB,EAAE,aAAa;;;KC5BtC,uCAAuC,KAAK;cAE3C;;EAKZ,YAAY,MAAM,6BAA6B,UAAS;SAwBjD,YAAY,KAAK,cAAc;EAYhC,aAAa,QAAO,2BAAgC,QAAQ;EAc5D,YAAY,OAAO,wBAAwB,QAAQ;EAQnD,WAAW,OAAO,wBAAwB,QAAQ;;;;cC1E5C,yCAAA;;;;;;;;;;;;;;;;cAYA,wCAAA;;;;;;;;;;;;;cAWA,uCAAA;;;;;;;;;;;;;cAWA,+BAAA"}

package/dist/{index-pwW1OsOx.d.ts → index-Y8p8bsWU.d.ts}

@@ -1,6 +1,6 @@
 import { a as ModuleDefinition, o as ToolContext, s as ToolDefinition } from "./types-Ccb0DXY9.js";
 import "./index-CZX5OeOF.js";
-import { s as HttpServiceOptions } from "./http-service-T7E5UjP8.js";
+import { s as HttpServiceOptions } from "./http-service-CerzWwQO.js";
 import { z } from "zod";
 //#region src/vendors/sqs/contracts.d.ts
 declare const MAX_SQS_MESSAGE_CHARS = 1048576;
@@ -131,4 +131,4 @@ declare const sqsModule: ModuleDefinition<{
 }>;
 //#endregion
 export { queueExtendVisibilityInputSchema as C, queueReceiveInputSchema as D, queueReceiptInputSchema as E, queueReceiveOutputSchema as O, queueEnqueueOutputSchema as S, queueMessageSchema as T, QueueReceiveInput as _, sqsSendTool as a, queueAcknowledgeOutputSchema as b, MAX_SQS_MESSAGE_CHARS as c, QueueEnqueueOutput as d, QueueExtendVisibilityInput as f, QueueReceiptInput as g, QueueOps as h, sqsReceiveTool as i, sqsAuthSchema as k, QueueAcknowledgeOutput as l, QueueMessage as m, sqsDeleteTool as n, SqsClient as o, QueueExtendVisibilityOutput as p, sqsModule as r, SqsClientOptions as s, sqsChangeVisibilityTool as t, QueueEnqueueInput as u, QueueReceiveOutput as v, queueExtendVisibilityOutputSchema as w, queueEnqueueInputSchema as x, SqsAuth as y };
-//# sourceMappingURL=index-pwW1OsOx.d.ts.map
+//# sourceMappingURL=index-Y8p8bsWU.d.ts.map