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

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

@@ -0,0 +1,324 @@
+/*
+ * 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 MathUtils from '../../common/detector/MathUtils';
+import DetectorResult from '../../common/DetectorResult';
+// import GridSampler from '../../common/GridSampler';
+import GridSamplerInstance from '../../common/GridSamplerInstance';
+import PerspectiveTransform from '../../common/PerspectiveTransform';
+import DecodeHintType from '../../DecodeHintType';
+import NotFoundException from '../../NotFoundException';
+import ResultPoint from '../../ResultPoint';
+import Version from '../decoder/Version';
+import AlignmentPatternFinder from './AlignmentPatternFinder';
+import FinderPatternFinder from './FinderPatternFinder';
+/*import java.util.Map;*/
+/**
+ * <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
+ */
+var Detector = /** @class */ (function () {
+    function Detector(image) {
+        this.image = image;
+    }
+    Detector.prototype.getImage = function () {
+        return this.image;
+    };
+    Detector.prototype.getResultPointCallback = function () {
+        return this.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
+     */
+    // public detect(): DetectorResult /*throws NotFoundException, FormatException*/ {
+    //   return detect(null)
+    // }
+    /**
+     * <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
+     */
+    Detector.prototype.detect = function (hints) {
+        this.resultPointCallback = (hints === null || hints === undefined) ? null :
+            /*(ResultPointCallback) */ hints.get(DecodeHintType.NEED_RESULT_POINT_CALLBACK);
+        var finder = new FinderPatternFinder(this.image, this.resultPointCallback);
+        var info = finder.find(hints);
+        return this.processFinderPatternInfo(info);
+    };
+    Detector.prototype.processFinderPatternInfo = function (info) {
+        var topLeft = info.getTopLeft();
+        var topRight = info.getTopRight();
+        var bottomLeft = info.getBottomLeft();
+        var moduleSize = this.calculateModuleSize(topLeft, topRight, bottomLeft);
+        if (moduleSize < 1.0) {
+            throw new NotFoundException('No pattern found in proccess finder.');
+        }
+        var dimension = Detector.computeDimension(topLeft, topRight, bottomLeft, moduleSize);
+        var provisionalVersion = Version.getProvisionalVersionForDimension(dimension);
+        var modulesBetweenFPCenters = provisionalVersion.getDimensionForVersion() - 7;
+        var alignmentPattern = null;
+        // Anything above version 1 has an alignment pattern
+        if (provisionalVersion.getAlignmentPatternCenters().length > 0) {
+            // Guess where a "bottom right" finder pattern would have been
+            var bottomRightX = topRight.getX() - topLeft.getX() + bottomLeft.getX();
+            var bottomRightY = topRight.getY() - topLeft.getY() + bottomLeft.getY();
+            // Estimate that alignment pattern is closer by 3 modules
+            // from "bottom right" to known top left location
+            var correctionToTopLeft = 1.0 - 3.0 / modulesBetweenFPCenters;
+            var estAlignmentX = /*(int) */ Math.floor(topLeft.getX() + correctionToTopLeft * (bottomRightX - topLeft.getX()));
+            var estAlignmentY = /*(int) */ Math.floor(topLeft.getY() + correctionToTopLeft * (bottomRightY - topLeft.getY()));
+            // Kind of arbitrary -- expand search radius before giving up
+            for (var i = 4; i <= 16; i <<= 1) {
+                try {
+                    alignmentPattern = this.findAlignmentInRegion(moduleSize, estAlignmentX, estAlignmentY, i);
+                    break;
+                }
+                catch (re /*NotFoundException*/) {
+                    if (!(re instanceof NotFoundException)) {
+                        throw re;
+                    }
+                    // try next round
+                }
+            }
+            // If we didn't find alignment pattern... well try anyway without it
+        }
+        var transform = Detector.createTransform(topLeft, topRight, bottomLeft, alignmentPattern, dimension);
+        var bits = Detector.sampleGrid(this.image, transform, dimension);
+        var points;
+        if (alignmentPattern === null) {
+            points = [bottomLeft, topLeft, topRight];
+        }
+        else {
+            points = [bottomLeft, topLeft, topRight, alignmentPattern];
+        }
+        return new DetectorResult(bits, points);
+    };
+    Detector.createTransform = function (topLeft, topRight, bottomLeft, alignmentPattern, dimension /*int*/) {
+        var dimMinusThree = dimension - 3.5;
+        var bottomRightX; /*float*/
+        var bottomRightY; /*float*/
+        var sourceBottomRightX; /*float*/
+        var sourceBottomRightY; /*float*/
+        if (alignmentPattern !== null) {
+            bottomRightX = alignmentPattern.getX();
+            bottomRightY = alignmentPattern.getY();
+            sourceBottomRightX = dimMinusThree - 3.0;
+            sourceBottomRightY = sourceBottomRightX;
+        }
+        else {
+            // Don't have an alignment pattern, just make up the bottom-right point
+            bottomRightX = (topRight.getX() - topLeft.getX()) + bottomLeft.getX();
+            bottomRightY = (topRight.getY() - topLeft.getY()) + bottomLeft.getY();
+            sourceBottomRightX = dimMinusThree;
+            sourceBottomRightY = dimMinusThree;
+        }
+        return PerspectiveTransform.quadrilateralToQuadrilateral(3.5, 3.5, dimMinusThree, 3.5, sourceBottomRightX, sourceBottomRightY, 3.5, dimMinusThree, topLeft.getX(), topLeft.getY(), topRight.getX(), topRight.getY(), bottomRightX, bottomRightY, bottomLeft.getX(), bottomLeft.getY());
+    };
+    Detector.sampleGrid = function (image, transform, dimension /*int*/) {
+        var sampler = GridSamplerInstance.getInstance();
+        return sampler.sampleGridWithTransform(image, dimension, dimension, transform);
+    };
+    /**
+     * <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>
+     */
+    Detector.computeDimension = function (topLeft, topRight, bottomLeft, moduleSize /*float*/) {
+        var tltrCentersDimension = MathUtils.round(ResultPoint.distance(topLeft, topRight) / moduleSize);
+        var tlblCentersDimension = MathUtils.round(ResultPoint.distance(topLeft, bottomLeft) / moduleSize);
+        var dimension = Math.floor((tltrCentersDimension + tlblCentersDimension) / 2) + 7;
+        switch (dimension & 0x03) { // mod 4
+            case 0:
+                dimension++;
+                break;
+            // 1? do nothing
+            case 2:
+                dimension--;
+                break;
+            case 3:
+                throw new NotFoundException('Dimensions could be not found.');
+        }
+        return dimension;
+    };
+    /**
+     * <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
+     */
+    Detector.prototype.calculateModuleSize = function (topLeft, topRight, bottomLeft) {
+        // Take the average
+        return (this.calculateModuleSizeOneWay(topLeft, topRight) +
+            this.calculateModuleSizeOneWay(topLeft, bottomLeft)) / 2.0;
+    };
+    /**
+     * <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>
+     */
+    Detector.prototype.calculateModuleSizeOneWay = function (pattern, otherPattern) {
+        var moduleSizeEst1 = this.sizeOfBlackWhiteBlackRunBothWays(/*(int) */ Math.floor(pattern.getX()), 
+        /*(int) */ Math.floor(pattern.getY()), 
+        /*(int) */ Math.floor(otherPattern.getX()), 
+        /*(int) */ Math.floor(otherPattern.getY()));
+        var moduleSizeEst2 = this.sizeOfBlackWhiteBlackRunBothWays(/*(int) */ Math.floor(otherPattern.getX()), 
+        /*(int) */ Math.floor(otherPattern.getY()), 
+        /*(int) */ Math.floor(pattern.getX()), 
+        /*(int) */ Math.floor(pattern.getY()));
+        if (isNaN(moduleSizeEst1)) {
+            return moduleSizeEst2 / 7.0;
+        }
+        if (isNaN(moduleSizeEst2)) {
+            return moduleSizeEst1 / 7.0;
+        }
+        // Average them, and divide by 7 since we've counted the width of 3 black modules,
+        // and 1 white and 1 black module on either side. Ergo, divide sum by 14.
+        return (moduleSizeEst1 + moduleSizeEst2) / 14.0;
+    };
+    /**
+     * 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.
+     */
+    Detector.prototype.sizeOfBlackWhiteBlackRunBothWays = function (fromX /*int*/, fromY /*int*/, toX /*int*/, toY /*int*/) {
+        var result = this.sizeOfBlackWhiteBlackRun(fromX, fromY, toX, toY);
+        // Now count other way -- don't run off image though of course
+        var scale = 1.0;
+        var otherToX = fromX - (toX - fromX);
+        if (otherToX < 0) {
+            scale = fromX / /*(float) */ (fromX - otherToX);
+            otherToX = 0;
+        }
+        else if (otherToX >= this.image.getWidth()) {
+            scale = (this.image.getWidth() - 1 - fromX) / /*(float) */ (otherToX - fromX);
+            otherToX = this.image.getWidth() - 1;
+        }
+        var otherToY = /*(int) */ Math.floor(fromY - (toY - fromY) * scale);
+        scale = 1.0;
+        if (otherToY < 0) {
+            scale = fromY / /*(float) */ (fromY - otherToY);
+            otherToY = 0;
+        }
+        else if (otherToY >= this.image.getHeight()) {
+            scale = (this.image.getHeight() - 1 - fromY) / /*(float) */ (otherToY - fromY);
+            otherToY = this.image.getHeight() - 1;
+        }
+        otherToX = /*(int) */ Math.floor(fromX + (otherToX - fromX) * scale);
+        result += this.sizeOfBlackWhiteBlackRun(fromX, fromY, otherToX, otherToY);
+        // Middle pixel is double-counted this way; subtract 1
+        return result - 1.0;
+    };
+    /**
+     * <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>
+     */
+    Detector.prototype.sizeOfBlackWhiteBlackRun = function (fromX /*int*/, fromY /*int*/, toX /*int*/, toY /*int*/) {
+        // Mild variant of Bresenham's algorithm
+        // see http://en.wikipedia.org/wiki/Bresenham's_line_algorithm
+        var steep = Math.abs(toY - fromY) > Math.abs(toX - fromX);
+        if (steep) {
+            var temp = fromX;
+            fromX = fromY;
+            fromY = temp;
+            temp = toX;
+            toX = toY;
+            toY = temp;
+        }
+        var dx = Math.abs(toX - fromX);
+        var dy = Math.abs(toY - fromY);
+        var error = -dx / 2;
+        var xstep = fromX < toX ? 1 : -1;
+        var ystep = fromY < toY ? 1 : -1;
+        // In black pixels, looking for white, first or second time.
+        var state = 0;
+        // Loop up until x == toX, but not beyond
+        var xLimit = toX + xstep;
+        for (var x = fromX, y = fromY; x !== xLimit; x += xstep) {
+            var realX = steep ? y : x;
+            var realY = steep ? x : y;
+            // Does current pixel mean we have moved white to black or vice versa?
+            // Scanning black in state 0,2 and white in state 1, so if we find the wrong
+            // color, advance to next state or end if we are in state 2 already
+            if ((state === 1) === this.image.get(realX, realY)) {
+                if (state === 2) {
+                    return MathUtils.distance(x, y, fromX, fromY);
+                }
+                state++;
+            }
+            error += dy;
+            if (error > 0) {
+                if (y === toY) {
+                    break;
+                }
+                y += ystep;
+                error -= dx;
+            }
+        }
+        // Found black-white-black; give the benefit of the doubt that the next pixel outside the image
+        // is "white" so this last point at (toX+xStep,toY) is the right ending. This is really a
+        // small approximation; (toX+xStep,toY+yStep) might be really correct. Ignore this.
+        if (state === 2) {
+            return MathUtils.distance(toX + xstep, toY, fromX, fromY);
+        }
+        // else we didn't find even black-white-black; no estimate is really possible
+        return NaN;
+    };
+    /**
+     * <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
+     */
+    Detector.prototype.findAlignmentInRegion = function (overallEstModuleSize /*float*/, estAlignmentX /*int*/, estAlignmentY /*int*/, allowanceFactor /*float*/) {
+        // Look for an alignment pattern (3 modules in size) around where it
+        // should be
+        var allowance = /*(int) */ Math.floor(allowanceFactor * overallEstModuleSize);
+        var alignmentAreaLeftX = Math.max(0, estAlignmentX - allowance);
+        var alignmentAreaRightX = Math.min(this.image.getWidth() - 1, estAlignmentX + allowance);
+        if (alignmentAreaRightX - alignmentAreaLeftX < overallEstModuleSize * 3) {
+            throw new NotFoundException('Alignment top exceeds estimated module size.');
+        }
+        var alignmentAreaTopY = Math.max(0, estAlignmentY - allowance);
+        var alignmentAreaBottomY = Math.min(this.image.getHeight() - 1, estAlignmentY + allowance);
+        if (alignmentAreaBottomY - alignmentAreaTopY < overallEstModuleSize * 3) {
+            throw new NotFoundException('Alignment bottom exceeds estimated module size.');
+        }
+        var alignmentFinder = new AlignmentPatternFinder(this.image, alignmentAreaLeftX, alignmentAreaTopY, alignmentAreaRightX - alignmentAreaLeftX, alignmentAreaBottomY - alignmentAreaTopY, overallEstModuleSize, this.resultPointCallback);
+        return alignmentFinder.find();
+    };
+    return Detector;
+}());
+export default Detector;
+//# sourceMappingURL=Detector.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"Detector.js","sourceRoot":"","sources":["../../../../../src/core/qrcode/detector/Detector.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAKH,OAAO,SAAS,MAAM,iCAAiC,CAAC;AACxD,OAAO,cAAc,MAAM,6BAA6B,CAAC;AACzD,sDAAsD;AACtD,OAAO,mBAAmB,MAAM,kCAAkC,CAAC;AACnE,OAAO,oBAAoB,MAAM,mCAAmC,CAAC;AACrE,OAAO,cAAc,MAAM,sBAAsB,CAAC;AAClD,OAAO,iBAAiB,MAAM,yBAAyB,CAAC;AACxD,OAAO,WAAW,MAAM,mBAAmB,CAAC;AAE5C,OAAO,OAAO,MAAM,oBAAoB,CAAC;AAEzC,OAAO,sBAAsB,MAAM,0BAA0B,CAAC;AAE9D,OAAO,mBAAmB,MAAM,uBAAuB,CAAC;AAIxD,yBAAyB;AAEzB;;;;;GAKG;AACH;IAIE,kBAA2B,KAAgB;QAAhB,UAAK,GAAL,KAAK,CAAW;IAAI,CAAC;IAEtC,2BAAQ,GAAlB;QACE,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAES,yCAAsB,GAAhC;QACE,OAAO,IAAI,CAAC,mBAAmB,CAAC;IAClC,CAAC;IAED;;;;;;OAMG;IACH,kFAAkF;IAClF,wBAAwB;IACxB,IAAI;IAEJ;;;;;;;OAOG;IACI,yBAAM,GAAb,UAAc,KAA+B;QAE3C,IAAI,CAAC,mBAAmB,GAAG,CAAC,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACvE,0BAA0B,CAAA,KAAK,CAAC,GAAG,CAAC,cAAc,CAAC,0BAA0B,CAAC,CAAC;QAEnF,IAAM,MAAM,GAAG,IAAI,mBAAmB,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,mBAAmB,CAAC,CAAC;QAC7E,IAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAEhC,OAAO,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,CAAC;IAC7C,CAAC;IAES,2CAAwB,GAAlC,UAAmC,IAAuB;QAExD,IAAM,OAAO,GAAkB,IAAI,CAAC,UAAU,EAAE,CAAC;QACjD,IAAM,QAAQ,GAAkB,IAAI,CAAC,WAAW,EAAE,CAAC;QACnD,IAAM,UAAU,GAAkB,IAAI,CAAC,aAAa,EAAE,CAAC;QAEvD,IAAM,UAAU,GAAqB,IAAI,CAAC,mBAAmB,CAAC,OAAO,EAAE,QAAQ,EAAE,UAAU,CAAC,CAAC;QAC7F,IAAI,UAAU,GAAG,GAAG,EAAE;YACpB,MAAM,IAAI,iBAAiB,CAAC,sCAAsC,CAAC,CAAC;SACrE;QACD,IAAM,SAAS,GAAG,QAAQ,CAAC,gBAAgB,CAAC,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;QACvF,IAAM,kBAAkB,GAAY,OAAO,CAAC,iCAAiC,CAAC,SAAS,CAAC,CAAC;QACzF,IAAM,uBAAuB,GAAG,kBAAkB,CAAC,sBAAsB,EAAE,GAAG,CAAC,CAAC;QAEhF,IAAI,gBAAgB,GAAqB,IAAI,CAAC;QAC9C,oDAAoD;QACpD,IAAI,kBAAkB,CAAC,0BAA0B,EAAE,CAAC,MAAM,GAAG,CAAC,EAAE;YAE9D,8DAA8D;YAC9D,IAAM,YAAY,GAAqB,QAAQ,CAAC,IAAI,EAAE,GAAG,OAAO,CAAC,IAAI,EAAE,GAAG,UAAU,CAAC,IAAI,EAAE,CAAC;YAC5F,IAAM,YAAY,GAAqB,QAAQ,CAAC,IAAI,EAAE,GAAG,OAAO,CAAC,IAAI,EAAE,GAAG,UAAU,CAAC,IAAI,EAAE,CAAC;YAE5F,yDAAyD;YACzD,iDAAiD;YACjD,IAAM,mBAAmB,GAAqB,GAAG,GAAG,GAAG,GAAG,uBAAuB,CAAC;YAClF,IAAM,aAAa,GAAG,UAAU,CAAA,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,mBAAmB,GAAG,CAAC,YAAY,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YACnH,IAAM,aAAa,GAAG,UAAU,CAAA,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,mBAAmB,GAAG,CAAC,YAAY,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YAEnH,6DAA6D;YAC7D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE;gBAChC,IAAI;oBACF,gBAAgB,GAAG,IAAI,CAAC,qBAAqB,CAAC,UAAU,EACtD,aAAa,EACb,aAAa,EACb,CAAC,CAAC,CAAC;oBACL,MAAM;iBACP;gBAAC,OAAO,EAAE,CAAA,qBAAqB,EAAE;oBAChC,IAAI,CAAC,CAAC,EAAE,YAAY,iBAAiB,CAAC,EAAE;wBACtC,MAAM,EAAE,CAAC;qBACV;oBACD,iBAAiB;iBAClB;aACF;YACD,oEAAoE;SACrE;QAED,IAAM,SAAS,GACb,QAAQ,CAAC,eAAe,CAAC,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,gBAAgB,EAAE,SAAS,CAAC,CAAC;QAEvF,IAAM,IAAI,GAAc,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;QAE9E,IAAI,MAAqB,CAAC;QAC1B,IAAI,gBAAgB,KAAK,IAAI,EAAE;YAC7B,MAAM,GAAG,CAAC,UAAU,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;SAC1C;aAAM;YACL,MAAM,GAAG,CAAC,UAAU,EAAE,OAAO,EAAE,QAAQ,EAAE,gBAAgB,CAAC,CAAC;SAC5D;QACD,OAAO,IAAI,cAAc,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAC1C,CAAC;IAEc,wBAAe,GAA9B,UAA+B,OAAoB,EACjD,QAAqB,EACrB,UAAuB,EACvB,gBAA6B,EAC7B,SAAiB,CAAC,OAAO;QACzB,IAAM,aAAa,GAAqB,SAAS,GAAG,GAAG,CAAC;QACxD,IAAI,YAAoB,CAAC,CAAC,SAAS;QACnC,IAAI,YAAoB,CAAC,CAAC,SAAS;QACnC,IAAI,kBAA0B,CAAC,CAAC,SAAS;QACzC,IAAI,kBAA0B,CAAC,CAAC,SAAS;QACzC,IAAI,gBAAgB,KAAK,IAAI,EAAE;YAC7B,YAAY,GAAG,gBAAgB,CAAC,IAAI,EAAE,CAAC;YACvC,YAAY,GAAG,gBAAgB,CAAC,IAAI,EAAE,CAAC;YACvC,kBAAkB,GAAG,aAAa,GAAG,GAAG,CAAC;YACzC,kBAAkB,GAAG,kBAAkB,CAAC;SACzC;aAAM;YACL,uEAAuE;YACvE,YAAY,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,GAAG,UAAU,CAAC,IAAI,EAAE,CAAC;YACtE,YAAY,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,GAAG,UAAU,CAAC,IAAI,EAAE,CAAC;YACtE,kBAAkB,GAAG,aAAa,CAAC;YACnC,kBAAkB,GAAG,aAAa,CAAC;SACpC;QAED,OAAO,oBAAoB,CAAC,4BAA4B,CACtD,GAAG,EACH,GAAG,EACH,aAAa,EACb,GAAG,EACH,kBAAkB,EAClB,kBAAkB,EAClB,GAAG,EACH,aAAa,EACb,OAAO,CAAC,IAAI,EAAE,EACd,OAAO,CAAC,IAAI,EAAE,EACd,QAAQ,CAAC,IAAI,EAAE,EACf,QAAQ,CAAC,IAAI,EAAE,EACf,YAAY,EACZ,YAAY,EACZ,UAAU,CAAC,IAAI,EAAE,EACjB,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC;IACvB,CAAC;IAEc,mBAAU,GAAzB,UAA0B,KAAgB,EACxC,SAA+B,EAC/B,SAAiB,CAAC,OAAO;QAEzB,IAAM,OAAO,GAAG,mBAAmB,CAAC,WAAW,EAAE,CAAC;QAClD,OAAO,OAAO,CAAC,uBAAuB,CAAC,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;IACjF,CAAC;IAED;;;OAGG;IACY,yBAAgB,GAA/B,UAAgC,OAAoB,EAClD,QAAqB,EACrB,UAAuB,EACvB,UAAkB,CAAA,SAAS;QAC3B,IAAM,oBAAoB,GAAG,SAAS,CAAC,KAAK,CAAC,WAAW,CAAC,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,GAAG,UAAU,CAAC,CAAC;QACnG,IAAM,oBAAoB,GAAG,SAAS,CAAC,KAAK,CAAC,WAAW,CAAC,QAAQ,CAAC,OAAO,EAAE,UAAU,CAAC,GAAG,UAAU,CAAC,CAAC;QACrG,IAAI,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,oBAAoB,GAAG,oBAAoB,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAClF,QAAQ,SAAS,GAAG,IAAI,EAAE,EAAE,QAAQ;YAClC,KAAK,CAAC;gBACJ,SAAS,EAAE,CAAC;gBACZ,MAAM;YACR,gBAAgB;YAChB,KAAK,CAAC;gBACJ,SAAS,EAAE,CAAC;gBACZ,MAAM;YACR,KAAK,CAAC;gBACJ,MAAM,IAAI,iBAAiB,CAAC,gCAAgC,CAAC,CAAC;SACjE;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;;;OAQG;IACO,sCAAmB,GAA7B,UAA8B,OAAoB,EAChD,QAAqB,EACrB,UAAuB;QACvB,mBAAmB;QACnB,OAAO,CAAC,IAAI,CAAC,yBAAyB,CAAC,OAAO,EAAE,QAAQ,CAAC;YACvD,IAAI,CAAC,yBAAyB,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC,GAAG,GAAG,CAAC;IAC/D,CAAC;IAED;;;;OAIG;IACK,4CAAyB,GAAjC,UAAkC,OAAoB,EAAE,YAAyB;QAC/E,IAAM,cAAc,GAAqB,IAAI,CAAC,gCAAgC,CAAC,UAAU,CAAA,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;QAC/G,UAAU,CAAA,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;QACpC,UAAU,CAAA,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC;QACzC,UAAU,CAAA,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC/C,IAAM,cAAc,GAAqB,IAAI,CAAC,gCAAgC,CAAC,UAAU,CAAA,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC;QACpH,UAAU,CAAA,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC;QACzC,UAAU,CAAA,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;QACpC,UAAU,CAAA,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC1C,IAAI,KAAK,CAAC,cAAc,CAAC,EAAE;YACzB,OAAO,cAAc,GAAG,GAAG,CAAC;SAC7B;QACD,IAAI,KAAK,CAAC,cAAc,CAAC,EAAE;YACzB,OAAO,cAAc,GAAG,GAAG,CAAC;SAC7B;QACD,kFAAkF;QAClF,yEAAyE;QACzE,OAAO,CAAC,cAAc,GAAG,cAAc,CAAC,GAAG,IAAI,CAAC;IAClD,CAAC;IAED;;;;OAIG;IACK,mDAAgC,GAAxC,UAAyC,KAAa,CAAC,OAAO,EAAE,KAAa,CAAC,OAAO,EAAE,GAAW,CAAC,OAAO,EAAE,GAAW,CAAC,OAAO;QAE7H,IAAI,MAAM,GAAqB,IAAI,CAAC,wBAAwB,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAErF,8DAA8D;QAC9D,IAAI,KAAK,GAAqB,GAAG,CAAC;QAClC,IAAI,QAAQ,GAAG,KAAK,GAAG,CAAC,GAAG,GAAG,KAAK,CAAC,CAAC;QACrC,IAAI,QAAQ,GAAG,CAAC,EAAE;YAChB,KAAK,GAAG,KAAK,GAAG,YAAY,CAAA,CAAC,KAAK,GAAG,QAAQ,CAAC,CAAC;YAC/C,QAAQ,GAAG,CAAC,CAAC;SACd;aAAM,IAAI,QAAQ,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,EAAE;YAC5C,KAAK,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,YAAY,CAAA,CAAC,QAAQ,GAAG,KAAK,CAAC,CAAC;YAC7E,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;SACtC;QACD,IAAI,QAAQ,GAAG,UAAU,CAAA,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;QAEnE,KAAK,GAAG,GAAG,CAAC;QACZ,IAAI,QAAQ,GAAG,CAAC,EAAE;YAChB,KAAK,GAAG,KAAK,GAAG,YAAY,CAAA,CAAC,KAAK,GAAG,QAAQ,CAAC,CAAC;YAC/C,QAAQ,GAAG,CAAC,CAAC;SACd;aAAM,IAAI,QAAQ,IAAI,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,EAAE;YAC7C,KAAK,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,YAAY,CAAA,CAAC,QAAQ,GAAG,KAAK,CAAC,CAAC;YAC9E,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;SACvC;QACD,QAAQ,GAAG,UAAU,CAAA,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,QAAQ,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;QAEpE,MAAM,IAAI,IAAI,CAAC,wBAAwB,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAE1E,sDAAsD;QACtD,OAAO,MAAM,GAAG,GAAG,CAAC;IACtB,CAAC;IAED;;;;;;;OAOG;IACK,2CAAwB,GAAhC,UAAiC,KAAa,CAAC,OAAO,EAAE,KAAa,CAAC,OAAO,EAAE,GAAW,CAAC,OAAO,EAAE,GAAW,CAAC,OAAO;QACrH,wCAAwC;QACxC,8DAA8D;QAC9D,IAAM,KAAK,GAAY,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,KAAK,CAAC,CAAC;QACrE,IAAI,KAAK,EAAE;YACT,IAAI,IAAI,GAAG,KAAK,CAAC;YACjB,KAAK,GAAG,KAAK,CAAC;YACd,KAAK,GAAG,IAAI,CAAC;YACb,IAAI,GAAG,GAAG,CAAC;YACX,GAAG,GAAG,GAAG,CAAC;YACV,GAAG,GAAG,IAAI,CAAC;SACZ;QAED,IAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,KAAK,CAAC,CAAC;QACjC,IAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,KAAK,CAAC,CAAC;QACjC,IAAI,KAAK,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;QACpB,IAAM,KAAK,GAAG,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACnC,IAAM,KAAK,GAAG,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAEnC,4DAA4D;QAC5D,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,yCAAyC;QACzC,IAAM,MAAM,GAAG,GAAG,GAAG,KAAK,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,KAAK,MAAM,EAAE,CAAC,IAAI,KAAK,EAAE;YACvD,IAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAE5B,sEAAsE;YACtE,4EAA4E;YAC5E,mEAAmE;YACnE,IAAI,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE;gBAClD,IAAI,KAAK,KAAK,CAAC,EAAE;oBACf,OAAO,SAAS,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;iBAC/C;gBACD,KAAK,EAAE,CAAC;aACT;YAED,KAAK,IAAI,EAAE,CAAC;YACZ,IAAI,KAAK,GAAG,CAAC,EAAE;gBACb,IAAI,CAAC,KAAK,GAAG,EAAE;oBACb,MAAM;iBACP;gBACD,CAAC,IAAI,KAAK,CAAC;gBACX,KAAK,IAAI,EAAE,CAAC;aACb;SACF;QACD,+FAA+F;QAC/F,yFAAyF;QACzF,mFAAmF;QACnF,IAAI,KAAK,KAAK,CAAC,EAAE;YACf,OAAO,SAAS,CAAC,QAAQ,CAAC,GAAG,GAAG,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;SAC3D;QACD,6EAA6E;QAC7E,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;;;;;;;;OAUG;IACO,wCAAqB,GAA/B,UAAgC,oBAA4B,CAAA,SAAS,EACnE,aAAqB,CAAC,OAAO,EAC7B,aAAqB,CAAC,OAAO,EAC7B,eAAuB,CAAA,SAAS;QAChC,oEAAoE;QACpE,YAAY;QACZ,IAAM,SAAS,GAAG,UAAU,CAAA,IAAI,CAAC,KAAK,CAAC,eAAe,GAAG,oBAAoB,CAAC,CAAC;QAC/E,IAAM,kBAAkB,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,aAAa,GAAG,SAAS,CAAC,CAAC;QAClE,IAAM,mBAAmB,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,GAAG,CAAC,EAAE,aAAa,GAAG,SAAS,CAAC,CAAC;QAC3F,IAAI,mBAAmB,GAAG,kBAAkB,GAAG,oBAAoB,GAAG,CAAC,EAAE;YACvE,MAAM,IAAI,iBAAiB,CAAC,8CAA8C,CAAC,CAAC;SAC7E;QAED,IAAM,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,aAAa,GAAG,SAAS,CAAC,CAAC;QACjE,IAAM,oBAAoB,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,GAAG,CAAC,EAAE,aAAa,GAAG,SAAS,CAAC,CAAC;QAC7F,IAAI,oBAAoB,GAAG,iBAAiB,GAAG,oBAAoB,GAAG,CAAC,EAAE;YACvE,MAAM,IAAI,iBAAiB,CAAC,iDAAiD,CAAC,CAAC;SAChF;QAED,IAAM,eAAe,GAAG,IAAI,sBAAsB,CAChD,IAAI,CAAC,KAAK,EACV,kBAAkB,EAClB,iBAAiB,EACjB,mBAAmB,GAAG,kBAAkB,EACxC,oBAAoB,GAAG,iBAAiB,EACxC,oBAAoB,EACpB,IAAI,CAAC,mBAAmB,CACzB,CAAC;QAEF,OAAO,eAAe,CAAC,IAAI,EAAE,CAAC;IAChC,CAAC;IAEH,eAAC;AAAD,CAAC,AA7WD,IA6WC"}

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

@@ -0,0 +1,26 @@
+import ResultPoint from '../../ResultPoint';
+/**
+ * <p>Encapsulates a finder pattern, which are the three square patterns found in
+ * the corners of QR Codes. It also encapsulates a count of similar finder patterns,
+ * as a convenience to the finder's bookkeeping.</p>
+ *
+ * @author Sean Owen
+ */
+export default class FinderPattern extends ResultPoint {
+    private estimatedModuleSize;
+    private count?;
+    constructor(posX: number, posY: number, estimatedModuleSize: number, count?: number);
+    getEstimatedModuleSize(): number;
+    getCount(): number;
+    /**
+     * <p>Determines if this finder pattern "about equals" a finder pattern at the stated
+     * position and size -- meaning, it is at nearly the same center with nearly the same size.</p>
+     */
+    aboutEquals(moduleSize: number, i: number, j: number): boolean;
+    /**
+     * 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 a weighted average
+     * based on count.
+     */
+    combineEstimate(i: number, j: number, newModuleSize: number): FinderPattern;
+}

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

@@ -0,0 +1,89 @@
+/*
+ * 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 a finder pattern, which are the three square patterns found in
+ * the corners of QR Codes. It also encapsulates a count of similar finder patterns,
+ * as a convenience to the finder's bookkeeping.</p>
+ *
+ * @author Sean Owen
+ */
+var FinderPattern = /** @class */ (function (_super) {
+    __extends(FinderPattern, _super);
+    // FinderPattern(posX: number/*float*/, posY: number/*float*/, estimatedModuleSize: number/*float*/) {
+    //   this(posX, posY, estimatedModuleSize, 1)
+    // }
+    function FinderPattern(posX /*float*/, posY /*float*/, estimatedModuleSize /*float*/, count /*int*/) {
+        var _this = _super.call(this, posX, posY) || this;
+        _this.estimatedModuleSize = estimatedModuleSize;
+        _this.count = count;
+        if (undefined === count) {
+            _this.count = 1;
+        }
+        return _this;
+    }
+    FinderPattern.prototype.getEstimatedModuleSize = function () {
+        return this.estimatedModuleSize;
+    };
+    FinderPattern.prototype.getCount = function () {
+        return this.count;
+    };
+    /*
+    void incrementCount() {
+      this.count++
+    }
+     */
+    /**
+     * <p>Determines if this finder pattern "about equals" a finder pattern at the stated
+     * position and size -- meaning, it is at nearly the same center with nearly the same size.</p>
+     */
+    FinderPattern.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 a weighted average
+     * based on count.
+     */
+    FinderPattern.prototype.combineEstimate = function (i /*float*/, j /*float*/, newModuleSize /*float*/) {
+        var combinedCount = this.count + 1;
+        var combinedX = (this.count * this.getX() + j) / combinedCount;
+        var combinedY = (this.count * this.getY() + i) / combinedCount;
+        var combinedModuleSize = (this.count * this.estimatedModuleSize + newModuleSize) / combinedCount;
+        return new FinderPattern(combinedX, combinedY, combinedModuleSize, combinedCount);
+    };
+    return FinderPattern;
+}(ResultPoint));
+export default FinderPattern;
+//# sourceMappingURL=FinderPattern.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"FinderPattern.js","sourceRoot":"","sources":["../../../../../src/core/qrcode/detector/FinderPattern.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;;;;;;;;;;;;;;AAEH,gDAAgD;AAEhD,OAAO,WAAW,MAAM,mBAAmB,CAAC;AAE5C;;;;;;GAMG;AACH;IAA2C,iCAAW;IAElD,sGAAsG;IACtG,6CAA6C;IAC7C,IAAI;IAEJ,uBAAmB,IAAY,CAAA,SAAS,EAAE,IAAY,CAAA,SAAS,EAAU,mBAA2B,CAAA,SAAS,EAAU,KAAc,CAAC,OAAO;QAA7I,YACI,kBAAM,IAAI,EAAE,IAAI,CAAC,SAIpB;QALwE,yBAAmB,GAAnB,mBAAmB,CAAQ;QAAmB,WAAK,GAAL,KAAK,CAAS;QAEjI,IAAI,SAAS,KAAK,KAAK,EAAE;YACrB,KAAI,CAAC,KAAK,GAAG,CAAC,CAAC;SAClB;;IACL,CAAC;IAEM,8CAAsB,GAA7B;QACI,OAAO,IAAI,CAAC,mBAAmB,CAAC;IACpC,CAAC;IAEM,gCAAQ,GAAf;QACI,OAAO,IAAI,CAAC,KAAK,CAAC;IACtB,CAAC;IAED;;;;OAIG;IAEH;;;OAGG;IACI,mCAAW,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;;;;OAIG;IACI,uCAAe,GAAtB,UAAuB,CAAS,CAAA,SAAS,EAAE,CAAS,CAAA,SAAS,EAAE,aAAqB,CAAA,SAAS;QACzF,IAAM,aAAa,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACrC,IAAM,SAAS,GAAqB,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,GAAG,aAAa,CAAC;QACnF,IAAM,SAAS,GAAqB,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,GAAG,aAAa,CAAC;QACnF,IAAM,kBAAkB,GAAqB,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,mBAAmB,GAAG,aAAa,CAAC,GAAG,aAAa,CAAC;QACrH,OAAO,IAAI,aAAa,CAAC,SAAS,EAAE,SAAS,EAAE,kBAAkB,EAAE,aAAa,CAAC,CAAC;IACtF,CAAC;IAEL,oBAAC;AAAD,CAAC,AApDD,CAA2C,WAAW,GAoDrD"}

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

@@ -0,0 +1,114 @@
+import DecodeHintType from '../../DecodeHintType';
+import ResultPointCallback from '../../ResultPointCallback';
+import BitMatrix from '../../common/BitMatrix';
+import FinderPattern from './FinderPattern';
+import FinderPatternInfo from './FinderPatternInfo';
+/**
+ * <p>This class attempts to find finder patterns in a QR Code. Finder patterns are the square
+ * markers at three corners of a QR Code.</p>
+ *
+ * <p>This class is thread-safe but not reentrant. Each thread must allocate its own object.
+ *
+ * @author Sean Owen
+ */
+export default class FinderPatternFinder {
+    private image;
+    private resultPointCallback;
+    private static CENTER_QUORUM;
+    protected static MIN_SKIP: number;
+    protected static MAX_MODULES: number;
+    private possibleCenters;
+    private hasSkipped;
+    private crossCheckStateCount;
+    /**
+     * <p>Creates a finder that will search the image for three finder patterns.</p>
+     *
+     * @param image image to search
+     */
+    constructor(image: BitMatrix, resultPointCallback: ResultPointCallback);
+    protected getImage(): BitMatrix;
+    protected getPossibleCenters(): FinderPattern[];
+    find(hints: Map<DecodeHintType, any>): FinderPatternInfo;
+    /**
+     * Given a count of black/white/black/white/black pixels just seen and an end position,
+     * figures the location of the center of this run.
+     */
+    private static centerFromEnd;
+    /**
+     * @param stateCount count of black/white/black/white/black pixels just read
+     * @return true iff the proportions of the counts is close enough to the 1/1/3/1/1 ratios
+     *         used by finder patterns to be considered a match
+     */
+    protected static foundPatternCross(stateCount: Int32Array): boolean;
+    private getCrossCheckStateCount;
+    /**
+     * After a vertical and horizontal scan finds a potential finder pattern, this method
+     * "cross-cross-cross-checks" by scanning down diagonally through the center of the possible
+     * finder pattern to see if the same proportion is detected.
+     *
+     * @param startI row where a finder pattern was detected
+     * @param centerJ center of the section that appears to cross a finder pattern
+     * @param maxCount maximum reasonable number of modules that should be
+     *  observed in any reading state, based on the results of the horizontal scan
+     * @param originalStateCountTotal The original state count total.
+     * @return true if proportions are withing expected limits
+     */
+    private crossCheckDiagonal;
+    /**
+     * <p>After a horizontal scan finds a potential finder pattern, this method
+     * "cross-checks" by scanning down vertically through the center of the possible
+     * finder pattern to see if the same proportion is detected.</p>
+     *
+     * @param startI row where a finder pattern was detected
+     * @param centerJ center of the section that appears to cross a finder 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 finder pattern, or {@link Float#NaN} if not found
+     */
+    private crossCheckVertical;
+    /**
+     * <p>Like {@link #crossCheckVertical(int, int, int, int)}, and in fact is basically identical,
+     * except it reads horizontally instead of vertically. This is used to cross-cross
+     * check a vertical cross check and locate the real center of the alignment pattern.</p>
+     */
+    private crossCheckHorizontal;
+    /**
+     * <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, ah, cross-cross-check
+     * with another horizontal scan. This is needed primarily to locate the real horizontal
+     * center of the pattern in cases of extreme skew.
+     * And then we cross-cross-cross check with another diagonal scan.</p>
+     *
+     * <p>If that succeeds the finder pattern location is added to a list that tracks
+     * the number of times each location has been nearly-matched as a finder pattern.
+     * Each additional find is more evidence that the location is in fact a finder
+     * pattern center
+     *
+     * @param stateCount reading state module counts from horizontal scan
+     * @param i row where finder pattern may be found
+     * @param j end of possible finder pattern in row
+     * @param pureBarcode true if in "pure barcode" mode
+     * @return true if a finder pattern candidate was found this time
+     */
+    protected handlePossibleCenter(stateCount: Int32Array, i: number, j: number, pureBarcode: boolean): boolean;
+    /**
+     * @return number of rows we could safely skip during scanning, based on the first
+     *         two finder patterns that have been located. In some cases their position will
+     *         allow us to infer that the third pattern must lie below a certain point farther
+     *         down in the image.
+     */
+    private findRowSkip;
+    /**
+     * @return true iff we have found at least 3 finder patterns that have been detected
+     *         at least {@link #CENTER_QUORUM} times each, and, the estimated module size of the
+     *         candidates is "pretty similar"
+     */
+    private haveMultiplyConfirmedCenters;
+    /**
+     * @return the 3 best {@link FinderPattern}s from our list of candidates. The "best" are
+     *         those that have been detected at least {@link #CENTER_QUORUM} times, and whose module
+     *         size differs from the average among those patterns the least
+     * @throws NotFoundException if 3 such finder patterns do not exist
+     */
+    private selectBestPatterns;
+}