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

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

@@ -0,0 +1,68 @@
+/*
+ * 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 __extends = (this && this.__extends) || (function () {
+    var extendStatics = function (d, b) {
+        extendStatics = Object.setPrototypeOf ||
+            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
+            function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };
+        return extendStatics(d, b);
+    };
+    return function (d, b) {
+        extendStatics(d, b);
+        function __() { this.constructor = d; }
+        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
+    };
+})();
+/*namespace com.google.zxing.qrcode.detector {*/
+import ResultPoint from '../../ResultPoint';
+/**
+ * <p>Encapsulates an alignment pattern, which are the smaller square patterns found in
+ * all but the simplest QR Codes.</p>
+ *
+ * @author Sean Owen
+ */
+var AlignmentPattern = /** @class */ (function (_super) {
+    __extends(AlignmentPattern, _super);
+    function AlignmentPattern(posX /*float*/, posY /*float*/, estimatedModuleSize /*float*/) {
+        var _this = _super.call(this, posX, posY) || this;
+        _this.estimatedModuleSize = estimatedModuleSize;
+        return _this;
+    }
+    /**
+     * <p>Determines if this alignment pattern "about equals" an alignment pattern at the stated
+     * position and size -- meaning, it is at nearly the same center with nearly the same size.</p>
+     */
+    AlignmentPattern.prototype.aboutEquals = function (moduleSize /*float*/, i /*float*/, j /*float*/) {
+        if (Math.abs(i - this.getY()) <= moduleSize && Math.abs(j - this.getX()) <= moduleSize) {
+            var moduleSizeDiff = Math.abs(moduleSize - this.estimatedModuleSize);
+            return moduleSizeDiff <= 1.0 || moduleSizeDiff <= this.estimatedModuleSize;
+        }
+        return false;
+    };
+    /**
+     * Combines this object's current estimate of a finder pattern position and module size
+     * with a new estimate. It returns a new {@code FinderPattern} containing an average of the two.
+     */
+    AlignmentPattern.prototype.combineEstimate = function (i /*float*/, j /*float*/, newModuleSize /*float*/) {
+        var combinedX = (this.getX() + j) / 2.0;
+        var combinedY = (this.getY() + i) / 2.0;
+        var combinedModuleSize = (this.estimatedModuleSize + newModuleSize) / 2.0;
+        return new AlignmentPattern(combinedX, combinedY, combinedModuleSize);
+    };
+    return AlignmentPattern;
+}(ResultPoint));
+export default AlignmentPattern;
+//# sourceMappingURL=AlignmentPattern.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"AlignmentPattern.js","sourceRoot":"","sources":["../../../../../src/core/qrcode/detector/AlignmentPattern.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;;;;;;;;;;;;;;AAEH,gDAAgD;AAEhD,OAAO,WAAW,MAAM,mBAAmB,CAAC;AAE5C;;;;;GAKG;AACH;IAA8C,oCAAW;IAErD,0BAAmB,IAAY,CAAA,SAAS,EAAE,IAAY,CAAA,SAAS,EAAU,mBAA2B,CAAA,SAAS;QAA7G,YACI,kBAAM,IAAI,EAAE,IAAI,CAAC,SACpB;QAFwE,yBAAmB,GAAnB,mBAAmB,CAAQ;;IAEpG,CAAC;IAED;;;OAGG;IACI,sCAAW,GAAlB,UAAmB,UAAkB,CAAA,SAAS,EAAE,CAAS,CAAA,SAAS,EAAE,CAAS,CAAA,SAAS;QAClF,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,UAAU,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,UAAU,EAAE;YACpF,IAAM,cAAc,GAAqB,IAAI,CAAC,GAAG,CAAC,UAAU,GAAG,IAAI,CAAC,mBAAmB,CAAC,CAAC;YACzF,OAAO,cAAc,IAAI,GAAG,IAAI,cAAc,IAAI,IAAI,CAAC,mBAAmB,CAAC;SAC9E;QACD,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;;OAGG;IACI,0CAAe,GAAtB,UAAuB,CAAS,CAAA,SAAS,EAAE,CAAS,CAAA,SAAS,EAAE,aAAqB,CAAA,SAAS;QACzF,IAAM,SAAS,GAAqB,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC;QAC5D,IAAM,SAAS,GAAqB,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC;QAC5D,IAAM,kBAAkB,GAAqB,CAAC,IAAI,CAAC,mBAAmB,GAAG,aAAa,CAAC,GAAG,GAAG,CAAC;QAC9F,OAAO,IAAI,gBAAgB,CAAC,SAAS,EAAE,SAAS,EAAE,kBAAkB,CAAC,CAAC;IAC1E,CAAC;IAEL,uBAAC;AAAD,CAAC,AA7BD,CAA8C,WAAW,GA6BxD"}

