molstar 3.0.0 → 3.0.1

package/lib/commonjs/mol-util/zip/inflate.js

@@ -1,232 +0,0 @@
-"use strict";
-/**
- * Copyright (c) 2020 mol* contributors, licensed under MIT, See LICENSE file for more info.
- *
- * @author Alexander Rose <alexander.rose@weirdbyte.de>
- *
- * ported from https://github.com/photopea/UZIP.js/blob/master/UZIP.js
- * MIT License, Copyright (c) 2018 Photopea
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports._inflate = void 0;
-var tslib_1 = require("tslib");
-var util_1 = require("./util");
-function InflateContext(data, buf) {
-    var noBuf = buf === undefined;
-    if (buf === undefined)
-        buf = new Uint8Array((data.length >>> 2) << 3);
-    return {
-        data: data,
-        buf: buf,
-        noBuf: noBuf,
-        BFINAL: 0,
-        off: 0,
-        pos: 0
-    };
-}
-function inflateBlocks(ctx, count) {
-    var data = ctx.data, noBuf = ctx.noBuf;
-    var buf = ctx.buf, BFINAL = ctx.BFINAL, off = ctx.off, pos = ctx.pos;
-    var iBlock = 0;
-    while (BFINAL === 0 && iBlock < count) {
-        var lmap = void 0, dmap = void 0;
-        var ML = 0, MD = 0;
-        BFINAL = _bitsF(data, pos, 1);
-        iBlock += 1;
-        var BTYPE = _bitsF(data, pos + 1, 2);
-        pos += 3;
-        if (BTYPE === 0) {
-            // uncompressed block
-            if ((pos & 7) !== 0)
-                pos += 8 - (pos & 7);
-            var p8 = (pos >>> 3) + 4;
-            var len = data[p8 - 4] | (data[p8 - 3] << 8);
-            if (noBuf)
-                buf = _check(buf, off + len);
-            buf.set(new Uint8Array(data.buffer, data.byteOffset + p8, len), off);
-            pos = ((p8 + len) << 3);
-            off += len;
-            continue;
-        }
-        // grow output buffer if not provided
-        if (noBuf)
-            buf = _check(buf, off + (1 << 17));
-        if (BTYPE === 1) {
-            // block compressed with fixed Huffman codes
-            lmap = util_1.U.flmap;
-            dmap = util_1.U.fdmap;
-            ML = (1 << 9) - 1;
-            MD = (1 << 5) - 1;
-        }
-        else if (BTYPE === 2) {
-            // block compressed with dynamic Huffman codes
-            var HLIT = _bitsE(data, pos, 5) + 257;
-            var HDIST = _bitsE(data, pos + 5, 5) + 1;
-            var HCLEN = _bitsE(data, pos + 10, 4) + 4;
-            pos += 14;
-            for (var i = 0; i < 38; i += 2) {
-                util_1.U.itree[i] = 0;
-                util_1.U.itree[i + 1] = 0;
-            }
-            var tl = 1;
-            for (var i = 0; i < HCLEN; i++) {
-                var l = _bitsE(data, pos + i * 3, 3);
-                util_1.U.itree[(util_1.U.ordr[i] << 1) + 1] = l;
-                if (l > tl)
-                    tl = l;
-            }
-            pos += 3 * HCLEN;
-            (0, util_1.makeCodes)(util_1.U.itree, tl);
-            (0, util_1.codes2map)(util_1.U.itree, tl, util_1.U.imap);
-            lmap = util_1.U.lmap;
-            dmap = util_1.U.dmap;
-            pos = _decodeTiny(util_1.U.imap, (1 << tl) - 1, HLIT + HDIST, data, pos, util_1.U.ttree);
-            var mx0 = _copyOut(util_1.U.ttree, 0, HLIT, util_1.U.ltree);
-            ML = (1 << mx0) - 1;
-            var mx1 = _copyOut(util_1.U.ttree, HLIT, HDIST, util_1.U.dtree);
-            MD = (1 << mx1) - 1;
-            (0, util_1.makeCodes)(util_1.U.ltree, mx0);
-            (0, util_1.codes2map)(util_1.U.ltree, mx0, lmap);
-            (0, util_1.makeCodes)(util_1.U.dtree, mx1);
-            (0, util_1.codes2map)(util_1.U.dtree, mx1, dmap);
-        }
-        else {
-            throw new Error("unknown BTYPE ".concat(BTYPE));
-        }
-        while (true) {
-            var code = lmap[_get17(data, pos) & ML];
-            pos += code & 15;
-            var lit = code >>> 4;
-            if ((lit >>> 8) === 0) {
-                buf[off++] = lit;
-            }
-            else if (lit === 256) {
-                break;
-            }
-            else {
-                var end = off + lit - 254;
-                if (lit > 264) {
-                    var ebs = util_1.U.ldef[lit - 257];
-                    end = off + (ebs >>> 3) + _bitsE(data, pos, ebs & 7);
-                    pos += ebs & 7;
-                }
-                var dcode = dmap[_get17(data, pos) & MD];
-                pos += dcode & 15;
-                var dlit = dcode >>> 4;
-                var dbs = util_1.U.ddef[dlit];
-                var dst = (dbs >>> 4) + _bitsF(data, pos, dbs & 15);
-                pos += dbs & 15;
-                if (noBuf)
-                    buf = _check(buf, off + (1 << 17));
-                while (off < end) {
-                    buf[off] = buf[off++ - dst];
-                    buf[off] = buf[off++ - dst];
-                    buf[off] = buf[off++ - dst];
-                    buf[off] = buf[off++ - dst];
-                }
-                off = end;
-            }
-        }
-    }
-    ctx.buf = buf;
-    ctx.BFINAL = BFINAL;
-    ctx.off = off;
-    ctx.pos = pos;
-}
-// https://tools.ietf.org/html/rfc1951
-function _inflate(runtime, data, buf) {
-    return (0, tslib_1.__awaiter)(this, void 0, void 0, function () {
-        var ctx;
-        return (0, tslib_1.__generator)(this, function (_a) {
-            switch (_a.label) {
-                case 0:
-                    if (data[0] === 3 && data[1] === 0)
-                        return [2 /*return*/, (buf ? buf : new Uint8Array(0))];
-                    ctx = InflateContext(data, buf);
-                    _a.label = 1;
-                case 1:
-                    if (!(ctx.BFINAL === 0)) return [3 /*break*/, 4];
-                    if (!runtime.shouldUpdate) return [3 /*break*/, 3];
-                    return [4 /*yield*/, runtime.update({ message: 'Inflating blocks...', current: ctx.pos, max: data.length })];
-                case 2:
-                    _a.sent();
-                    _a.label = 3;
-                case 3:
-                    inflateBlocks(ctx, 100);
-                    return [3 /*break*/, 1];
-                case 4: return [2 /*return*/, ctx.buf.length === ctx.off ? ctx.buf : ctx.buf.slice(0, ctx.off)];
-            }
-        });
-    });
-}
-exports._inflate = _inflate;
-function _check(buf, len) {
-    var bl = buf.length;
-    if (len <= bl)
-        return buf;
-    var nbuf = new Uint8Array(Math.max(bl << 1, len));
-    nbuf.set(buf, 0);
-    return nbuf;
-}
-function _decodeTiny(lmap, LL, len, data, pos, tree) {
-    var i = 0;
-    while (i < len) {
-        var code = lmap[_get17(data, pos) & LL];
-        pos += code & 15;
-        var lit = code >>> 4;
-        if (lit <= 15) {
-            tree[i] = lit;
-            i++;
-        }
-        else {
-            var ll = 0, n = 0;
-            if (lit === 16) {
-                n = (3 + _bitsE(data, pos, 2));
-                pos += 2;
-                ll = tree[i - 1];
-            }
-            else if (lit === 17) {
-                n = (3 + _bitsE(data, pos, 3));
-                pos += 3;
-            }
-            else if (lit === 18) {
-                n = (11 + _bitsE(data, pos, 7));
-                pos += 7;
-            }
-            var ni = i + n;
-            while (i < ni) {
-                tree[i] = ll;
-                i++;
-            }
-        }
-    }
-    return pos;
-}
-function _copyOut(src, off, len, tree) {
-    var mx = 0, i = 0;
-    var tl = tree.length >>> 1;
-    while (i < len) {
-        var v = src[i + off];
-        tree[(i << 1)] = 0;
-        tree[(i << 1) + 1] = v;
-        if (v > mx)
-            mx = v;
-        i++;
-    }
-    while (i < tl) {
-        tree[(i << 1)] = 0;
-        tree[(i << 1) + 1] = 0;
-        i++;
-    }
-    return mx;
-}
-function _bitsE(dt, pos, length) {
-    return ((dt[pos >>> 3] | (dt[(pos >>> 3) + 1] << 8)) >>> (pos & 7)) & ((1 << length) - 1);
-}
-function _bitsF(dt, pos, length) {
-    return ((dt[pos >>> 3] | (dt[(pos >>> 3) + 1] << 8) | (dt[(pos >>> 3) + 2] << 16)) >>> (pos & 7)) & ((1 << length) - 1);
-}
-function _get17(dt, pos) {
-    return (dt[pos >>> 3] | (dt[(pos >>> 3) + 1] << 8) | (dt[(pos >>> 3) + 2] << 16)) >>> (pos & 7);
-}
-//# sourceMappingURL=inflate.js.map

