@gmod/cram 4.0.9 → 5.0.0

package/dist/seek-bzip/index.js

@@ -0,0 +1,585 @@
+"use strict";
+// @ts-nocheck
+/*
+seek-bzip - a pure-javascript module for seeking within bzip2 data
+
+Copyright (C) 2013 C. Scott Ananian
+Copyright (C) 2012 Eli Skeggs
+Copyright (C) 2011 Kevin Kwok
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+Adapted from node-bzip, copyright 2012 Eli Skeggs.
+Adapted from bzip2.js, copyright 2011 Kevin Kwok (antimatter15@gmail.com).
+
+Based on micro-bunzip by Rob Landley (rob@landley.net).
+
+Based on bzip2 decompression code by Julian R Seward (jseward@acm.org),
+which also acknowledges contributions by Mike Burrows, David Wheeler,
+Peter Fenwick, Alistair Moffat, Radford Neal, Ian H. Witten,
+Robert Sedgewick, and Jon L. Bentley.
+*/
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.decode = decode;
+const bitreader_1 = __importDefault(require("./bitreader"));
+const crc32_1 = __importDefault(require("./crc32"));
+const stream_1 = __importDefault(require("./stream"));
+const MAX_HUFCODE_BITS = 20;
+const MAX_SYMBOLS = 258;
+const SYMBOL_RUNA = 0;
+const SYMBOL_RUNB = 1;
+const MIN_GROUPS = 2;
+const MAX_GROUPS = 6;
+const GROUP_SIZE = 50;
+const WHOLEPI = '314159265359';
+const SQRTPI = '177245385090';
+const mtf = function (array, index) {
+    const src = array[index];
+    for (let i = index; i > 0; i--) {
+        array[i] = array[i - 1];
+    }
+    array[0] = src;
+    return src;
+};
+const Err = {
+    OK: 0,
+    LAST_BLOCK: -1,
+    NOT_BZIP_DATA: -2,
+    UNEXPECTED_INPUT_EOF: -3,
+    UNEXPECTED_OUTPUT_EOF: -4,
+    DATA_ERROR: -5,
+    OUT_OF_MEMORY: -6,
+    OBSOLETE_INPUT: -7,
+    END_OF_BLOCK: -8,
+};
+const ErrorMessages = {};
+ErrorMessages[Err.LAST_BLOCK] = 'Bad file checksum';
+ErrorMessages[Err.NOT_BZIP_DATA] = 'Not bzip data';
+ErrorMessages[Err.UNEXPECTED_INPUT_EOF] = 'Unexpected input EOF';
+ErrorMessages[Err.UNEXPECTED_OUTPUT_EOF] = 'Unexpected output EOF';
+ErrorMessages[Err.DATA_ERROR] = 'Data error';
+ErrorMessages[Err.OUT_OF_MEMORY] = 'Out of memory';
+ErrorMessages[Err.OBSOLETE_INPUT] =
+    'Obsolete (pre 0.9.5) bzip format not supported.';
+const _throw = function (status, optDetail) {
+    let msg = ErrorMessages[status] || 'unknown error';
+    if (optDetail) {
+        msg += ': ' + optDetail;
+    }
+    const e = new TypeError(msg);
+    e.errorCode = status;
+    throw e;
+};
+class Bunzip {
+    constructor(inputStream, outputStream) {
+        this.writePos = this.writeCurrent = this.writeCount = 0;
+        this._start_bunzip(inputStream, outputStream);
+    }
+    _init_block() {
+        const moreBlocks = this._get_next_block();
+        if (!moreBlocks) {
+            this.writeCount = -1;
+            return false; /* no more blocks */
+        }
+        this.blockCRC = new crc32_1.default();
+        return true;
+    }
+    /* XXX micro-bunzip uses (inputStream, inputBuffer, len) as arguments */
+    _start_bunzip(inputStream, outputStream) {
+        /* Ensure that file starts with "BZh['1'-'9']." */
+        const buf = new Uint8Array(4);
+        if (inputStream.read(buf, 0, 4) !== 4 ||
+            String.fromCharCode(buf[0], buf[1], buf[2]) !== 'BZh') {
+            _throw(Err.NOT_BZIP_DATA, 'bad magic');
+        }
+        const level = buf[3] - 0x30;
+        if (level < 1 || level > 9) {
+            _throw(Err.NOT_BZIP_DATA, 'level out of range');
+        }
+        this.reader = new bitreader_1.default(inputStream);
+        /* Fourth byte (ascii '1'-'9'), indicates block size in units of 100k of
+         uncompressed data.  Allocate intermediate buffer for block. */
+        this.dbufSize = 100000 * level;
+        this.nextoutput = 0;
+        this.outputStream = outputStream;
+        this.streamCRC = 0;
+    }
+    _get_next_block() {
+        let i, j, k;
+        const reader = this.reader;
+        // this is get_next_block() function from micro-bunzip:
+        /* Read in header signature and CRC, then validate signature.
+         (last block signature means CRC is for whole file, return now) */
+        const h = reader.pi();
+        if (h === SQRTPI) {
+            // last block
+            return false; /* no more blocks */
+        }
+        if (h !== WHOLEPI) {
+            _throw(Err.NOT_BZIP_DATA);
+        }
+        this.targetBlockCRC = reader.read(32) >>> 0; // (convert to unsigned)
+        this.streamCRC =
+            (this.targetBlockCRC ^
+                ((this.streamCRC << 1) | (this.streamCRC >>> 31))) >>>
+                0;
+        /* We can add support for blockRandomised if anybody complains.  There was
+         some code for this in busybox 1.0.0-pre3, but nobody ever noticed that
+         it didn't actually work. */
+        if (reader.read(1)) {
+            _throw(Err.OBSOLETE_INPUT);
+        }
+        const origPointer = reader.read(24);
+        if (origPointer > this.dbufSize) {
+            _throw(Err.DATA_ERROR, 'initial position out of bounds');
+        }
+        /* mapping table: if some byte values are never used (encoding things
+         like ascii text), the compression code removes the gaps to have fewer
+         symbols to deal with, and writes a sparse bitfield indicating which
+         values were present.  We make a translation table to convert the symbols
+         back to the corresponding bytes. */
+        let t = reader.read(16);
+        let symToByte = new Uint8Array(256), symTotal = 0;
+        for (i = 0; i < 16; i++) {
+            if (t & (1 << (0xf - i))) {
+                const o = i * 16;
+                k = reader.read(16);
+                for (j = 0; j < 16; j++) {
+                    if (k & (1 << (0xf - j))) {
+                        symToByte[symTotal++] = o + j;
+                    }
+                }
+            }
+        }
+        /* How many different huffman coding groups does this block use? */
+        const groupCount = reader.read(3);
+        if (groupCount < MIN_GROUPS || groupCount > MAX_GROUPS) {
+            _throw(Err.DATA_ERROR);
+        }
+        /* nSelectors: Every GROUP_SIZE many symbols we select a new huffman coding
+         group.  Read in the group selector list, which is stored as MTF encoded
+         bit runs.  (MTF=Move To Front, as each value is used it's moved to the
+         start of the list.) */
+        const nSelectors = reader.read(15);
+        if (nSelectors === 0) {
+            _throw(Err.DATA_ERROR);
+        }
+        const mtfSymbol = new Uint8Array(256);
+        for (i = 0; i < groupCount; i++) {
+            mtfSymbol[i] = i;
+        }
+        const selectors = new Uint8Array(nSelectors); // was 32768...
+        for (i = 0; i < nSelectors; i++) {
+            /* Get next value */
+            for (j = 0; reader.read(1); j++) {
+                if (j >= groupCount) {
+                    _throw(Err.DATA_ERROR);
+                }
+            }
+            /* Decode MTF to get the next selector */
+            selectors[i] = mtf(mtfSymbol, j);
+        }
+        /* Read the huffman coding tables for each group, which code for symTotal
+         literal symbols, plus two run symbols (RUNA, RUNB) */
+        let symCount = symTotal + 2;
+        let groups = [], hufGroup;
+        for (j = 0; j < groupCount; j++) {
+            const length = new Uint8Array(symCount), temp = new Uint16Array(MAX_HUFCODE_BITS + 1);
+            /* Read huffman code lengths for each symbol.  They're stored in
+             a way similar to mtf; record a starting value for the first symbol,
+             and an offset from the previous value for everys symbol after that. */
+            t = reader.read(5); // lengths
+            for (i = 0; i < symCount; i++) {
+                for (;;) {
+                    if (t < 1 || t > MAX_HUFCODE_BITS) {
+                        _throw(Err.DATA_ERROR);
+                    }
+                    /* If first bit is 0, stop.  Else second bit indicates whether
+                     to increment or decrement the value. */
+                    if (!reader.read(1)) {
+                        break;
+                    }
+                    if (!reader.read(1)) {
+                        t++;
+                    }
+                    else {
+                        t--;
+                    }
+                }
+                length[i] = t;
+            }
+            /* Find largest and smallest lengths in this group */
+            var minLen, maxLen;
+            minLen = maxLen = length[0];
+            for (i = 1; i < symCount; i++) {
+                if (length[i] > maxLen) {
+                    maxLen = length[i];
+                }
+                else if (length[i] < minLen) {
+                    minLen = length[i];
+                }
+            }
+            /* Calculate permute[], base[], and limit[] tables from length[].
+             *
+             * permute[] is the lookup table for converting huffman coded symbols
+             * into decoded symbols.  base[] is the amount to subtract from the
+             * value of a huffman symbol of a given length when using permute[].
+             *
+             * limit[] indicates the largest numerical value a symbol with a given
+             * number of bits can have.  This is how the huffman codes can vary in
+             * length: each code with a value>limit[length] needs another bit.
+             */
+            hufGroup = {};
+            groups.push(hufGroup);
+            hufGroup.permute = new Uint16Array(MAX_SYMBOLS);
+            hufGroup.limit = new Uint32Array(MAX_HUFCODE_BITS + 2);
+            hufGroup.base = new Uint32Array(MAX_HUFCODE_BITS + 1);
+            hufGroup.minLen = minLen;
+            hufGroup.maxLen = maxLen;
+            /* Calculate permute[].  Concurently, initialize temp[] and limit[]. */
+            let pp = 0;
+            for (i = minLen; i <= maxLen; i++) {
+                temp[i] = hufGroup.limit[i] = 0;
+                for (t = 0; t < symCount; t++) {
+                    if (length[t] === i) {
+                        hufGroup.permute[pp++] = t;
+                    }
+                }
+            }
+            /* Count symbols coded for at each bit length */
+            for (i = 0; i < symCount; i++) {
+                temp[length[i]]++;
+            }
+            /* Calculate limit[] (the largest symbol-coding value at each bit
+             * length, which is (previous limit<<1)+symbols at this level), and
+             * base[] (number of symbols to ignore at each bit length, which is
+             * limit minus the cumulative count of symbols coded for already). */
+            pp = t = 0;
+            for (i = minLen; i < maxLen; i++) {
+                pp += temp[i];
+                /* We read the largest possible symbol size and then unget bits
+                 after determining how many we need, and those extra bits could
+                 be set to anything.  (They're noise from future symbols.)  At
+                 each level we're really only interested in the first few bits,
+                 so here we set all the trailing to-be-ignored bits to 1 so they
+                 don't affect the value>limit[length] comparison. */
+                hufGroup.limit[i] = pp - 1;
+                pp <<= 1;
+                t += temp[i];
+                hufGroup.base[i + 1] = pp - t;
+            }
+            hufGroup.limit[maxLen + 1] =
+                Number.MAX_VALUE; /* Sentinal value for reading next sym. */
+            hufGroup.limit[maxLen] = pp + temp[maxLen] - 1;
+            hufGroup.base[minLen] = 0;
+        }
+        /* We've finished reading and digesting the block header.  Now read this
+         block's huffman coded symbols from the file and undo the huffman coding
+         and run length encoding, saving the result into dbuf[dbufCount++]=uc */
+        /* Initialize symbol occurrence counters and symbol Move To Front table */
+        const byteCount = new Uint32Array(256);
+        for (i = 0; i < 256; i++) {
+            mtfSymbol[i] = i;
+        }
+        /* Loop through compressed symbols. */
+        let runPos = 0, dbufCount = 0, selector = 0, uc;
+        const dbuf = (this.dbuf = new Uint32Array(this.dbufSize));
+        symCount = 0;
+        for (;;) {
+            /* Determine which huffman coding group to use. */
+            if (!symCount--) {
+                symCount = GROUP_SIZE - 1;
+                if (selector >= nSelectors) {
+                    _throw(Err.DATA_ERROR);
+                }
+                hufGroup = groups[selectors[selector++]];
+            }
+            /* Read next huffman-coded symbol. */
+            i = hufGroup.minLen;
+            j = reader.read(i);
+            for (;; i++) {
+                if (i > hufGroup.maxLen) {
+                    _throw(Err.DATA_ERROR);
+                }
+                if (j <= hufGroup.limit[i]) {
+                    break;
+                }
+                j = (j << 1) | reader.read(1);
+            }
+            /* Huffman decode value to get nextSym (with bounds checking) */
+            j -= hufGroup.base[i];
+            if (j < 0 || j >= MAX_SYMBOLS) {
+                _throw(Err.DATA_ERROR);
+            }
+            const nextSym = hufGroup.permute[j];
+            /* We have now decoded the symbol, which indicates either a new literal
+             byte, or a repeated run of the most recent literal byte.  First,
+             check if nextSym indicates a repeated run, and if so loop collecting
+             how many times to repeat the last literal. */
+            if (nextSym === SYMBOL_RUNA || nextSym === SYMBOL_RUNB) {
+                /* If this is the start of a new run, zero out counter */
+                if (!runPos) {
+                    runPos = 1;
+                    t = 0;
+                }
+                /* Neat trick that saves 1 symbol: instead of or-ing 0 or 1 at
+                 each bit position, add 1 or 2 instead.  For example,
+                 1011 is 1<<0 + 1<<1 + 2<<2.  1010 is 2<<0 + 2<<1 + 1<<2.
+                 You can make any bit pattern that way using 1 less symbol than
+                 the basic or 0/1 method (except all bits 0, which would use no
+                 symbols, but a run of length 0 doesn't mean anything in this
+                 context).  Thus space is saved. */
+                t += nextSym === SYMBOL_RUNA ? runPos : 2 * runPos;
+                runPos <<= 1;
+                continue;
+            }
+            /* When we hit the first non-run symbol after a run, we now know
+             how many times to repeat the last literal, so append that many
+             copies to our buffer of decoded symbols (dbuf) now.  (The last
+             literal used is the one at the head of the mtfSymbol array.) */
+            if (runPos) {
+                runPos = 0;
+                if (dbufCount + t > this.dbufSize) {
+                    _throw(Err.DATA_ERROR);
+                }
+                uc = symToByte[mtfSymbol[0]];
+                byteCount[uc] += t;
+                while (t--) {
+                    dbuf[dbufCount++] = uc;
+                }
+            }
+            /* Is this the terminating symbol? */
+            if (nextSym > symTotal) {
+                break;
+            }
+            /* At this point, nextSym indicates a new literal character.  Subtract
+             one to get the position in the MTF array at which this literal is
+             currently to be found.  (Note that the result can't be -1 or 0,
+             because 0 and 1 are RUNA and RUNB.  But another instance of the
+             first symbol in the mtf array, position 0, would have been handled
+             as part of a run above.  Therefore 1 unused mtf position minus
+             2 non-literal nextSym values equals -1.) */
+            if (dbufCount >= this.dbufSize) {
+                _throw(Err.DATA_ERROR);
+            }
+            i = nextSym - 1;
+            uc = mtf(mtfSymbol, i);
+            uc = symToByte[uc];
+            /* We have our literal byte.  Save it into dbuf. */
+            byteCount[uc]++;
+            dbuf[dbufCount++] = uc;
+        }
+        /* At this point, we've read all the huffman-coded symbols (and repeated
+         runs) for this block from the input stream, and decoded them into the
+         intermediate buffer.  There are dbufCount many decoded bytes in dbuf[].
+         Now undo the Burrows-Wheeler transform on dbuf.
+         See http://dogma.net/markn/articles/bwt/bwt.htm
+      */
+        if (origPointer < 0 || origPointer >= dbufCount) {
+            _throw(Err.DATA_ERROR);
+        }
+        /* Turn byteCount into cumulative occurrence counts of 0 to n-1. */
+        j = 0;
+        for (i = 0; i < 256; i++) {
+            k = j + byteCount[i];
+            byteCount[i] = j;
+            j = k;
+        }
+        /* Figure out what order dbuf would be in if we sorted it. */
+        for (i = 0; i < dbufCount; i++) {
+            uc = dbuf[i] & 0xff;
+            dbuf[byteCount[uc]] |= i << 8;
+            byteCount[uc]++;
+        }
+        /* Decode first byte by hand to initialize "previous" byte.  Note that it
+         doesn't get output, and if the first three characters are identical
+         it doesn't qualify as a run (hence writeRunCountdown=5). */
+        let pos = 0, current = 0, run = 0;
+        if (dbufCount) {
+            pos = dbuf[origPointer];
+            current = pos & 0xff;
+            pos >>= 8;
+            run = -1;
+        }
+        this.writePos = pos;
+        this.writeCurrent = current;
+        this.writeCount = dbufCount;
+        this.writeRun = run;
+        return true; /* more blocks to come */
+    }
+    /* Undo burrows-wheeler transform on intermediate buffer to produce output.
+     If start_bunzip was initialized with out_fd=-1, then up to len bytes of
+     data are written to outbuf.  Return value is number of bytes written or
+     error (all errors are negative numbers).  If out_fd!=-1, outbuf and len
+     are ignored, data is written to out_fd and return is RETVAL_OK or error.
+  */
+    _read_bunzip(outputBuffer, len) {
+        let copies, previous, outbyte;
+        /* james@jamestaylor.org: writeCount goes to -1 when the buffer is fully
+           decoded, which results in this returning RETVAL_LAST_BLOCK, also
+           equal to -1... Confusing, I'm returning 0 here to indicate no
+           bytes written into the buffer */
+        if (this.writeCount < 0) {
+            return 0;
+        }
+        const gotcount = 0;
+        let dbuf = this.dbuf, pos = this.writePos, current = this.writeCurrent;
+        let dbufCount = this.writeCount, outputsize = this.outputsize;
+        let run = this.writeRun;
+        while (dbufCount) {
+            dbufCount--;
+            previous = current;
+            pos = dbuf[pos];
+            current = pos & 0xff;
+            pos >>= 8;
+            if (run++ === 3) {
+                copies = current;
+                outbyte = previous;
+                current = -1;
+            }
+            else {
+                copies = 1;
+                outbyte = current;
+            }
+            this.blockCRC.updateCRCRun(outbyte, copies);
+            while (copies--) {
+                this.outputStream.writeByte(outbyte);
+                this.nextoutput++;
+            }
+            if (current != previous) {
+                run = 0;
+            }
+        }
+        this.writeCount = dbufCount;
+        // check CRC
+        if (this.blockCRC.getCRC() !== this.targetBlockCRC) {
+            _throw(Err.DATA_ERROR, 'Bad block CRC ' +
+                '(got ' +
+                this.blockCRC.getCRC().toString(16) +
+                ' expected ' +
+                this.targetBlockCRC.toString(16) +
+                ')');
+        }
+        return this.nextoutput;
+    }
+}
+const coerceInputStream = function (input) {
+    if ('readByte' in input) {
+        return input;
+    }
+    const inputStream = new stream_1.default();
+    inputStream.pos = 0;
+    inputStream.readByte = function () {
+        return input[this.pos++];
+    };
+    inputStream.seek = function (pos) {
+        this.pos = pos;
+    };
+    inputStream.eof = function () {
+        return this.pos >= input.length;
+    };
+    return inputStream;
+};
+const coerceOutputStream = function (output) {
+    const outputStream = new stream_1.default();
+    let resizeOk = true;
+    if (output) {
+        if (typeof output === 'number') {
+            outputStream.buffer = new Uint8Array(output);
+            resizeOk = false;
+        }
+        else if ('writeByte' in output) {
+            return output;
+        }
+        else {
+            outputStream.buffer = output;
+            resizeOk = false;
+        }
+    }
+    else {
+        outputStream.buffer = new Uint8Array(16384);
+    }
+    outputStream.pos = 0;
+    outputStream.writeByte = function (_byte) {
+        if (resizeOk && this.pos >= this.buffer.length) {
+            const newBuffer = new Uint8Array(this.buffer.length * 2);
+            newBuffer.set(this.buffer);
+            this.buffer = newBuffer;
+        }
+        this.buffer[this.pos++] = _byte;
+    };
+    outputStream.getBuffer = function () {
+        // trim buffer
+        if (this.pos !== this.buffer.length) {
+            if (!resizeOk) {
+                throw new TypeError('outputsize does not match decoded input');
+            }
+            const newBuffer = new Uint8Array(this.pos);
+            newBuffer.set(this.buffer.slice(0, this.pos));
+            this.buffer = newBuffer;
+        }
+        return this.buffer;
+    };
+    outputStream._coerced = true;
+    return outputStream;
+};
+/* Static helper functions */
+// 'input' can be a stream or a buffer
+// 'output' can be a stream or a buffer or a number (buffer size)
+function decode(input, output, multistream) {
+    // make a stream from a buffer, if necessary
+    const inputStream = coerceInputStream(input);
+    const outputStream = coerceOutputStream(output);
+    const bz = new Bunzip(inputStream, outputStream);
+    while (true) {
+        if ('eof' in inputStream && inputStream.eof()) {
+            break;
+        }
+        if (bz._init_block()) {
+            bz._read_bunzip();
+        }
+        else {
+            const targetStreamCRC = bz.reader.read(32) >>> 0; // (convert to unsigned)
+            if (targetStreamCRC !== bz.streamCRC) {
+                _throw(Err.DATA_ERROR, 'Bad stream CRC ' +
+                    '(got ' +
+                    bz.streamCRC.toString(16) +
+                    ' expected ' +
+                    targetStreamCRC.toString(16) +
+                    ')');
+            }
+            if (multistream && 'eof' in inputStream && !inputStream.eof()) {
+                // note that start_bunzip will also resync the bit reader to next byte
+                bz._start_bunzip(inputStream, outputStream);
+            }
+            else {
+                break;
+            }
+        }
+    }
+    if ('getBuffer' in outputStream) {
+        return outputStream.getBuffer();
+    }
+}
+exports.default = Bunzip;
+//# sourceMappingURL=index.js.map

