@cloudbase/framework-plugin-low-code 0.4.44 → 0.4.45

package/template/node_modules/@zxing/library/esm/core/qrcode/QRCodeWriter.js

@@ -0,0 +1,97 @@
+/*
+ * Copyright 2008 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.
+ */
+/*namespace com.google.zxing.qrcode {*/
+import BarcodeFormat from '../BarcodeFormat';
+import EncodeHintType from '../EncodeHintType';
+import BitMatrix from '../common/BitMatrix';
+import ErrorCorrectionLevel from './decoder/ErrorCorrectionLevel';
+import Encoder from './encoder/Encoder';
+import IllegalArgumentException from '../IllegalArgumentException';
+import IllegalStateException from '../IllegalStateException';
+/*import java.util.Map;*/
+/**
+ * This object renders a QR Code as a BitMatrix 2D array of greyscale values.
+ *
+ * @author dswitkin@google.com (Daniel Switkin)
+ */
+var QRCodeWriter = /** @class */ (function () {
+    function QRCodeWriter() {
+    }
+    /*@Override*/
+    // public encode(contents: string, format: BarcodeFormat, width: number /*int*/, height: number /*int*/): BitMatrix
+    //     /*throws WriterException */ {
+    //   return encode(contents, format, width, height, null)
+    // }
+    /*@Override*/
+    QRCodeWriter.prototype.encode = function (contents, format, width /*int*/, height /*int*/, hints) {
+        if (contents.length === 0) {
+            throw new IllegalArgumentException('Found empty contents');
+        }
+        if (format !== BarcodeFormat.QR_CODE) {
+            throw new IllegalArgumentException('Can only encode QR_CODE, but got ' + format);
+        }
+        if (width < 0 || height < 0) {
+            throw new IllegalArgumentException("Requested dimensions are too small: " + width + "x" + height);
+        }
+        var errorCorrectionLevel = ErrorCorrectionLevel.L;
+        var quietZone = QRCodeWriter.QUIET_ZONE_SIZE;
+        if (hints !== null) {
+            if (undefined !== hints.get(EncodeHintType.ERROR_CORRECTION)) {
+                errorCorrectionLevel = ErrorCorrectionLevel.fromString(hints.get(EncodeHintType.ERROR_CORRECTION).toString());
+            }
+            if (undefined !== hints.get(EncodeHintType.MARGIN)) {
+                quietZone = Number.parseInt(hints.get(EncodeHintType.MARGIN).toString(), 10);
+            }
+        }
+        var code = Encoder.encode(contents, errorCorrectionLevel, hints);
+        return QRCodeWriter.renderResult(code, width, height, quietZone);
+    };
+    // Note that the input matrix uses 0 == white, 1 == black, while the output matrix uses
+    // 0 == black, 255 == white (i.e. an 8 bit greyscale bitmap).
+    QRCodeWriter.renderResult = function (code, width /*int*/, height /*int*/, quietZone /*int*/) {
+        var input = code.getMatrix();
+        if (input === null) {
+            throw new IllegalStateException();
+        }
+        var inputWidth = input.getWidth();
+        var inputHeight = input.getHeight();
+        var qrWidth = inputWidth + (quietZone * 2);
+        var qrHeight = inputHeight + (quietZone * 2);
+        var outputWidth = Math.max(width, qrWidth);
+        var outputHeight = Math.max(height, qrHeight);
+        var multiple = Math.min(Math.floor(outputWidth / qrWidth), Math.floor(outputHeight / qrHeight));
+        // Padding includes both the quiet zone and the extra white pixels to accommodate the requested
+        // dimensions. For example, if input is 25x25 the QR will be 33x33 including the quiet zone.
+        // If the requested size is 200x160, the multiple will be 4, for a QR of 132x132. These will
+        // handle all the padding from 100x100 (the actual QR) up to 200x160.
+        var leftPadding = Math.floor((outputWidth - (inputWidth * multiple)) / 2);
+        var topPadding = Math.floor((outputHeight - (inputHeight * multiple)) / 2);
+        var output = new BitMatrix(outputWidth, outputHeight);
+        for (var inputY = 0, outputY = topPadding; inputY < inputHeight; inputY++, outputY += multiple) {
+            // Write the contents of this row of the barcode
+            for (var inputX = 0, outputX = leftPadding; inputX < inputWidth; inputX++, outputX += multiple) {
+                if (input.get(inputX, inputY) === 1) {
+                    output.setRegion(outputX, outputY, multiple, multiple);
+                }
+            }
+        }
+        return output;
+    };
+    QRCodeWriter.QUIET_ZONE_SIZE = 4;
+    return QRCodeWriter;
+}());
+export default QRCodeWriter;
+//# sourceMappingURL=QRCodeWriter.js.map

