@mtkruto/node 0.6.0 → 0.6.3

package/esm/deps/raw.githubusercontent.com/MTKruto/compress/main/zlib/zlib/inftrees.d.ts

@@ -1,2 +0,0 @@
-export default function inflate_table(type: any, lens: any, lens_index: any, codes: any, table: any, table_index: any, work: any, opts: any): 0 | 1 | -1;
-//# sourceMappingURL=inftrees.d.ts.map

package/esm/deps/raw.githubusercontent.com/MTKruto/compress/main/zlib/zlib/inftrees.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"inftrees.d.ts","sourceRoot":"","sources":["../../../../../../../../src/deps/raw.githubusercontent.com/MTKruto/compress/main/zlib/zlib/inftrees.ts"],"names":[],"mappings":"AAuJA,MAAM,CAAC,OAAO,UAAU,aAAa,CACnC,IAAI,EAAE,GAAG,EACT,IAAI,EAAE,GAAG,EACT,UAAU,EAAE,GAAG,EACf,KAAK,EAAE,GAAG,EACV,KAAK,EAAE,GAAG,EACV,WAAW,EAAE,GAAG,EAChB,IAAI,EAAE,GAAG,EACT,IAAI,EAAE,GAAG,cAoOV"}

package/esm/deps/raw.githubusercontent.com/MTKruto/compress/main/zlib/zlib/inftrees.js

