@gmod/cram 6.0.0 → 7.0.0

package/dist/seek-bzip/toHex.js

@@ -1,36 +0,0 @@
-"use strict";
-// from https://www.xaymar.com/articles/2020/12/08/fastest-uint8array-to-hex-string-conversion-in-javascript/
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.toHex = toHex;
-// Pre-Init
-const LUT_HEX_4b = [
-    '0',
-    '1',
-    '2',
-    '3',
-    '4',
-    '5',
-    '6',
-    '7',
-    '8',
-    '9',
-    'A',
-    'B',
-    'C',
-    'D',
-    'E',
-    'F',
-];
-const LUT_HEX_8b = new Array(0x100);
-for (let n = 0; n < 0x100; n++) {
-    LUT_HEX_8b[n] = `${LUT_HEX_4b[(n >>> 4) & 0xf]}${LUT_HEX_4b[n & 0xf]}`;
-}
-// End Pre-Init
-function toHex(buffer) {
-    let out = '';
-    for (let idx = 0, edx = buffer.length; idx < edx; idx++) {
-        out += LUT_HEX_8b[buffer[idx]];
-    }
-    return out;
-}
-//# sourceMappingURL=toHex.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"toHex.js","sourceRoot":"","sources":["../../src/seek-bzip/toHex.ts"],"names":[],"mappings":";AAAA,6GAA6G;;AA0B7G,sBAMC;AA9BD,WAAW;AACX,MAAM,UAAU,GAAG;IACjB,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;CACJ,CAAA;AACD,MAAM,UAAU,GAAG,IAAI,KAAK,CAAC,KAAK,CAAC,CAAA;AACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;IAC/B,UAAU,CAAC,CAAC,CAAC,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC,GAAG,GAAG,CAAC,EAAE,CAAA;AACxE,CAAC;AACD,eAAe;AACf,SAAgB,KAAK,CAAC,MAAkB;IACtC,IAAI,GAAG,GAAG,EAAE,CAAA;IACZ,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,MAAM,CAAC,MAAM,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC;QACxD,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,GAAG,CAAE,CAAC,CAAA;IACjC,CAAC;IACD,OAAO,GAAG,CAAA;AACZ,CAAC"}

package/esm/htscodecs/arith_gen.d.ts

@@ -1,16 +0,0 @@
-import IOStream from './iostream.ts';
-export default class RangeCoderGen {
-    stream: IOStream;
-    decode(src: Uint8Array): Uint8Array<any>;
-    decodeStream(stream: IOStream, n_out?: number): Uint8Array<any>;
-    decode0(stream: any, n_out: any): Uint8Array<any>;
-    decode1(stream: any, n_out: any): Uint8Array<any>;
-    decodeExt(stream: any, n_out: any): any;
-    decodeRLE0(stream: any, n_out: any): Uint8Array<any>;
-    decodeRLE1(stream: any, n_out: any): Uint8Array<any>;
-    decodePackMeta(stream: any): any[];
-    decodePack(data: any, M: any, len: any): any;
-    packMeta(src: any): (number | any[] | IOStream)[];
-    decodeStripe(stream: any, len: any): Uint8Array<any>;
-    decodeCat(stream: any, len: any): Uint8Array<any>;
-}

package/esm/htscodecs/arith_gen.js