package/dist/seek-bzip/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/seek-bzip/index.ts"],"names":[],"mappings":";AAAA,cAAc;AACd;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EAmCE;;;;;AA4hBF,wBAoCC;AA9jBD,4DAAmC;AACnC,oDAA2B;AAC3B,sDAA6B;AAE7B,MAAM,gBAAgB,GAAG,EAAE,CAAA;AAC3B,MAAM,WAAW,GAAG,GAAG,CAAA;AACvB,MAAM,WAAW,GAAG,CAAC,CAAA;AACrB,MAAM,WAAW,GAAG,CAAC,CAAA;AACrB,MAAM,UAAU,GAAG,CAAC,CAAA;AACpB,MAAM,UAAU,GAAG,CAAC,CAAA;AACpB,MAAM,UAAU,GAAG,EAAE,CAAA;AAErB,MAAM,OAAO,GAAG,cAAc,CAAA;AAC9B,MAAM,MAAM,GAAG,cAAc,CAAA;AAE7B,MAAM,GAAG,GAAG,UAAU,KAAK,EAAE,KAAK;IAChC,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,CAAA;IACxB,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;IACzB,CAAC;IACD,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAA;IACd,OAAO,GAAG,CAAA;AACZ,CAAC,CAAA;AAED,MAAM,GAAG,GAAG;IACV,EAAE,EAAE,CAAC;IACL,UAAU,EAAE,CAAC,CAAC;IACd,aAAa,EAAE,CAAC,CAAC;IACjB,oBAAoB,EAAE,CAAC,CAAC;IACxB,qBAAqB,EAAE,CAAC,CAAC;IACzB,UAAU,EAAE,CAAC,CAAC;IACd,aAAa,EAAE,CAAC,CAAC;IACjB,cAAc,EAAE,CAAC,CAAC;IAClB,YAAY,EAAE,CAAC,CAAC;CACjB,CAAA;AACD,MAAM,aAAa,GAAG,EAAE,CAAA;AACxB,aAAa,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,mBAAmB,CAAA;AACnD,aAAa,CAAC,GAAG,CAAC,aAAa,CAAC,GAAG,eAAe,CAAA;AAClD,aAAa,CAAC,GAAG,CAAC,oBAAoB,CAAC,GAAG,sBAAsB,CAAA;AAChE,aAAa,CAAC,GAAG,CAAC,qBAAqB,CAAC,GAAG,uBAAuB,CAAA;AAClE,aAAa,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,YAAY,CAAA;AAC5C,aAAa,CAAC,GAAG,CAAC,aAAa,CAAC,GAAG,eAAe,CAAA;AAClD,aAAa,CAAC,GAAG,CAAC,cAAc,CAAC;IAC/B,iDAAiD,CAAA;AAEnD,MAAM,MAAM,GAAG,UAAU,MAAM,EAAE,SAAS;IACxC,IAAI,GAAG,GAAG,aAAa,CAAC,MAAM,CAAC,IAAI,eAAe,CAAA;IAClD,IAAI,SAAS,EAAE,CAAC;QACd,GAAG,IAAI,IAAI,GAAG,SAAS,CAAA;IACzB,CAAC;IACD,MAAM,CAAC,GAAG,IAAI,SAAS,CAAC,GAAG,CAAC,CAAA;IAC5B,CAAC,CAAC,SAAS,GAAG,MAAM,CAAA;IACpB,MAAM,CAAC,CAAA;AACT,CAAC,CAAA;AAED,MAAM,MAAM;IACV,YAAY,WAAW,EAAE,YAAY;QACnC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,UAAU,GAAG,CAAC,CAAA;QAEvD,IAAI,CAAC,aAAa,CAAC,WAAW,EAAE,YAAY,CAAC,CAAA;IAC/C,CAAC;IACD,WAAW;QACT,MAAM,UAAU,GAAG,IAAI,CAAC,eAAe,EAAE,CAAA;QACzC,IAAI,CAAC,UAAU,EAAE,CAAC;YAChB,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC,CAAA;YACpB,OAAO,KAAK,CAAA,CAAC,oBAAoB;QACnC,CAAC;QACD,IAAI,CAAC,QAAQ,GAAG,IAAI,eAAK,EAAE,CAAA;QAC3B,OAAO,IAAI,CAAA;IACb,CAAC;IACD,wEAAwE;IACxE,aAAa,CAAC,WAAW,EAAE,YAAY;QACrC,kDAAkD;QAClD,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAA;QAC7B,IACE,WAAW,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC;YACjC,MAAM,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,KAAK,EACrD,CAAC;YACD,MAAM,CAAC,GAAG,CAAC,aAAa,EAAE,WAAW,CAAC,CAAA;QACxC,CAAC;QAED,MAAM,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAA;QAC3B,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,CAAC,aAAa,EAAE,oBAAoB,CAAC,CAAA;QACjD,CAAC;QAED,IAAI,CAAC,MAAM,GAAG,IAAI,mBAAS,CAAC,WAAW,CAAC,CAAA;QAExC;uEAC+D;QAC/D,IAAI,CAAC,QAAQ,GAAG,MAAM,GAAG,KAAK,CAAA;QAC9B,IAAI,CAAC,UAAU,GAAG,CAAC,CAAA;QACnB,IAAI,CAAC,YAAY,GAAG,YAAY,CAAA;QAChC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAA;IACpB,CAAC;IACD,eAAe;QACb,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,CAAA;QACX,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAA;QAC1B,uDAAuD;QACvD;0EACkE;QAClE,MAAM,CAAC,GAAG,MAAM,CAAC,EAAE,EAAE,CAAA;QACrB,IAAI,CAAC,KAAK,MAAM,EAAE,CAAC;YACjB,aAAa;YACb,OAAO,KAAK,CAAA,CAAC,oBAAoB;QACnC,CAAC;QACD,IAAI,CAAC,KAAK,OAAO,EAAE,CAAC;YAClB,MAAM,CAAC,GAAG,CAAC,aAAa,CAAC,CAAA;QAC3B,CAAC;QACD,IAAI,CAAC,cAAc,GAAG,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAA,CAAC,wBAAwB;QACpE,IAAI,CAAC,SAAS;YACZ,CAAC,IAAI,CAAC,cAAc;gBAClB,CAAC,CAAC,IAAI,CAAC,SAAS,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,KAAK,EAAE,CAAC,CAAC,CAAC;gBACpD,CAAC,CAAA;QACH;;oCAE4B;QAC5B,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;YACnB,MAAM,CAAC,GAAG,CAAC,cAAc,CAAC,CAAA;QAC5B,CAAC;QACD,MAAM,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QACnC,IAAI,WAAW,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;YAChC,MAAM,CAAC,GAAG,CAAC,UAAU,EAAE,gCAAgC,CAAC,CAAA;QAC1D,CAAC;QACD;;;;4CAIoC;QACpC,IAAI,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QACvB,IAAI,SAAS,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,EACjC,QAAQ,GAAG,CAAC,CAAA;QACd,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YACxB,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBACzB,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAA;gBAChB,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;gBACnB,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;oBACxB,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;wBACzB,SAAS,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;oBAC/B,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,mEAAmE;QACnE,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACjC,IAAI,UAAU,GAAG,UAAU,IAAI,UAAU,GAAG,UAAU,EAAE,CAAC;YACvD,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;QACxB,CAAC;QACD;;;+BAGuB;QACvB,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QAClC,IAAI,UAAU,KAAK,CAAC,EAAE,CAAC;YACrB,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;QACxB,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,CAAA;QACrC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;QAClB,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,UAAU,CAAC,UAAU,CAAC,CAAA,CAAC,eAAe;QAE5D,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,oBAAoB;YACpB,KAAK,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAChC,IAAI,CAAC,IAAI,UAAU,EAAE,CAAC;oBACpB,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;gBACxB,CAAC;YACH,CAAC;YACD,yCAAyC;YACzC,SAAS,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC,CAAA;QAClC,CAAC;QAED;8DACsD;QACtD,IAAI,QAAQ,GAAG,QAAQ,GAAG,CAAC,CAAA;QAC3B,IAAI,MAAM,GAAG,EAAE,EACb,QAAQ,CAAA;QACV,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,QAAQ,CAAC,EACrC,IAAI,GAAG,IAAI,WAAW,CAAC,gBAAgB,GAAG,CAAC,CAAC,CAAA;YAC9C;;mFAEuE;YACvE,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA,CAAC,UAAU;YAC7B,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9B,SAAS,CAAC;oBACR,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,gBAAgB,EAAE,CAAC;wBAClC,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;oBACxB,CAAC;oBACD;4DACwC;oBACxC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;wBACpB,MAAK;oBACP,CAAC;oBACD,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;wBACpB,CAAC,EAAE,CAAA;oBACL,CAAC;yBAAM,CAAC;wBACN,CAAC,EAAE,CAAA;oBACL,CAAC;gBACH,CAAC;gBACD,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;YACf,CAAC;YAED,qDAAqD;YACrD,IAAI,MAAM,EAAE,MAAM,CAAA;YAClB,MAAM,GAAG,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,CAAA;YAC3B,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9B,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,EAAE,CAAC;oBACvB,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,CAAA;gBACpB,CAAC;qBAAM,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,EAAE,CAAC;oBAC9B,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,CAAA;gBACpB,CAAC;YACH,CAAC;YAED;;;;;;;;;eASG;YACH,QAAQ,GAAG,EAAE,CAAA;YACb,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;YACrB,QAAQ,CAAC,OAAO,GAAG,IAAI,WAAW,CAAC,WAAW,CAAC,CAAA;YAC/C,QAAQ,CAAC,KAAK,GAAG,IAAI,WAAW,CAAC,gBAAgB,GAAG,CAAC,CAAC,CAAA;YACtD,QAAQ,CAAC,IAAI,GAAG,IAAI,WAAW,CAAC,gBAAgB,GAAG,CAAC,CAAC,CAAA;YACrD,QAAQ,CAAC,MAAM,GAAG,MAAM,CAAA;YACxB,QAAQ,CAAC,MAAM,GAAG,MAAM,CAAA;YACxB,uEAAuE;YACvE,IAAI,EAAE,GAAG,CAAC,CAAA;YACV,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAClC,IAAI,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;gBAC/B,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC9B,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;wBACpB,QAAQ,CAAC,OAAO,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAA;oBAC5B,CAAC;gBACH,CAAC;YACH,CAAC;YACD,gDAAgD;YAChD,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9B,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA;YACnB,CAAC;YACD;;;iFAGqE;YACrE,EAAE,GAAG,CAAC,GAAG,CAAC,CAAA;YACV,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACjC,EAAE,IAAI,IAAI,CAAC,CAAC,CAAC,CAAA;gBACb;;;;;oEAKoD;gBACpD,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAA;gBAC1B,EAAE,KAAK,CAAC,CAAA;gBACR,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAA;gBACZ,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAA;YAC/B,CAAC;YACD,QAAQ,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;gBACxB,MAAM,CAAC,SAAS,CAAA,CAAC,0CAA0C;YAC7D,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;YAC9C,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;QAC3B,CAAC;QACD;;gFAEwE;QAExE,0EAA0E;QAC1E,MAAM,SAAS,GAAG,IAAI,WAAW,CAAC,GAAG,CAAC,CAAA;QACtC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YACzB,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;QAClB,CAAC;QACD,sCAAsC;QACtC,IAAI,MAAM,GAAG,CAAC,EACZ,SAAS,GAAG,CAAC,EACb,QAAQ,GAAG,CAAC,EACZ,EAAE,CAAA;QACJ,MAAM,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAA;QACzD,QAAQ,GAAG,CAAC,CAAA;QACZ,SAAS,CAAC;YACR,kDAAkD;YAClD,IAAI,CAAC,QAAQ,EAAE,EAAE,CAAC;gBAChB,QAAQ,GAAG,UAAU,GAAG,CAAC,CAAA;gBACzB,IAAI,QAAQ,IAAI,UAAU,EAAE,CAAC;oBAC3B,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;gBACxB,CAAC;gBACD,QAAQ,GAAG,MAAM,CAAC,SAAS,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAA;YAC1C,CAAC;YACD,qCAAqC;YACrC,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAA;YACnB,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;YAClB,QAAS,CAAC,EAAE,EAAE,CAAC;gBACb,IAAI,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;oBACxB,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;gBACxB,CAAC;gBACD,IAAI,CAAC,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC3B,MAAK;gBACP,CAAC;gBACD,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;YAC/B,CAAC;YACD,gEAAgE;YAChE,CAAC,IAAI,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;YACrB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,WAAW,EAAE,CAAC;gBAC9B,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;YACxB,CAAC;YACD,MAAM,OAAO,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAA;YACnC;;;0DAG8C;YAC9C,IAAI,OAAO,KAAK,WAAW,IAAI,OAAO,KAAK,WAAW,EAAE,CAAC;gBACvD,yDAAyD;gBACzD,IAAI,CAAC,MAAM,EAAE,CAAC;oBACZ,MAAM,GAAG,CAAC,CAAA;oBACV,CAAC,GAAG,CAAC,CAAA;gBACP,CAAC;gBACD;;;;;;mDAMmC;gBACnC,CAAC,IAAI,OAAO,KAAK,WAAW,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAA;gBAClD,MAAM,KAAK,CAAC,CAAA;gBACZ,SAAQ;YACV,CAAC;YACD;;;4EAGgE;YAChE,IAAI,MAAM,EAAE,CAAC;gBACX,MAAM,GAAG,CAAC,CAAA;gBACV,IAAI,SAAS,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;oBAClC,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;gBACxB,CAAC;gBACD,EAAE,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAA;gBAC5B,SAAS,CAAC,EAAE,CAAC,IAAI,CAAC,CAAA;gBAClB,OAAO,CAAC,EAAE,EAAE,CAAC;oBACX,IAAI,CAAC,SAAS,EAAE,CAAC,GAAG,EAAE,CAAA;gBACxB,CAAC;YACH,CAAC;YACD,qCAAqC;YACrC,IAAI,OAAO,GAAG,QAAQ,EAAE,CAAC;gBACvB,MAAK;YACP,CAAC;YACD;;;;;;wDAM4C;YAC5C,IAAI,SAAS,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAC/B,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;YACxB,CAAC;YACD,CAAC,GAAG,OAAO,GAAG,CAAC,CAAA;YACf,EAAE,GAAG,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC,CAAA;YACtB,EAAE,GAAG,SAAS,CAAC,EAAE,CAAC,CAAA;YAClB,mDAAmD;YACnD,SAAS,CAAC,EAAE,CAAC,EAAE,CAAA;YACf,IAAI,CAAC,SAAS,EAAE,CAAC,GAAG,EAAE,CAAA;QACxB,CAAC;QACD;;;;;QAKA;QACA,IAAI,WAAW,GAAG,CAAC,IAAI,WAAW,IAAI,SAAS,EAAE,CAAC;YAChD,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;QACxB,CAAC;QACD,mEAAmE;QACnE,CAAC,GAAG,CAAC,CAAA;QACL,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YACzB,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAA;YACpB,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;YAChB,CAAC,GAAG,CAAC,CAAA;QACP,CAAC;QACD,6DAA6D;QAC7D,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAA;YACnB,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YAC7B,SAAS,CAAC,EAAE,CAAC,EAAE,CAAA;QACjB,CAAC;QACD;;oEAE4D;QAC5D,IAAI,GAAG,GAAG,CAAC,EACT,OAAO,GAAG,CAAC,EACX,GAAG,GAAG,CAAC,CAAA;QACT,IAAI,SAAS,EAAE,CAAC;YACd,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,CAAA;YACvB,OAAO,GAAG,GAAG,GAAG,IAAI,CAAA;YACpB,GAAG,KAAK,CAAC,CAAA;YACT,GAAG,GAAG,CAAC,CAAC,CAAA;QACV,CAAC;QACD,IAAI,CAAC,QAAQ,GAAG,GAAG,CAAA;QACnB,IAAI,CAAC,YAAY,GAAG,OAAO,CAAA;QAC3B,IAAI,CAAC,UAAU,GAAG,SAAS,CAAA;QAC3B,IAAI,CAAC,QAAQ,GAAG,GAAG,CAAA;QAEnB,OAAO,IAAI,CAAA,CAAC,yBAAyB;IACvC,CAAC;IACD;;;;;IAKA;IACA,YAAY,CAAC,YAAY,EAAE,GAAG;QAC5B,IAAI,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAA;QAC7B;;;2CAGmC;QACnC,IAAI,IAAI,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC;YACxB,OAAO,CAAC,CAAA;QACV,CAAC;QAED,MAAM,QAAQ,GAAG,CAAC,CAAA;QAClB,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,EAClB,GAAG,GAAG,IAAI,CAAC,QAAQ,EACnB,OAAO,GAAG,IAAI,CAAC,YAAY,CAAA;QAC7B,IAAI,SAAS,GAAG,IAAI,CAAC,UAAU,EAC7B,UAAU,GAAG,IAAI,CAAC,UAAU,CAAA;QAC9B,IAAI,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAA;QAEvB,OAAO,SAAS,EAAE,CAAC;YACjB,SAAS,EAAE,CAAA;YACX,QAAQ,GAAG,OAAO,CAAA;YAClB,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAA;YACf,OAAO,GAAG,GAAG,GAAG,IAAI,CAAA;YACpB,GAAG,KAAK,CAAC,CAAA;YACT,IAAI,GAAG,EAAE,KAAK,CAAC,EAAE,CAAC;gBAChB,MAAM,GAAG,OAAO,CAAA;gBAChB,OAAO,GAAG,QAAQ,CAAA;gBAClB,OAAO,GAAG,CAAC,CAAC,CAAA;YACd,CAAC;iBAAM,CAAC;gBACN,MAAM,GAAG,CAAC,CAAA;gBACV,OAAO,GAAG,OAAO,CAAA;YACnB,CAAC;YACD,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,OAAO,EAAE,MAAM,CAAC,CAAA;YAC3C,OAAO,MAAM,EAAE,EAAE,CAAC;gBAChB,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,OAAO,CAAC,CAAA;gBACpC,IAAI,CAAC,UAAU,EAAE,CAAA;YACnB,CAAC;YACD,IAAI,OAAO,IAAI,QAAQ,EAAE,CAAC;gBACxB,GAAG,GAAG,CAAC,CAAA;YACT,CAAC;QACH,CAAC;QACD,IAAI,CAAC,UAAU,GAAG,SAAS,CAAA;QAC3B,YAAY;QACZ,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC,cAAc,EAAE,CAAC;YACnD,MAAM,CACJ,GAAG,CAAC,UAAU,EACd,gBAAgB;gBACd,OAAO;gBACP,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACnC,YAAY;gBACZ,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAChC,GAAG,CACN,CAAA;QACH,CAAC;QACD,OAAO,IAAI,CAAC,UAAU,CAAA;IACxB,CAAC;CACF;AAED,MAAM,iBAAiB,GAAG,UAAU,KAAK;IACvC,IAAI,UAAU,IAAI,KAAK,EAAE,CAAC;QACxB,OAAO,KAAK,CAAA;IACd,CAAC;IACD,MAAM,WAAW,GAAG,IAAI,gBAAM,EAAE,CAAA;IAChC,WAAW,CAAC,GAAG,GAAG,CAAC,CAAA;IACnB,WAAW,CAAC,QAAQ,GAAG;QACrB,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAA;IAC1B,CAAC,CAAA;IACD,WAAW,CAAC,IAAI,GAAG,UAAU,GAAG;QAC9B,IAAI,CAAC,GAAG,GAAG,GAAG,CAAA;IAChB,CAAC,CAAA;IACD,WAAW,CAAC,GAAG,GAAG;QAChB,OAAO,IAAI,CAAC,GAAG,IAAI,KAAK,CAAC,MAAM,CAAA;IACjC,CAAC,CAAA;IACD,OAAO,WAAW,CAAA;AACpB,CAAC,CAAA;AACD,MAAM,kBAAkB,GAAG,UAAU,MAAM;IACzC,MAAM,YAAY,GAAG,IAAI,gBAAM,EAAE,CAAA;IACjC,IAAI,QAAQ,GAAG,IAAI,CAAA;IACnB,IAAI,MAAM,EAAE,CAAC;QACX,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE,CAAC;YAC/B,YAAY,CAAC,MAAM,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,CAAA;YAC5C,QAAQ,GAAG,KAAK,CAAA;QAClB,CAAC;aAAM,IAAI,WAAW,IAAI,MAAM,EAAE,CAAC;YACjC,OAAO,MAAM,CAAA;QACf,CAAC;aAAM,CAAC;YACN,YAAY,CAAC,MAAM,GAAG,MAAM,CAAA;YAC5B,QAAQ,GAAG,KAAK,CAAA;QAClB,CAAC;IACH,CAAC;SAAM,CAAC;QACN,YAAY,CAAC,MAAM,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,CAAA;IAC7C,CAAC;IACD,YAAY,CAAC,GAAG,GAAG,CAAC,CAAA;IACpB,YAAY,CAAC,SAAS,GAAG,UAAU,KAAK;QACtC,IAAI,QAAQ,IAAI,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;YAC/C,MAAM,SAAS,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;YACxD,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;YAC1B,IAAI,CAAC,MAAM,GAAG,SAAS,CAAA;QACzB,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,GAAG,KAAK,CAAA;IACjC,CAAC,CAAA;IACD,YAAY,CAAC,SAAS,GAAG;QACvB,cAAc;QACd,IAAI,IAAI,CAAC,GAAG,KAAK,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;YACpC,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACd,MAAM,IAAI,SAAS,CAAC,yCAAyC,CAAC,CAAA;YAChE,CAAC;YACD,MAAM,SAAS,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;YAC1C,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAA;YAC7C,IAAI,CAAC,MAAM,GAAG,SAAS,CAAA;QACzB,CAAC;QACD,OAAO,IAAI,CAAC,MAAM,CAAA;IACpB,CAAC,CAAA;IACD,YAAY,CAAC,QAAQ,GAAG,IAAI,CAAA;IAC5B,OAAO,YAAY,CAAA;AACrB,CAAC,CAAA;AAED,6BAA6B;AAC7B,sCAAsC;AACtC,iEAAiE;AACjE,SAAgB,MAAM,CAAC,KAAiB,EAAE,MAAY,EAAE,WAAiB;IACvE,4CAA4C;IAC5C,MAAM,WAAW,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAA;IAC5C,MAAM,YAAY,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAA;IAE/C,MAAM,EAAE,GAAG,IAAI,MAAM,CAAC,WAAW,EAAE,YAAY,CAAC,CAAA;IAChD,OAAO,IAAI,EAAE,CAAC;QACZ,IAAI,KAAK,IAAI,WAAW,IAAI,WAAW,CAAC,GAAG,EAAE,EAAE,CAAC;YAC9C,MAAK;QACP,CAAC;QACD,IAAI,EAAE,CAAC,WAAW,EAAE,EAAE,CAAC;YACrB,EAAE,CAAC,YAAY,EAAE,CAAA;QACnB,CAAC;aAAM,CAAC;YACN,MAAM,eAAe,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAA,CAAC,wBAAwB;YACzE,IAAI,eAAe,KAAK,EAAE,CAAC,SAAS,EAAE,CAAC;gBACrC,MAAM,CACJ,GAAG,CAAC,UAAU,EACd,iBAAiB;oBACf,OAAO;oBACP,EAAE,CAAC,SAAS,CAAC,QAAQ,CAAC,EAAE,CAAC;oBACzB,YAAY;oBACZ,eAAe,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAC5B,GAAG,CACN,CAAA;YACH,CAAC;YACD,IAAI,WAAW,IAAI,KAAK,IAAI,WAAW,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,EAAE,CAAC;gBAC9D,sEAAsE;gBACtE,EAAE,CAAC,aAAa,CAAC,WAAW,EAAE,YAAY,CAAC,CAAA;YAC7C,CAAC;iBAAM,CAAC;gBACN,MAAK;YACP,CAAC;QACH,CAAC;IACH,CAAC;IACD,IAAI,WAAW,IAAI,YAAY,EAAE,CAAC;QAChC,OAAO,YAAY,CAAC,SAAS,EAAE,CAAA;IACjC,CAAC;AACH,CAAC;AAED,kBAAe,MAAM,CAAA"}