package/template/node_modules/@zxing/library/esm/core/qrcode/QRCodeWriter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"QRCodeWriter.js","sourceRoot":"","sources":["../../../../src/core/qrcode/QRCodeWriter.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,uCAAuC;AAEvC,OAAO,aAAa,MAAM,kBAAkB,CAAC;AAC7C,OAAO,cAAc,MAAM,mBAAmB,CAAC;AAE/C,OAAO,SAAS,MAAM,qBAAqB,CAAC;AAC5C,OAAO,oBAAoB,MAAM,gCAAgC,CAAC;AAClE,OAAO,OAAO,MAAM,mBAAmB,CAAC;AAGxC,OAAO,wBAAwB,MAAM,6BAA6B,CAAC;AACnE,OAAO,qBAAqB,MAAM,0BAA0B,CAAC;AAE7D,yBAAyB;AAEzB;;;;GAIG;AACH;IAAA;IAiFA,CAAC;IA7EG,aAAa;IACb,mHAAmH;IACnH,oCAAoC;IAEpC,yDAAyD;IACzD,IAAI;IAEJ,aAAa;IACN,6BAAM,GAAb,UAAc,QAAgB,EAC1B,MAAqB,EACrB,KAAa,CAAC,OAAO,EACrB,MAAc,CAAC,OAAO,EACtB,KAA+B;QAE/B,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE;YACvB,MAAM,IAAI,wBAAwB,CAAC,sBAAsB,CAAC,CAAC;SAC9D;QAED,IAAI,MAAM,KAAK,aAAa,CAAC,OAAO,EAAE;YAClC,MAAM,IAAI,wBAAwB,CAAC,mCAAmC,GAAG,MAAM,CAAC,CAAC;SACpF;QAED,IAAI,KAAK,GAAG,CAAC,IAAI,MAAM,GAAG,CAAC,EAAE;YACzB,MAAM,IAAI,wBAAwB,CAAC,yCAAuC,KAAK,SAAI,MAAQ,CAAC,CAAC;SAChG;QAED,IAAI,oBAAoB,GAAG,oBAAoB,CAAC,CAAC,CAAC;QAClD,IAAI,SAAS,GAAG,YAAY,CAAC,eAAe,CAAC;QAC7C,IAAI,KAAK,KAAK,IAAI,EAAE;YAChB,IAAI,SAAS,KAAK,KAAK,CAAC,GAAG,CAAC,cAAc,CAAC,gBAAgB,CAAC,EAAE;gBAC1D,oBAAoB,GAAG,oBAAoB,CAAC,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,cAAc,CAAC,gBAAgB,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC;aACjH;YACD,IAAI,SAAS,KAAK,KAAK,CAAC,GAAG,CAAC,cAAc,CAAC,MAAM,CAAC,EAAE;gBAChD,SAAS,GAAG,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,QAAQ,EAAE,EAAE,EAAE,CAAC,CAAC;aAChF;SACJ;QAED,IAAM,IAAI,GAAW,OAAO,CAAC,MAAM,CAAC,QAAQ,EAAE,oBAAoB,EAAE,KAAK,CAAC,CAAC;QAC3E,OAAO,YAAY,CAAC,YAAY,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC;IACrE,CAAC;IAED,uFAAuF;IACvF,6DAA6D;IAC9C,yBAAY,GAA3B,UAA4B,IAAY,EAAE,KAAa,CAAC,OAAO,EAAE,MAAc,CAAC,OAAO,EAAE,SAAiB,CAAC,OAAO;QAC9G,IAAM,KAAK,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;QAC/B,IAAI,KAAK,KAAK,IAAI,EAAE;YAChB,MAAM,IAAI,qBAAqB,EAAE,CAAC;SACrC;QACD,IAAM,UAAU,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;QACpC,IAAM,WAAW,GAAG,KAAK,CAAC,SAAS,EAAE,CAAC;QACtC,IAAM,OAAO,GAAG,UAAU,GAAG,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;QAC7C,IAAM,QAAQ,GAAG,WAAW,GAAG,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;QAC/C,IAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAC7C,IAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QAEhD,IAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,OAAO,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,YAAY,GAAG,QAAQ,CAAC,CAAC,CAAC;QAClG,+FAA+F;QAC/F,4FAA4F;QAC5F,4FAA4F;QAC5F,qEAAqE;QACrE,IAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,WAAW,GAAG,CAAC,UAAU,GAAG,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC5E,IAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,YAAY,GAAG,CAAC,WAAW,GAAG,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAE7E,IAAM,MAAM,GAAG,IAAI,SAAS,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;QAExD,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,OAAO,GAAG,UAAU,EAAE,MAAM,GAAG,WAAW,EAAE,MAAM,EAAE,EAAG,OAAO,IAAI,QAAQ,EAAE;YAC7F,gDAAgD;YAChD,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,OAAO,GAAG,WAAW,EAAE,MAAM,GAAG,UAAU,EAAE,MAAM,EAAE,EAAG,OAAO,IAAI,QAAQ,EAAE;gBAC7F,IAAI,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,KAAK,CAAC,EAAE;oBACjC,MAAM,CAAC,SAAS,CAAC,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;iBAC1D;aACJ;SACJ;QAED,OAAO,MAAM,CAAC;IAClB,CAAC;IA7Ec,4BAAe,GAAG,CAAC,CAAC;IA+EvC,mBAAC;CAAA,AAjFD,IAiFC;eAjFoB,YAAY"}

package/template/node_modules/@zxing/library/esm/core/qrcode/decoder/BitMatrixParser.d.ts

