@cloudbase/framework-plugin-low-code 0.4.42-alpha.2 → 0.4.45

package/template/node_modules/@zxing/library/cjs/core/common/BitMatrix.js

@@ -0,0 +1,490 @@
+"use strict";
+/*
+ * Copyright 2007 ZXing authors
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *      http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+/*namespace com.google.zxing.common {*/
+/*import java.util.Arrays;*/
+var BitArray_1 = require("./BitArray");
+var System_1 = require("../util/System");
+var Arrays_1 = require("../util/Arrays");
+var StringBuilder_1 = require("../util/StringBuilder");
+var IllegalArgumentException_1 = require("../IllegalArgumentException");
+/**
+ * <p>Represents a 2D matrix of bits. In function arguments below, and throughout the common
+ * module, x is the column position, and y is the row position. The ordering is always x, y.
+ * The origin is at the top-left.</p>
+ *
+ * <p>Internally the bits are represented in a 1-D array of 32-bit ints. However, each row begins
+ * with a new int. This is done intentionally so that we can copy out a row into a BitArray very
+ * efficiently.</p>
+ *
+ * <p>The ordering of bits is row-major. Within each int, the least significant bits are used first,
+ * meaning they represent lower x values. This is compatible with BitArray's implementation.</p>
+ *
+ * @author Sean Owen
+ * @author dswitkin@google.com (Daniel Switkin)
+ */
+var BitMatrix /*implements Cloneable*/ = /** @class */ (function () {
+    /**
+     * Creates an empty square {@link BitMatrix}.
+     *
+     * @param dimension height and width
+     */
+    // public constructor(dimension: number /*int*/) {
+    //   this(dimension, dimension)
+    // }
+    /**
+     * Creates an empty {@link BitMatrix}.
+     *
+     * @param width bit matrix width
+     * @param height bit matrix height
+     */
+    // public constructor(width: number /*int*/, height: number /*int*/) {
+    //   if (width < 1 || height < 1) {
+    //     throw new IllegalArgumentException("Both dimensions must be greater than 0")
+    //   }
+    //   this.width = width
+    //   this.height = height
+    //   this.rowSize = (width + 31) / 32
+    //   bits = new int[rowSize * height];
+    // }
+    function BitMatrix(width /*int*/, height /*int*/, rowSize /*int*/, bits) {
+        this.width = width;
+        this.height = height;
+        this.rowSize = rowSize;
+        this.bits = bits;
+        if (undefined === height || null === height) {
+            height = width;
+        }
+        this.height = height;
+        if (width < 1 || height < 1) {
+            throw new IllegalArgumentException_1.default('Both dimensions must be greater than 0');
+        }
+        if (undefined === rowSize || null === rowSize) {
+            rowSize = Math.floor((width + 31) / 32);
+        }
+        this.rowSize = rowSize;
+        if (undefined === bits || null === bits) {
+            this.bits = new Int32Array(this.rowSize * this.height);
+        }
+    }
+    /**
+     * Interprets a 2D array of booleans as a {@link BitMatrix}, where "true" means an "on" bit.
+     *
+     * @function parse
+     * @param image bits of the image, as a row-major 2D array. Elements are arrays representing rows
+     * @return {@link BitMatrix} representation of image
+     */
+    BitMatrix.parseFromBooleanArray = function (image) {
+        var height = image.length;
+        var width = image[0].length;
+        var bits = new BitMatrix(width, height);
+        for (var i = 0; i < height; i++) {
+            var imageI = image[i];
+            for (var j = 0; j < width; j++) {
+                if (imageI[j]) {
+                    bits.set(j, i);
+                }
+            }
+        }
+        return bits;
+    };
+    /**
+     *
+     * @function parse
+     * @param stringRepresentation
+     * @param setString
+     * @param unsetString
+     */
+    BitMatrix.parseFromString = function (stringRepresentation, setString, unsetString) {
+        if (stringRepresentation === null) {
+            throw new IllegalArgumentException_1.default('stringRepresentation cannot be null');
+        }
+        var bits = new Array(stringRepresentation.length);
+        var bitsPos = 0;
+        var rowStartPos = 0;
+        var rowLength = -1;
+        var nRows = 0;
+        var pos = 0;
+        while (pos < stringRepresentation.length) {
+            if (stringRepresentation.charAt(pos) === '\n' ||
+                stringRepresentation.charAt(pos) === '\r') {
+                if (bitsPos > rowStartPos) {
+                    if (rowLength === -1) {
+                        rowLength = bitsPos - rowStartPos;
+                    }
+                    else if (bitsPos - rowStartPos !== rowLength) {
+                        throw new IllegalArgumentException_1.default('row lengths do not match');
+                    }
+                    rowStartPos = bitsPos;
+                    nRows++;
+                }
+                pos++;
+            }
+            else if (stringRepresentation.substring(pos, pos + setString.length) === setString) {
+                pos += setString.length;
+                bits[bitsPos] = true;
+                bitsPos++;
+            }
+            else if (stringRepresentation.substring(pos, pos + unsetString.length) === unsetString) {
+                pos += unsetString.length;
+                bits[bitsPos] = false;
+                bitsPos++;
+            }
+            else {
+                throw new IllegalArgumentException_1.default('illegal character encountered: ' + stringRepresentation.substring(pos));
+            }
+        }
+        // no EOL at end?
+        if (bitsPos > rowStartPos) {
+            if (rowLength === -1) {
+                rowLength = bitsPos - rowStartPos;
+            }
+            else if (bitsPos - rowStartPos !== rowLength) {
+                throw new IllegalArgumentException_1.default('row lengths do not match');
+            }
+            nRows++;
+        }
+        var matrix = new BitMatrix(rowLength, nRows);
+        for (var i = 0; i < bitsPos; i++) {
+            if (bits[i]) {
+                matrix.set(Math.floor(i % rowLength), Math.floor(i / rowLength));
+            }
+        }
+        return matrix;
+    };
+    /**
+     * <p>Gets the requested bit, where true means black.</p>
+     *
+     * @param x The horizontal component (i.e. which column)
+     * @param y The vertical component (i.e. which row)
+     * @return value of given bit in matrix
+     */
+    BitMatrix.prototype.get = function (x /*int*/, y /*int*/) {
+        var offset = y * this.rowSize + Math.floor(x / 32);
+        return ((this.bits[offset] >>> (x & 0x1f)) & 1) !== 0;
+    };
+    /**
+     * <p>Sets the given bit to true.</p>
+     *
+     * @param x The horizontal component (i.e. which column)
+     * @param y The vertical component (i.e. which row)
+     */
+    BitMatrix.prototype.set = function (x /*int*/, y /*int*/) {
+        var offset = y * this.rowSize + Math.floor(x / 32);
+        this.bits[offset] |= (1 << (x & 0x1f)) & 0xFFFFFFFF;
+    };
+    BitMatrix.prototype.unset = function (x /*int*/, y /*int*/) {
+        var offset = y * this.rowSize + Math.floor(x / 32);
+        this.bits[offset] &= ~((1 << (x & 0x1f)) & 0xFFFFFFFF);
+    };
+    /**
+     * <p>Flips the given bit.</p>
+     *
+     * @param x The horizontal component (i.e. which column)
+     * @param y The vertical component (i.e. which row)
+     */
+    BitMatrix.prototype.flip = function (x /*int*/, y /*int*/) {
+        var offset = y * this.rowSize + Math.floor(x / 32);
+        this.bits[offset] ^= ((1 << (x & 0x1f)) & 0xFFFFFFFF);
+    };
+    /**
+     * Exclusive-or (XOR): Flip the bit in this {@code BitMatrix} if the corresponding
+     * mask bit is set.
+     *
+     * @param mask XOR mask
+     */
+    BitMatrix.prototype.xor = function (mask) {
+        if (this.width !== mask.getWidth() || this.height !== mask.getHeight()
+            || this.rowSize !== mask.getRowSize()) {
+            throw new IllegalArgumentException_1.default('input matrix dimensions do not match');
+        }
+        var rowArray = new BitArray_1.default(Math.floor(this.width / 32) + 1);
+        var rowSize = this.rowSize;
+        var bits = this.bits;
+        for (var y = 0, height = this.height; y < height; y++) {
+            var offset = y * rowSize;
+            var row = mask.getRow(y, rowArray).getBitArray();
+            for (var x = 0; x < rowSize; x++) {
+                bits[offset + x] ^= row[x];
+            }
+        }
+    };
+    /**
+     * Clears all bits (sets to false).
+     */
+    BitMatrix.prototype.clear = function () {
+        var bits = this.bits;
+        var max = bits.length;
+        for (var i = 0; i < max; i++) {
+            bits[i] = 0;
+        }
+    };
+    /**
+     * <p>Sets a square region of the bit matrix to true.</p>
+     *
+     * @param left The horizontal position to begin at (inclusive)
+     * @param top The vertical position to begin at (inclusive)
+     * @param width The width of the region
+     * @param height The height of the region
+     */
+    BitMatrix.prototype.setRegion = function (left /*int*/, top /*int*/, width /*int*/, height /*int*/) {
+        if (top < 0 || left < 0) {
+            throw new IllegalArgumentException_1.default('Left and top must be nonnegative');
+        }
+        if (height < 1 || width < 1) {
+            throw new IllegalArgumentException_1.default('Height and width must be at least 1');
+        }
+        var right = left + width;
+        var bottom = top + height;
+        if (bottom > this.height || right > this.width) {
+            throw new IllegalArgumentException_1.default('The region must fit inside the matrix');
+        }
+        var rowSize = this.rowSize;
+        var bits = this.bits;
+        for (var y = top; y < bottom; y++) {
+            var offset = y * rowSize;
+            for (var x = left; x < right; x++) {
+                bits[offset + Math.floor(x / 32)] |= ((1 << (x & 0x1f)) & 0xFFFFFFFF);
+            }
+        }
+    };
+    /**
+     * A fast method to retrieve one row of data from the matrix as a BitArray.
+     *
+     * @param y The row to retrieve
+     * @param row An optional caller-allocated BitArray, will be allocated if null or too small
+     * @return The resulting BitArray - this reference should always be used even when passing
+     *         your own row
+     */
+    BitMatrix.prototype.getRow = function (y /*int*/, row) {
+        if (row === null || row === undefined || row.getSize() < this.width) {
+            row = new BitArray_1.default(this.width);
+        }
+        else {
+            row.clear();
+        }
+        var rowSize = this.rowSize;
+        var bits = this.bits;
+        var offset = y * rowSize;
+        for (var x = 0; x < rowSize; x++) {
+            row.setBulk(x * 32, bits[offset + x]);
+        }
+        return row;
+    };
+    /**
+     * @param y row to set
+     * @param row {@link BitArray} to copy from
+     */
+    BitMatrix.prototype.setRow = function (y /*int*/, row) {
+        System_1.default.arraycopy(row.getBitArray(), 0, this.bits, y * this.rowSize, this.rowSize);
+    };
+    /**
+     * Modifies this {@code BitMatrix} to represent the same but rotated 180 degrees
+     */
+    BitMatrix.prototype.rotate180 = function () {
+        var width = this.getWidth();
+        var height = this.getHeight();
+        var topRow = new BitArray_1.default(width);
+        var bottomRow = new BitArray_1.default(width);
+        for (var i = 0, length_1 = Math.floor((height + 1) / 2); i < length_1; i++) {
+            topRow = this.getRow(i, topRow);
+            bottomRow = this.getRow(height - 1 - i, bottomRow);
+            topRow.reverse();
+            bottomRow.reverse();
+            this.setRow(i, bottomRow);
+            this.setRow(height - 1 - i, topRow);
+        }
+    };
+    /**
+     * This is useful in detecting the enclosing rectangle of a 'pure' barcode.
+     *
+     * @return {@code left,top,width,height} enclosing rectangle of all 1 bits, or null if it is all white
+     */
+    BitMatrix.prototype.getEnclosingRectangle = function () {
+        var width = this.width;
+        var height = this.height;
+        var rowSize = this.rowSize;
+        var bits = this.bits;
+        var left = width;
+        var top = height;
+        var right = -1;
+        var bottom = -1;
+        for (var y = 0; y < height; y++) {
+            for (var x32 = 0; x32 < rowSize; x32++) {
+                var theBits = bits[y * rowSize + x32];
+                if (theBits !== 0) {
+                    if (y < top) {
+                        top = y;
+                    }
+                    if (y > bottom) {
+                        bottom = y;
+                    }
+                    if (x32 * 32 < left) {
+                        var bit = 0;
+                        while (((theBits << (31 - bit)) & 0xFFFFFFFF) === 0) {
+                            bit++;
+                        }
+                        if ((x32 * 32 + bit) < left) {
+                            left = x32 * 32 + bit;
+                        }
+                    }
+                    if (x32 * 32 + 31 > right) {
+                        var bit = 31;
+                        while ((theBits >>> bit) === 0) {
+                            bit--;
+                        }
+                        if ((x32 * 32 + bit) > right) {
+                            right = x32 * 32 + bit;
+                        }
+                    }
+                }
+            }
+        }
+        if (right < left || bottom < top) {
+            return null;
+        }
+        return Int32Array.from([left, top, right - left + 1, bottom - top + 1]);
+    };
+    /**
+     * This is useful in detecting a corner of a 'pure' barcode.
+     *
+     * @return {@code x,y} coordinate of top-left-most 1 bit, or null if it is all white
+     */
+    BitMatrix.prototype.getTopLeftOnBit = function () {
+        var rowSize = this.rowSize;
+        var bits = this.bits;
+        var bitsOffset = 0;
+        while (bitsOffset < bits.length && bits[bitsOffset] === 0) {
+            bitsOffset++;
+        }
+        if (bitsOffset === bits.length) {
+            return null;
+        }
+        var y = bitsOffset / rowSize;
+        var x = (bitsOffset % rowSize) * 32;
+        var theBits = bits[bitsOffset];
+        var bit = 0;
+        while (((theBits << (31 - bit)) & 0xFFFFFFFF) === 0) {
+            bit++;
+        }
+        x += bit;
+        return Int32Array.from([x, y]);
+    };
+    BitMatrix.prototype.getBottomRightOnBit = function () {
+        var rowSize = this.rowSize;
+        var bits = this.bits;
+        var bitsOffset = bits.length - 1;
+        while (bitsOffset >= 0 && bits[bitsOffset] === 0) {
+            bitsOffset--;
+        }
+        if (bitsOffset < 0) {
+            return null;
+        }
+        var y = Math.floor(bitsOffset / rowSize);
+        var x = Math.floor(bitsOffset % rowSize) * 32;
+        var theBits = bits[bitsOffset];
+        var bit = 31;
+        while ((theBits >>> bit) === 0) {
+            bit--;
+        }
+        x += bit;
+        return Int32Array.from([x, y]);
+    };
+    /**
+     * @return The width of the matrix
+     */
+    BitMatrix.prototype.getWidth = function () {
+        return this.width;
+    };
+    /**
+     * @return The height of the matrix
+     */
+    BitMatrix.prototype.getHeight = function () {
+        return this.height;
+    };
+    /**
+     * @return The row size of the matrix
+     */
+    BitMatrix.prototype.getRowSize = function () {
+        return this.rowSize;
+    };
+    /*@Override*/
+    BitMatrix.prototype.equals = function (o) {
+        if (!(o instanceof BitMatrix)) {
+            return false;
+        }
+        var other = o;
+        return this.width === other.width && this.height === other.height && this.rowSize === other.rowSize &&
+            Arrays_1.default.equals(this.bits, other.bits);
+    };
+    /*@Override*/
+    BitMatrix.prototype.hashCode = function () {
+        var hash = this.width;
+        hash = 31 * hash + this.width;
+        hash = 31 * hash + this.height;
+        hash = 31 * hash + this.rowSize;
+        hash = 31 * hash + Arrays_1.default.hashCode(this.bits);
+        return hash;
+    };
+    /**
+     * @return string representation using "X" for set and " " for unset bits
+     */
+    /*@Override*/
+    // public toString(): string {
+    //   return toString(": "X, "  ")
+    // }
+    /**
+     * @param setString representation of a set bit
+     * @param unsetString representation of an unset bit
+     * @return string representation of entire matrix utilizing given strings
+     */
+    // public toString(setString: string = "X ", unsetString: string = "  "): string {
+    //   return this.buildToString(setString, unsetString, "\n")
+    // }
+    /**
+     * @param setString representation of a set bit
+     * @param unsetString representation of an unset bit
+     * @param lineSeparator newline character in string representation
+     * @return string representation of entire matrix utilizing given strings and line separator
+     * @deprecated call {@link #toString(String,String)} only, which uses \n line separator always
+     */
+    // @Deprecated
+    BitMatrix.prototype.toString = function (setString, unsetString, lineSeparator) {
+        if (setString === void 0) { setString = 'X '; }
+        if (unsetString === void 0) { unsetString = '  '; }
+        if (lineSeparator === void 0) { lineSeparator = '\n'; }
+        return this.buildToString(setString, unsetString, lineSeparator);
+    };
+    BitMatrix.prototype.buildToString = function (setString, unsetString, lineSeparator) {
+        var result = new StringBuilder_1.default();
+        // result.append(lineSeparator);
+        for (var y = 0, height = this.height; y < height; y++) {
+            for (var x = 0, width = this.width; x < width; x++) {
+                result.append(this.get(x, y) ? setString : unsetString);
+            }
+            result.append(lineSeparator);
+        }
+        return result.toString();
+    };
+    /*@Override*/
+    BitMatrix.prototype.clone = function () {
+        return new BitMatrix(this.width, this.height, this.rowSize, this.bits.slice());
+    };
+    return BitMatrix;
+}());
+exports.default = BitMatrix;
+//# sourceMappingURL=BitMatrix.js.map