package/dist/seek-bzip/stream.d.ts

@@ -0,0 +1 @@
+declare const Stream: () => void;

package/dist/seek-bzip/stream.js

@@ -0,0 +1,41 @@
+"use strict";
+// @ts-nocheck
+/// * very simple input/output stream interface */
+const Stream = function () { };
+// input streams //////////////
+/** Returns the next byte, or -1 for EOF. */
+Stream.prototype.readByte = function () {
+    throw new Error('abstract method readByte() not implemented');
+};
+/** Attempts to fill the buffer; returns number of bytes read, or
+ *  -1 for EOF. */
+Stream.prototype.read = function (buffer, bufOffset, length) {
+    let bytesRead = 0;
+    while (bytesRead < length) {
+        const c = this.readByte();
+        if (c < 0) {
+            // EOF
+            return bytesRead === 0 ? -1 : bytesRead;
+        }
+        buffer[bufOffset++] = c;
+        bytesRead++;
+    }
+    return bytesRead;
+};
+Stream.prototype.seek = function (new_pos) {
+    throw new Error('abstract method seek() not implemented');
+};
+// output streams ///////////
+Stream.prototype.writeByte = function (_byte) {
+    throw new Error('abstract method readByte() not implemented');
+};
+Stream.prototype.write = function (buffer, bufOffset, length) {
+    let i;
+    for (i = 0; i < length; i++) {
+        this.writeByte(buffer[bufOffset++]);
+    }
+    return length;
+};
+Stream.prototype.flush = function () { };
+module.exports = Stream;
+//# sourceMappingURL=stream.js.map