@@ -0,0 +1,58 @@
+import BitMatrix from '../../common/BitMatrix';
+import Version from './Version';
+import FormatInformation from './FormatInformation';
+/**
+ * @author Sean Owen
+ */
+export default class BitMatrixParser {
+    private bitMatrix;
+    private parsedVersion;
+    private parsedFormatInfo;
+    private isMirror;
+    /**
+     * @param bitMatrix {@link BitMatrix} to parse
+     * @throws FormatException if dimension is not >= 21 and 1 mod 4
+     */
+    constructor(bitMatrix: BitMatrix);
+    /**
+     * <p>Reads format information from one of its two locations within the QR Code.</p>
+     *
+     * @return {@link FormatInformation} encapsulating the QR Code's format info
+     * @throws FormatException if both format information locations cannot be parsed as
+     * the valid encoding of format information
+     */
+    readFormatInformation(): FormatInformation;
+    /**
+     * <p>Reads version information from one of its two locations within the QR Code.</p>
+     *
+     * @return {@link Version} encapsulating the QR Code's version
+     * @throws FormatException if both version information locations cannot be parsed as
+     * the valid encoding of version information
+     */
+    readVersion(): Version;
+    private copyBit;
+    /**
+     * <p>Reads the bits in the {@link BitMatrix} representing the finder pattern in the
+     * correct order in order to reconstruct the codewords bytes contained within the
+     * QR Code.</p>
+     *
+     * @return bytes encoded within the QR Code
+     * @throws FormatException if the exact number of bytes expected is not read
+     */
+    readCodewords(): Uint8Array;
+    /**
+     * Revert the mask removal done while reading the code words. The bit matrix should revert to its original state.
+     */
+    remask(): void;
+    /**
+     * Prepare the parser for a mirrored operation.
+     * This flag has effect only on the {@link #readFormatInformation()} and the
+     * {@link #readVersion()}. Before proceeding with {@link #readCodewords()} the
+     * {@link #mirror()} method should be called.
+     *
+     * @param mirror Whether to read version and format information mirrored.
+     */
+    setMirror(isMirror: boolean): void;
+    /** Mirror the bit matrix in order to attempt a second reading. */
+    mirror(): void;
+}

package/template/node_modules/@zxing/library/esm/core/qrcode/decoder/BitMatrixParser.js