@@ -1,317 +0,0 @@
-/* eslint-disable no-var */
-// @ts-nocheck
-/*
- * Copyright (c) 2019,2020 Genome Research Ltd.
- * Author(s): James Bonfield
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *    1. Redistributions of source code must retain the above copyright notice,
- *       this list of conditions and the following disclaimer.
- *
- *    2. Redistributions in binary form must reproduce the above
- *       copyright notice, this list of conditions and the following
- *       disclaimer in the documentation and/or other materials provided
- *       with the distribution.
- *
- *    3. Neither the names Genome Research Ltd and Wellcome Trust Sanger
- *       Institute nor the names of its contributors may be used to endorse
- *       or promote products derived from this software without specific
- *       prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY GENOME RESEARCH LTD AND CONTRIBUTORS "AS
- * IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
- * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
- * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL GENOME RESEARCH
- * LTD OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
- * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
- * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-import { decode } from "../seek-bzip/index.js";
-import RangeCoder from "./arith_sh.js";
-import ByteModel from "./byte_model.js";
-import IOStream from "./iostream.js";
-const ARITH_ORDER = 1;
-const ARITH_EXT = 4;
-const ARITH_STRIPE = 8;
-const ARITH_NOSIZE = 16;
-const ARITH_CAT = 32;
-const ARITH_RLE = 64;
-const ARITH_PACK = 128;
-export default class RangeCoderGen {
-    decode(src) {
-        this.stream = new IOStream(src);
-        return this.decodeStream(this.stream);
-    }
-    decodeStream(stream, n_out = 0) {
-        const flags = this.stream.ReadByte();
-        if (!(flags & ARITH_NOSIZE)) {
-            n_out = this.stream.ReadUint7();
-        }
-        let e_len = n_out;
-        const order = flags & ARITH_ORDER;
-        // 4-way recursion
-        if (flags & ARITH_STRIPE) {
-            return this.decodeStripe(this.stream, n_out);
-        }
-        // Meta data
-        if (flags & ARITH_PACK) {
-            var P;
-            [P, e_len] = this.decodePackMeta(this.stream);
-        }
-        // NOP, useful for tiny blocks
-        if (flags & ARITH_CAT) {
-            var data = this.decodeCat(this.stream, e_len);
-        }
-        // Entropy decode
-        else if (flags & ARITH_EXT) {
-            var data = this.decodeExt(this.stream, e_len);
-        }
-        else if (flags & ARITH_RLE) {
-            var data = order
-                ? this.decodeRLE1(this.stream, e_len)
-                : this.decodeRLE0(this.stream, e_len);
-        }
-        else {
-            var data = order
-                ? this.decode1(this.stream, e_len)
-                : this.decode0(this.stream, e_len);
-        }
-        // Transforms
-        if (flags & ARITH_PACK) {
-            data = this.decodePack(data, P, n_out);
-        }
-        return data;
-    }
-    // ----------------------------------------------------------------------
-    // Order-0 codec
-    decode0(stream, n_out) {
-        const output = new Uint8Array(n_out);
-        let max_sym = stream.ReadByte();
-        if (max_sym == 0) {
-            max_sym = 256;
-        }
-        const byte_model = new ByteModel(max_sym);
-        const rc = new RangeCoder(stream);
-        rc.RangeStartDecode(stream);
-        for (let i = 0; i < n_out; i++) {
-            output[i] = byte_model.ModelDecode(stream, rc);
-        }
-        return output;
-    }
-    // ----------------------------------------------------------------------
-    // Order-1 codec
-    decode1(stream, n_out) {
-        const output = new Uint8Array(n_out);
-        let max_sym = stream.ReadByte();
-        if (max_sym == 0) {
-            max_sym = 256;
-        }
-        const byte_model = new Array(max_sym);
-        for (var i = 0; i < max_sym; i++) {
-            byte_model[i] = new ByteModel(max_sym);
-        }
-        const rc = new RangeCoder(stream);
-        rc.RangeStartDecode(stream);
-        let last = 0;
-        for (var i = 0; i < n_out; i++) {
-            output[i] = byte_model[last].ModelDecode(stream, rc);
-            last = output[i];
-        }
-        return output;
-    }
-    // ----------------------------------------------------------------------
-    // External codec
-    decodeExt(stream, n_out) {
-        return decode(stream.buf.slice(stream.pos));
-    }
-    // ----------------------------------------------------------------------
-    // Order-0 RLE codec
-    decodeRLE0(stream, n_out) {
-        const output = new Uint8Array(n_out);
-        let max_sym = stream.ReadByte();
-        if (max_sym == 0) {
-            max_sym = 256;
-        }
-        const model_lit = new ByteModel(max_sym);
-        const model_run = new Array(258);
-        for (var i = 0; i <= 257; i++) {
-            model_run[i] = new ByteModel(4);
-        }
-        const rc = new RangeCoder(stream);
-        rc.RangeStartDecode(stream);
-        var i = 0;
-        while (i < n_out) {
-            output[i] = model_lit.ModelDecode(stream, rc);
-            let part = model_run[output[i]].ModelDecode(stream, rc);
-            let run = part;
-            let rctx = 256;
-            while (part == 3) {
-                part = model_run[rctx].ModelDecode(stream, rc);
-                rctx = 257;
-                run += part;
-            }
-            for (let j = 1; j <= run; j++) {
-                output[i + j] = output[i];
-            }
-            i += run + 1;
-        }
-        return output;
-    }
-    // ----------------------------------------------------------------------
-    // Order-1 RLE codec
-    decodeRLE1(stream, n_out) {
-        const output = new Uint8Array(n_out);
-        let max_sym = stream.ReadByte();
-        if (max_sym == 0) {
-            max_sym = 256;
-        }
-        const model_lit = new Array(max_sym);
-        for (var i = 0; i < max_sym; i++) {
-            model_lit[i] = new ByteModel(max_sym);
-        }
-        const model_run = new Array(258);
-        for (var i = 0; i <= 257; i++) {
-            model_run[i] = new ByteModel(4);
-        }
-        const rc = new RangeCoder(stream);
-        rc.RangeStartDecode(stream);
-        let last = 0;
-        var i = 0;
-        while (i < n_out) {
-            output[i] = model_lit[last].ModelDecode(stream, rc);
-            last = output[i];
-            let part = model_run[output[i]].ModelDecode(stream, rc);
-            let run = part;
-            let rctx = 256;
-            while (part == 3) {
-                part = model_run[rctx].ModelDecode(stream, rc);
-                rctx = 257;
-                run += part;
-            }
-            for (let j = 1; j <= run; j++) {
-                output[i + j] = output[i];
-            }
-            i += run + 1;
-        }
-        return output;
-    }
-    // ----------------------------------------------------------------------
-    // Pack method
-    decodePackMeta(stream) {
-        this.nsym = stream.ReadByte();
-        const M = new Array(this.nsym);
-        for (let i = 0; i < this.nsym; i++) {
-            M[i] = stream.ReadByte();
-        }
-        const e_len = stream.ReadUint7(); // Could be derived data from nsym and n_out
-        return [M, e_len];
-    }
-    decodePack(data, M, len) {
-        const out = new Uint8Array(len);
-        if (this.nsym <= 1) {
-            // Constant value
-            for (var i = 0; i < len; i++) {
-                out[i] = M[0];
-            }
-        }
-        else if (this.nsym <= 2) {
-            // 1 bit per value
-            for (var i = 0, j = 0; i < len; i++) {
-                if (i % 8 == 0) {
-                    var v = data[j++];
-                }
-                out[i] = M[v & 1];
-                v >>= 1;
-            }
-        }
-        else if (this.nsym <= 4) {
-            // 2 bits per value
-            for (var i = 0, j = 0; i < len; i++) {
-                if (i % 4 == 0) {
-                    var v = data[j++];
-                }
-                out[i] = M[v & 3];
-                v >>= 2;
-            }
-        }
-        else if (this.nsym <= 16) {
-            // 4 bits per value
-            for (var i = 0, j = 0; i < len; i++) {
-                if (i % 2 == 0) {
-                    var v = data[j++];
-                }
-                out[i] = M[v & 15];
-                v >>= 4;
-            }
-        }
-        else {
-            // 8 bits per value: NOP
-            return data;
-        }
-        return out;
-    }
-    // Compute M array and return meta-data stream
-    packMeta(src) {
-        const stream = new IOStream('', 0, 1024);
-        // Count symbols
-        const M = new Array(256);
-        for (var i = 0; i < src.length; i++) {
-            M[src[i]] = 1;
-        }
-        // Write Map
-        for (var nsym = 0, i = 0; i < 256; i++) {
-            if (M[i]) {
-                M[i] = ++nsym;
-            }
-        } // map to 1..N
-        stream.WriteByte(nsym);
-        // FIXME: add check for nsym > 16?
-        // Or just accept it as an inefficient waste of time.
-        for (var i = 0; i < 256; i++) {
-            if (M[i]) {
-                stream.WriteByte(i); // adjust to 0..N-1
-                M[i]--;
-            }
-        }
-        return [stream, M, nsym];
-    }
-    decodeStripe(stream, len) {
-        const N = stream.ReadByte();
-        // Retrieve lengths
-        const clen = new Array(N);
-        const ulen = new Array(N);
-        for (var j = 0; j < N; j++) {
-            clen[j] = stream.ReadUint7();
-        }
-        // Decode streams
-        const T = new Array(N);
-        for (var j = 0; j < N; j++) {
-            ulen[j] = Math.floor(len / N) + (len % N > j);
-            T[j] = this.decodeStream(stream, ulen[j]);
-        }
-        // Transpose
-        const out = new Uint8Array(len);
-        for (var j = 0; j < N; j++) {
-            for (let i = 0; i < ulen[j]; i++) {
-                out[i * N + j] = T[j][i];
-            }
-        }
-        return out;
-    }
-    // ----------------------------------------------------------------------
-    // Cat method
-    decodeCat(stream, len) {
-        const out = new Uint8Array(len);
-        for (let i = 0; i < len; i++) {
-            out[i] = stream.ReadByte();
-        }
-        return out;
-    }
-}
-//# sourceMappingURL=arith_gen.js.map

package/esm/htscodecs/arith_gen.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"arith_gen.js","sourceRoot":"","sources":["../../src/htscodecs/arith_gen.ts"],"names":[],"mappings":"AAAA,2BAA2B;AAC3B,cAAc;AAEd;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,uBAAuB,CAAA;AAE9C,OAAO,UAAU,MAAM,eAAe,CAAA;AACtC,OAAO,SAAS,MAAM,iBAAiB,CAAA;AACvC,OAAO,QAAQ,MAAM,eAAe,CAAA;AAGpC,MAAM,WAAW,GAAG,CAAC,CAAA;AACrB,MAAM,SAAS,GAAG,CAAC,CAAA;AACnB,MAAM,YAAY,GAAG,CAAC,CAAA;AACtB,MAAM,YAAY,GAAG,EAAE,CAAA;AACvB,MAAM,SAAS,GAAG,EAAE,CAAA;AACpB,MAAM,SAAS,GAAG,EAAE,CAAA;AACpB,MAAM,UAAU,GAAG,GAAG,CAAA;AAEtB,MAAM,CAAC,OAAO,OAAO,aAAa;IAEhC,MAAM,CAAC,GAAe;QACpB,IAAI,CAAC,MAAM,GAAG,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAA;QAC/B,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;IACvC,CAAC;IAED,YAAY,CAAC,MAAgB,EAAE,KAAK,GAAG,CAAC;QACtC,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAA;QACpC,IAAI,CAAC,CAAC,KAAK,GAAG,YAAY,CAAC,EAAE,CAAC;YAC5B,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAA;QACjC,CAAC;QACD,IAAI,KAAK,GAAG,KAAK,CAAA;QAEjB,MAAM,KAAK,GAAG,KAAK,GAAG,WAAW,CAAA;QAEjC,kBAAkB;QAClB,IAAI,KAAK,GAAG,YAAY,EAAE,CAAC;YACzB,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;QAC9C,CAAC;QAED,YAAY;QACZ,IAAI,KAAK,GAAG,UAAU,EAAE,CAAC;YACvB,IAAI,CAAC,CACJ;YAAA,CAAC,CAAC,EAAE,KAAK,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;QAChD,CAAC;QAED,8BAA8B;QAC9B,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;YACtB,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;QAC/C,CAAC;QACD,iBAAiB;aACZ,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;YAC3B,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;QAC/C,CAAC;aAAM,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;YAC7B,IAAI,IAAI,GAAG,KAAK;gBACd,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC;gBACrC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;QACzC,CAAC;aAAM,CAAC;YACN,IAAI,IAAI,GAAG,KAAK;gBACd,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC;gBAClC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;QACtC,CAAC;QAED,aAAa;QACb,IAAI,KAAK,GAAG,UAAU,EAAE,CAAC;YACvB,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,CAAC,CAAA;QACxC,CAAC;QAED,OAAO,IAAI,CAAA;IACb,CAAC;IAED,yEAAyE;IACzE,gBAAgB;IAChB,OAAO,CAAC,MAAM,EAAE,KAAK;QACnB,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,CAAA;QAEpC,IAAI,OAAO,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAA;QAC/B,IAAI,OAAO,IAAI,CAAC,EAAE,CAAC;YACjB,OAAO,GAAG,GAAG,CAAA;QACf,CAAC;QAED,MAAM,UAAU,GAAG,IAAI,SAAS,CAAC,OAAO,CAAC,CAAA;QAEzC,MAAM,EAAE,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,CAAA;QACjC,EAAE,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAA;QAE3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,MAAM,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,WAAW,CAAC,MAAM,EAAE,EAAE,CAAC,CAAA;QAChD,CAAC;QAED,OAAO,MAAM,CAAA;IACf,CAAC;IAED,yEAAyE;IACzE,gBAAgB;IAEhB,OAAO,CAAC,MAAM,EAAE,KAAK;QACnB,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,CAAA;QAEpC,IAAI,OAAO,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAA;QAC/B,IAAI,OAAO,IAAI,CAAC,EAAE,CAAC;YACjB,OAAO,GAAG,GAAG,CAAA;QACf,CAAC;QAED,MAAM,UAAU,GAAG,IAAI,KAAK,CAAC,OAAO,CAAC,CAAA;QACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI,SAAS,CAAC,OAAO,CAAC,CAAA;QACxC,CAAC;QAED,MAAM,EAAE,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,CAAA;QACjC,EAAE,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAA;QAE3B,IAAI,IAAI,GAAG,CAAC,CAAA;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,MAAM,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,WAAW,CAAC,MAAM,EAAE,EAAE,CAAC,CAAA;YACpD,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAA;QAClB,CAAC;QAED,OAAO,MAAM,CAAA;IACf,CAAC;IAED,yEAAyE;IACzE,iBAAiB;IACjB,SAAS,CAAC,MAAM,EAAE,KAAK;QACrB,OAAO,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAA;IAC7C,CAAC;IAED,yEAAyE;IACzE,oBAAoB;IACpB,UAAU,CAAC,MAAM,EAAE,KAAK;QACtB,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,CAAA;QAEpC,IAAI,OAAO,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAA;QAC/B,IAAI,OAAO,IAAI,CAAC,EAAE,CAAC;YACjB,OAAO,GAAG,GAAG,CAAA;QACf,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,SAAS,CAAC,OAAO,CAAC,CAAA;QACxC,MAAM,SAAS,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,CAAA;QAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,SAAS,CAAC,CAAC,CAAC,GAAG,IAAI,SAAS,CAAC,CAAC,CAAC,CAAA;QACjC,CAAC;QAED,MAAM,EAAE,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,CAAA;QACjC,EAAE,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAA;QAE3B,IAAI,CAAC,GAAG,CAAC,CAAA;QACT,OAAO,CAAC,GAAG,KAAK,EAAE,CAAC;YACjB,MAAM,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,WAAW,CAAC,MAAM,EAAE,EAAE,CAAC,CAAA;YAC7C,IAAI,IAAI,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,EAAE,EAAE,CAAC,CAAA;YACvD,IAAI,GAAG,GAAG,IAAI,CAAA;YACd,IAAI,IAAI,GAAG,GAAG,CAAA;YACd,OAAO,IAAI,IAAI,CAAC,EAAE,CAAC;gBACjB,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC,WAAW,CAAC,MAAM,EAAE,EAAE,CAAC,CAAA;gBAC9C,IAAI,GAAG,GAAG,CAAA;gBACV,GAAG,IAAI,IAAI,CAAA;YACb,CAAC;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9B,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAA;YAC3B,CAAC;YACD,CAAC,IAAI,GAAG,GAAG,CAAC,CAAA;QACd,CAAC;QAED,OAAO,MAAM,CAAA;IACf,CAAC;IAED,yEAAyE;IACzE,oBAAoB;IAEpB,UAAU,CAAC,MAAM,EAAE,KAAK;QACtB,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,CAAA;QAEpC,IAAI,OAAO,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAA;QAC/B,IAAI,OAAO,IAAI,CAAC,EAAE,CAAC;YACjB,OAAO,GAAG,GAAG,CAAA;QACf,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,KAAK,CAAC,OAAO,CAAC,CAAA;QACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,SAAS,CAAC,CAAC,CAAC,GAAG,IAAI,SAAS,CAAC,OAAO,CAAC,CAAA;QACvC,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,CAAA;QAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,SAAS,CAAC,CAAC,CAAC,GAAG,IAAI,SAAS,CAAC,CAAC,CAAC,CAAA;QACjC,CAAC;QAED,MAAM,EAAE,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,CAAA;QACjC,EAAE,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAA;QAE3B,IAAI,IAAI,GAAG,CAAC,CAAA;QACZ,IAAI,CAAC,GAAG,CAAC,CAAA;QACT,OAAO,CAAC,GAAG,KAAK,EAAE,CAAC;YACjB,MAAM,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC,WAAW,CAAC,MAAM,EAAE,EAAE,CAAC,CAAA;YACnD,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAA;YAChB,IAAI,IAAI,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,EAAE,EAAE,CAAC,CAAA;YACvD,IAAI,GAAG,GAAG,IAAI,CAAA;YACd,IAAI,IAAI,GAAG,GAAG,CAAA;YACd,OAAO,IAAI,IAAI,CAAC,EAAE,CAAC;gBACjB,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC,WAAW,CAAC,MAAM,EAAE,EAAE,CAAC,CAAA;gBAC9C,IAAI,GAAG,GAAG,CAAA;gBACV,GAAG,IAAI,IAAI,CAAA;YACb,CAAC;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9B,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAA;YAC3B,CAAC;YACD,CAAC,IAAI,GAAG,GAAG,CAAC,CAAA;QACd,CAAC;QAED,OAAO,MAAM,CAAA;IACf,CAAC;IAED,yEAAyE;IACzE,cAAc;IACd,cAAc,CAAC,MAAM;QACnB,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAA;QAE7B,MAAM,CAAC,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAA;QAC1B,CAAC;QAED,MAAM,KAAK,GAAG,MAAM,CAAC,SAAS,EAAE,CAAA,CAAC,4CAA4C;QAE7E,OAAO,CAAC,CAAC,EAAE,KAAK,CAAC,CAAA;IACnB,CAAC;IAED,UAAU,CAAC,IAAI,EAAE,CAAC,EAAE,GAAG;QACrB,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,CAAA;QAE/B,IAAI,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC;YACnB,iBAAiB;YACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7B,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;YACf,CAAC;QACH,CAAC;aAAM,IAAI,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC;YAC1B,kBAAkB;YAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBACpC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBACf,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC,CAAA;gBACnB,CAAC;gBACD,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;gBACjB,CAAC,KAAK,CAAC,CAAA;YACT,CAAC;QACH,CAAC;aAAM,IAAI,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC;YAC1B,mBAAmB;YACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBACpC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBACf,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC,CAAA;gBACnB,CAAC;gBACD,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;gBACjB,CAAC,KAAK,CAAC,CAAA;YACT,CAAC;QACH,CAAC;aAAM,IAAI,IAAI,CAAC,IAAI,IAAI,EAAE,EAAE,CAAC;YAC3B,mBAAmB;YACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBACpC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBACf,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC,CAAA;gBACnB,CAAC;gBACD,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAA;gBAClB,CAAC,KAAK,CAAC,CAAA;YACT,CAAC;QACH,CAAC;aAAM,CAAC;YACN,wBAAwB;YACxB,OAAO,IAAI,CAAA;QACb,CAAC;QAED,OAAO,GAAG,CAAA;IACZ,CAAC;IAED,8CAA8C;IAC9C,QAAQ,CAAC,GAAG;QACV,MAAM,MAAM,GAAG,IAAI,QAAQ,CAAC,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC,CAAA;QAExC,gBAAgB;QAChB,MAAM,CAAC,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,CAAA;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;QACf,CAAC;QAED,YAAY;QACZ,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACT,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,CAAA;YACf,CAAC;QACH,CAAC,CAAC,cAAc;QAChB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,CAAA;QAEtB,kCAAkC;QAClC,qDAAqD;QACrD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACT,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA,CAAC,mBAAmB;gBACvC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA;YACR,CAAC;QACH,CAAC;QAED,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,IAAI,CAAC,CAAA;IAC1B,CAAC;IAED,YAAY,CAAC,MAAM,EAAE,GAAG;QACtB,MAAM,CAAC,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAA;QAE3B,mBAAmB;QACnB,MAAM,IAAI,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAA;QACzB,MAAM,IAAI,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAA;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,SAAS,EAAE,CAAA;QAC9B,CAAC;QAED,iBAAiB;QACjB,MAAM,CAAC,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAA;QACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;YAC7C,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;QAC3C,CAAC;QAED,YAAY;QACZ,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,CAAA;QAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACjC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YAC1B,CAAC;QACH,CAAC;QAED,OAAO,GAAG,CAAA;IACZ,CAAC;IAED,yEAAyE;IACzE,aAAa;IACb,SAAS,CAAC,MAAM,EAAE,GAAG;QACnB,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,CAAA;QAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,GAAG,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAA;QAC5B,CAAC;QAED,OAAO,GAAG,CAAA;IACZ,CAAC;CACF"}

package/esm/htscodecs/arith_sh.d.ts

@@ -1,9 +0,0 @@
-export default class RangeCoder {
-    constructor(src: any);
-    RangeStartDecode(src: any): void;
-    RangeGetFrequency(tot_freq: any): number;
-    RangeDecode(src: any, sym_low: any, sym_freq: any, tot_freq: any): void;
-    RangeShiftLow(dst: any): void;
-    RangeEncode(dst: any, sym_low: any, sym_freq: any, tot_freq: any): void;
-    RangeFinishEncode(dst: any): void;
-}

package/esm/htscodecs/arith_sh.js

@@ -1,131 +0,0 @@
-// @ts-nocheck
-/*
- * Copyright (c) 2019 Genome Research Ltd.
- * Author(s): James Bonfield
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *    1. Redistributions of source code must retain the above copyright notice,
- *       this list of conditions and the following disclaimer.
- *
- *    2. Redistributions in binary form must reproduce the above
- *       copyright notice, this list of conditions and the following
- *       disclaimer in the documentation and/or other materials provided
- *       with the distribution.
- *
- *    3. Neither the names Genome Research Ltd and Wellcome Trust Sanger
- *       Institute nor the names of its contributors may be used to endorse
- *       or promote products derived from this software without specific
- *       prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY GENOME RESEARCH LTD AND CONTRIBUTORS "AS
- * IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
- * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
- * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL GENOME RESEARCH
- * LTD OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
- * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
- * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-// An arithmetic coder, based on Eugene Shelwien's reimplementation of
-// Michael Schindler range coder.
-//
-// Order-0 byte stream of ~/scratch/data/q40b
-// C:              3.1s decode  (approx same vs 32-bit and 64-bit)
-// Arith_sh.js     6.7s decode  (32-bit with carries)
-// Arith.js      317.0s decode  (64-bit no carries); int64 crippling it.
-// ----------------------------------------------------------------------
-// Arithmetic (range) coder
-export default class RangeCoder {
-    constructor(src) {
-        this.low = 0;
-        this.range = 0xffffffff;
-        this.code = 0;
-        this.FFnum = 0;
-        this.carry = 0;
-        this.cache = 0;
-    }
-    RangeStartDecode(src) {
-        for (let i = 0; i < 5; i++) {
-            this.code = (this.code << 8) + src.ReadByte();
-        }
-        this.code &= 0xffffffff;
-        this.code >>>= 0; // force to be +ve int
-    }
-    RangeGetFrequency(tot_freq) {
-        this.range = Math.floor(this.range / tot_freq);
-        // return this.code / this.range;
-        return Math.floor(this.code / this.range);
-        // Conceptual scenario; return freq only and don't modify range yet
-        // return Math.floor(this.code / (Math.floor(this.range / tot_freq)));
-    }
-    RangeDecode(src, sym_low, sym_freq, tot_freq) {
-        // Conceptually we divide range here, but in practice we cached it earlier
-        // this.range = Math.floor(this.range / tot_freq);
-        this.code -= sym_low * this.range;
-        this.range *= sym_freq;
-        while (this.range < 1 << 24) {
-            this.range *= 256;
-            this.code = this.code * 256 + src.ReadByte();
-        }
-    }
-    RangeShiftLow(dst) {
-        // We know range is < (1<<24) as we got here.  We already have a
-        // cached copy of 8 bits from low.  Is this correct, or does it need
-        // fixing?  Possible scenarios.
-        // 1. Low < 0xff000000 thus low+range < 0xffffffff and cache
-        //    cannot possibly change.  Output cache and as many ffs as needed.
-        // 2. We already detected an overflow in RangeEncode, setting carry.
-        //    In this case output cached byte + 1 and any 00s needed.
-        // 3. Neither case - range is low but we haven't yet detected if we're
-        //    XXffffff or XY000000 scenario.  Increase counter for ff/00s.
-        if ((this.low < 0xff000000) | this.carry) {
-            // cached byte if no overflow, byte+1 otherwise
-            dst.WriteByte(this.cache + this.carry);
-            // Flush any tracked FFs (no carry) or 00s (carry).
-            while (this.FFnum) {
-                dst.WriteByte(this.carry - 1);
-                this.FFnum--;
-            }
-            // Take a copy of top byte ready for next flush
-            this.cache = this.low >>> 24;
-            this.carry = 0;
-        }
-        else {
-            this.FFnum++; // keep track of number of trailing ff/00 bytes to write
-        }
-        this.low <<= 8;
-        this.low >>>= 0; // force to be +ve int
-    }
-    RangeEncode(dst, sym_low, sym_freq, tot_freq) {
-        const old_low = this.low;
-        this.range = Math.floor(this.range / tot_freq);
-        this.low += sym_low * this.range;
-        this.low >>>= 0; // Truncate to +ve int so we can spot overflow
-        this.range *= sym_freq;
-        // "low + sym*range < old_low" means we overflow; set carry.
-        // NB: can this.low < old_low occur twice before range < (1<<24)?
-        // We claim not, but prove it!
-        if (this.low < old_low) {
-            if (this.carry != 0) {
-                console.log('ERROR: Multiple carry');
-            }
-            this.carry = 1;
-        }
-        // Renormalise if range gets too small
-        while (this.range < 1 << 24) {
-            this.range *= 256;
-            this.RangeShiftLow(dst);
-        }
-    }
-    RangeFinishEncode(dst) {
-        for (let i = 0; i < 5; i++) {
-            this.RangeShiftLow(dst);
-        }
-    }
-}
-//# sourceMappingURL=arith_sh.js.map

package/esm/htscodecs/arith_sh.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"arith_sh.js","sourceRoot":"","sources":["../../src/htscodecs/arith_sh.ts"],"names":[],"mappings":"AAAA,cAAc;AAEd;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AAEH,sEAAsE;AACtE,iCAAiC;AACjC,EAAE;AACF,6CAA6C;AAC7C,kEAAkE;AAClE,qDAAqD;AACrD,wEAAwE;AAExE,yEAAyE;AACzE,2BAA2B;AAC3B,MAAM,CAAC,OAAO,OAAO,UAAU;IAC7B,YAAY,GAAG;QACb,IAAI,CAAC,GAAG,GAAG,CAAC,CAAA;QACZ,IAAI,CAAC,KAAK,GAAG,UAAU,CAAA;QACvB,IAAI,CAAC,IAAI,GAAG,CAAC,CAAA;QACb,IAAI,CAAC,KAAK,GAAG,CAAC,CAAA;QACd,IAAI,CAAC,KAAK,GAAG,CAAC,CAAA;QACd,IAAI,CAAC,KAAK,GAAG,CAAC,CAAA;IAChB,CAAC;IAED,gBAAgB,CAAC,GAAG;QAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAA;QAC/C,CAAC;QACD,IAAI,CAAC,IAAI,IAAI,UAAU,CAAA;QACvB,IAAI,CAAC,IAAI,MAAM,CAAC,CAAA,CAAC,sBAAsB;IACzC,CAAC;IAED,iBAAiB,CAAC,QAAQ;QACxB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC,CAAA;QAC9C,iCAAiC;QACjC,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAA;QAEzC,mEAAmE;QACnE,sEAAsE;IACxE,CAAC;IAED,WAAW,CAAC,GAAG,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ;QAC1C,0EAA0E;QAC1E,kDAAkD;QAElD,IAAI,CAAC,IAAI,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,CAAA;QACjC,IAAI,CAAC,KAAK,IAAI,QAAQ,CAAA;QAEtB,OAAO,IAAI,CAAC,KAAK,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC;YAC5B,IAAI,CAAC,KAAK,IAAI,GAAG,CAAA;YACjB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,GAAG,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAA;QAC9C,CAAC;IACH,CAAC;IAED,aAAa,CAAC,GAAG;QACf,gEAAgE;QAChE,oEAAoE;QACpE,+BAA+B;QAC/B,4DAA4D;QAC5D,sEAAsE;QACtE,oEAAoE;QACpE,6DAA6D;QAC7D,sEAAsE;QACtE,kEAAkE;QAElE,IAAI,CAAC,IAAI,CAAC,GAAG,GAAG,UAAU,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;YACzC,+CAA+C;YAC/C,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAA;YAEtC,mDAAmD;YACnD,OAAO,IAAI,CAAC,KAAK,EAAE,CAAC;gBAClB,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAA;gBAC7B,IAAI,CAAC,KAAK,EAAE,CAAA;YACd,CAAC;YAED,+CAA+C;YAC/C,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,KAAK,EAAE,CAAA;YAC5B,IAAI,CAAC,KAAK,GAAG,CAAC,CAAA;QAChB,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,KAAK,EAAE,CAAA,CAAC,wDAAwD;QACvE,CAAC;QACD,IAAI,CAAC,GAAG,KAAK,CAAC,CAAA;QACd,IAAI,CAAC,GAAG,MAAM,CAAC,CAAA,CAAC,sBAAsB;IACxC,CAAC;IAED,WAAW,CAAC,GAAG,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ;QAC1C,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAA;QACxB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC,CAAA;QAC9C,IAAI,CAAC,GAAG,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,CAAA;QAChC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAA,CAAC,8CAA8C;QAC9D,IAAI,CAAC,KAAK,IAAI,QAAQ,CAAA;QAEtB,4DAA4D;QAC5D,iEAAiE;QACjE,8BAA8B;QAC9B,IAAI,IAAI,CAAC,GAAG,GAAG,OAAO,EAAE,CAAC;YACvB,IAAI,IAAI,CAAC,KAAK,IAAI,CAAC,EAAE,CAAC;gBACpB,OAAO,CAAC,GAAG,CAAC,uBAAuB,CAAC,CAAA;YACtC,CAAC;YACD,IAAI,CAAC,KAAK,GAAG,CAAC,CAAA;QAChB,CAAC;QAED,sCAAsC;QACtC,OAAO,IAAI,CAAC,KAAK,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC;YAC5B,IAAI,CAAC,KAAK,IAAI,GAAG,CAAA;YACjB,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAA;QACzB,CAAC;IACH,CAAC;IAED,iBAAiB,CAAC,GAAG;QACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAA;QACzB,CAAC;IACH,CAAC;CACF"}

package/esm/htscodecs/byte_model.d.ts

@@ -1,6 +0,0 @@
-export default class ByteModel {
-    constructor(max_sym?: number);
-    ModelDecode(src: any, rc: any): any;
-    ModelRenormalise(): void;
-    ModelEncode(dst: any, rc: any, sym: any): void;
-}

package/esm/htscodecs/byte_model.js

@@ -1,118 +0,0 @@
-/* eslint-disable no-var */
-// @ts-nocheck
-/*
- * Copyright (c) 2019 Genome Research Ltd.
- * Author(s): James Bonfield
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *    1. Redistributions of source code must retain the above copyright notice,
- *       this list of conditions and the following disclaimer.
- *
- *    2. Redistributions in binary form must reproduce the above
- *       copyright notice, this list of conditions and the following
- *       disclaimer in the documentation and/or other materials provided
- *       with the distribution.
- *
- *    3. Neither the names Genome Research Ltd and Wellcome Trust Sanger
- *       Institute nor the names of its contributors may be used to endorse
- *       or promote products derived from this software without specific
- *       prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY GENOME RESEARCH LTD AND CONTRIBUTORS "AS
- * IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
- * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
- * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL GENOME RESEARCH
- * LTD OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
- * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
- * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-// An adaptive probability model for encoding and decoding of symbols
-// within a given alphabet, using the range coder to get/put the
-// compressed data.
-const MAX_FREQ = (1 << 16) - 17;
-const STEP = 16;
-export default class ByteModel {
-    constructor(max_sym = 256) {
-        this.total_freq = max_sym;
-        this.max_sym = max_sym - 1;
-        this.S = [];
-        this.F = [];
-        for (let i = 0; i <= this.max_sym; i++) {
-            this.S[i] = i;
-            this.F[i] = 1;
-        }
-    }
-    ModelDecode(src, rc) {
-        // Find symbol
-        const freq = rc.RangeGetFrequency(this.total_freq);
-        // Linear scan to find cumulative frequency 'freq'
-        let acc = 0;
-        let x = 0;
-        while (acc + this.F[x] <= freq) {
-            acc += this.F[x++];
-        }
-        //	for (var acc = 0; (acc += this.F[x]) <= freq; x++)
-        //	    ;
-        //	acc -= this.F[x];
-        // Update range coder
-        rc.RangeDecode(src, acc, this.F[x], this.total_freq);
-        // Update model
-        this.F[x] += STEP;
-        this.total_freq += STEP;
-        if (this.total_freq > MAX_FREQ) {
-            this.ModelRenormalise();
-        }
-        // Keep symbols approximately frequency sorted
-        const sym = this.S[x];
-        if (x > 0 && this.F[x] > this.F[x - 1]) {
-            let tmp = this.F[x];
-            this.F[x] = this.F[x - 1];
-            this.F[x - 1] = tmp;
-            tmp = this.S[x];
-            this.S[x] = this.S[x - 1];
-            this.S[x - 1] = tmp;
-        }
-        return sym;
-    }
-    ModelRenormalise() {
-        // Halve all the frequencies, being careful not to hit zero
-        this.total_freq = 0;
-        for (let i = 0; i <= this.max_sym; i++) {
-            this.F[i] -= Math.floor(this.F[i] / 2);
-            this.total_freq += this.F[i];
-        }
-    }
-    ModelEncode(dst, rc, sym) {
-        // Find cumulative frequency
-        let acc = 0;
-        for (var x = 0; this.S[x] != sym; x++) {
-            acc += this.F[x];
-        }
-        // Encode
-        rc.RangeEncode(dst, acc, this.F[x], this.total_freq);
-        // Update model
-        this.F[x] += STEP;
-        this.total_freq += STEP;
-        if (this.total_freq > MAX_FREQ) {
-            // FIXME x2
-            this.ModelRenormalise();
-        }
-        // Keep symbols approximately frequency sorted
-        var sym = this.S[x];
-        if (x > 0 && this.F[x] > this.F[x - 1]) {
-            let tmp = this.F[x];
-            this.F[x] = this.F[x - 1];
-            this.F[x - 1] = tmp;
-            tmp = this.S[x];
-            this.S[x] = this.S[x - 1];
-            this.S[x - 1] = tmp;
-        }
-    }
-}
-//# sourceMappingURL=byte_model.js.map