package/template/node_modules/@zxing/library/cjs/core/common/BitMatrix.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"BitMatrix.js","sourceRoot":"","sources":["../../../../src/core/common/BitMatrix.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;GAcG;;AAEH,uCAAuC;AAEvC,4BAA4B;AAE5B,uCAAkC;AAClC,yCAAoC;AACpC,yCAAoC;AACpC,uDAAkD;AAClD,wEAAmE;AAInE;;;;;;;;;;;;;;GAcG;AACH,cAA+B,wBAAwB;IAEnD;;;;OAIG;IACH,kDAAkD;IAClD,+BAA+B;IAC/B,IAAI;IAEJ;;;;;OAKG;IACH,sEAAsE;IACtE,mCAAmC;IACnC,mFAAmF;IACnF,MAAM;IACN,uBAAuB;IACvB,yBAAyB;IACzB,qCAAqC;IACrC,sCAAsC;IACtC,IAAI;IAEJ,mBAA2B,KAAa,CAAC,OAAO,EAAU,MAAe,CAAC,OAAO,EACrE,OAAgB,CAAC,OAAO,EAAU,IAAiB;QADpC,UAAK,GAAL,KAAK,CAAQ;QAAkB,WAAM,GAAN,MAAM,CAAS;QAC7D,YAAO,GAAP,OAAO,CAAS;QAAkB,SAAI,GAAJ,IAAI,CAAa;QAC3D,IAAI,SAAS,KAAK,MAAM,IAAI,IAAI,KAAK,MAAM,EAAE;YACzC,MAAM,GAAG,KAAK,CAAC;SAClB;QACD,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,KAAK,GAAG,CAAC,IAAI,MAAM,GAAG,CAAC,EAAE;YACzB,MAAM,IAAI,kCAAwB,CAAC,wCAAwC,CAAC,CAAC;SAChF;QACD,IAAI,SAAS,KAAK,OAAO,IAAI,IAAI,KAAK,OAAO,EAAE;YAC3C,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;SAC3C;QACD,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,SAAS,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,EAAE;YACrC,IAAI,CAAC,IAAI,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;SAC1D;IACL,CAAC;IAED;;;;;;OAMG;IACW,+BAAqB,GAAnC,UAAoC,KAAkB;QAClD,IAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;QAC5B,IAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QAC9B,IAAM,IAAI,GAAG,IAAI,SAAS,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;YAC7B,IAAM,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE;gBAC5B,IAAI,MAAM,CAAC,CAAC,CAAC,EAAE;oBACX,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;iBAClB;aACJ;SACJ;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;;;;;OAMG;IACW,yBAAe,GAA7B,UAA8B,oBAA4B,EAAE,SAAiB,EAAE,WAAmB;QAC9F,IAAI,oBAAoB,KAAK,IAAI,EAAE;YAC/B,MAAM,IAAI,kCAAwB,CAAC,qCAAqC,CAAC,CAAC;SAC7E;QAED,IAAM,IAAI,GAAG,IAAI,KAAK,CAAU,oBAAoB,CAAC,MAAM,CAAC,CAAC;QAC7D,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,IAAI,SAAS,GAAG,CAAC,CAAC,CAAC;QACnB,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,OAAO,GAAG,GAAG,oBAAoB,CAAC,MAAM,EAAE;YACtC,IAAI,oBAAoB,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,IAAI;gBACzC,oBAAoB,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,IAAI,EAAE;gBAC3C,IAAI,OAAO,GAAG,WAAW,EAAE;oBACvB,IAAI,SAAS,KAAK,CAAC,CAAC,EAAE;wBAClB,SAAS,GAAG,OAAO,GAAG,WAAW,CAAC;qBACrC;yBAAM,IAAI,OAAO,GAAG,WAAW,KAAK,SAAS,EAAE;wBAC5C,MAAM,IAAI,kCAAwB,CAAC,0BAA0B,CAAC,CAAC;qBAClE;oBACD,WAAW,GAAG,OAAO,CAAC;oBACtB,KAAK,EAAE,CAAC;iBACX;gBACD,GAAG,EAAE,CAAC;aACT;iBAAM,IAAI,oBAAoB,CAAC,SAAS,CAAC,GAAG,EAAE,GAAG,GAAG,SAAS,CAAC,MAAM,CAAC,KAAK,SAAS,EAAE;gBAClF,GAAG,IAAI,SAAS,CAAC,MAAM,CAAC;gBACxB,IAAI,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC;gBACrB,OAAO,EAAE,CAAC;aACb;iBAAM,IAAI,oBAAoB,CAAC,SAAS,CAAC,GAAG,EAAE,GAAG,GAAG,WAAW,CAAC,MAAM,CAAC,KAAK,WAAW,EAAE;gBACtF,GAAG,IAAI,WAAW,CAAC,MAAM,CAAC;gBAC1B,IAAI,CAAC,OAAO,CAAC,GAAG,KAAK,CAAC;gBACtB,OAAO,EAAE,CAAC;aACb;iBAAM;gBACH,MAAM,IAAI,kCAAwB,CAC9B,iCAAiC,GAAG,oBAAoB,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;aAChF;SACJ;QAED,iBAAiB;QACjB,IAAI,OAAO,GAAG,WAAW,EAAE;YACvB,IAAI,SAAS,KAAK,CAAC,CAAC,EAAE;gBAClB,SAAS,GAAG,OAAO,GAAG,WAAW,CAAC;aACrC;iBAAM,IAAI,OAAO,GAAG,WAAW,KAAK,SAAS,EAAE;gBAC5C,MAAM,IAAI,kCAAwB,CAAC,0BAA0B,CAAC,CAAC;aAClE;YACD,KAAK,EAAE,CAAC;SACX;QAED,IAAM,MAAM,GAAG,IAAI,SAAS,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;QAC/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE;YAC9B,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE;gBACT,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,SAAS,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC;aACpE;SACJ;QACD,OAAO,MAAM,CAAC;IAClB,CAAC;IAED;;;;;;OAMG;IACI,uBAAG,GAAV,UAAW,CAAS,CAAC,OAAO,EAAE,CAAS,CAAC,OAAO;QAC3C,IAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QACrD,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAC1D,CAAC;IAED;;;;;OAKG;IACI,uBAAG,GAAV,UAAW,CAAS,CAAC,OAAO,EAAE,CAAS,CAAC,OAAO;QAC3C,IAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QACrD,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,UAAU,CAAC;IACxD,CAAC;IAEM,yBAAK,GAAZ,UAAa,CAAS,CAAC,OAAO,EAAE,CAAS,CAAC,OAAO;QAC7C,IAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QACrD,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC;IAC3D,CAAC;IAED;;;;;OAKG;IACI,wBAAI,GAAX,UAAY,CAAS,CAAC,OAAO,EAAE,CAAS,CAAC,OAAO;QAC5C,IAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QACrD,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC;IAC1D,CAAC;IAED;;;;;OAKG;IACI,uBAAG,GAAV,UAAW,IAAe;QACtB,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,QAAQ,EAAE,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,SAAS,EAAE;eAC/D,IAAI,CAAC,OAAO,KAAK,IAAI,CAAC,UAAU,EAAE,EAAE;YACvC,MAAM,IAAI,kCAAwB,CAAC,sCAAsC,CAAC,CAAC;SAC9E;QACD,IAAM,QAAQ,GAAG,IAAI,kBAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/D,IAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;QAC7B,IAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;YACnD,IAAM,MAAM,GAAG,CAAC,GAAG,OAAO,CAAC;YAC3B,IAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,WAAW,EAAE,CAAC;YACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE;gBAC9B,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;aAC9B;SACJ;IACL,CAAC;IAED;;OAEG;IACI,yBAAK,GAAZ;QACI,IAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACvB,IAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;YAC1B,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;SACf;IACL,CAAC;IAED;;;;;;;OAOG;IACI,6BAAS,GAAhB,UAAiB,IAAY,CAAC,OAAO,EAAE,GAAW,CAAC,OAAO,EAAE,KAAa,CAAC,OAAO,EAAE,MAAc,CAAC,OAAO;QACrG,IAAI,GAAG,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,EAAE;YACrB,MAAM,IAAI,kCAAwB,CAAC,kCAAkC,CAAC,CAAC;SAC1E;QACD,IAAI,MAAM,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC,EAAE;YACzB,MAAM,IAAI,kCAAwB,CAAC,qCAAqC,CAAC,CAAC;SAC7E;QACD,IAAM,KAAK,GAAG,IAAI,GAAG,KAAK,CAAC;QAC3B,IAAM,MAAM,GAAG,GAAG,GAAG,MAAM,CAAC;QAC5B,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE;YAC5C,MAAM,IAAI,kCAAwB,CAAC,uCAAuC,CAAC,CAAC;SAC/E;QACD,IAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;QAC7B,IAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACvB,KAAK,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;YAC/B,IAAM,MAAM,GAAG,CAAC,GAAG,OAAO,CAAC;YAC3B,KAAK,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE;gBAC/B,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC;aACzE;SACJ;IACL,CAAC;IAED;;;;;;;OAOG;IACI,0BAAM,GAAb,UAAc,CAAS,CAAC,OAAO,EAAE,GAAc;QAC3C,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,KAAK,SAAS,IAAI,GAAG,CAAC,OAAO,EAAE,GAAG,IAAI,CAAC,KAAK,EAAE;YACjE,GAAG,GAAG,IAAI,kBAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SAClC;aAAM;YACH,GAAG,CAAC,KAAK,EAAE,CAAC;SACf;QACD,IAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;QAC7B,IAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACvB,IAAM,MAAM,GAAG,CAAC,GAAG,OAAO,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE;YAC9B,GAAG,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;SACzC;QACD,OAAO,GAAG,CAAC;IACf,CAAC;IAED;;;OAGG;IACI,0BAAM,GAAb,UAAc,CAAS,CAAC,OAAO,EAAE,GAAa;QAC1C,gBAAM,CAAC,SAAS,CAAC,GAAG,CAAC,WAAW,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;IACtF,CAAC;IAED;;OAEG;IACI,6BAAS,GAAhB;QACI,IAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;QAC9B,IAAM,MAAM,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;QAChC,IAAI,MAAM,GAAG,IAAI,kBAAQ,CAAC,KAAK,CAAC,CAAC;QACjC,IAAI,SAAS,GAAG,IAAI,kBAAQ,CAAC,KAAK,CAAC,CAAC;QACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,QAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,QAAM,EAAE,CAAC,EAAE,EAAE;YACpE,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;YAChC,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,EAAE,SAAS,CAAC,CAAC;YACnD,MAAM,CAAC,OAAO,EAAE,CAAC;YACjB,SAAS,CAAC,OAAO,EAAE,CAAC;YACpB,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;YAC1B,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;SACvC;IACL,CAAC;IAED;;;;OAIG;IACI,yCAAqB,GAA5B;QACI,IAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,IAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC3B,IAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;QAC7B,IAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QAEvB,IAAI,IAAI,GAAG,KAAK,CAAC;QACjB,IAAI,GAAG,GAAG,MAAM,CAAC;QACjB,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC;QACf,IAAI,MAAM,GAAG,CAAC,CAAC,CAAC;QAEhB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;YAC7B,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,OAAO,EAAE,GAAG,EAAE,EAAE;gBACpC,IAAM,OAAO,GAAG,IAAI,CAAC,CAAC,GAAG,OAAO,GAAG,GAAG,CAAC,CAAC;gBACxC,IAAI,OAAO,KAAK,CAAC,EAAE;oBACf,IAAI,CAAC,GAAG,GAAG,EAAE;wBACT,GAAG,GAAG,CAAC,CAAC;qBACX;oBACD,IAAI,CAAC,GAAG,MAAM,EAAE;wBACZ,MAAM,GAAG,CAAC,CAAC;qBACd;oBACD,IAAI,GAAG,GAAG,EAAE,GAAG,IAAI,EAAE;wBACjB,IAAI,GAAG,GAAG,CAAC,CAAC;wBACZ,OAAO,CAAC,CAAC,OAAO,IAAI,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,EAAE;4BACjD,GAAG,EAAE,CAAC;yBACT;wBACD,IAAI,CAAC,GAAG,GAAG,EAAE,GAAG,GAAG,CAAC,GAAG,IAAI,EAAE;4BACzB,IAAI,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,CAAC;yBACzB;qBACJ;oBACD,IAAI,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,KAAK,EAAE;wBACvB,IAAI,GAAG,GAAG,EAAE,CAAC;wBACb,OAAO,CAAC,OAAO,KAAK,GAAG,CAAC,KAAK,CAAC,EAAE;4BAC5B,GAAG,EAAE,CAAC;yBACT;wBACD,IAAI,CAAC,GAAG,GAAG,EAAE,GAAG,GAAG,CAAC,GAAG,KAAK,EAAE;4BAC1B,KAAK,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,CAAC;yBAC1B;qBACJ;iBACJ;aACJ;SACJ;QAED,IAAI,KAAK,GAAG,IAAI,IAAI,MAAM,GAAG,GAAG,EAAE;YAC9B,OAAO,IAAI,CAAC;SACf;QAED,OAAO,UAAU,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,KAAK,GAAG,IAAI,GAAG,CAAC,EAAE,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAC5E,CAAC;IAED;;;;OAIG;IACI,mCAAe,GAAtB;QACI,IAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;QAC7B,IAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QAEvB,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,OAAO,UAAU,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE;YACvD,UAAU,EAAE,CAAC;SAChB;QACD,IAAI,UAAU,KAAK,IAAI,CAAC,MAAM,EAAE;YAC5B,OAAO,IAAI,CAAC;SACf;QACD,IAAM,CAAC,GAAG,UAAU,GAAG,OAAO,CAAC;QAC/B,IAAI,CAAC,GAAG,CAAC,UAAU,GAAG,OAAO,CAAC,GAAG,EAAE,CAAC;QAEpC,IAAM,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC;QACjC,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,OAAO,CAAC,CAAC,OAAO,IAAI,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,EAAE;YACjD,GAAG,EAAE,CAAC;SACT;QACD,CAAC,IAAI,GAAG,CAAC;QACT,OAAO,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC;IAEM,uCAAmB,GAA1B;QACI,IAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;QAC7B,IAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QAEvB,IAAI,UAAU,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QACjC,OAAO,UAAU,IAAI,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE;YAC9C,UAAU,EAAE,CAAC;SAChB;QACD,IAAI,UAAU,GAAG,CAAC,EAAE;YAChB,OAAO,IAAI,CAAC;SACf;QAED,IAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,OAAO,CAAC,CAAC;QAC3C,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,OAAO,CAAC,GAAG,EAAE,CAAC;QAE9C,IAAM,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC;QACjC,IAAI,GAAG,GAAG,EAAE,CAAC;QACb,OAAO,CAAC,OAAO,KAAK,GAAG,CAAC,KAAK,CAAC,EAAE;YAC5B,GAAG,EAAE,CAAC;SACT;QACD,CAAC,IAAI,GAAG,CAAC;QAET,OAAO,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC;IAED;;OAEG;IACI,4BAAQ,GAAf;QACI,OAAO,IAAI,CAAC,KAAK,CAAC;IACtB,CAAC;IAED;;OAEG;IACI,6BAAS,GAAhB;QACI,OAAO,IAAI,CAAC,MAAM,CAAC;IACvB,CAAC;IAED;;OAEG;IACI,8BAAU,GAAjB;QACI,OAAO,IAAI,CAAC,OAAO,CAAC;IACxB,CAAC;IAED,aAAa;IACN,0BAAM,GAAb,UAAc,CAAS;QACnB,IAAI,CAAC,CAAC,CAAC,YAAY,SAAS,CAAC,EAAE;YAC3B,OAAO,KAAK,CAAC;SAChB;QACD,IAAM,KAAK,GAAc,CAAC,CAAC;QAC3B,OAAO,IAAI,CAAC,KAAK,KAAK,KAAK,CAAC,KAAK,IAAI,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,OAAO,KAAK,KAAK,CAAC,OAAO;YAC/F,gBAAM,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;IAC7C,CAAC;IAED,aAAa;IACN,4BAAQ,GAAf;QACI,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACtB,IAAI,GAAG,EAAE,GAAG,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QAC9B,IAAI,GAAG,EAAE,GAAG,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;QAC/B,IAAI,GAAG,EAAE,GAAG,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC;QAChC,IAAI,GAAG,EAAE,GAAG,IAAI,GAAG,gBAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9C,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,aAAa;IACb,8BAA8B;IAC9B,iCAAiC;IACjC,IAAI;IAEJ;;;;OAIG;IACH,kFAAkF;IAClF,4DAA4D;IAC5D,IAAI;IAEJ;;;;;;OAMG;IACH,cAAc;IACP,4BAAQ,GAAf,UAAgB,SAAwB,EAAE,WAA0B,EAAE,aAA4B;QAAlF,0BAAA,EAAA,gBAAwB;QAAE,4BAAA,EAAA,kBAA0B;QAAE,8BAAA,EAAA,oBAA4B;QAC9F,OAAO,IAAI,CAAC,aAAa,CAAC,SAAS,EAAE,WAAW,EAAE,aAAa,CAAC,CAAC;IACrE,CAAC;IAEO,iCAAa,GAArB,UAAsB,SAAiB,EAAE,WAAmB,EAAE,aAAqB;QAC/E,IAAI,MAAM,GAAG,IAAI,uBAAa,EAAE,CAAC;QACjC,gCAAgC;QAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;YACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE;gBAChD,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;aAC3D;YACD,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;SAChC;QACD,OAAO,MAAM,CAAC,QAAQ,EAAE,CAAC;IAC7B,CAAC;IAED,aAAa;IACN,yBAAK,GAAZ;QACI,OAAO,IAAI,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;IACnF,CAAC;IAEL,gBAAC;AAAD,CAAC,AA9dD,IA8dC"}