@@ -0,0 +1,218 @@
+/*
+ * 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.
+ */
+import Version from './Version';
+import FormatInformation from './FormatInformation';
+import DataMask from './DataMask';
+import FormatException from '../../FormatException';
+/**
+ * @author Sean Owen
+ */
+var BitMatrixParser = /** @class */ (function () {
+    /**
+     * @param bitMatrix {@link BitMatrix} to parse
+     * @throws FormatException if dimension is not >= 21 and 1 mod 4
+     */
+    function BitMatrixParser(bitMatrix) {
+        var dimension = bitMatrix.getHeight();
+        if (dimension < 21 || (dimension & 0x03) !== 1) {
+            throw new FormatException();
+        }
+        this.bitMatrix = bitMatrix;
+    }
+    /**
+     * <p>Reads format information from one of its two locations within the QR Code.</p>
+     *
+     * @return {@link FormatInformation} encapsulating the QR Code's format info
+     * @throws FormatException if both format information locations cannot be parsed as
+     * the valid encoding of format information
+     */
+    BitMatrixParser.prototype.readFormatInformation = function () {
+        if (this.parsedFormatInfo !== null && this.parsedFormatInfo !== undefined) {
+            return this.parsedFormatInfo;
+        }
+        // Read top-left format info bits
+        var formatInfoBits1 = 0;
+        for (var i = 0; i < 6; i++) {
+            formatInfoBits1 = this.copyBit(i, 8, formatInfoBits1);
+        }
+        // .. and skip a bit in the timing pattern ...
+        formatInfoBits1 = this.copyBit(7, 8, formatInfoBits1);
+        formatInfoBits1 = this.copyBit(8, 8, formatInfoBits1);
+        formatInfoBits1 = this.copyBit(8, 7, formatInfoBits1);
+        // .. and skip a bit in the timing pattern ...
+        for (var j = 5; j >= 0; j--) {
+            formatInfoBits1 = this.copyBit(8, j, formatInfoBits1);
+        }
+        // Read the top-right/bottom-left pattern too
+        var dimension = this.bitMatrix.getHeight();
+        var formatInfoBits2 = 0;
+        var jMin = dimension - 7;
+        for (var j = dimension - 1; j >= jMin; j--) {
+            formatInfoBits2 = this.copyBit(8, j, formatInfoBits2);
+        }
+        for (var i = dimension - 8; i < dimension; i++) {
+            formatInfoBits2 = this.copyBit(i, 8, formatInfoBits2);
+        }
+        this.parsedFormatInfo = FormatInformation.decodeFormatInformation(formatInfoBits1, formatInfoBits2);
+        if (this.parsedFormatInfo !== null) {
+            return this.parsedFormatInfo;
+        }
+        throw new FormatException();
+    };
+    /**
+     * <p>Reads version information from one of its two locations within the QR Code.</p>
+     *
+     * @return {@link Version} encapsulating the QR Code's version
+     * @throws FormatException if both version information locations cannot be parsed as
+     * the valid encoding of version information
+     */
+    BitMatrixParser.prototype.readVersion = function () {
+        if (this.parsedVersion !== null && this.parsedVersion !== undefined) {
+            return this.parsedVersion;
+        }
+        var dimension = this.bitMatrix.getHeight();
+        var provisionalVersion = Math.floor((dimension - 17) / 4);
+        if (provisionalVersion <= 6) {
+            return Version.getVersionForNumber(provisionalVersion);
+        }
+        // Read top-right version info: 3 wide by 6 tall
+        var versionBits = 0;
+        var ijMin = dimension - 11;
+        for (var j = 5; j >= 0; j--) {
+            for (var i = dimension - 9; i >= ijMin; i--) {
+                versionBits = this.copyBit(i, j, versionBits);
+            }
+        }
+        var theParsedVersion = Version.decodeVersionInformation(versionBits);
+        if (theParsedVersion !== null && theParsedVersion.getDimensionForVersion() === dimension) {
+            this.parsedVersion = theParsedVersion;
+            return theParsedVersion;
+        }
+        // Hmm, failed. Try bottom left: 6 wide by 3 tall
+        versionBits = 0;
+        for (var i = 5; i >= 0; i--) {
+            for (var j = dimension - 9; j >= ijMin; j--) {
+                versionBits = this.copyBit(i, j, versionBits);
+            }
+        }
+        theParsedVersion = Version.decodeVersionInformation(versionBits);
+        if (theParsedVersion !== null && theParsedVersion.getDimensionForVersion() === dimension) {
+            this.parsedVersion = theParsedVersion;
+            return theParsedVersion;
+        }
+        throw new FormatException();
+    };
+    BitMatrixParser.prototype.copyBit = function (i /*int*/, j /*int*/, versionBits /*int*/) {
+        var bit = this.isMirror ? this.bitMatrix.get(j, i) : this.bitMatrix.get(i, j);
+        return bit ? (versionBits << 1) | 0x1 : versionBits << 1;
+    };
+    /**
+     * <p>Reads the bits in the {@link BitMatrix} representing the finder pattern in the
+     * correct order in order to reconstruct the codewords bytes contained within the
+     * QR Code.</p>
+     *
+     * @return bytes encoded within the QR Code
+     * @throws FormatException if the exact number of bytes expected is not read
+     */
+    BitMatrixParser.prototype.readCodewords = function () {
+        var formatInfo = this.readFormatInformation();
+        var version = this.readVersion();
+        // Get the data mask for the format used in this QR Code. This will exclude
+        // some bits from reading as we wind through the bit matrix.
+        var dataMask = DataMask.values.get(formatInfo.getDataMask());
+        var dimension = this.bitMatrix.getHeight();
+        dataMask.unmaskBitMatrix(this.bitMatrix, dimension);
+        var functionPattern = version.buildFunctionPattern();
+        var readingUp = true;
+        var result = new Uint8Array(version.getTotalCodewords());
+        var resultOffset = 0;
+        var currentByte = 0;
+        var bitsRead = 0;
+        // Read columns in pairs, from right to left
+        for (var j = dimension - 1; j > 0; j -= 2) {
+            if (j === 6) {
+                // Skip whole column with vertical alignment pattern
+                // saves time and makes the other code proceed more cleanly
+                j--;
+            }
+            // Read alternatingly from bottom to top then top to bottom
+            for (var count = 0; count < dimension; count++) {
+                var i = readingUp ? dimension - 1 - count : count;
+                for (var col = 0; col < 2; col++) {
+                    // Ignore bits covered by the function pattern
+                    if (!functionPattern.get(j - col, i)) {
+                        // Read a bit
+                        bitsRead++;
+                        currentByte <<= 1;
+                        if (this.bitMatrix.get(j - col, i)) {
+                            currentByte |= 1;
+                        }
+                        // If we've made a whole byte, save it off
+                        if (bitsRead === 8) {
+                            result[resultOffset++] = /*(byte) */ currentByte;
+                            bitsRead = 0;
+                            currentByte = 0;
+                        }
+                    }
+                }
+            }
+            readingUp = !readingUp; // readingUp ^= true; // readingUp = !readingUp; // switch directions
+        }
+        if (resultOffset !== version.getTotalCodewords()) {
+            throw new FormatException();
+        }
+        return result;
+    };
+    /**
+     * Revert the mask removal done while reading the code words. The bit matrix should revert to its original state.
+     */
+    BitMatrixParser.prototype.remask = function () {
+        if (this.parsedFormatInfo === null) {
+            return; // We have no format information, and have no data mask
+        }
+        var dataMask = DataMask.values[this.parsedFormatInfo.getDataMask()];
+        var dimension = this.bitMatrix.getHeight();
+        dataMask.unmaskBitMatrix(this.bitMatrix, dimension);
+    };
+    /**
+     * Prepare the parser for a mirrored operation.
+     * This flag has effect only on the {@link #readFormatInformation()} and the
+     * {@link #readVersion()}. Before proceeding with {@link #readCodewords()} the
+     * {@link #mirror()} method should be called.
+     *
+     * @param mirror Whether to read version and format information mirrored.
+     */
+    BitMatrixParser.prototype.setMirror = function (isMirror) {
+        this.parsedVersion = null;
+        this.parsedFormatInfo = null;
+        this.isMirror = isMirror;
+    };
+    /** Mirror the bit matrix in order to attempt a second reading. */
+    BitMatrixParser.prototype.mirror = function () {
+        var bitMatrix = this.bitMatrix;
+        for (var x = 0, width = bitMatrix.getWidth(); x < width; x++) {
+            for (var y = x + 1, height = bitMatrix.getHeight(); y < height; y++) {
+                if (bitMatrix.get(x, y) !== bitMatrix.get(y, x)) {
+                    bitMatrix.flip(y, x);
+                    bitMatrix.flip(x, y);
+                }
+            }
+        }
+    };
+    return BitMatrixParser;
+}());
+export default BitMatrixParser;
+//# sourceMappingURL=BitMatrixParser.js.map