package/lib/commonjs/mol-util/zip/util.d.ts

@@ -1,40 +0,0 @@
-/**
- * Copyright (c) 2020 mol* contributors, licensed under MIT, See LICENSE file for more info.
- *
- * @author Alexander Rose <alexander.rose@weirdbyte.de>
- *
- * ported from https://github.com/photopea/UZIP.js/blob/master/UZIP.js
- * MIT License, Copyright (c) 2018 Photopea
- */
-export declare const U: {
-    next_code: Uint16Array;
-    bl_count: Uint16Array;
-    ordr: number[];
-    of0: number[];
-    exb: number[];
-    ldef: Uint16Array;
-    df0: number[];
-    dxb: number[];
-    ddef: Uint32Array;
-    flmap: Uint16Array;
-    fltree: number[];
-    fdmap: Uint16Array;
-    fdtree: number[];
-    lmap: Uint16Array;
-    ltree: number[];
-    ttree: number[];
-    dmap: Uint16Array;
-    dtree: number[];
-    imap: Uint16Array;
-    itree: number[];
-    rev15: Uint16Array;
-    lhst: Uint32Array;
-    dhst: Uint32Array;
-    ihst: Uint32Array;
-    lits: Uint32Array;
-    strt: Uint16Array;
-    prev: Uint16Array;
-};
-export declare function codes2map(tree: number[], MAX_BITS: number, map: Uint16Array): void;
-export declare function makeCodes(tree: number[], MAX_BITS: number): void;
-export declare function revCodes(tree: number[], MAX_BITS: number): void;