package/template/node_modules/@zxing/library/cjs/core/common/BitSource.d.ts

@@ -0,0 +1,38 @@
+/**
+ * <p>This provides an easy abstraction to read bits at a time from a sequence of bytes, where the
+ * number of bits read is not often a multiple of 8.</p>
+ *
+ * <p>This class is thread-safe but not reentrant -- unless the caller modifies the bytes array
+ * it passed in, in which case all bets are off.</p>
+ *
+ * @author Sean Owen
+ */
+export default class BitSource {
+    private bytes;
+    private byteOffset;
+    private bitOffset;
+    /**
+     * @param bytes bytes from which this will read bits. Bits will be read from the first byte first.
+     * Bits are read within a byte from most-significant to least-significant bit.
+     */
+    constructor(bytes: Uint8Array);
+    /**
+     * @return index of next bit in current byte which would be read by the next call to {@link #readBits(int)}.
+     */
+    getBitOffset(): number;
+    /**
+     * @return index of next byte in input byte array which would be read by the next call to {@link #readBits(int)}.
+     */
+    getByteOffset(): number;
+    /**
+     * @param numBits number of bits to read
+     * @return int representing the bits read. The bits will appear as the least-significant
+     *         bits of the int
+     * @throws IllegalArgumentException if numBits isn't in [1,32] or more than is available
+     */
+    readBits(numBits: number): number;
+    /**
+     * @return number of bits that can be read successfully
+     */
+    available(): number;
+}