package/template/node_modules/@zxing/library/esm/core/qrcode/detector/AlignmentPatternFinder.d.ts

@@ -0,0 +1,82 @@
+import ResultPointCallback from '../../ResultPointCallback';
+import BitMatrix from '../../common/BitMatrix';
+import AlignmentPattern from './AlignmentPattern';
+/**
+ * <p>This class attempts to find alignment patterns in a QR Code. Alignment patterns look like finder
+ * patterns but are smaller and appear at regular intervals throughout the image.</p>
+ *
+ * <p>At the moment this only looks for the bottom-right alignment pattern.</p>
+ *
+ * <p>This is mostly a simplified copy of {@link FinderPatternFinder}. It is copied,
+ * pasted and stripped down here for maximum performance but does unfortunately duplicate
+ * some code.</p>
+ *
+ * <p>This class is thread-safe but not reentrant. Each thread must allocate its own object.</p>
+ *
+ * @author Sean Owen
+ */
+export default class AlignmentPatternFinder {
+    private image;
+    private startX;
+    private startY;
+    private width;
+    private height;
+    private moduleSize;
+    private resultPointCallback;
+    private possibleCenters;
+    private crossCheckStateCount;
+    /**
+     * <p>Creates a finder that will look in a portion of the whole image.</p>
+     *
+     * @param image image to search
+     * @param startX left column from which to start searching
+     * @param startY top row from which to start searching
+     * @param width width of region to search
+     * @param height height of region to search
+     * @param moduleSize estimated module size so far
+     */
+    constructor(image: BitMatrix, startX: number, startY: number, width: number, height: number, moduleSize: number, resultPointCallback: ResultPointCallback);
+    /**
+     * <p>This method attempts to find the bottom-right alignment pattern in the image. It is a bit messy since
+     * it's pretty performance-critical and so is written to be fast foremost.</p>
+     *
+     * @return {@link AlignmentPattern} if found
+     * @throws NotFoundException if not found
+     */
+    find(): AlignmentPattern;
+    /**
+     * Given a count of black/white/black pixels just seen and an end position,
+     * figures the location of the center of this black/white/black run.
+     */
+    private static centerFromEnd;
+    /**
+     * @param stateCount count of black/white/black pixels just read
+     * @return true iff the proportions of the counts is close enough to the 1/1/1 ratios
+     *         used by alignment patterns to be considered a match
+     */
+    private foundPatternCross;
+    /**
+     * <p>After a horizontal scan finds a potential alignment pattern, this method
+     * "cross-checks" by scanning down vertically through the center of the possible
+     * alignment pattern to see if the same proportion is detected.</p>
+     *
+     * @param startI row where an alignment pattern was detected
+     * @param centerJ center of the section that appears to cross an alignment pattern
+     * @param maxCount maximum reasonable number of modules that should be
+     * observed in any reading state, based on the results of the horizontal scan
+     * @return vertical center of alignment pattern, or {@link Float#NaN} if not found
+     */
+    private crossCheckVertical;
+    /**
+     * <p>This is called when a horizontal scan finds a possible alignment pattern. It will
+     * cross check with a vertical scan, and if successful, will see if this pattern had been
+     * found on a previous horizontal scan. If so, we consider it confirmed and conclude we have
+     * found the alignment pattern.</p>
+     *
+     * @param stateCount reading state module counts from horizontal scan
+     * @param i row where alignment pattern may be found
+     * @param j end of possible alignment pattern in row
+     * @return {@link AlignmentPattern} if we have found the same pattern twice, or null if not
+     */
+    private handlePossibleCenter;
+}

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