package/lib/commonjs/mol-util/zip/util.js

@@ -1,136 +0,0 @@
-"use strict";
-/**
- * Copyright (c) 2020 mol* contributors, licensed under MIT, See LICENSE file for more info.
- *
- * @author Alexander Rose <alexander.rose@weirdbyte.de>
- *
- * ported from https://github.com/photopea/UZIP.js/blob/master/UZIP.js
- * MIT License, Copyright (c) 2018 Photopea
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.revCodes = exports.makeCodes = exports.codes2map = exports.U = void 0;
-exports.U = (function () {
-    var u16 = Uint16Array, u32 = Uint32Array;
-    return {
-        next_code: new u16(16),
-        bl_count: new u16(16),
-        ordr: [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15],
-        of0: [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, 999, 999, 999],
-        exb: [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, 0, 0, 0],
-        ldef: new u16(32),
-        df0: [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, 65535, 65535],
-        dxb: [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, 0, 0],
-        ddef: new u32(32),
-        flmap: new u16(512), fltree: [],
-        fdmap: new u16(32), fdtree: [],
-        lmap: new u16(32768), ltree: [], ttree: [],
-        dmap: new u16(32768), dtree: [],
-        imap: new u16(512), itree: [],
-        // rev9 : new u16(  512)
-        rev15: new u16(1 << 15),
-        lhst: new u32(286), dhst: new u32(30), ihst: new u32(19),
-        lits: new u32(15000),
-        strt: new u16(1 << 16),
-        prev: new u16(1 << 15)
-    };
-})();
-(function () {
-    var len = 1 << 15;
-    for (var i = 0; i < len; i++) {
-        var x = i;
-        x = (((x & 0xaaaaaaaa) >>> 1) | ((x & 0x55555555) << 1));
-        x = (((x & 0xcccccccc) >>> 2) | ((x & 0x33333333) << 2));
-        x = (((x & 0xf0f0f0f0) >>> 4) | ((x & 0x0f0f0f0f) << 4));
-        x = (((x & 0xff00ff00) >>> 8) | ((x & 0x00ff00ff) << 8));
-        exports.U.rev15[i] = (((x >>> 16) | (x << 16))) >>> 17;
-    }
-    function pushV(tgt, n, sv) {
-        while (n-- !== 0)
-            tgt.push(0, sv);
-    }
-    for (var i = 0; i < 32; i++) {
-        exports.U.ldef[i] = (exports.U.of0[i] << 3) | exports.U.exb[i];
-        exports.U.ddef[i] = (exports.U.df0[i] << 4) | exports.U.dxb[i];
-    }
-    pushV(exports.U.fltree, 144, 8);
-    pushV(exports.U.fltree, 255 - 143, 9);
-    pushV(exports.U.fltree, 279 - 255, 7);
-    pushV(exports.U.fltree, 287 - 279, 8);
-    /*
-    var i = 0;
-    for(; i<=143; i++) U.fltree.push(0,8);
-    for(; i<=255; i++) U.fltree.push(0,9);
-    for(; i<=279; i++) U.fltree.push(0,7);
-    for(; i<=287; i++) U.fltree.push(0,8);
-    */
-    makeCodes(exports.U.fltree, 9);
-    codes2map(exports.U.fltree, 9, exports.U.flmap);
-    revCodes(exports.U.fltree, 9);
-    pushV(exports.U.fdtree, 32, 5);
-    // for(i=0;i<32; i++) U.fdtree.push(0,5);
-    makeCodes(exports.U.fdtree, 5);
-    codes2map(exports.U.fdtree, 5, exports.U.fdmap);
-    revCodes(exports.U.fdtree, 5);
-    pushV(exports.U.itree, 19, 0);
-    pushV(exports.U.ltree, 286, 0);
-    pushV(exports.U.dtree, 30, 0);
-    pushV(exports.U.ttree, 320, 0);
-    /*
-    for(var i=0; i< 19; i++) U.itree.push(0,0);
-    for(var i=0; i<286; i++) U.ltree.push(0,0);
-    for(var i=0; i< 30; i++) U.dtree.push(0,0);
-    for(var i=0; i<320; i++) U.ttree.push(0,0);
-    */
-})();
-function codes2map(tree, MAX_BITS, map) {
-    var max_code = tree.length;
-    var r15 = exports.U.rev15;
-    for (var i = 0; i < max_code; i += 2) {
-        if (tree[i + 1] !== 0) {
-            var lit = i >> 1;
-            var cl = tree[i + 1], val = (lit << 4) | cl; // :  (0x8000 | (U.of0[lit-257]<<7) | (U.exb[lit-257]<<4) | cl);
-            var rest = (MAX_BITS - cl);
-            var i0 = tree[i] << rest;
-            var i1 = i0 + (1 << rest);
-            // tree[i]=r15[i0]>>>(15-MAX_BITS);
-            while (i0 !== i1) {
-                var p0 = r15[i0] >>> (15 - MAX_BITS);
-                map[p0] = val;
-                i0++;
-            }
-        }
-    }
-}
-exports.codes2map = codes2map;
-function makeCodes(tree, MAX_BITS) {
-    var max_code = tree.length;
-    var bl_count = exports.U.bl_count;
-    for (var i = 0; i <= MAX_BITS; i++)
-        bl_count[i] = 0;
-    for (var i = 1; i < max_code; i += 2)
-        bl_count[tree[i]]++;
-    var next_code = exports.U.next_code; // smallest code for each length
-    var code = 0;
-    bl_count[0] = 0;
-    for (var bits = 1; bits <= MAX_BITS; bits++) {
-        code = (code + bl_count[bits - 1]) << 1;
-        next_code[bits] = code;
-    }
-    for (var n = 0; n < max_code; n += 2) {
-        var len = tree[n + 1];
-        if (len !== 0) {
-            tree[n] = next_code[len];
-            next_code[len]++;
-        }
-    }
-}
-exports.makeCodes = makeCodes;
-function revCodes(tree, MAX_BITS) {
-    var r15 = exports.U.rev15, imb = 15 - MAX_BITS;
-    for (var i = 0; i < tree.length; i += 2) {
-        var i0 = (tree[i] << (MAX_BITS - tree[i + 1]));
-        tree[i] = r15[i0] >>> imb;
-    }
-}
-exports.revCodes = revCodes;
-//# sourceMappingURL=util.js.map