package/template/node_modules/@zxing/library/esm/core/qrcode/decoder/BitMatrixParser.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"BitMatrixParser.js","sourceRoot":"","sources":["../../../../../src/core/qrcode/decoder/BitMatrixParser.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAKH,OAAO,OAAO,MAAM,WAAW,CAAC;AAChC,OAAO,iBAAiB,MAAM,qBAAqB,CAAC;AAEpD,OAAO,QAAQ,MAAM,YAAY,CAAC;AAClC,OAAO,eAAe,MAAM,uBAAuB,CAAC;AACpD;;GAEG;AACH;IAOI;;;OAGG;IACH,yBAAmB,SAAoB;QACnC,IAAM,SAAS,GAAG,SAAS,CAAC,SAAS,EAAE,CAAC;QACxC,IAAI,SAAS,GAAG,EAAE,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE;YAC5C,MAAM,IAAI,eAAe,EAAE,CAAC;SAC/B;QACD,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;IAC/B,CAAC;IAED;;;;;;OAMG;IACI,+CAAqB,GAA5B;QAEI,IAAI,IAAI,CAAC,gBAAgB,KAAK,IAAI,IAAI,IAAI,CAAC,gBAAgB,KAAK,SAAS,EAAE;YACvE,OAAO,IAAI,CAAC,gBAAgB,CAAC;SAChC;QAED,iCAAiC;QACjC,IAAI,eAAe,GAAG,CAAC,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YACxB,eAAe,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,eAAe,CAAC,CAAC;SACzD;QACD,8CAA8C;QAC9C,eAAe,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,eAAe,CAAC,CAAC;QACtD,eAAe,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,eAAe,CAAC,CAAC;QACtD,eAAe,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,eAAe,CAAC,CAAC;QACtD,8CAA8C;QAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;YACzB,eAAe,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,eAAe,CAAC,CAAC;SACzD;QAED,6CAA6C;QAC7C,IAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,SAAS,EAAE,CAAC;QAC7C,IAAI,eAAe,GAAG,CAAC,CAAC;QACxB,IAAM,IAAI,GAAG,SAAS,GAAG,CAAC,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,SAAS,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE,EAAE;YACxC,eAAe,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,eAAe,CAAC,CAAC;SACzD;QACD,KAAK,IAAI,CAAC,GAAG,SAAS,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE;YAC5C,eAAe,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,eAAe,CAAC,CAAC;SACzD;QAED,IAAI,CAAC,gBAAgB,GAAG,iBAAiB,CAAC,uBAAuB,CAAC,eAAe,EAAE,eAAe,CAAC,CAAC;QACpG,IAAI,IAAI,CAAC,gBAAgB,KAAK,IAAI,EAAE;YAChC,OAAO,IAAI,CAAC,gBAAgB,CAAC;SAChC;QACD,MAAM,IAAI,eAAe,EAAE,CAAC;IAChC,CAAC;IAED;;;;;;OAMG;IACI,qCAAW,GAAlB;QAEI,IAAI,IAAI,CAAC,aAAa,KAAK,IAAI,IAAI,IAAI,CAAC,aAAa,KAAK,SAAS,EAAE;YACjE,OAAO,IAAI,CAAC,aAAa,CAAC;SAC7B;QAED,IAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,SAAS,EAAE,CAAC;QAE7C,IAAM,kBAAkB,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,SAAS,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QAC5D,IAAI,kBAAkB,IAAI,CAAC,EAAE;YACzB,OAAO,OAAO,CAAC,mBAAmB,CAAC,kBAAkB,CAAC,CAAC;SAC1D;QAED,gDAAgD;QAChD,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,IAAM,KAAK,GAAG,SAAS,GAAG,EAAE,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;YACzB,KAAK,IAAI,CAAC,GAAG,SAAS,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,EAAE,EAAE;gBACzC,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,WAAW,CAAC,CAAC;aACjD;SACJ;QAED,IAAI,gBAAgB,GAAG,OAAO,CAAC,wBAAwB,CAAC,WAAW,CAAC,CAAC;QACrE,IAAI,gBAAgB,KAAK,IAAI,IAAI,gBAAgB,CAAC,sBAAsB,EAAE,KAAK,SAAS,EAAE;YACtF,IAAI,CAAC,aAAa,GAAG,gBAAgB,CAAC;YACtC,OAAO,gBAAgB,CAAC;SAC3B;QAED,iDAAiD;QACjD,WAAW,GAAG,CAAC,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;YACzB,KAAK,IAAI,CAAC,GAAG,SAAS,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,EAAE,EAAE;gBACzC,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,WAAW,CAAC,CAAC;aACjD;SACJ;QAED,gBAAgB,GAAG,OAAO,CAAC,wBAAwB,CAAC,WAAW,CAAC,CAAC;QACjE,IAAI,gBAAgB,KAAK,IAAI,IAAI,gBAAgB,CAAC,sBAAsB,EAAE,KAAK,SAAS,EAAE;YACtF,IAAI,CAAC,aAAa,GAAG,gBAAgB,CAAC;YACtC,OAAO,gBAAgB,CAAC;SAC3B;QACD,MAAM,IAAI,eAAe,EAAE,CAAC;IAChC,CAAC;IAEO,iCAAO,GAAf,UAAgB,CAAS,CAAC,OAAO,EAAE,CAAS,CAAC,OAAO,EAAE,WAAmB,CAAC,OAAO;QAC7E,IAAM,GAAG,GAAY,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACzF,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC;IAC7D,CAAC;IAED;;;;;;;OAOG;IACI,uCAAa,GAApB;QAEI,IAAM,UAAU,GAAG,IAAI,CAAC,qBAAqB,EAAE,CAAC;QAChD,IAAM,OAAO,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QAEnC,2EAA2E;QAC3E,4DAA4D;QAC5D,IAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,WAAW,EAAE,CAAC,CAAC;QAC/D,IAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,SAAS,EAAE,CAAC;QAC7C,QAAQ,CAAC,eAAe,CAAC,IAAI,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QAEpD,IAAM,eAAe,GAAG,OAAO,CAAC,oBAAoB,EAAE,CAAC;QAEvD,IAAI,SAAS,GAAY,IAAI,CAAC;QAC9B,IAAM,MAAM,GAAG,IAAI,UAAU,CAAC,OAAO,CAAC,iBAAiB,EAAE,CAAC,CAAC;QAC3D,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,4CAA4C;QAC5C,KAAK,IAAI,CAAC,GAAG,SAAS,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE;YACvC,IAAI,CAAC,KAAK,CAAC,EAAE;gBACT,oDAAoD;gBACpD,2DAA2D;gBAC3D,CAAC,EAAE,CAAC;aACP;YACD,2DAA2D;YAC3D,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,SAAS,EAAE,KAAK,EAAE,EAAE;gBAC5C,IAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;gBACpD,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE;oBAC9B,8CAA8C;oBAC9C,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC,EAAE;wBAClC,aAAa;wBACb,QAAQ,EAAE,CAAC;wBACX,WAAW,KAAK,CAAC,CAAC;wBAClB,IAAI,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC,EAAE;4BAChC,WAAW,IAAI,CAAC,CAAC;yBACpB;wBACD,0CAA0C;wBAC1C,IAAI,QAAQ,KAAK,CAAC,EAAE;4BAChB,MAAM,CAAC,YAAY,EAAE,CAAC,GAAG,WAAW,CAAA,WAAW,CAAC;4BAChD,QAAQ,GAAG,CAAC,CAAC;4BACb,WAAW,GAAG,CAAC,CAAC;yBACnB;qBACJ;iBACJ;aACJ;YACD,SAAS,GAAG,CAAC,SAAS,CAAC,CAAC,qEAAqE;SAChG;QACD,IAAI,YAAY,KAAK,OAAO,CAAC,iBAAiB,EAAE,EAAE;YAC9C,MAAM,IAAI,eAAe,EAAE,CAAC;SAC/B;QACD,OAAO,MAAM,CAAC;IAClB,CAAC;IAED;;OAEG;IACI,gCAAM,GAAb;QACI,IAAI,IAAI,CAAC,gBAAgB,KAAK,IAAI,EAAE;YAChC,OAAO,CAAC,uDAAuD;SAClE;QACD,IAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,gBAAgB,CAAC,WAAW,EAAE,CAAC,CAAC;QACtE,IAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,SAAS,EAAE,CAAC;QAC7C,QAAQ,CAAC,eAAe,CAAC,IAAI,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;IACxD,CAAC;IAED;;;;;;;OAOG;IACI,mCAAS,GAAhB,UAAiB,QAAiB;QAC9B,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC;QAC1B,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC;QAC7B,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;IAC7B,CAAC;IAED,kEAAkE;IAC3D,gCAAM,GAAb;QACI,IAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC;QACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,KAAK,GAAG,SAAS,CAAC,QAAQ,EAAE,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE;YAC1D,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC,SAAS,EAAE,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;gBACjE,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;oBAC7C,SAAS,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBACrB,SAAS,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;iBACxB;aACJ;SACJ;IACL,CAAC;IAEL,sBAAC;AAAD,CAAC,AA7ND,IA6NC"}