@@ -1,355 +0,0 @@
-const MAXBITS = 15;
-const ENOUGH_LENS = 852;
-const ENOUGH_DISTS = 592;
-//const ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);
-const CODES = 0;
-const LENS = 1;
-const DISTS = 2;
-const lbase = [
-    /* Length codes 257..285 base */
-    3,
-    4,
-    5,
-    6,
-    7,
-    8,
-    9,
-    10,
-    11,
-    13,
-    15,
-    17,
-    19,
-    23,
-    27,
-    31,
-    35,
-    43,
-    51,
-    59,
-    67,
-    83,
-    99,
-    115,
-    131,
-    163,
-    195,
-    227,
-    258,
-    0,
-    0,
-];
-const lext = [
-    /* Length codes 257..285 extra */
-    16,
-    16,
-    16,
-    16,
-    16,
-    16,
-    16,
-    16,
-    17,
-    17,
-    17,
-    17,
-    18,
-    18,
-    18,
-    18,
-    19,
-    19,
-    19,
-    19,
-    20,
-    20,
-    20,
-    20,
-    21,
-    21,
-    21,
-    21,
-    16,
-    72,
-    78,
-];
-const dbase = [
-    /* Distance codes 0..29 base */
-    1,
-    2,
-    3,
-    4,
-    5,
-    7,
-    9,
-    13,
-    17,
-    25,
-    33,
-    49,
-    65,
-    97,
-    129,
-    193,
-    257,
-    385,
-    513,
-    769,
-    1025,
-    1537,
-    2049,
-    3073,
-    4097,
-    6145,
-    8193,
-    12289,
-    16385,
-    24577,
-    0,
-    0,
-];
-const dext = [
-    /* Distance codes 0..29 extra */
-    16,
-    16,
-    16,
-    16,
-    17,
-    17,
-    18,
-    18,
-    19,
-    19,
-    20,
-    20,
-    21,
-    21,
-    22,
-    22,
-    23,
-    23,
-    24,
-    24,
-    25,
-    25,
-    26,
-    26,
-    27,
-    27,
-    28,
-    28,
-    29,
-    29,
-    64,
-    64,
-];
-export default function inflate_table(type, lens, lens_index, codes, table, table_index, work, opts) {
-    let bits = opts.bits;
-    //here = opts.here; /* table entry for duplication */
-    let len = 0; /* a code's length in bits */
-    let sym = 0; /* index of code symbols */
-    let min = 0, max = 0; /* minimum and maximum code lengths */
-    let root = 0; /* number of index bits for root table */
-    let curr = 0; /* number of index bits for current table */
-    let drop = 0; /* code bits to drop for sub-table */
-    let left = 0; /* number of prefix codes available */
-    let used = 0; /* code entries in table used */
-    let huff = 0; /* Huffman code */
-    let incr; /* for incrementing code, index */
-    let fill; /* index for replicating entries */
-    let low; /* low bits for current root entry */
-    let mask; /* mask for low root bits */
-    let next; /* next available space in table */
-    let base = null; /* base value table to use */
-    let base_index = 0;
-    //  let shoextra;    /* extra bits table to use */
-    let end; /* use base and extra for symbol > end */
-    let count = new Uint16Array(MAXBITS + 1); //[MAXBITS+1];    /* number of codes of each length */
-    let offs = new Uint16Array(MAXBITS + 1); //[MAXBITS+1];     /* offsets in table for each length */
-    let extra = null;
-    let extra_index = 0;
-    let here_bits, here_op, here_val;
-    /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */
-    for (len = 0; len <= MAXBITS; len++) {
-        count[len] = 0;
-    }
-    for (sym = 0; sym < codes; sym++) {
-        count[lens[lens_index + sym]]++;
-    }
-    /* bound code lengths, force root to be within code lengths */
-    root = bits;
-    for (max = MAXBITS; max >= 1; max--) {
-        if (count[max] !== 0)
-            break;
-    }
-    if (root > max) {
-        root = max;
-    }
-    if (max === 0) {
-        /* no symbols to code at all */
-        //table.op[opts.table_index] = 64;  //here.op = (let char)64;    /* invalid code marker */
-        //table.bits[opts.table_index] = 1;   //here.bits = (let char)1;
-        //table.val[opts.table_index++] = 0;   //here.val = (let short)0;
-        table[table_index++] = (1 << 24) | (64 << 16) | 0;
-        //table.op[opts.table_index] = 64;
-        //table.bits[opts.table_index] = 1;
-        //table.val[opts.table_index++] = 0;
-        table[table_index++] = (1 << 24) | (64 << 16) | 0;
-        opts.bits = 1;
-        return 0; /* no symbols, but wait for decoding to report error */
-    }
-    for (min = 1; min < max; min++) {
-        if (count[min] !== 0)
-            break;
-    }
-    if (root < min) {
-        root = min;
-    }
-    /* check for an over-subscribed or incomplete set of lengths */
-    left = 1;
-    for (len = 1; len <= MAXBITS; len++) {
-        left <<= 1;
-        left -= count[len];
-        if (left < 0) {
-            return -1;
-        } /* over-subscribed */
-    }
-    if (left > 0 && (type === CODES || max !== 1)) {
-        return -1; /* incomplete set */
-    }
-    /* generate offsets into symbol table for each length for sorting */
-    offs[1] = 0;
-    for (len = 1; len < MAXBITS; len++) {
-        offs[len + 1] = offs[len] + count[len];
-    }
-    /* sort symbols by length, by symbol order within each length */
-    for (sym = 0; sym < codes; sym++) {
-        if (lens[lens_index + sym] !== 0) {
-            work[offs[lens[lens_index + sym]]++] = sym;
-        }
-    }
-    /* set up for code type */
-    // poor man optimization - use if-else instead of switch,
-    // to avoid deopts in old v8
-    if (type === CODES) {
-        base = extra = work; /* dummy value--not used */
-        end = 19;
-    }
-    else if (type === LENS) {
-        base = lbase;
-        base_index -= 257;
-        extra = lext;
-        extra_index -= 257;
-        end = 256;
-    }
-    else {
-        /* DISTS */
-        base = dbase;
-        extra = dext;
-        end = -1;
-    }
-    /* initialize opts for loop */
-    huff = 0; /* starting code */
-    sym = 0; /* starting code symbol */
-    len = min; /* starting code length */
-    next = table_index; /* current table to fill in */
-    curr = root; /* current table index bits */
-    drop = 0; /* current bits to drop from code for index */
-    low = -1; /* trigger new sub-table when len > root */
-    used = 1 << root; /* use root table entries */
-    mask = used - 1; /* mask for comparing low */
-    /* check available table space */
-    if ((type === LENS && used > ENOUGH_LENS) ||
-        (type === DISTS && used > ENOUGH_DISTS)) {
-        return 1;
-    }
-    /* process all codes and make table entries */
-    for (;;) {
-        /* create table entry */
-        here_bits = len - drop;
-        if (work[sym] < end) {
-            here_op = 0;
-            here_val = work[sym];
-        }
-        else if (work[sym] > end) {
-            here_op = extra[extra_index + work[sym]];
-            here_val = base[base_index + work[sym]];
-        }
-        else {
-            here_op = 32 + 64; /* end of block */
-            here_val = 0;
-        }
-        /* replicate for those indices with low len bits equal to huff */
-        incr = 1 << (len - drop);
-        fill = 1 << curr;
-        min = fill; /* save offset to next table */
-        do {
-            fill -= incr;
-            table[next + (huff >> drop) + fill] = (here_bits << 24) |
-                (here_op << 16) | here_val | 0;
-        } while (fill !== 0);
-        /* backwards increment the len-bit code huff */
-        incr = 1 << (len - 1);
-        while (huff & incr) {
-            incr >>= 1;
-        }
-        if (incr !== 0) {
-            huff &= incr - 1;
-            huff += incr;
-        }
-        else {
-            huff = 0;
-        }
-        /* go to next symbol, update count, len */
-        sym++;
-        if (--count[len] === 0) {
-            if (len === max)
-                break;
-            len = lens[lens_index + work[sym]];
-        }
-        /* create new sub-table if needed */
-        if (len > root && (huff & mask) !== low) {
-            /* if first time, transition to sub-tables */
-            if (drop === 0) {
-                drop = root;
-            }
-            /* increment past last table */
-            next += min; /* here min is 1 << curr */
-            /* determine length of next table */
-            curr = len - drop;
-            left = 1 << curr;
-            while (curr + drop < max) {
-                left -= count[curr + drop];
-                if (left <= 0)
-                    break;
-                curr++;
-                left <<= 1;
-            }
-            /* check for enough space */
-            used += 1 << curr;
-            if ((type === LENS && used > ENOUGH_LENS) ||
-                (type === DISTS && used > ENOUGH_DISTS)) {
-                return 1;
-            }
-            /* point entry in root table to sub-table */
-            low = huff & mask;
-            /*table.op[low] = curr;
-            table.bits[low] = root;
-            table.val[low] = next - opts.table_index;*/
-            table[low] = (root << 24) | (curr << 16) | (next - table_index) | 0;
-        }
-    }
-    /* fill in remaining table entry if code is incomplete (guaranteed to have
-     at most one remaining entry, since if the code is incomplete, the
-     maximum code length that was allowed to get this far is one bit) */
-    if (huff !== 0) {
-        //table.op[next + huff] = 64;            /* invalid code marker */
-        //table.bits[next + huff] = len - drop;
-        //table.val[next + huff] = 0;
-        table[next + huff] = ((len - drop) << 24) | (64 << 16) | 0;
-    }
-    /* set return parameters */
-    //opts.table_index += used;
-    opts.bits = root;
-    return 0;
-}