package/lib/commonjs/mol-util/zip/zip.d.ts

@@ -1,29 +0,0 @@
-/**
- * Copyright (c) 2020 mol* contributors, licensed under MIT, See LICENSE file for more info.
- *
- * @author Alexander Rose <alexander.rose@weirdbyte.de>
- *
- * ported from https://github.com/photopea/UZIP.js/blob/master/UZIP.js
- * MIT License, Copyright (c) 2018 Photopea
- *
- * - added `ungzip`
- */
-import { RuntimeContext, Task } from '../../mol-task';
-export declare function unzip(runtime: RuntimeContext, buf: ArrayBuffer, onlyNames?: boolean): Promise<{
-    [k: string]: Uint8Array | {
-        size: number;
-        csize: number;
-    };
-}>;
-export declare function inflateRaw(runtime: RuntimeContext, file: Uint8Array, buf?: Uint8Array): Promise<Uint8Array>;
-export declare function inflate(runtime: RuntimeContext, file: Uint8Array, buf?: Uint8Array): Promise<Uint8Array>;
-export declare function ungzip(runtime: RuntimeContext, file: Uint8Array, buf?: Uint8Array): Promise<Uint8Array>;
-export declare function deflate(runtime: RuntimeContext, data: Uint8Array, opts?: {
-    level: number;
-}): Promise<Uint8Array>;
-export declare function Zip(obj: {
-    [k: string]: Uint8Array;
-}, noCmpr?: boolean): Task<ArrayBufferLike>;
-export declare function zip(runtime: RuntimeContext, obj: {
-    [k: string]: Uint8Array;
-}, noCmpr?: boolean): Promise<ArrayBufferLike>;