package/template/node_modules/@zxing/library/esm/core/qrcode/decoder/DataBlock.d.ts

@@ -0,0 +1,28 @@
+import Version from './Version';
+import ErrorCorrectionLevel from './ErrorCorrectionLevel';
+/**
+ * <p>Encapsulates a block of data within a QR Code. QR Codes may split their data into
+ * multiple blocks, each of which is a unit of data and error-correction codewords. Each
+ * is represented by an instance of this class.</p>
+ *
+ * @author Sean Owen
+ */
+export default class DataBlock {
+    private numDataCodewords;
+    private codewords;
+    private constructor();
+    /**
+     * <p>When QR Codes use multiple data blocks, they are actually interleaved.
+     * That is, the first byte of data block 1 to n is written, then the second bytes, and so on. This
+     * method will separate the data into original blocks.</p>
+     *
+     * @param rawCodewords bytes as read directly from the QR Code
+     * @param version version of the QR Code
+     * @param ecLevel error-correction level of the QR Code
+     * @return DataBlocks containing original bytes, "de-interleaved" from representation in the
+     *         QR Code
+     */
+    static getDataBlocks(rawCodewords: Uint8Array, version: Version, ecLevel: ErrorCorrectionLevel): DataBlock[];
+    getNumDataCodewords(): number;
+    getCodewords(): Uint8Array;
+}

package/template/node_modules/@zxing/library/esm/core/qrcode/decoder/DataBlock.js