@@ -0,0 +1,270 @@
+/*
+ * 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 AlignmentPattern from './AlignmentPattern';
+import NotFoundException from '../../NotFoundException';
+/*import java.util.ArrayList;*/
+/*import java.util.List;*/
+/**
+ * <p>This class attempts to find alignment patterns in a QR Code. Alignment patterns look like finder
+ * patterns but are smaller and appear at regular intervals throughout the image.</p>
+ *
+ * <p>At the moment this only looks for the bottom-right alignment pattern.</p>
+ *
+ * <p>This is mostly a simplified copy of {@link FinderPatternFinder}. It is copied,
+ * pasted and stripped down here for maximum performance but does unfortunately duplicate
+ * some code.</p>
+ *
+ * <p>This class is thread-safe but not reentrant. Each thread must allocate its own object.</p>
+ *
+ * @author Sean Owen
+ */
+var AlignmentPatternFinder = /** @class */ (function () {
+    /**
+     * <p>Creates a finder that will look in a portion of the whole image.</p>
+     *
+     * @param image image to search
+     * @param startX left column from which to start searching
+     * @param startY top row from which to start searching
+     * @param width width of region to search
+     * @param height height of region to search
+     * @param moduleSize estimated module size so far
+     */
+    function AlignmentPatternFinder(image, startX /*int*/, startY /*int*/, width /*int*/, height /*int*/, moduleSize /*float*/, resultPointCallback) {
+        this.image = image;
+        this.startX = startX;
+        this.startY = startY;
+        this.width = width;
+        this.height = height;
+        this.moduleSize = moduleSize;
+        this.resultPointCallback = resultPointCallback;
+        this.possibleCenters = []; // new Array<any>(5))
+        // TYPESCRIPTPORT: array initialization without size as the length is checked below
+        this.crossCheckStateCount = new Int32Array(3);
+    }
+    /**
+     * <p>This method attempts to find the bottom-right alignment pattern in the image. It is a bit messy since
+     * it's pretty performance-critical and so is written to be fast foremost.</p>
+     *
+     * @return {@link AlignmentPattern} if found
+     * @throws NotFoundException if not found
+     */
+    AlignmentPatternFinder.prototype.find = function () {
+        var startX = this.startX;
+        var height = this.height;
+        var width = this.width;
+        var maxJ = startX + width;
+        var middleI = this.startY + (height / 2);
+        // We are looking for black/white/black modules in 1:1:1 ratio
+        // this tracks the number of black/white/black modules seen so far
+        var stateCount = new Int32Array(3);
+        var image = this.image;
+        for (var iGen = 0; iGen < height; iGen++) {
+            // Search from middle outwards
+            var i = middleI + ((iGen & 0x01) === 0 ? Math.floor((iGen + 1) / 2) : -Math.floor((iGen + 1) / 2));
+            stateCount[0] = 0;
+            stateCount[1] = 0;
+            stateCount[2] = 0;
+            var j = startX;
+            // Burn off leading white pixels before anything else; if we start in the middle of
+            // a white run, it doesn't make sense to count its length, since we don't know if the
+            // white run continued to the left of the start point
+            while (j < maxJ && !image.get(j, i)) {
+                j++;
+            }
+            var currentState = 0;
+            while (j < maxJ) {
+                if (image.get(j, i)) {
+                    // Black pixel
+                    if (currentState === 1) { // Counting black pixels
+                        stateCount[1]++;
+                    }
+                    else { // Counting white pixels
+                        if (currentState === 2) { // A winner?
+                            if (this.foundPatternCross(stateCount)) { // Yes
+                                var confirmed = this.handlePossibleCenter(stateCount, i, j);
+                                if (confirmed !== null) {
+                                    return confirmed;
+                                }
+                            }
+                            stateCount[0] = stateCount[2];
+                            stateCount[1] = 1;
+                            stateCount[2] = 0;
+                            currentState = 1;
+                        }
+                        else {
+                            stateCount[++currentState]++;
+                        }
+                    }
+                }
+                else { // White pixel
+                    if (currentState === 1) { // Counting black pixels
+                        currentState++;
+                    }
+                    stateCount[currentState]++;
+                }
+                j++;
+            }
+            if (this.foundPatternCross(stateCount)) {
+                var confirmed = this.handlePossibleCenter(stateCount, i, maxJ);
+                if (confirmed !== null) {
+                    return confirmed;
+                }
+            }
+        }
+        // Hmm, nothing we saw was observed and confirmed twice. If we had
+        // any guess at all, return it.
+        if (this.possibleCenters.length !== 0) {
+            return this.possibleCenters[0];
+        }
+        throw new NotFoundException();
+    };
+    /**
+     * Given a count of black/white/black pixels just seen and an end position,
+     * figures the location of the center of this black/white/black run.
+     */
+    AlignmentPatternFinder.centerFromEnd = function (stateCount, end /*int*/) {
+        return (end - stateCount[2]) - stateCount[1] / 2.0;
+    };
+    /**
+     * @param stateCount count of black/white/black pixels just read
+     * @return true iff the proportions of the counts is close enough to the 1/1/1 ratios
+     *         used by alignment patterns to be considered a match
+     */
+    AlignmentPatternFinder.prototype.foundPatternCross = function (stateCount) {
+        var moduleSize = this.moduleSize;
+        var maxVariance = moduleSize / 2.0;
+        for (var i = 0; i < 3; i++) {
+            if (Math.abs(moduleSize - stateCount[i]) >= maxVariance) {
+                return false;
+            }
+        }
+        return true;
+    };
+    /**
+     * <p>After a horizontal scan finds a potential alignment pattern, this method
+     * "cross-checks" by scanning down vertically through the center of the possible
+     * alignment pattern to see if the same proportion is detected.</p>
+     *
+     * @param startI row where an alignment pattern was detected
+     * @param centerJ center of the section that appears to cross an alignment pattern
+     * @param maxCount maximum reasonable number of modules that should be
+     * observed in any reading state, based on the results of the horizontal scan
+     * @return vertical center of alignment pattern, or {@link Float#NaN} if not found
+     */
+    AlignmentPatternFinder.prototype.crossCheckVertical = function (startI /*int*/, centerJ /*int*/, maxCount /*int*/, originalStateCountTotal /*int*/) {
+        var image = this.image;
+        var maxI = image.getHeight();
+        var stateCount = this.crossCheckStateCount;
+        stateCount[0] = 0;
+        stateCount[1] = 0;
+        stateCount[2] = 0;
+        // Start counting up from center
+        var i = startI;
+        while (i >= 0 && image.get(centerJ, i) && stateCount[1] <= maxCount) {
+            stateCount[1]++;
+            i--;
+        }
+        // If already too many modules in this state or ran off the edge:
+        if (i < 0 || stateCount[1] > maxCount) {
+            return NaN;
+        }
+        while (i >= 0 && !image.get(centerJ, i) && stateCount[0] <= maxCount) {
+            stateCount[0]++;
+            i--;
+        }
+        if (stateCount[0] > maxCount) {
+            return NaN;
+        }
+        // Now also count down from center
+        i = startI + 1;
+        while (i < maxI && image.get(centerJ, i) && stateCount[1] <= maxCount) {
+            stateCount[1]++;
+            i++;
+        }
+        if (i === maxI || stateCount[1] > maxCount) {
+            return NaN;
+        }
+        while (i < maxI && !image.get(centerJ, i) && stateCount[2] <= maxCount) {
+            stateCount[2]++;
+            i++;
+        }
+        if (stateCount[2] > maxCount) {
+            return NaN;
+        }
+        var stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2];
+        if (5 * Math.abs(stateCountTotal - originalStateCountTotal) >= 2 * originalStateCountTotal) {
+            return NaN;
+        }
+        return this.foundPatternCross(stateCount) ? AlignmentPatternFinder.centerFromEnd(stateCount, i) : NaN;
+    };
+    /**
+     * <p>This is called when a horizontal scan finds a possible alignment pattern. It will
+     * cross check with a vertical scan, and if successful, will see if this pattern had been
+     * found on a previous horizontal scan. If so, we consider it confirmed and conclude we have
+     * found the alignment pattern.</p>
+     *
+     * @param stateCount reading state module counts from horizontal scan
+     * @param i row where alignment pattern may be found
+     * @param j end of possible alignment pattern in row
+     * @return {@link AlignmentPattern} if we have found the same pattern twice, or null if not
+     */
+    AlignmentPatternFinder.prototype.handlePossibleCenter = function (stateCount, i /*int*/, j /*int*/) {
+        var e_1, _a;
+        var stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2];
+        var centerJ = AlignmentPatternFinder.centerFromEnd(stateCount, j);
+        var centerI = this.crossCheckVertical(i, /*(int) */ centerJ, 2 * stateCount[1], stateCountTotal);
+        if (!isNaN(centerI)) {
+            var estimatedModuleSize = (stateCount[0] + stateCount[1] + stateCount[2]) / 3.0;
+            try {
+                for (var _b = __values(this.possibleCenters), _c = _b.next(); !_c.done; _c = _b.next()) {
+                    var center = _c.value;
+                    // Look for about the same center and module size:
+                    if (center.aboutEquals(estimatedModuleSize, centerI, centerJ)) {
+                        return center.combineEstimate(centerI, centerJ, estimatedModuleSize);
+                    }
+                }
+            }
+            catch (e_1_1) { e_1 = { error: e_1_1 }; }
+            finally {
+                try {
+                    if (_c && !_c.done && (_a = _b.return)) _a.call(_b);
+                }
+                finally { if (e_1) throw e_1.error; }
+            }
+            // Hadn't found this before; save it
+            var point = new AlignmentPattern(centerJ, centerI, estimatedModuleSize);
+            this.possibleCenters.push(point);
+            if (this.resultPointCallback !== null && this.resultPointCallback !== undefined) {
+                this.resultPointCallback.foundPossibleResultPoint(point);
+            }
+        }
+        return null;
+    };
+    return AlignmentPatternFinder;
+}());
+export default AlignmentPatternFinder;
+//# sourceMappingURL=AlignmentPatternFinder.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"AlignmentPatternFinder.js","sourceRoot":"","sources":["../../../../../src/core/qrcode/detector/AlignmentPatternFinder.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;;;;;;;;;;;;AAMH,OAAO,gBAAgB,MAAM,oBAAoB,CAAC;AAElD,OAAO,iBAAiB,MAAM,yBAAyB,CAAC;AAExD,+BAA+B;AAC/B,0BAA0B;AAE1B;;;;;;;;;;;;;GAaG;AACH;IAKI;;;;;;;;;OASG;IACH,gCAA2B,KAAgB,EAC/B,MAAc,CAAC,OAAO,EACtB,MAAc,CAAC,OAAO,EACtB,KAAa,CAAC,OAAO,EACrB,MAAc,CAAC,OAAO,EACtB,UAAkB,CAAA,SAAS,EAC3B,mBAAwC;QANzB,UAAK,GAAL,KAAK,CAAW;QAC/B,WAAM,GAAN,MAAM,CAAQ;QACd,WAAM,GAAN,MAAM,CAAQ;QACd,UAAK,GAAL,KAAK,CAAQ;QACb,WAAM,GAAN,MAAM,CAAQ;QACd,eAAU,GAAV,UAAU,CAAQ;QAClB,wBAAmB,GAAnB,mBAAmB,CAAqB;QAChD,IAAI,CAAC,eAAe,GAAG,EAAE,CAAC,CAAC,qBAAqB;QAChD,mFAAmF;QACnF,IAAI,CAAC,oBAAoB,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IAClD,CAAC;IAED;;;;;;OAMG;IACI,qCAAI,GAAX;QACI,IAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC3B,IAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC3B,IAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,IAAM,IAAI,GAAG,MAAM,GAAG,KAAK,CAAC;QAC5B,IAAM,OAAO,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC3C,8DAA8D;QAC9D,kEAAkE;QAClE,IAAM,UAAU,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;QACrC,IAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,MAAM,EAAE,IAAI,EAAE,EAAE;YACtC,8BAA8B;YAC9B,IAAM,CAAC,GAAG,OAAO,GAAG,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAErG,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAClB,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAClB,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAElB,IAAI,CAAC,GAAG,MAAM,CAAC;YACf,mFAAmF;YACnF,qFAAqF;YACrF,qDAAqD;YACrD,OAAO,CAAC,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;gBACjC,CAAC,EAAE,CAAC;aACP;YACD,IAAI,YAAY,GAAG,CAAC,CAAC;YACrB,OAAO,CAAC,GAAG,IAAI,EAAE;gBACb,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;oBACjB,cAAc;oBACd,IAAI,YAAY,KAAK,CAAC,EAAE,EAAE,wBAAwB;wBAC9C,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC;qBACnB;yBAAM,EAAE,wBAAwB;wBAC7B,IAAI,YAAY,KAAK,CAAC,EAAE,EAAE,YAAY;4BAClC,IAAI,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC,EAAE,EAAE,MAAM;gCAC5C,IAAM,SAAS,GAAG,IAAI,CAAC,oBAAoB,CAAC,UAAU,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;gCAC9D,IAAI,SAAS,KAAK,IAAI,EAAE;oCACpB,OAAO,SAAS,CAAC;iCACpB;6BACJ;4BACD,UAAU,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;4BAC9B,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;4BAClB,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;4BAClB,YAAY,GAAG,CAAC,CAAC;yBACpB;6BAAM;4BACH,UAAU,CAAC,EAAE,YAAY,CAAC,EAAE,CAAC;yBAChC;qBACJ;iBACJ;qBAAM,EAAE,cAAc;oBACnB,IAAI,YAAY,KAAK,CAAC,EAAE,EAAE,wBAAwB;wBAC9C,YAAY,EAAE,CAAC;qBAClB;oBACD,UAAU,CAAC,YAAY,CAAC,EAAE,CAAC;iBAC9B;gBACD,CAAC,EAAE,CAAC;aACP;YACD,IAAI,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC,EAAE;gBACpC,IAAM,SAAS,GAAG,IAAI,CAAC,oBAAoB,CAAC,UAAU,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;gBACjE,IAAI,SAAS,KAAK,IAAI,EAAE;oBACpB,OAAO,SAAS,CAAC;iBACpB;aACJ;SAEJ;QAED,kEAAkE;QAClE,+BAA+B;QAC/B,IAAI,IAAI,CAAC,eAAe,CAAC,MAAM,KAAK,CAAC,EAAE;YACnC,OAAO,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;SAClC;QAED,MAAM,IAAI,iBAAiB,EAAE,CAAC;IAClC,CAAC;IAED;;;OAGG;IACY,oCAAa,GAA5B,UAA6B,UAAsB,EAAE,GAAW,CAAC,OAAO;QACpE,OAAO,CAAC,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;IACvD,CAAC;IAED;;;;OAIG;IACK,kDAAiB,GAAzB,UAA0B,UAAsB;QAC5C,IAAM,UAAU,GAAqB,IAAI,CAAC,UAAU,CAAC;QACrD,IAAM,WAAW,GAAqB,UAAU,GAAG,GAAG,CAAC;QACvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YACxB,IAAI,IAAI,CAAC,GAAG,CAAC,UAAU,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,WAAW,EAAE;gBACrD,OAAO,KAAK,CAAC;aAChB;SACJ;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;;;;;;;;;OAUG;IACK,mDAAkB,GAA1B,UAA2B,MAAc,CAAC,OAAO,EAAE,OAAe,CAAC,OAAO,EAAE,QAAgB,CAAC,OAAO,EAChG,uBAA+B,CAAC,OAAO;QACvC,IAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QAEzB,IAAM,IAAI,GAAG,KAAK,CAAC,SAAS,EAAE,CAAC;QAC/B,IAAM,UAAU,GAAG,IAAI,CAAC,oBAAoB,CAAC;QAC7C,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAClB,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAClB,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAElB,gCAAgC;QAChC,IAAI,CAAC,GAAG,MAAM,CAAC;QACf,OAAO,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,IAAI,QAAQ,EAAE;YACjE,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC;YAChB,CAAC,EAAE,CAAC;SACP;QACD,iEAAiE;QACjE,IAAI,CAAC,GAAG,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,GAAG,QAAQ,EAAE;YACnC,OAAO,GAAG,CAAC;SACd;QACD,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,IAAI,QAAQ,EAAE;YAClE,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC;YAChB,CAAC,EAAE,CAAC;SACP;QACD,IAAI,UAAU,CAAC,CAAC,CAAC,GAAG,QAAQ,EAAE;YAC1B,OAAO,GAAG,CAAC;SACd;QAED,kCAAkC;QAClC,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC;QACf,OAAO,CAAC,GAAG,IAAI,IAAI,KAAK,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,IAAI,QAAQ,EAAE;YACnE,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC;YAChB,CAAC,EAAE,CAAC;SACP;QACD,IAAI,CAAC,KAAK,IAAI,IAAI,UAAU,CAAC,CAAC,CAAC,GAAG,QAAQ,EAAE;YACxC,OAAO,GAAG,CAAC;SACd;QACD,OAAO,CAAC,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,IAAI,QAAQ,EAAE;YACpE,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC;YAChB,CAAC,EAAE,CAAC;SACP;QACD,IAAI,UAAU,CAAC,CAAC,CAAC,GAAG,QAAQ,EAAE;YAC1B,OAAO,GAAG,CAAC;SACd;QAED,IAAM,eAAe,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;QACtE,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,eAAe,GAAG,uBAAuB,CAAC,IAAI,CAAC,GAAG,uBAAuB,EAAE;YACxF,OAAO,GAAG,CAAC;SACd;QAED,OAAO,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,sBAAsB,CAAC,aAAa,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;IAC1G,CAAC;IAED;;;;;;;;;;OAUG;IACK,qDAAoB,GAA5B,UAA6B,UAAsB,EAAE,CAAS,CAAC,OAAO,EAAE,CAAS,CAAC,OAAO;;QACrF,IAAM,eAAe,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;QACtE,IAAM,OAAO,GAAqB,sBAAsB,CAAC,aAAa,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;QACtF,IAAM,OAAO,GAAqB,IAAI,CAAC,kBAAkB,CAAC,CAAC,EAAE,UAAU,CAAA,OAAO,EAAE,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,EAAE,eAAe,CAAC,CAAC;QACpH,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE;YACjB,IAAM,mBAAmB,GAAqB,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;;gBACpG,KAAqB,IAAA,KAAA,SAAA,IAAI,CAAC,eAAe,CAAA,gBAAA,4BAAE;oBAAtC,IAAM,MAAM,WAAA;oBACb,kDAAkD;oBAClD,IAAI,MAAM,CAAC,WAAW,CAAC,mBAAmB,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE;wBAC3D,OAAO,MAAM,CAAC,eAAe,CAAC,OAAO,EAAE,OAAO,EAAE,mBAAmB,CAAC,CAAC;qBACxE;iBACJ;;;;;;;;;YACD,oCAAoC;YACpC,IAAM,KAAK,GAAG,IAAI,gBAAgB,CAAC,OAAO,EAAE,OAAO,EAAE,mBAAmB,CAAC,CAAC;YAC1E,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACjC,IAAI,IAAI,CAAC,mBAAmB,KAAK,IAAI,IAAI,IAAI,CAAC,mBAAmB,KAAK,SAAS,EAAE;gBAC7E,IAAI,CAAC,mBAAmB,CAAC,wBAAwB,CAAC,KAAK,CAAC,CAAC;aAC5D;SACJ;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;IAEL,6BAAC;AAAD,CAAC,AApOD,IAoOC"}