package/esm/deps/raw.githubusercontent.com/MTKruto/compress/main/zlib/zlib/messages.d.ts

@@ -1,13 +0,0 @@
-export declare const message: {
-    2: string;
-    1: string;
-    0: string;
-    "-1": string;
-    "-2": string;
-    "-3": string;
-    "-4": string;
-    "-5": string;
-    "-6": string;
-};
-export type CODE = 2 | 1 | 0 | "-1" | "-2" | "-3" | "-4" | "-5" | "-6";
-//# sourceMappingURL=messages.d.ts.map

package/esm/deps/raw.githubusercontent.com/MTKruto/compress/main/zlib/zlib/messages.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"messages.d.ts","sourceRoot":"","sources":["../../../../../../../../src/deps/raw.githubusercontent.com/MTKruto/compress/main/zlib/zlib/messages.ts"],"names":[],"mappings":"AAAA,eAAO,MAAM,OAAO;;;;;;;;;;CAUnB,CAAC;AAEF,MAAM,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC"}

package/esm/deps/raw.githubusercontent.com/MTKruto/compress/main/zlib/zlib/messages.js

@@ -1,11 +0,0 @@
-export const message = {
-    2: "need dictionary", /* Z_NEED_DICT       2  */
-    1: "stream end", /* Z_STREAM_END      1  */
-    0: "", /* Z_OK              0  */
-    "-1": "file error", /* Z_ERRNO         (-1) */
-    "-2": "stream error", /* Z_STREAM_ERROR  (-2) */
-    "-3": "data error", /* Z_DATA_ERROR    (-3) */
-    "-4": "insufficient memory", /* Z_MEM_ERROR     (-4) */
-    "-5": "buffer error", /* Z_BUF_ERROR     (-5) */
-    "-6": "incompatible version", /* Z_VERSION_ERROR (-6) */
-};