package/dist/seek-bzip/stream.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"stream.js","sourceRoot":"","sources":["../../src/seek-bzip/stream.ts"],"names":[],"mappings":";AAAA,cAAc;AACd,kDAAkD;AAClD,MAAM,MAAM,GAAG,cAAa,CAAC,CAAA;AAE7B,+BAA+B;AAC/B,4CAA4C;AAC5C,MAAM,CAAC,SAAS,CAAC,QAAQ,GAAG;IAC1B,MAAM,IAAI,KAAK,CAAC,4CAA4C,CAAC,CAAA;AAC/D,CAAC,CAAA;AACD;kBACkB;AAClB,MAAM,CAAC,SAAS,CAAC,IAAI,GAAG,UAAU,MAAM,EAAE,SAAS,EAAE,MAAM;IACzD,IAAI,SAAS,GAAG,CAAC,CAAA;IACjB,OAAO,SAAS,GAAG,MAAM,EAAE,CAAC;QAC1B,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAA;QACzB,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACV,MAAM;YACN,OAAO,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAA;QACzC,CAAC;QACD,MAAM,CAAC,SAAS,EAAE,CAAC,GAAG,CAAC,CAAA;QACvB,SAAS,EAAE,CAAA;IACb,CAAC;IACD,OAAO,SAAS,CAAA;AAClB,CAAC,CAAA;AACD,MAAM,CAAC,SAAS,CAAC,IAAI,GAAG,UAAU,OAAO;IACvC,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAA;AAC3D,CAAC,CAAA;AAED,6BAA6B;AAC7B,MAAM,CAAC,SAAS,CAAC,SAAS,GAAG,UAAU,KAAK;IAC1C,MAAM,IAAI,KAAK,CAAC,4CAA4C,CAAC,CAAA;AAC/D,CAAC,CAAA;AACD,MAAM,CAAC,SAAS,CAAC,KAAK,GAAG,UAAU,MAAM,EAAE,SAAS,EAAE,MAAM;IAC1D,IAAI,CAAC,CAAA;IACL,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,CAAA;IACrC,CAAC;IACD,OAAO,MAAM,CAAA;AACf,CAAC,CAAA;AACD,MAAM,CAAC,SAAS,CAAC,KAAK,GAAG,cAAa,CAAC,CAAA;AAEvC,MAAM,CAAC,OAAO,GAAG,MAAM,CAAA"}

package/dist/seek-bzip/toHex.d.ts

@@ -0,0 +1 @@
+export declare function toHex(buffer: Uint8Array): string;