@gmod/cram 3.0.6 → 4.0.0

package/dist/htscodecs/arith_sh.js

@@ -0,0 +1,128 @@
+"use strict";
+/*
+ * 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
+module.exports = 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 (var 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) {
+        var 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 (var i = 0; i < 5; i++)
+            this.RangeShiftLow(dst);
+    }
+};
+//# sourceMappingURL=arith_sh.js.map

package/dist/htscodecs/arith_sh.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"arith_sh.js","sourceRoot":"","sources":["../../src/htscodecs/arith_sh.js"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AAEH,sEAAsE;AACtE,iCAAiC;AACjC,EAAE;AACF,6CAA6C;AAC7C,kEAAkE;AAClE,qDAAqD;AACrD,wEAAwE;AAExE,wEAAwE;AACxE,2BAA2B;AAC3B,MAAM,CAAC,OAAO,GAAG,MAAM,UAAU;IAC/B,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;YAAE,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAA;QACzE,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,gCAAgC;QAChC,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAA;QAEzC,mEAAmE;QACnE,qEAAqE;IACvE,CAAC;IAED,WAAW,CAAC,GAAG,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ;QAC1C,0EAA0E;QAC1E,iDAAiD;QAEjD,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,IAAI,OAAO,GAAG,IAAI,CAAC,GAAG,CAAA;QACtB,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;gBAAE,OAAO,CAAC,GAAG,CAAC,uBAAuB,CAAC,CAAA;YACzD,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;YAAE,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAA;IACrD,CAAC;CACF,CAAA"}

package/dist/htscodecs/byte_model.d.ts

@@ -0,0 +1,11 @@
+export = ByteModel;
+declare class ByteModel {
+    constructor(max_sym?: number);
+    total_freq: number;
+    max_sym: number;
+    S: any[];
+    F: any[];
+    ModelDecode(src: any, rc: any): any;
+    ModelRenormalise(): void;
+    ModelEncode(dst: any, rc: any, sym: any): void;
+}

package/dist/htscodecs/byte_model.js

@@ -0,0 +1,113 @@
+"use strict";
+/*
+ * 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;
+module.exports = class ByteModel {
+    constructor(max_sym = 256) {
+        this.total_freq = max_sym;
+        this.max_sym = max_sym - 1;
+        this.S = new Array();
+        this.F = new Array();
+        for (var i = 0; i <= this.max_sym; i++) {
+            this.S[i] = i;
+            this.F[i] = 1;
+        }
+    }
+    ModelDecode(src, rc) {
+        // Find symbol
+        var freq = rc.RangeGetFrequency(this.total_freq);
+        // Linear scan to find cumulative frequency 'freq'
+        var acc = 0;
+        var 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
+        var sym = this.S[x];
+        if (x > 0 && this.F[x] > this.F[x - 1]) {
+            var 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 (var 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
+        var 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]) {
+            var 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

package/dist/htscodecs/byte_model.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"byte_model.js","sourceRoot":"","sources":["../../src/htscodecs/byte_model.js"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AAEH,qEAAqE;AACrE,gEAAgE;AAChE,mBAAmB;AAEnB,MAAM,QAAQ,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,CAAA;AAC/B,MAAM,IAAI,GAAG,EAAE,CAAA;AAEf,MAAM,CAAC,OAAO,GAAG,MAAM,SAAS;IAC9B,YAAY,OAAO,GAAG,GAAG;QACvB,IAAI,CAAC,UAAU,GAAG,OAAO,CAAA;QACzB,IAAI,CAAC,OAAO,GAAG,OAAO,GAAG,CAAC,CAAA;QAC1B,IAAI,CAAC,CAAC,GAAG,IAAI,KAAK,EAAE,CAAA;QACpB,IAAI,CAAC,CAAC,GAAG,IAAI,KAAK,EAAE,CAAA;QAEpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;YACb,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;QACf,CAAC;IACH,CAAC;IAED,WAAW,CAAC,GAAG,EAAE,EAAE;QACjB,cAAc;QACd,IAAI,IAAI,GAAG,EAAE,CAAC,iBAAiB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAA;QAEhD,kDAAkD;QAClD,IAAI,GAAG,GAAG,CAAC,CAAA;QACX,IAAI,CAAC,GAAG,CAAC,CAAA;QACT,OAAO,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI;YAAE,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;QAElD,qDAAqD;QACrD,QAAQ;QACR,oBAAoB;QAEpB,qBAAqB;QACrB,EAAE,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,CAAA;QAEpD,eAAe;QACf,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAA;QACjB,IAAI,CAAC,UAAU,IAAI,IAAI,CAAA;QACvB,IAAI,IAAI,CAAC,UAAU,GAAG,QAAQ;YAAE,IAAI,CAAC,gBAAgB,EAAE,CAAA;QAEvD,8CAA8C;QAC9C,IAAI,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QACnB,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;YACvC,IAAI,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YACnB,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;YACzB,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAA;YAEnB,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YACf,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;YACzB,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAA;QACrB,CAAC;QAED,OAAO,GAAG,CAAA;IACZ,CAAC;IAED,gBAAgB;QACd,2DAA2D;QAC3D,IAAI,CAAC,UAAU,GAAG,CAAC,CAAA;QACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;YACtC,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAC9B,CAAC;IACH,CAAC;IAED,WAAW,CAAC,GAAG,EAAE,EAAE,EAAE,GAAG;QACtB,4BAA4B;QAC5B,IAAI,GAAG,GAAG,CAAC,CAAA;QACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE;YAAE,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAEvD,SAAS;QACT,EAAE,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,CAAA;QAEpD,eAAe;QACf,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAA;QACjB,IAAI,CAAC,UAAU,IAAI,IAAI,CAAA;QACvB,IAAI,IAAI,CAAC,UAAU,GAAG,QAAQ;YAC5B,WAAW;YACX,IAAI,CAAC,gBAAgB,EAAE,CAAA;QAEzB,8CAA8C;QAC9C,IAAI,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QACnB,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;YACvC,IAAI,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YACnB,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;YACzB,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAA;YAEnB,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YACf,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;YACzB,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAA;QACrB,CAAC;IACH,CAAC;CACF,CAAA"}

package/dist/htscodecs/fqzcomp.d.ts

@@ -0,0 +1 @@
+export function decode(src: any, q_lens: any): Uint8Array<any> | undefined;

package/dist/htscodecs/fqzcomp.js

@@ -0,0 +1,325 @@
+"use strict";
+/*
+ * 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.
+ */
+const IOStream = require('./iostream');
+const ByteModel = require('./byte_model');
+const RangeCoder = require('./arith_sh');
+//----------------------------------------------------------------------
+// Main arithmetic entry function: decodes a compressed src and
+// returns the uncompressed buffer.
+function read_array(src, tab, size) {
+    var j = 0; // array value
+    var z = 0; // array index: tab[j]
+    var last = -1;
+    // Remove first level of run-length encoding
+    var R = new Array(1024); // runs
+    while (z < size) {
+        var run = src.ReadByte();
+        R[j++] = run;
+        z += run;
+        if (run == last) {
+            var copy = src.ReadByte();
+            z += run * copy;
+            while (copy--)
+                R[j++] = run;
+        }
+        last = run;
+    }
+    // Now expand runs in R to tab, noting 255 is max run
+    var i = 0;
+    j = 0;
+    z = 0;
+    while (z < size) {
+        var run_len = 0;
+        do {
+            var part = R[j++];
+            run_len += part;
+        } while (part == 255);
+        while (run_len--)
+            tab[z++] = i;
+        i++;
+    }
+}
+const QMAX = 256;
+const FLAG_DEDUP = 2;
+const FLAG_FLEN = 4;
+const FLAG_SEL = 8; // whether selector is used in context
+const FLAG_QMAP = 16;
+const FLAG_PTAB = 32;
+const FLAG_DTAB = 64;
+const FLAG_QTAB = 128;
+const GFLAG_MULTI_PARAM = 1;
+const GFLAG_HAVE_STAB = 2;
+const GFLAG_DO_REV = 4;
+// Compute a new context from our current state and qual q
+function fqz_update_ctx(params, state, q) {
+    var last = params.context;
+    state.qctx = (state.qctx << params.qshift) + params.qtab[q]; // >>> 0
+    last += (state.qctx & ((1 << params.qbits) - 1)) << params.qloc; // >>> 0
+    if (params.do_pos)
+        last += params.ptab[Math.min(state.p, 1023)] << params.ploc;
+    if (params.do_delta) {
+        last += params.dtab[Math.min(state.delta, 255)] << params.dloc;
+        // Is it better to use q here or qtab[q]?
+        // If qtab[q] we can map eg [a-z0-9A-Z]->0 ,->1 and have
+        // delta being a token number count into comma separated lists?
+        state.delta += state.prevq != q ? 1 : 0;
+        state.prevq = q;
+    }
+    if (params.do_sel)
+        last += state.s << params.sloc;
+    state.p--;
+    return last & 0xffff;
+}
+function decode_fqz_single_param(src) {
+    var p = {}; // params
+    // Load FQZ parameters
+    p.context = src.ReadUint16();
+    p.pflags = src.ReadByte();
+    p.do_dedup = p.pflags & FLAG_DEDUP;
+    p.fixed_len = p.pflags & FLAG_FLEN;
+    p.do_sel = p.pflags & FLAG_SEL;
+    p.do_qmap = p.pflags & FLAG_QMAP;
+    p.do_pos = p.pflags & FLAG_PTAB;
+    p.do_delta = p.pflags & FLAG_DTAB;
+    p.do_qtab = p.pflags & FLAG_QTAB;
+    p.max_sym = src.ReadByte();
+    var x = src.ReadByte();
+    p.qbits = x >> 4;
+    p.qshift = x & 15;
+    x = src.ReadByte();
+    p.qloc = x >> 4;
+    p.sloc = x & 15;
+    x = src.ReadByte();
+    p.ploc = x >> 4;
+    p.dloc = x & 15;
+    // Qual map, eg to "unbin" Illumina qualities
+    p.qmap = new Array(256);
+    if (p.pflags & FLAG_QMAP) {
+        for (var i = 0; i < p.max_sym; i++)
+            p.qmap[i] = src.ReadByte();
+    }
+    else {
+        // Useful optimisation to speed up main loop
+        for (var i = 0; i < 256; i++)
+            p.qmap[i] = i; // NOP
+    }
+    // Read tables
+    p.qtab = new Array(1024);
+    if (p.qbits > 0 && p.pflags & FLAG_QTAB) {
+        read_array(src, p.qtab, 256);
+    }
+    else {
+        // Useful optimisation to speed up main loop
+        for (var i = 0; i < 256; i++)
+            p.qtab[i] = i; // NOP
+    }
+    p.ptab = new Array(1024);
+    if (p.pflags & FLAG_PTAB)
+        read_array(src, p.ptab, 1024);
+    p.dtab = new Array(256);
+    if (p.pflags & FLAG_DTAB)
+        read_array(src, p.dtab, 256);
+    return p;
+}
+function decode_fqz_params(src) {
+    var gparams = {
+        max_sym: 0,
+    };
+    // Check fqz format version
+    var vers = src.ReadByte();
+    if (vers != 5) {
+        console.error('Invalid FQZComp version number');
+        return;
+    }
+    var gflags = src.ReadByte();
+    var nparam = gflags & GFLAG_MULTI_PARAM ? src.ReadByte() : 1;
+    var max_sel = gflags.nparam > 1 ? gflags.nparam - 1 : 0; // Note max_sel, not num_sel
+    var stab = new Array(256);
+    if (gflags & GFLAG_HAVE_STAB) {
+        max_sel = src.ReadByte();
+        read_array(src, stab, 256);
+    }
+    else {
+        for (var i = 0; i < nparam; i++)
+            stab[i] = i;
+        for (; i < 256; i++)
+            stab[i] = nparam - 1;
+    }
+    gparams.do_rev = gflags & GFLAG_DO_REV;
+    gparams.stab = stab;
+    gparams.max_sel = max_sel;
+    gparams.params = new Array(gparams.nparam);
+    for (var p = 0; p < nparam; p++) {
+        gparams.params[p] = decode_fqz_single_param(src);
+        if (gparams.max_sym < gparams.params[p].max_sym)
+            gparams.max_sym = gparams.params[p].max_sym;
+    }
+    return gparams;
+}
+function fqz_create_models(gparams) {
+    var model = {};
+    model.qual = new Array(1 << 16);
+    for (var i = 0; i < 1 << 16; i++)
+        model.qual[i] = new ByteModel(gparams.max_sym + 1); // +1 as max value not num. values
+    model.len = new Array(4);
+    for (var i = 0; i < 4; i++)
+        model.len[i] = new ByteModel(256);
+    model.rev = new ByteModel(2);
+    model.dup = new ByteModel(2);
+    if (gparams.max_sel > 0)
+        model.sel = new ByteModel(gparams.max_sel + 1); // +1 as max value not num. values
+    return model;
+}
+// Initialise a new record, updating state.
+// Returns 1 if dup, otherwise 0
+function decode_fqz_new_record(src, rc, gparams, model, state, rev) {
+    // Parameter selector
+    if (gparams.max_sel > 0) {
+        state.s = model.sel.ModelDecode(src, rc);
+    }
+    else {
+        state.s = 0;
+    }
+    state.x = gparams.stab[state.s];
+    var params = gparams.params[state.x];
+    // Reset contexts at the start of each new record
+    if (params.fixed_len >= 0) {
+        // Not fixed or fixed but first record
+        var len = model.len[0].ModelDecode(src, rc);
+        len |= model.len[1].ModelDecode(src, rc) << 8;
+        len |= model.len[2].ModelDecode(src, rc) << 16;
+        len |= model.len[3].ModelDecode(src, rc) << 24;
+        if (params.fixed_len > 0)
+            params.fixed_len = -len;
+    }
+    else {
+        len = -params.fixed_len;
+    }
+    state.len = len;
+    if (gparams.do_rev)
+        rev[state.rec] = model.rev.ModelDecode(src, rc);
+    state.is_dup = 0;
+    if (params.pflags & FLAG_DEDUP) {
+        if (model.dup.ModelDecode(src, rc))
+            state.is_dup = 1;
+    }
+    state.p = len; // number of remaining bytes in this record
+    state.delta = 0;
+    state.qctx = 0;
+    state.prevq = 0;
+    state.rec++;
+}
+function decode_fqz(src, q_lens) {
+    // Decode parameter block
+    var n_out = src.ReadUint7();
+    var gparams = decode_fqz_params(src);
+    if (!gparams)
+        return;
+    var params = gparams.params;
+    var rev = new Array(q_lens.length);
+    // Create initial models
+    var model = fqz_create_models(gparams);
+    // Create our entropy encoder and output buffers
+    var rc = new RangeCoder(src);
+    rc.RangeStartDecode(src);
+    var output = new Uint8Array(n_out);
+    // Internal FQZ state
+    var state = {
+        qctx: 0, // Qual-only sub-context
+        prevq: 0, // Previous quality value
+        delta: 0, // Running delta (q vs prevq)
+        p: 0, // Number of bases left in current record
+        s: 0, // Current parameter selector value (0 if unused)
+        x: 0, // "stab" tabulated copy of s
+        len: 0, // Length of current string
+        is_dup: 0, // This string is a duplicate of last
+        rec: 0, // Record number
+    };
+    // The main decode loop itself
+    var i = 0; // position in output buffer
+    while (i < n_out) {
+        if (state.p == 0) {
+            decode_fqz_new_record(src, rc, gparams, model, state, rev);
+            if (state.is_dup > 0) {
+                if (model.dup.ModelDecode(src, rc)) {
+                    // Duplicate of last line
+                    for (var x = 0; x < len; x++)
+                        output[i + x] = output[i + x - state.len];
+                    i += state.len;
+                    state.p = 0;
+                    continue;
+                }
+            }
+            q_lens.push(state.len);
+            var params = gparams.params[state.x];
+            var last = params.context;
+        }
+        // Decode the current quality (possibly mapped via qmap)
+        var Q = model.qual[last].ModelDecode(src, rc);
+        //if (params.do_qmap)
+        //    output[i++] = params.qmap[Q];
+        //else
+        //    output[i++] = Q
+        output[i++] = params.qmap[Q]; // optimised version of above
+        last = fqz_update_ctx(params, state, Q);
+    }
+    if (gparams.do_rev)
+        reverse_qualities(output, n_out, rev, q_lens);
+    return output;
+}
+function reverse_qualities(qual, qual_len, rev, len) {
+    var rec = 0;
+    var i = 0;
+    while (i < qual_len) {
+        if (rev[rec]) {
+            var j = 0;
+            var k = len[rec] - 1;
+            while (j < k) {
+                var tmp = qual[i + j];
+                qual[i + j] = qual[i + k];
+                qual[i + k] = tmp;
+                j++;
+                k--;
+            }
+        }
+        i += len[rec++];
+    }
+}
+function decode(src, q_lens) {
+    var stream = new IOStream(src);
+    //var n_out = stream.ReadUint32(); stream.ReadUint32(); // move to main
+    return decode_fqz(stream, q_lens);
+}
+module.exports = { decode };
+//# sourceMappingURL=fqzcomp.js.map