@@ -0,0 +1,140 @@
+/*
+ * 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.
+ */
+var __values = (this && this.__values) || function(o) {
+    var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;
+    if (m) return m.call(o);
+    if (o && typeof o.length === "number") return {
+        next: function () {
+            if (o && i >= o.length) o = void 0;
+            return { value: o && o[i++], done: !o };
+        }
+    };
+    throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
+};
+import IllegalArgumentException from '../../IllegalArgumentException';
+/**
+ * <p>Encapsulates a block of data within a QR Code. QR Codes may split their data into
+ * multiple blocks, each of which is a unit of data and error-correction codewords. Each
+ * is represented by an instance of this class.</p>
+ *
+ * @author Sean Owen
+ */
+var DataBlock = /** @class */ (function () {
+    function DataBlock(numDataCodewords /*int*/, codewords) {
+        this.numDataCodewords = numDataCodewords;
+        this.codewords = codewords;
+    }
+    /**
+     * <p>When QR Codes use multiple data blocks, they are actually interleaved.
+     * That is, the first byte of data block 1 to n is written, then the second bytes, and so on. This
+     * method will separate the data into original blocks.</p>
+     *
+     * @param rawCodewords bytes as read directly from the QR Code
+     * @param version version of the QR Code
+     * @param ecLevel error-correction level of the QR Code
+     * @return DataBlocks containing original bytes, "de-interleaved" from representation in the
+     *         QR Code
+     */
+    DataBlock.getDataBlocks = function (rawCodewords, version, ecLevel) {
+        var e_1, _a, e_2, _b;
+        if (rawCodewords.length !== version.getTotalCodewords()) {
+            throw new IllegalArgumentException();
+        }
+        // Figure out the number and size of data blocks used by this version and
+        // error correction level
+        var ecBlocks = version.getECBlocksForLevel(ecLevel);
+        // First count the total number of data blocks
+        var totalBlocks = 0;
+        var ecBlockArray = ecBlocks.getECBlocks();
+        try {
+            for (var ecBlockArray_1 = __values(ecBlockArray), ecBlockArray_1_1 = ecBlockArray_1.next(); !ecBlockArray_1_1.done; ecBlockArray_1_1 = ecBlockArray_1.next()) {
+                var ecBlock = ecBlockArray_1_1.value;
+                totalBlocks += ecBlock.getCount();
+            }
+        }
+        catch (e_1_1) { e_1 = { error: e_1_1 }; }
+        finally {
+            try {
+                if (ecBlockArray_1_1 && !ecBlockArray_1_1.done && (_a = ecBlockArray_1.return)) _a.call(ecBlockArray_1);
+            }
+            finally { if (e_1) throw e_1.error; }
+        }
+        // Now establish DataBlocks of the appropriate size and number of data codewords
+        var result = new Array(totalBlocks);
+        var numResultBlocks = 0;
+        try {
+            for (var ecBlockArray_2 = __values(ecBlockArray), ecBlockArray_2_1 = ecBlockArray_2.next(); !ecBlockArray_2_1.done; ecBlockArray_2_1 = ecBlockArray_2.next()) {
+                var ecBlock = ecBlockArray_2_1.value;
+                for (var i = 0; i < ecBlock.getCount(); i++) {
+                    var numDataCodewords = ecBlock.getDataCodewords();
+                    var numBlockCodewords = ecBlocks.getECCodewordsPerBlock() + numDataCodewords;
+                    result[numResultBlocks++] = new DataBlock(numDataCodewords, new Uint8Array(numBlockCodewords));
+                }
+            }
+        }
+        catch (e_2_1) { e_2 = { error: e_2_1 }; }
+        finally {
+            try {
+                if (ecBlockArray_2_1 && !ecBlockArray_2_1.done && (_b = ecBlockArray_2.return)) _b.call(ecBlockArray_2);
+            }
+            finally { if (e_2) throw e_2.error; }
+        }
+        // All blocks have the same amount of data, except that the last n
+        // (where n may be 0) have 1 more byte. Figure out where these start.
+        var shorterBlocksTotalCodewords = result[0].codewords.length;
+        var longerBlocksStartAt = result.length - 1;
+        // TYPESCRIPTPORT: check length is correct here
+        while (longerBlocksStartAt >= 0) {
+            var numCodewords = result[longerBlocksStartAt].codewords.length;
+            if (numCodewords === shorterBlocksTotalCodewords) {
+                break;
+            }
+            longerBlocksStartAt--;
+        }
+        longerBlocksStartAt++;
+        var shorterBlocksNumDataCodewords = shorterBlocksTotalCodewords - ecBlocks.getECCodewordsPerBlock();
+        // The last elements of result may be 1 element longer
+        // first fill out as many elements as all of them have
+        var rawCodewordsOffset = 0;
+        for (var i = 0; i < shorterBlocksNumDataCodewords; i++) {
+            for (var j = 0; j < numResultBlocks; j++) {
+                result[j].codewords[i] = rawCodewords[rawCodewordsOffset++];
+            }
+        }
+        // Fill out the last data block in the longer ones
+        for (var j = longerBlocksStartAt; j < numResultBlocks; j++) {
+            result[j].codewords[shorterBlocksNumDataCodewords] = rawCodewords[rawCodewordsOffset++];
+        }
+        // Now add in error correction blocks
+        var max = result[0].codewords.length;
+        for (var i = shorterBlocksNumDataCodewords; i < max; i++) {
+            for (var j = 0; j < numResultBlocks; j++) {
+                var iOffset = j < longerBlocksStartAt ? i : i + 1;
+                result[j].codewords[iOffset] = rawCodewords[rawCodewordsOffset++];
+            }
+        }
+        return result;
+    };
+    DataBlock.prototype.getNumDataCodewords = function () {
+        return this.numDataCodewords;
+    };
+    DataBlock.prototype.getCodewords = function () {
+        return this.codewords;
+    };
+    return DataBlock;
+}());
+export default DataBlock;
+//# sourceMappingURL=DataBlock.js.map