package/esm/deps/raw.githubusercontent.com/MTKruto/compress/main/zlib/zlib/status.d.ts

@@ -1,31 +0,0 @@
-declare enum STATUS {
-    Z_NO_FLUSH = 0,
-    Z_PARTIAL_FLUSH = 1,
-    Z_SYNC_FLUSH = 2,
-    Z_FULL_FLUSH = 3,
-    Z_FINISH = 4,
-    Z_BLOCK = 5,
-    Z_TREES = 6,
-    Z_OK = 0,
-    Z_STREAM_END = 1,
-    Z_NEED_DICT = 2,
-    Z_ERRNO = -1,
-    Z_STREAM_ERROR = -2,
-    Z_DATA_ERROR = -3,
-    Z_BUF_ERROR = -5,
-    Z_NO_COMPRESSION = 0,
-    Z_BEST_SPEED = 1,
-    Z_BEST_COMPRESSION = 9,
-    Z_DEFAULT_COMPRESSION = -1,
-    Z_FILTERED = 1,
-    Z_HUFFMAN_ONLY = 2,
-    Z_RLE = 3,
-    Z_FIXED = 4,
-    Z_DEFAULT_STRATEGY = 0,
-    Z_BINARY = 0,
-    Z_TEXT = 1,
-    Z_UNKNOWN = 2,
-    Z_DEFLATED = 8
-}
-export default STATUS;
-//# sourceMappingURL=status.d.ts.map

package/esm/deps/raw.githubusercontent.com/MTKruto/compress/main/zlib/zlib/status.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"status.d.ts","sourceRoot":"","sources":["../../../../../../../../src/deps/raw.githubusercontent.com/MTKruto/compress/main/zlib/zlib/status.ts"],"names":[],"mappings":"AAAA,aAAK,MAAM;IAET,UAAU,IAAI;IACd,eAAe,IAAI;IACnB,YAAY,IAAI;IAChB,YAAY,IAAI;IAChB,QAAQ,IAAI;IACZ,OAAO,IAAI;IACX,OAAO,IAAI;IAKX,IAAI,IAAI;IACR,YAAY,IAAI;IAChB,WAAW,IAAI;IACf,OAAO,KAAK;IACZ,cAAc,KAAK;IACnB,YAAY,KAAK;IAEjB,WAAW,KAAK;IAIhB,gBAAgB,IAAI;IACpB,YAAY,IAAI;IAChB,kBAAkB,IAAI;IACtB,qBAAqB,KAAK;IAE1B,UAAU,IAAI;IACd,cAAc,IAAI;IAClB,KAAK,IAAI;IACT,OAAO,IAAI;IACX,kBAAkB,IAAI;IAGtB,QAAQ,IAAI;IACZ,MAAM,IAAI;IAEV,SAAS,IAAI;IAGb,UAAU,IAAI;CAEf;AACD,eAAe,MAAM,CAAC"}

package/esm/deps/raw.githubusercontent.com/MTKruto/compress/main/zlib/zlib/status.js