package/template/node_modules/@zxing/library/cjs/core/common/BitSource.js

@@ -0,0 +1,107 @@
+"use strict";
+/*
+ * Copyright 2007 ZXing authors
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *      http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+/*namespace com.google.zxing.common {*/
+var IllegalArgumentException_1 = require("../IllegalArgumentException");
+/**
+ * <p>This provides an easy abstraction to read bits at a time from a sequence of bytes, where the
+ * number of bits read is not often a multiple of 8.</p>
+ *
+ * <p>This class is thread-safe but not reentrant -- unless the caller modifies the bytes array
+ * it passed in, in which case all bets are off.</p>
+ *
+ * @author Sean Owen
+ */
+var BitSource = /** @class */ (function () {
+    /**
+     * @param bytes bytes from which this will read bits. Bits will be read from the first byte first.
+     * Bits are read within a byte from most-significant to least-significant bit.
+     */
+    function BitSource(bytes) {
+        this.bytes = bytes;
+        this.byteOffset = 0;
+        this.bitOffset = 0;
+    }
+    /**
+     * @return index of next bit in current byte which would be read by the next call to {@link #readBits(int)}.
+     */
+    BitSource.prototype.getBitOffset = function () {
+        return this.bitOffset;
+    };
+    /**
+     * @return index of next byte in input byte array which would be read by the next call to {@link #readBits(int)}.
+     */
+    BitSource.prototype.getByteOffset = function () {
+        return this.byteOffset;
+    };
+    /**
+     * @param numBits number of bits to read
+     * @return int representing the bits read. The bits will appear as the least-significant
+     *         bits of the int
+     * @throws IllegalArgumentException if numBits isn't in [1,32] or more than is available
+     */
+    BitSource.prototype.readBits = function (numBits /*int*/) {
+        if (numBits < 1 || numBits > 32 || numBits > this.available()) {
+            throw new IllegalArgumentException_1.default('' + numBits);
+        }
+        var result = 0;
+        var bitOffset = this.bitOffset;
+        var byteOffset = this.byteOffset;
+        var bytes = this.bytes;
+        // First, read remainder from current byte
+        if (bitOffset > 0) {
+            var bitsLeft = 8 - bitOffset;
+            var toRead = numBits < bitsLeft ? numBits : bitsLeft;
+            var bitsToNotRead = bitsLeft - toRead;
+            var mask = (0xFF >> (8 - toRead)) << bitsToNotRead;
+            result = (bytes[byteOffset] & mask) >> bitsToNotRead;
+            numBits -= toRead;
+            bitOffset += toRead;
+            if (bitOffset === 8) {
+                bitOffset = 0;
+                byteOffset++;
+            }
+        }
+        // Next read whole bytes
+        if (numBits > 0) {
+            while (numBits >= 8) {
+                result = (result << 8) | (bytes[byteOffset] & 0xFF);
+                byteOffset++;
+                numBits -= 8;
+            }
+            // Finally read a partial byte
+            if (numBits > 0) {
+                var bitsToNotRead = 8 - numBits;
+                var mask = (0xFF >> bitsToNotRead) << bitsToNotRead;
+                result = (result << numBits) | ((bytes[byteOffset] & mask) >> bitsToNotRead);
+                bitOffset += numBits;
+            }
+        }
+        this.bitOffset = bitOffset;
+        this.byteOffset = byteOffset;
+        return result;
+    };
+    /**
+     * @return number of bits that can be read successfully
+     */
+    BitSource.prototype.available = function () {
+        return 8 * (this.bytes.length - this.byteOffset) - this.bitOffset;
+    };
+    return BitSource;
+}());
+exports.default = BitSource;
+//# sourceMappingURL=BitSource.js.map