package/template/node_modules/@zxing/library/esm/core/qrcode/decoder/DataBlock.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"DataBlock.js","sourceRoot":"","sources":["../../../../../src/core/qrcode/decoder/DataBlock.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;;;;;;;;;;;;AASH,OAAO,wBAAwB,MAAM,gCAAgC,CAAC;AAEtE;;;;;;GAMG;AACH;IAEI,mBAA4B,gBAAwB,CAAC,OAAO,EAAU,SAAqB;QAA/D,qBAAgB,GAAhB,gBAAgB,CAAQ;QAAkB,cAAS,GAAT,SAAS,CAAY;IAAI,CAAC;IAEhG;;;;;;;;;;OAUG;IACW,uBAAa,GAA3B,UAA4B,YAAwB,EAChD,OAAgB,EAChB,OAA6B;;QAE7B,IAAI,YAAY,CAAC,MAAM,KAAK,OAAO,CAAC,iBAAiB,EAAE,EAAE;YACrD,MAAM,IAAI,wBAAwB,EAAE,CAAC;SACxC;QAED,yEAAyE;QACzE,yBAAyB;QACzB,IAAM,QAAQ,GAAa,OAAO,CAAC,mBAAmB,CAAC,OAAO,CAAC,CAAC;QAEhE,8CAA8C;QAC9C,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,IAAM,YAAY,GAAU,QAAQ,CAAC,WAAW,EAAE,CAAC;;YACnD,KAAsB,IAAA,iBAAA,SAAA,YAAY,CAAA,0CAAA,oEAAE;gBAA/B,IAAM,OAAO,yBAAA;gBACd,WAAW,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;aACrC;;;;;;;;;QAED,gFAAgF;QAChF,IAAM,MAAM,GAAG,IAAI,KAAK,CAAY,WAAW,CAAC,CAAC;QACjD,IAAI,eAAe,GAAG,CAAC,CAAC;;YACxB,KAAsB,IAAA,iBAAA,SAAA,YAAY,CAAA,0CAAA,oEAAE;gBAA/B,IAAM,OAAO,yBAAA;gBACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,QAAQ,EAAE,EAAE,CAAC,EAAE,EAAE;oBACzC,IAAM,gBAAgB,GAAG,OAAO,CAAC,gBAAgB,EAAE,CAAC;oBACpD,IAAM,iBAAiB,GAAG,QAAQ,CAAC,sBAAsB,EAAE,GAAG,gBAAgB,CAAC;oBAC/E,MAAM,CAAC,eAAe,EAAE,CAAC,GAAG,IAAI,SAAS,CAAC,gBAAgB,EAAE,IAAI,UAAU,CAAC,iBAAiB,CAAC,CAAC,CAAC;iBAClG;aACJ;;;;;;;;;QAED,kEAAkE;QAClE,qEAAqE;QACrE,IAAM,2BAA2B,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC;QAC/D,IAAI,mBAAmB,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QAC5C,+CAA+C;QAC/C,OAAO,mBAAmB,IAAI,CAAC,EAAE;YAC7B,IAAM,YAAY,GAAG,MAAM,CAAC,mBAAmB,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC;YAClE,IAAI,YAAY,KAAK,2BAA2B,EAAE;gBAC9C,MAAM;aACT;YACD,mBAAmB,EAAE,CAAC;SACzB;QACD,mBAAmB,EAAE,CAAC;QAEtB,IAAM,6BAA6B,GAAG,2BAA2B,GAAG,QAAQ,CAAC,sBAAsB,EAAE,CAAC;QACtG,sDAAsD;QACtD,sDAAsD;QACtD,IAAI,kBAAkB,GAAG,CAAC,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,6BAA6B,EAAE,CAAC,EAAE,EAAE;YACpD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,EAAE,CAAC,EAAE,EAAE;gBACtC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,kBAAkB,EAAE,CAAC,CAAC;aAC/D;SACJ;QACD,kDAAkD;QAClD,KAAK,IAAI,CAAC,GAAG,mBAAmB,EAAE,CAAC,GAAG,eAAe,EAAE,CAAC,EAAE,EAAE;YACxD,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,6BAA6B,CAAC,GAAG,YAAY,CAAC,kBAAkB,EAAE,CAAC,CAAC;SAC3F;QACD,qCAAqC;QACrC,IAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC;QACvC,KAAK,IAAI,CAAC,GAAG,6BAA6B,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;YACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,EAAE,CAAC,EAAE,EAAE;gBACtC,IAAM,OAAO,GAAG,CAAC,GAAG,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACpD,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,OAAO,CAAC,GAAG,YAAY,CAAC,kBAAkB,EAAE,CAAC,CAAC;aACrE;SACJ;QACD,OAAO,MAAM,CAAC;IAClB,CAAC;IAEM,uCAAmB,GAA1B;QACI,OAAO,IAAI,CAAC,gBAAgB,CAAC;IACjC,CAAC;IAEM,gCAAY,GAAnB;QACI,OAAO,IAAI,CAAC,SAAS,CAAC;IAC1B,CAAC;IAEL,gBAAC;AAAD,CAAC,AA3FD,IA2FC"}

package/template/node_modules/@zxing/library/esm/core/qrcode/decoder/DataMask.d.ts

@@ -0,0 +1,36 @@
+import BitMatrix from '../../common/BitMatrix';
+export declare enum DataMaskValues {
+    DATA_MASK_000 = 0,
+    DATA_MASK_001 = 1,
+    DATA_MASK_010 = 2,
+    DATA_MASK_011 = 3,
+    DATA_MASK_100 = 4,
+    DATA_MASK_101 = 5,
+    DATA_MASK_110 = 6,
+    DATA_MASK_111 = 7
+}
+/**
+ * <p>Encapsulates data masks for the data bits in a QR code, per ISO 18004:2006 6.8. Implementations
+ * of this class can un-mask a raw BitMatrix. For simplicity, they will unmask the entire BitMatrix,
+ * including areas used for finder patterns, timing patterns, etc. These areas should be unused
+ * after the point they are unmasked anyway.</p>
+ *
+ * <p>Note that the diagram in section 6.8.1 is misleading since it indicates that i is column position
+ * and j is row position. In fact, as the text says, i is row position and j is column position.</p>
+ *
+ * @author Sean Owen
+ */
+export default class DataMask {
+    private value;
+    private isMasked;
+    constructor(value: DataMaskValues, isMasked: (i: number, j: number) => boolean);
+    static values: Map<DataMaskValues, DataMask>;
+    /**
+     * <p>Implementations of this method reverse the data masking process applied to a QR Code and
+     * make its bits ready to read.</p>
+     *
+     * @param bits representation of QR Code bits
+     * @param dimension dimension of QR Code, represented by bits, being unmasked
+     */
+    unmaskBitMatrix(bits: BitMatrix, dimension: number): void;
+}