package/template/node_modules/@zxing/library/esm/core/qrcode/detector/Detector.d.ts

@@ -0,0 +1,87 @@
+import BitMatrix from '../../common/BitMatrix';
+import DetectorResult from '../../common/DetectorResult';
+import DecodeHintType from '../../DecodeHintType';
+import ResultPoint from '../../ResultPoint';
+import ResultPointCallback from '../../ResultPointCallback';
+import AlignmentPattern from './AlignmentPattern';
+import FinderPatternInfo from './FinderPatternInfo';
+/**
+ * <p>Encapsulates logic that can detect a QR Code in an image, even if the QR Code
+ * is rotated or skewed, or partially obscured.</p>
+ *
+ * @author Sean Owen
+ */
+export default class Detector {
+    private image;
+    private resultPointCallback;
+    constructor(image: BitMatrix);
+    protected getImage(): BitMatrix;
+    protected getResultPointCallback(): ResultPointCallback;
+    /**
+     * <p>Detects a QR Code in an image.</p>
+     *
+     * @return {@link DetectorResult} encapsulating results of detecting a QR Code
+     * @throws NotFoundException if QR Code cannot be found
+     * @throws FormatException if a QR Code cannot be decoded
+     */
+    /**
+     * <p>Detects a QR Code in an image.</p>
+     *
+     * @param hints optional hints to detector
+     * @return {@link DetectorResult} encapsulating results of detecting a QR Code
+     * @throws NotFoundException if QR Code cannot be found
+     * @throws FormatException if a QR Code cannot be decoded
+     */
+    detect(hints: Map<DecodeHintType, any>): DetectorResult;
+    protected processFinderPatternInfo(info: FinderPatternInfo): DetectorResult;
+    private static createTransform;
+    private static sampleGrid;
+    /**
+     * <p>Computes the dimension (number of modules on a size) of the QR Code based on the position
+     * of the finder patterns and estimated module size.</p>
+     */
+    private static computeDimension;
+    /**
+     * <p>Computes an average estimated module size based on estimated derived from the positions
+     * of the three finder patterns.</p>
+     *
+     * @param topLeft detected top-left finder pattern center
+     * @param topRight detected top-right finder pattern center
+     * @param bottomLeft detected bottom-left finder pattern center
+     * @return estimated module size
+     */
+    protected calculateModuleSize(topLeft: ResultPoint, topRight: ResultPoint, bottomLeft: ResultPoint): number;
+    /**
+     * <p>Estimates module size based on two finder patterns -- it uses
+     * {@link #sizeOfBlackWhiteBlackRunBothWays(int, int, int, int)} to figure the
+     * width of each, measuring along the axis between their centers.</p>
+     */
+    private calculateModuleSizeOneWay;
+    /**
+     * See {@link #sizeOfBlackWhiteBlackRun(int, int, int, int)}; computes the total width of
+     * a finder pattern by looking for a black-white-black run from the center in the direction
+     * of another point (another finder pattern center), and in the opposite direction too.
+     */
+    private sizeOfBlackWhiteBlackRunBothWays;
+    /**
+     * <p>This method traces a line from a point in the image, in the direction towards another point.
+     * It begins in a black region, and keeps going until it finds white, then black, then white again.
+     * It reports the distance from the start to this point.</p>
+     *
+     * <p>This is used when figuring out how wide a finder pattern is, when the finder pattern
+     * may be skewed or rotated.</p>
+     */
+    private sizeOfBlackWhiteBlackRun;
+    /**
+     * <p>Attempts to locate an alignment pattern in a limited region of the image, which is
+     * guessed to contain it. This method uses {@link AlignmentPattern}.</p>
+     *
+     * @param overallEstModuleSize estimated module size so far
+     * @param estAlignmentX x coordinate of center of area probably containing alignment pattern
+     * @param estAlignmentY y coordinate of above
+     * @param allowanceFactor number of pixels in all directions to search from the center
+     * @return {@link AlignmentPattern} if found, or null otherwise
+     * @throws NotFoundException if an unexpected error occurs during detection
+     */
+    protected findAlignmentInRegion(overallEstModuleSize: number, estAlignmentX: number, estAlignmentY: number, allowanceFactor: number): AlignmentPattern;
+}