package/template/node_modules/@zxing/library/cjs/core/common/BitSource.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"BitSource.js","sourceRoot":"","sources":["../../../../src/core/common/BitSource.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;GAcG;;AAEH,uCAAuC;AAGvC,wEAAmE;AAEnE;;;;;;;;GAQG;AACH;IAKI;;;OAGG;IACH,mBAA2B,KAAiB;QAAjB,UAAK,GAAL,KAAK,CAAY;QACxC,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC;QACpB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;IACvB,CAAC;IAED;;OAEG;IACI,gCAAY,GAAnB;QACI,OAAO,IAAI,CAAC,SAAS,CAAC;IAC1B,CAAC;IAED;;OAEG;IACI,iCAAa,GAApB;QACI,OAAO,IAAI,CAAC,UAAU,CAAC;IAC3B,CAAC;IAED;;;;;OAKG;IACI,4BAAQ,GAAf,UAAgB,OAAe,CAAC,OAAO;QACnC,IAAI,OAAO,GAAG,CAAC,IAAI,OAAO,GAAG,EAAE,IAAI,OAAO,GAAG,IAAI,CAAC,SAAS,EAAE,EAAE;YAC3D,MAAM,IAAI,kCAAwB,CAAC,EAAE,GAAG,OAAO,CAAC,CAAC;SACpD;QAED,IAAI,MAAM,GAAG,CAAC,CAAC;QAEf,IAAI,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC;QAC/B,IAAI,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;QAEjC,IAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,0CAA0C;QAC1C,IAAI,SAAS,GAAG,CAAC,EAAE;YACf,IAAM,QAAQ,GAAG,CAAC,GAAG,SAAS,CAAC;YAC/B,IAAM,MAAM,GAAG,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC;YACvD,IAAM,aAAa,GAAG,QAAQ,GAAG,MAAM,CAAC;YACxC,IAAM,IAAI,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,aAAa,CAAC;YAErD,MAAM,GAAG,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,IAAI,CAAC,IAAI,aAAa,CAAC;YACrD,OAAO,IAAI,MAAM,CAAC;YAClB,SAAS,IAAI,MAAM,CAAC;YAEpB,IAAI,SAAS,KAAK,CAAC,EAAE;gBACjB,SAAS,GAAG,CAAC,CAAC;gBACd,UAAU,EAAE,CAAC;aAChB;SACJ;QAED,wBAAwB;QACxB,IAAI,OAAO,GAAG,CAAC,EAAE;YAEb,OAAO,OAAO,IAAI,CAAC,EAAE;gBACjB,MAAM,GAAG,CAAC,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,IAAI,CAAC,CAAC;gBACpD,UAAU,EAAE,CAAC;gBACb,OAAO,IAAI,CAAC,CAAC;aAChB;YAED,8BAA8B;YAC9B,IAAI,OAAO,GAAG,CAAC,EAAE;gBACb,IAAM,aAAa,GAAG,CAAC,GAAG,OAAO,CAAC;gBAClC,IAAM,IAAI,GAAG,CAAC,IAAI,IAAI,aAAa,CAAC,IAAI,aAAa,CAAC;gBAEtD,MAAM,GAAG,CAAC,MAAM,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,IAAI,CAAC,IAAI,aAAa,CAAC,CAAC;gBAC7E,SAAS,IAAI,OAAO,CAAC;aACxB;SACJ;QAED,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAE7B,OAAO,MAAM,CAAC;IAClB,CAAC;IAED;;OAEG;IACI,6BAAS,GAAhB;QACI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC;IACtE,CAAC;IAEL,gBAAC;AAAD,CAAC,AA9FD,IA8FC"}