@@ -1,42 +0,0 @@
-var STATUS;
-(function (STATUS) {
-    /* Allowed flush values; see deflate() and inflate() below for details */
-    STATUS[STATUS["Z_NO_FLUSH"] = 0] = "Z_NO_FLUSH";
-    STATUS[STATUS["Z_PARTIAL_FLUSH"] = 1] = "Z_PARTIAL_FLUSH";
-    STATUS[STATUS["Z_SYNC_FLUSH"] = 2] = "Z_SYNC_FLUSH";
-    STATUS[STATUS["Z_FULL_FLUSH"] = 3] = "Z_FULL_FLUSH";
-    STATUS[STATUS["Z_FINISH"] = 4] = "Z_FINISH";
-    STATUS[STATUS["Z_BLOCK"] = 5] = "Z_BLOCK";
-    STATUS[STATUS["Z_TREES"] = 6] = "Z_TREES";
-    /* Return codes for the compression/decompression functions. Negative values
-    * are errors, positive values are used for special but normal events.
-    */
-    STATUS[STATUS["Z_OK"] = 0] = "Z_OK";
-    STATUS[STATUS["Z_STREAM_END"] = 1] = "Z_STREAM_END";
-    STATUS[STATUS["Z_NEED_DICT"] = 2] = "Z_NEED_DICT";
-    STATUS[STATUS["Z_ERRNO"] = -1] = "Z_ERRNO";
-    STATUS[STATUS["Z_STREAM_ERROR"] = -2] = "Z_STREAM_ERROR";
-    STATUS[STATUS["Z_DATA_ERROR"] = -3] = "Z_DATA_ERROR";
-    //Z_MEM_ERROR=     -4,
-    STATUS[STATUS["Z_BUF_ERROR"] = -5] = "Z_BUF_ERROR";
-    //Z_VERSION_ERROR= -6,
-    /* compression levels */
-    STATUS[STATUS["Z_NO_COMPRESSION"] = 0] = "Z_NO_COMPRESSION";
-    STATUS[STATUS["Z_BEST_SPEED"] = 1] = "Z_BEST_SPEED";
-    STATUS[STATUS["Z_BEST_COMPRESSION"] = 9] = "Z_BEST_COMPRESSION";
-    STATUS[STATUS["Z_DEFAULT_COMPRESSION"] = -1] = "Z_DEFAULT_COMPRESSION";
-    STATUS[STATUS["Z_FILTERED"] = 1] = "Z_FILTERED";
-    STATUS[STATUS["Z_HUFFMAN_ONLY"] = 2] = "Z_HUFFMAN_ONLY";
-    STATUS[STATUS["Z_RLE"] = 3] = "Z_RLE";
-    STATUS[STATUS["Z_FIXED"] = 4] = "Z_FIXED";
-    STATUS[STATUS["Z_DEFAULT_STRATEGY"] = 0] = "Z_DEFAULT_STRATEGY";
-    /* Possible values of the data_type field (though see inflate()) */
-    STATUS[STATUS["Z_BINARY"] = 0] = "Z_BINARY";
-    STATUS[STATUS["Z_TEXT"] = 1] = "Z_TEXT";
-    //Z_ASCII=                1, // = Z_TEXT (deprecated)
-    STATUS[STATUS["Z_UNKNOWN"] = 2] = "Z_UNKNOWN";
-    /* The deflate compression method */
-    STATUS[STATUS["Z_DEFLATED"] = 8] = "Z_DEFLATED";
-    //Z_NULL=                 null // Use -1 or null inline, depending on var type
-})(STATUS || (STATUS = {}));
-export default STATUS;

package/esm/deps/raw.githubusercontent.com/MTKruto/compress/main/zlib/zlib/trees.d.ts

@@ -1,6 +0,0 @@
-export declare function _tr_init(s: any): void;
-export declare function _tr_stored_block(s: any, buf: any, stored_len: any, last: any): void;
-export declare function _tr_align(s: any): void;
-export declare function _tr_flush_block(s: any, buf: any, stored_len: any, last: any): void;
-export declare function _tr_tally(s: any, dist: any, lc: any): boolean;
-//# sourceMappingURL=trees.d.ts.map

package/esm/deps/raw.githubusercontent.com/MTKruto/compress/main/zlib/zlib/trees.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"trees.d.ts","sourceRoot":"","sources":["../../../../../../../../src/deps/raw.githubusercontent.com/MTKruto/compress/main/zlib/zlib/trees.ts"],"names":[],"mappings":"AA2hCA,wBAAgB,QAAQ,CAAC,CAAC,EAAE,GAAG,QAe9B;AAKD,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,QAO5E;AAMD,wBAAgB,SAAS,CAAC,CAAC,EAAE,GAAG,QAI/B;AAMD,wBAAgB,eAAe,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,QA4E3E;AAMD,wBAAgB,SAAS,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,WAoDnD"}