package/dist/htscodecs/fqzcomp.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fqzcomp.js","sourceRoot":"","sources":["../../src/htscodecs/fqzcomp.js"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AAEH,MAAM,QAAQ,GAAG,OAAO,CAAC,YAAY,CAAC,CAAA;AACtC,MAAM,SAAS,GAAG,OAAO,CAAC,cAAc,CAAC,CAAA;AACzC,MAAM,UAAU,GAAG,OAAO,CAAC,YAAY,CAAC,CAAA;AAExC,wEAAwE;AACxE,+DAA+D;AAC/D,mCAAmC;AAEnC,SAAS,UAAU,CAAC,GAAG,EAAE,GAAG,EAAE,IAAI;IAChC,IAAI,CAAC,GAAG,CAAC,CAAA,CAAC,cAAc;IACxB,IAAI,CAAC,GAAG,CAAC,CAAA,CAAC,sBAAsB;IAChC,IAAI,IAAI,GAAG,CAAC,CAAC,CAAA;IAEb,4CAA4C;IAC5C,IAAI,CAAC,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,CAAA,CAAC,OAAO;IAC/B,OAAO,CAAC,GAAG,IAAI,EAAE,CAAC;QAChB,IAAI,GAAG,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAA;QACxB,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAA;QACZ,CAAC,IAAI,GAAG,CAAA;QAER,IAAI,GAAG,IAAI,IAAI,EAAE,CAAC;YAChB,IAAI,IAAI,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAA;YACzB,CAAC,IAAI,GAAG,GAAG,IAAI,CAAA;YACf,OAAO,IAAI,EAAE;gBAAE,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAA;QAC7B,CAAC;QACD,IAAI,GAAG,GAAG,CAAA;IACZ,CAAC;IAED,qDAAqD;IACrD,IAAI,CAAC,GAAG,CAAC,CAAA;IACT,CAAC,GAAG,CAAC,CAAA;IACL,CAAC,GAAG,CAAC,CAAA;IACL,OAAO,CAAC,GAAG,IAAI,EAAE,CAAC;QAChB,IAAI,OAAO,GAAG,CAAC,CAAA;QACf,GAAG,CAAC;YACF,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;YACjB,OAAO,IAAI,IAAI,CAAA;QACjB,CAAC,QAAQ,IAAI,IAAI,GAAG,EAAC;QAErB,OAAO,OAAO,EAAE;YAAE,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAA;QAC9B,CAAC,EAAE,CAAA;IACL,CAAC;AACH,CAAC;AAED,MAAM,IAAI,GAAG,GAAG,CAAA;AAEhB,MAAM,UAAU,GAAG,CAAC,CAAA;AACpB,MAAM,SAAS,GAAG,CAAC,CAAA;AACnB,MAAM,QAAQ,GAAG,CAAC,CAAA,CAAC,sCAAsC;AACzD,MAAM,SAAS,GAAG,EAAE,CAAA;AACpB,MAAM,SAAS,GAAG,EAAE,CAAA;AACpB,MAAM,SAAS,GAAG,EAAE,CAAA;AACpB,MAAM,SAAS,GAAG,GAAG,CAAA;AAErB,MAAM,iBAAiB,GAAG,CAAC,CAAA;AAC3B,MAAM,eAAe,GAAG,CAAC,CAAA;AACzB,MAAM,YAAY,GAAG,CAAC,CAAA;AAEtB,0DAA0D;AAC1D,SAAS,cAAc,CAAC,MAAM,EAAE,KAAK,EAAE,CAAC;IACtC,IAAI,IAAI,GAAG,MAAM,CAAC,OAAO,CAAA;IACzB,KAAK,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,IAAI,MAAM,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA,CAAC,QAAQ;IACpE,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,IAAI,CAAA,CAAC,QAAQ;IAExE,IAAI,MAAM,CAAC,MAAM;QAAE,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,IAAI,MAAM,CAAC,IAAI,CAAA;IAE9E,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;QACpB,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,IAAI,MAAM,CAAC,IAAI,CAAA;QAC9D,yCAAyC;QACzC,wDAAwD;QACxD,+DAA+D;QAC/D,KAAK,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QACvC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAA;IACjB,CAAC;IAED,IAAI,MAAM,CAAC,MAAM;QAAE,IAAI,IAAI,KAAK,CAAC,CAAC,IAAI,MAAM,CAAC,IAAI,CAAA;IAEjD,KAAK,CAAC,CAAC,EAAE,CAAA;IAET,OAAO,IAAI,GAAG,MAAM,CAAA;AACtB,CAAC;AAED,SAAS,uBAAuB,CAAC,GAAG;IAClC,IAAI,CAAC,GAAG,EAAE,CAAA,CAAC,SAAS;IAEpB,sBAAsB;IACtB,CAAC,CAAC,OAAO,GAAG,GAAG,CAAC,UAAU,EAAE,CAAA;IAC5B,CAAC,CAAC,MAAM,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAA;IAEzB,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,MAAM,GAAG,UAAU,CAAA;IAClC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,MAAM,GAAG,SAAS,CAAA;IAClC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,GAAG,QAAQ,CAAA;IAC9B,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,MAAM,GAAG,SAAS,CAAA;IAChC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,GAAG,SAAS,CAAA;IAC/B,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,MAAM,GAAG,SAAS,CAAA;IACjC,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,MAAM,GAAG,SAAS,CAAA;IAEhC,CAAC,CAAC,OAAO,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAA;IAE1B,IAAI,CAAC,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAA;IACtB,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI,CAAC,CAAA;IAChB,CAAC,CAAC,MAAM,GAAG,CAAC,GAAG,EAAE,CAAA;IACjB,CAAC,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAA;IAClB,CAAC,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,CAAA;IACf,CAAC,CAAC,IAAI,GAAG,CAAC,GAAG,EAAE,CAAA;IACf,CAAC,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAA;IAClB,CAAC,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,CAAA;IACf,CAAC,CAAC,IAAI,GAAG,CAAC,GAAG,EAAE,CAAA;IAEf,6CAA6C;IAC7C,CAAC,CAAC,IAAI,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,CAAA;IACvB,IAAI,CAAC,CAAC,MAAM,GAAG,SAAS,EAAE,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC,EAAE;YAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAA;IAChE,CAAC;SAAM,CAAC;QACN,4CAA4C;QAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE;YAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA,CAAC,MAAM;IACpD,CAAC;IAED,cAAc;IACd,CAAC,CAAC,IAAI,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,CAAA;IACxB,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,SAAS,EAAE,CAAC;QACxC,UAAU,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;IAC9B,CAAC;SAAM,CAAC;QACN,4CAA4C;QAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE;YAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA,CAAC,MAAM;IACpD,CAAC;IAED,CAAC,CAAC,IAAI,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,CAAA;IACxB,IAAI,CAAC,CAAC,MAAM,GAAG,SAAS;QAAE,UAAU,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;IAEvD,CAAC,CAAC,IAAI,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,CAAA;IACvB,IAAI,CAAC,CAAC,MAAM,GAAG,SAAS;QAAE,UAAU,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;IAEtD,OAAO,CAAC,CAAA;AACV,CAAC;AAED,SAAS,iBAAiB,CAAC,GAAG;IAC5B,IAAI,OAAO,GAAG;QACZ,OAAO,EAAE,CAAC;KACX,CAAA;IAED,2BAA2B;IAC3B,IAAI,IAAI,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAA;IACzB,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC;QACd,OAAO,CAAC,KAAK,CAAC,gCAAgC,CAAC,CAAA;QAC/C,OAAM;IACR,CAAC;IAED,IAAI,MAAM,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAA;IAC3B,IAAI,MAAM,GAAG,MAAM,GAAG,iBAAiB,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;IAC5D,IAAI,OAAO,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA,CAAC,4BAA4B;IAEpF,IAAI,IAAI,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,CAAA;IACzB,IAAI,MAAM,GAAG,eAAe,EAAE,CAAC;QAC7B,OAAO,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAA;QACxB,UAAU,CAAC,GAAG,EAAE,IAAI,EAAE,GAAG,CAAC,CAAA;IAC5B,CAAC;SAAM,CAAC;QACN,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE;YAAE,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;QAC5C,OAAO,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE;YAAE,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,CAAA;IAC3C,CAAC;IACD,OAAO,CAAC,MAAM,GAAG,MAAM,GAAG,YAAY,CAAA;IACtC,OAAO,CAAC,IAAI,GAAG,IAAI,CAAA;IACnB,OAAO,CAAC,OAAO,GAAG,OAAO,CAAA;IAEzB,OAAO,CAAC,MAAM,GAAG,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAA;IAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,uBAAuB,CAAC,GAAG,CAAC,CAAA;QAChD,IAAI,OAAO,CAAC,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO;YAC7C,OAAO,CAAC,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAA;IAC/C,CAAC;IAED,OAAO,OAAO,CAAA;AAChB,CAAC;AAED,SAAS,iBAAiB,CAAC,OAAO;IAChC,IAAI,KAAK,GAAG,EAAE,CAAA;IAEd,KAAK,CAAC,IAAI,GAAG,IAAI,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC,CAAA;IAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE;QAC9B,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,SAAS,CAAC,OAAO,CAAC,OAAO,GAAG,CAAC,CAAC,CAAA,CAAC,kCAAkC;IAEvF,KAAK,CAAC,GAAG,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAA;IACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,SAAS,CAAC,GAAG,CAAC,CAAA;IAE7D,KAAK,CAAC,GAAG,GAAG,IAAI,SAAS,CAAC,CAAC,CAAC,CAAA;IAC5B,KAAK,CAAC,GAAG,GAAG,IAAI,SAAS,CAAC,CAAC,CAAC,CAAA;IAE5B,IAAI,OAAO,CAAC,OAAO,GAAG,CAAC;QAAE,KAAK,CAAC,GAAG,GAAG,IAAI,SAAS,CAAC,OAAO,CAAC,OAAO,GAAG,CAAC,CAAC,CAAA,CAAC,kCAAkC;IAE1G,OAAO,KAAK,CAAA;AACd,CAAC;AAED,2CAA2C;AAC3C,gCAAgC;AAChC,SAAS,qBAAqB,CAAC,GAAG,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG;IAChE,qBAAqB;IACrB,IAAI,OAAO,CAAC,OAAO,GAAG,CAAC,EAAE,CAAC;QACxB,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,WAAW,CAAC,GAAG,EAAE,EAAE,CAAC,CAAA;IAC1C,CAAC;SAAM,CAAC;QACN,KAAK,CAAC,CAAC,GAAG,CAAC,CAAA;IACb,CAAC;IACD,KAAK,CAAC,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;IAE/B,IAAI,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;IAEpC,iDAAiD;IACjD,IAAI,MAAM,CAAC,SAAS,IAAI,CAAC,EAAE,CAAC;QAC1B,sCAAsC;QACtC,IAAI,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,EAAE,CAAC,CAAA;QAC3C,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,CAAA;QAC7C,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,EAAE,CAAA;QAC9C,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,EAAE,CAAA;QAC9C,IAAI,MAAM,CAAC,SAAS,GAAG,CAAC;YAAE,MAAM,CAAC,SAAS,GAAG,CAAC,GAAG,CAAA;IACnD,CAAC;SAAM,CAAC;QACN,GAAG,GAAG,CAAC,MAAM,CAAC,SAAS,CAAA;IACzB,CAAC;IACD,KAAK,CAAC,GAAG,GAAG,GAAG,CAAA;IAEf,IAAI,OAAO,CAAC,MAAM;QAAE,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,WAAW,CAAC,GAAG,EAAE,EAAE,CAAC,CAAA;IAEnE,KAAK,CAAC,MAAM,GAAG,CAAC,CAAA;IAChB,IAAI,MAAM,CAAC,MAAM,GAAG,UAAU,EAAE,CAAC;QAC/B,IAAI,KAAK,CAAC,GAAG,CAAC,WAAW,CAAC,GAAG,EAAE,EAAE,CAAC;YAAE,KAAK,CAAC,MAAM,GAAG,CAAC,CAAA;IACtD,CAAC;IAED,KAAK,CAAC,CAAC,GAAG,GAAG,CAAA,CAAC,2CAA2C;IACzD,KAAK,CAAC,KAAK,GAAG,CAAC,CAAA;IACf,KAAK,CAAC,IAAI,GAAG,CAAC,CAAA;IACd,KAAK,CAAC,KAAK,GAAG,CAAC,CAAA;IACf,KAAK,CAAC,GAAG,EAAE,CAAA;AACb,CAAC;AAED,SAAS,UAAU,CAAC,GAAG,EAAE,MAAM;IAC7B,yBAAyB;IACzB,IAAI,KAAK,GAAG,GAAG,CAAC,SAAS,EAAE,CAAA;IAC3B,IAAI,OAAO,GAAG,iBAAiB,CAAC,GAAG,CAAC,CAAA;IACpC,IAAI,CAAC,OAAO;QAAE,OAAM;IACpB,IAAI,MAAM,GAAG,OAAO,CAAC,MAAM,CAAA;IAC3B,IAAI,GAAG,GAAG,IAAI,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;IAElC,wBAAwB;IACxB,IAAI,KAAK,GAAG,iBAAiB,CAAC,OAAO,CAAC,CAAA;IAEtC,gDAAgD;IAChD,IAAI,EAAE,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,CAAA;IAC5B,EAAE,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAA;IACxB,IAAI,MAAM,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,CAAA;IAElC,qBAAqB;IACrB,IAAI,KAAK,GAAG;QACV,IAAI,EAAE,CAAC,EAAE,wBAAwB;QACjC,KAAK,EAAE,CAAC,EAAE,yBAAyB;QACnC,KAAK,EAAE,CAAC,EAAE,6BAA6B;QACvC,CAAC,EAAE,CAAC,EAAE,yCAAyC;QAC/C,CAAC,EAAE,CAAC,EAAE,iDAAiD;QACvD,CAAC,EAAE,CAAC,EAAE,6BAA6B;QACnC,GAAG,EAAE,CAAC,EAAE,2BAA2B;QACnC,MAAM,EAAE,CAAC,EAAE,qCAAqC;QAChD,GAAG,EAAE,CAAC,EAAE,gBAAgB;KACzB,CAAA;IAED,8BAA8B;IAC9B,IAAI,CAAC,GAAG,CAAC,CAAA,CAAC,4BAA4B;IACtC,OAAO,CAAC,GAAG,KAAK,EAAE,CAAC;QACjB,IAAI,KAAK,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YACjB,qBAAqB,CAAC,GAAG,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC,CAAA;YAC1D,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACrB,IAAI,KAAK,CAAC,GAAG,CAAC,WAAW,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC;oBACnC,yBAAyB;oBACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE;wBAC1B,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAA;oBAC3C,CAAC,IAAI,KAAK,CAAC,GAAG,CAAA;oBACd,KAAK,CAAC,CAAC,GAAG,CAAC,CAAA;oBACX,SAAQ;gBACV,CAAC;YACH,CAAC;YACD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;YAEtB,IAAI,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;YACpC,IAAI,IAAI,GAAG,MAAM,CAAC,OAAO,CAAA;QAC3B,CAAC;QAED,wDAAwD;QACxD,IAAI,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,EAAE,CAAC,CAAA;QAE7C,qBAAqB;QACrB,mCAAmC;QACnC,MAAM;QACN,qBAAqB;QACrB,MAAM,CAAC,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA,CAAC,6BAA6B;QAC1D,IAAI,GAAG,cAAc,CAAC,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC,CAAA;IACzC,CAAC;IAED,IAAI,OAAO,CAAC,MAAM;QAAE,iBAAiB,CAAC,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,CAAC,CAAA;IAEjE,OAAO,MAAM,CAAA;AACf,CAAC;AAED,SAAS,iBAAiB,CAAC,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG;IACjD,IAAI,GAAG,GAAG,CAAC,CAAA;IACX,IAAI,CAAC,GAAG,CAAC,CAAA;IACT,OAAO,CAAC,GAAG,QAAQ,EAAE,CAAC;QACpB,IAAI,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACb,IAAI,CAAC,GAAG,CAAC,CAAA;YACT,IAAI,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;YACpB,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;gBACb,IAAI,GAAG,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;gBACrB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;gBACzB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAA;gBACjB,CAAC,EAAE,CAAA;gBACH,CAAC,EAAE,CAAA;YACL,CAAC;QACH,CAAC;QAED,CAAC,IAAI,GAAG,CAAC,GAAG,EAAE,CAAC,CAAA;IACjB,CAAC;AACH,CAAC;AAED,SAAS,MAAM,CAAC,GAAG,EAAE,MAAM;IACzB,IAAI,MAAM,GAAG,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAA;IAE9B,uEAAuE;IAEvE,OAAO,UAAU,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;AACnC,CAAC;AAED,MAAM,CAAC,OAAO,GAAG,EAAE,MAAM,EAAE,CAAA"}

package/dist/htscodecs/index.d.ts

@@ -0,0 +1,5 @@
+export function r4x8_uncompress(inputBuffer: any, outputBuffer: any): Uint8Array<any>;
+export function r4x16_uncompress(inputBuffer: any): any;
+export function arith_uncompress(inputBuffer: any): Uint8Array<any>;
+export function fqzcomp_uncompress(inputBuffer: any): Uint8Array<any> | undefined;
+export function tok3_uncompress(inputBuffer: any): Uint8Array<ArrayBuffer>;