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

package/template/node_modules/@zxing/library/cjs/core/pdf417/decoder/ec/ModulusPoly.js

@@ -0,0 +1,276 @@
+"use strict";
+/*
+* Copyright 2012 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.");
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+// package com.google.zxing.pdf417.decoder.ec;
+var IllegalArgumentException_1 = require("../../../IllegalArgumentException");
+var System_1 = require("../../../util/System");
+var StringBuilder_1 = require("../../../util/StringBuilder");
+/**
+ * @author Sean Owen
+ * @see com.google.zxing.common.reedsolomon.GenericGFPoly
+ */
+var ModulusPoly = /** @class */ (function () {
+    function ModulusPoly(field, coefficients) {
+        if (coefficients.length === 0) {
+            throw new IllegalArgumentException_1.default();
+        }
+        this.field = field;
+        var coefficientsLength = /*int*/ coefficients.length;
+        if (coefficientsLength > 1 && coefficients[0] === 0) {
+            // Leading term must be non-zero for anything except the constant polynomial "0"
+            var firstNonZero = /*int*/ 1;
+            while (firstNonZero < coefficientsLength && coefficients[firstNonZero] === 0) {
+                firstNonZero++;
+            }
+            if (firstNonZero === coefficientsLength) {
+                this.coefficients = new Int32Array([0]);
+            }
+            else {
+                this.coefficients = new Int32Array(coefficientsLength - firstNonZero);
+                System_1.default.arraycopy(coefficients, firstNonZero, this.coefficients, 0, this.coefficients.length);
+            }
+        }
+        else {
+            this.coefficients = coefficients;
+        }
+    }
+    ModulusPoly.prototype.getCoefficients = function () {
+        return this.coefficients;
+    };
+    /**
+     * @return degree of this polynomial
+     */
+    ModulusPoly.prototype.getDegree = function () {
+        return this.coefficients.length - 1;
+    };
+    /**
+     * @return true iff this polynomial is the monomial "0"
+     */
+    ModulusPoly.prototype.isZero = function () {
+        return this.coefficients[0] === 0;
+    };
+    /**
+     * @return coefficient of x^degree term in this polynomial
+     */
+    ModulusPoly.prototype.getCoefficient = function (degree) {
+        return this.coefficients[this.coefficients.length - 1 - degree];
+    };
+    /**
+     * @return evaluation of this polynomial at a given point
+     */
+    ModulusPoly.prototype.evaluateAt = function (a) {
+        var e_1, _a;
+        if (a === 0) {
+            // Just return the x^0 coefficient
+            return this.getCoefficient(0);
+        }
+        if (a === 1) {
+            // Just the sum of the coefficients
+            var sum = /*int*/ 0;
+            try {
+                for (var _b = __values(this.coefficients), _c = _b.next(); !_c.done; _c = _b.next()) {
+                    var coefficient = _c.value /*int*/;
+                    sum = this.field.add(sum, coefficient);
+                }
+            }
+            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; }
+            }
+            return sum;
+        }
+        var result = /*int*/ this.coefficients[0];
+        var size = /*int*/ this.coefficients.length;
+        for (var i /*int*/ = 1; i < size; i++) {
+            result = this.field.add(this.field.multiply(a, result), this.coefficients[i]);
+        }
+        return result;
+    };
+    ModulusPoly.prototype.add = function (other) {
+        if (!this.field.equals(other.field)) {
+            throw new IllegalArgumentException_1.default('ModulusPolys do not have same ModulusGF field');
+        }
+        if (this.isZero()) {
+            return other;
+        }
+        if (other.isZero()) {
+            return this;
+        }
+        var smallerCoefficients = this.coefficients;
+        var largerCoefficients = other.coefficients;
+        if (smallerCoefficients.length > largerCoefficients.length) {
+            var temp = smallerCoefficients;
+            smallerCoefficients = largerCoefficients;
+            largerCoefficients = temp;
+        }
+        var sumDiff = new Int32Array(largerCoefficients.length);
+        var lengthDiff = /*int*/ largerCoefficients.length - smallerCoefficients.length;
+        // Copy high-order terms only found in higher-degree polynomial's coefficients
+        System_1.default.arraycopy(largerCoefficients, 0, sumDiff, 0, lengthDiff);
+        for (var i /*int*/ = lengthDiff; i < largerCoefficients.length; i++) {
+            sumDiff[i] = this.field.add(smallerCoefficients[i - lengthDiff], largerCoefficients[i]);
+        }
+        return new ModulusPoly(this.field, sumDiff);
+    };
+    ModulusPoly.prototype.subtract = function (other) {
+        if (!this.field.equals(other.field)) {
+            throw new IllegalArgumentException_1.default('ModulusPolys do not have same ModulusGF field');
+        }
+        if (other.isZero()) {
+            return this;
+        }
+        return this.add(other.negative());
+    };
+    ModulusPoly.prototype.multiply = function (other) {
+        if (other instanceof ModulusPoly) {
+            return this.multiplyOther(other);
+        }
+        return this.multiplyScalar(other);
+    };
+    ModulusPoly.prototype.multiplyOther = function (other) {
+        if (!this.field.equals(other.field)) {
+            throw new IllegalArgumentException_1.default('ModulusPolys do not have same ModulusGF field');
+        }
+        if (this.isZero() || other.isZero()) {
+            // return this.field.getZero();
+            return new ModulusPoly(this.field, new Int32Array([0]));
+        }
+        var aCoefficients = this.coefficients;
+        var aLength = /*int*/ aCoefficients.length;
+        var bCoefficients = other.coefficients;
+        var bLength = /*int*/ bCoefficients.length;
+        var product = new Int32Array(aLength + bLength - 1);
+        for (var i /*int*/ = 0; i < aLength; i++) {
+            var aCoeff = /*int*/ aCoefficients[i];
+            for (var j /*int*/ = 0; j < bLength; j++) {
+                product[i + j] = this.field.add(product[i + j], this.field.multiply(aCoeff, bCoefficients[j]));
+            }
+        }
+        return new ModulusPoly(this.field, product);
+    };
+    ModulusPoly.prototype.negative = function () {
+        var size = /*int*/ this.coefficients.length;
+        var negativeCoefficients = new Int32Array(size);
+        for (var i /*int*/ = 0; i < size; i++) {
+            negativeCoefficients[i] = this.field.subtract(0, this.coefficients[i]);
+        }
+        return new ModulusPoly(this.field, negativeCoefficients);
+    };
+    ModulusPoly.prototype.multiplyScalar = function (scalar) {
+        if (scalar === 0) {
+            return new ModulusPoly(this.field, new Int32Array([0]));
+        }
+        if (scalar === 1) {
+            return this;
+        }
+        var size = /*int*/ this.coefficients.length;
+        var product = new Int32Array(size);
+        for (var i /*int*/ = 0; i < size; i++) {
+            product[i] = this.field.multiply(this.coefficients[i], scalar);
+        }
+        return new ModulusPoly(this.field, product);
+    };
+    ModulusPoly.prototype.multiplyByMonomial = function (degree, coefficient) {
+        if (degree < 0) {
+            throw new IllegalArgumentException_1.default();
+        }
+        if (coefficient === 0) {
+            return new ModulusPoly(this.field, new Int32Array([0]));
+        }
+        var size = /*int*/ this.coefficients.length;
+        var product = new Int32Array(size + degree);
+        for (var i /*int*/ = 0; i < size; i++) {
+            product[i] = this.field.multiply(this.coefficients[i], coefficient);
+        }
+        return new ModulusPoly(this.field, product);
+    };
+    /*
+    ModulusPoly[] divide(other: ModulusPoly) {
+      if (!field.equals(other.field)) {
+        throw new IllegalArgumentException("ModulusPolys do not have same ModulusGF field");
+      }
+      if (other.isZero()) {
+        throw new IllegalArgumentException("Divide by 0");
+      }
+  
+      let quotient: ModulusPoly = field.getZero();
+      let remainder: ModulusPoly = this;
+  
+      let denominatorLeadingTerm: /*int/ number = other.getCoefficient(other.getDegree());
+      let inverseDenominatorLeadingTerm: /*int/ number = field.inverse(denominatorLeadingTerm);
+  
+      while (remainder.getDegree() >= other.getDegree() && !remainder.isZero()) {
+        let degreeDifference: /*int/ number = remainder.getDegree() - other.getDegree();
+        let scale: /*int/ number = field.multiply(remainder.getCoefficient(remainder.getDegree()), inverseDenominatorLeadingTerm);
+        let term: ModulusPoly = other.multiplyByMonomial(degreeDifference, scale);
+        let iterationQuotient: ModulusPoly = field.buildMonomial(degreeDifference, scale);
+        quotient = quotient.add(iterationQuotient);
+        remainder = remainder.subtract(term);
+      }
+  
+      return new ModulusPoly[] { quotient, remainder };
+    }
+    */
+    // @Override
+    ModulusPoly.prototype.toString = function () {
+        var result = new StringBuilder_1.default( /*8 * this.getDegree()*/); // dynamic string size in JS
+        for (var degree /*int*/ = this.getDegree(); degree >= 0; degree--) {
+            var coefficient = /*int*/ this.getCoefficient(degree);
+            if (coefficient !== 0) {
+                if (coefficient < 0) {
+                    result.append(' - ');
+                    coefficient = -coefficient;
+                }
+                else {
+                    if (result.length() > 0) {
+                        result.append(' + ');
+                    }
+                }
+                if (degree === 0 || coefficient !== 1) {
+                    result.append(coefficient);
+                }
+                if (degree !== 0) {
+                    if (degree === 1) {
+                        result.append('x');
+                    }
+                    else {
+                        result.append('x^');
+                        result.append(degree);
+                    }
+                }
+            }
+        }
+        return result.toString();
+    };
+    return ModulusPoly;
+}());
+exports.default = ModulusPoly;
+//# sourceMappingURL=ModulusPoly.js.map

package/template/node_modules/@zxing/library/cjs/core/pdf417/decoder/ec/ModulusPoly.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ModulusPoly.js","sourceRoot":"","sources":["../../../../../../src/core/pdf417/decoder/ec/ModulusPoly.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;EAcE;;;;;;;;;;;;;AAEF,8CAA8C;AAE9C,8EAAyE;AACzE,+CAA0C;AAC1C,6DAAwD;AAGxD;;;GAGG;AACH;IAKE,qBAAY,KAAkB,EAAE,YAAwB;QACtD,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE;YAC7B,MAAM,IAAI,kCAAwB,EAAE,CAAC;SACtC;QACD,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,kBAAkB,GAAE,OAAO,CAAU,YAAY,CAAC,MAAM,CAAC;QAC7D,IAAI,kBAAkB,GAAG,CAAC,IAAI,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE;YACnD,gFAAgF;YAChF,IAAI,YAAY,GAAE,OAAO,CAAU,CAAC,CAAC;YACrC,OAAO,YAAY,GAAG,kBAAkB,IAAI,YAAY,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE;gBAC5E,YAAY,EAAE,CAAC;aAChB;YACD,IAAI,YAAY,KAAK,kBAAkB,EAAE;gBACvC,IAAI,CAAC,YAAY,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;aACzC;iBAAM;gBACL,IAAI,CAAC,YAAY,GAAG,IAAI,UAAU,CAAC,kBAAkB,GAAG,YAAY,CAAC,CAAC;gBACtE,gBAAM,CAAC,SAAS,CAAC,YAAY,EAC3B,YAAY,EACZ,IAAI,CAAC,YAAY,EACjB,CAAC,EACD,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;aAC7B;SACF;aAAM;YACL,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;SAClC;IACH,CAAC;IAED,qCAAe,GAAf;QACE,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,+BAAS,GAAT;QACE,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC;IACtC,CAAC;IAED;;OAEG;IACH,4BAAM,GAAN;QACE,OAAO,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IACpC,CAAC;IAED;;OAEG;IACH,oCAAc,GAAd,UAAe,MAAsB;QACnC,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;IAClE,CAAC;IAED;;OAEG;IACH,gCAAU,GAAV,UAAW,CAAiB;;QAC1B,IAAI,CAAC,KAAK,CAAC,EAAE;YACX,kCAAkC;YAClC,OAAO,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;SAC/B;QACD,IAAI,CAAC,KAAK,CAAC,EAAE;YACX,mCAAmC;YACnC,IAAI,GAAG,GAAE,OAAO,CAAU,CAAC,CAAC;;gBAC5B,KAAgC,IAAA,KAAA,SAAA,IAAI,CAAC,YAAY,CAAA,gBAAA,4BAAE;oBAA9C,IAAI,WAAW,WAAA,CAAC,OAAO;oBAC1B,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,WAAW,CAAC,CAAC;iBACxC;;;;;;;;;YACD,OAAO,GAAG,CAAC;SACZ;QACD,IAAI,MAAM,GAAE,OAAO,CAAU,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAClD,IAAI,IAAI,GAAE,OAAO,CAAU,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;QACpD,KAAK,IAAI,CAAC,CAAC,OAAO,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE;YACrC,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;SAC/E;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,yBAAG,GAAH,UAAI,KAAkB;QACpB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE;YACnC,MAAM,IAAI,kCAAwB,CAAC,+CAA+C,CAAC,CAAC;SACrF;QACD,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE;YACjB,OAAO,KAAK,CAAC;SACd;QACD,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE;YAClB,OAAO,IAAI,CAAC;SACb;QAED,IAAI,mBAAmB,GAAe,IAAI,CAAC,YAAY,CAAC;QACxD,IAAI,kBAAkB,GAAe,KAAK,CAAC,YAAY,CAAC;QACxD,IAAI,mBAAmB,CAAC,MAAM,GAAG,kBAAkB,CAAC,MAAM,EAAE;YAC1D,IAAI,IAAI,GAAe,mBAAmB,CAAC;YAC3C,mBAAmB,GAAG,kBAAkB,CAAC;YACzC,kBAAkB,GAAG,IAAI,CAAC;SAC3B;QACD,IAAI,OAAO,GAAe,IAAI,UAAU,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC;QACpE,IAAI,UAAU,GAAE,OAAO,CAAU,kBAAkB,CAAC,MAAM,GAAG,mBAAmB,CAAC,MAAM,CAAC;QACxF,8EAA8E;QAC9E,gBAAM,CAAC,SAAS,CAAC,kBAAkB,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;QAEhE,KAAK,IAAI,CAAC,CAAC,OAAO,GAAG,UAAU,EAAE,CAAC,GAAG,kBAAkB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACnE,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,mBAAmB,CAAC,CAAC,GAAG,UAAU,CAAC,EAAE,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC;SACzF;QAED,OAAO,IAAI,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAC9C,CAAC;IAED,8BAAQ,GAAR,UAAS,KAAkB;QACzB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE;YACnC,MAAM,IAAI,kCAAwB,CAAC,+CAA+C,CAAC,CAAC;SACrF;QACD,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE;YAClB,OAAO,IAAI,CAAC;SACb;QACD,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC;IACpC,CAAC;IAED,8BAAQ,GAAR,UAAS,KAA2B;QAClC,IAAI,KAAK,YAAY,WAAW,EAAE;YAChC,OAAO,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;SAClC;QACD,OAAO,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;IACpC,CAAC;IAED,mCAAa,GAAb,UAAc,KAAkB;QAC9B,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE;YACnC,MAAM,IAAI,kCAAwB,CAAC,+CAA+C,CAAC,CAAC;SACrF;QACD,IAAI,IAAI,CAAC,MAAM,EAAE,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE;YACnC,+BAA+B;YAC/B,OAAO,IAAI,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SACzD;QACD,IAAI,aAAa,GAAe,IAAI,CAAC,YAAY,CAAC;QAClD,IAAI,OAAO,GAAE,OAAO,CAAU,aAAa,CAAC,MAAM,CAAC;QACnD,IAAI,aAAa,GAAe,KAAK,CAAC,YAAY,CAAC;QACnD,IAAI,OAAO,GAAE,OAAO,CAAU,aAAa,CAAC,MAAM,CAAC;QACnD,IAAI,OAAO,GAAe,IAAI,UAAU,CAAC,OAAO,GAAG,OAAO,GAAG,CAAC,CAAC,CAAC;QAChE,KAAK,IAAI,CAAC,CAAC,OAAO,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE;YACxC,IAAI,MAAM,GAAE,OAAO,CAAU,aAAa,CAAC,CAAC,CAAC,CAAC;YAC9C,KAAK,IAAI,CAAC,CAAC,OAAO,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE;gBACxC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;aAChG;SACF;QACD,OAAO,IAAI,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAC9C,CAAC;IAED,8BAAQ,GAAR;QACE,IAAI,IAAI,GAAE,OAAO,CAAU,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;QACpD,IAAI,oBAAoB,GAAe,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC;QAC5D,KAAK,IAAI,CAAC,CAAC,OAAO,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE;YACrC,oBAAoB,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;SACxE;QACD,OAAO,IAAI,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,oBAAoB,CAAC,CAAC;IAC3D,CAAC;IAED,oCAAc,GAAd,UAAe,MAAsB;QACnC,IAAI,MAAM,KAAK,CAAC,EAAE;YAChB,OAAO,IAAI,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SACzD;QACD,IAAI,MAAM,KAAK,CAAC,EAAE;YAChB,OAAO,IAAI,CAAC;SACb;QACD,IAAI,IAAI,GAAE,OAAO,CAAU,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;QACpD,IAAI,OAAO,GAAe,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC;QAC/C,KAAK,IAAI,CAAC,CAAC,OAAO,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE;YACrC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;SAChE;QACD,OAAO,IAAI,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAC9C,CAAC;IAED,wCAAkB,GAAlB,UAAmB,MAAsB,EAAE,WAA2B;QACpE,IAAI,MAAM,GAAG,CAAC,EAAE;YACd,MAAM,IAAI,kCAAwB,EAAE,CAAC;SACtC;QACD,IAAI,WAAW,KAAK,CAAC,EAAE;YACrB,OAAO,IAAI,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SACzD;QACD,IAAI,IAAI,GAAE,OAAO,CAAU,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;QACpD,IAAI,OAAO,GAAe,IAAI,UAAU,CAAC,IAAI,GAAG,MAAM,CAAC,CAAC;QACxD,KAAK,IAAI,CAAC,CAAC,OAAO,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE;YACrC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;SACrE;QACD,OAAO,IAAI,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAC9C,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;;;;;;MA0BE;IAEF,YAAY;IACL,8BAAQ,GAAf;QACE,IAAI,MAAM,GAAkB,IAAI,uBAAa,EAAC,wBAAwB,CAAC,CAAC,CAAC,4BAA4B;QACrG,KAAK,IAAI,MAAM,CAAC,OAAO,GAAG,IAAI,CAAC,SAAS,EAAE,EAAE,MAAM,IAAI,CAAC,EAAE,MAAM,EAAE,EAAE;YACjE,IAAI,WAAW,GAAE,OAAO,CAAU,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;YAC9D,IAAI,WAAW,KAAK,CAAC,EAAE;gBACrB,IAAI,WAAW,GAAG,CAAC,EAAE;oBACnB,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;oBACrB,WAAW,GAAG,CAAC,WAAW,CAAC;iBAC5B;qBAAM;oBACL,IAAI,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE;wBACvB,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;qBACtB;iBACF;gBACD,IAAI,MAAM,KAAK,CAAC,IAAI,WAAW,KAAK,CAAC,EAAE;oBACrC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;iBAC5B;gBACD,IAAI,MAAM,KAAK,CAAC,EAAE;oBAChB,IAAI,MAAM,KAAK,CAAC,EAAE;wBAChB,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;qBACpB;yBAAM;wBACL,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;wBACpB,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;qBACvB;iBACF;aACF;SACF;QACD,OAAO,MAAM,CAAC,QAAQ,EAAE,CAAC;IAC3B,CAAC;IAEH,kBAAC;AAAD,CAAC,AAvPD,IAuPC"}

package/template/node_modules/@zxing/library/cjs/core/pdf417/detector/Detector.d.ts

@@ -0,0 +1,84 @@
+import BinaryBitmap from '../../BinaryBitmap';
+import DecodeHintType from '../../DecodeHintType';
+import PDF417DetectorResult from './PDF417DetectorResult';
+/**
+ * <p>Encapsulates logic that can detect a PDF417 Code in an image, even if the
+ * PDF417 Code is rotated or skewed, or partially obscured.</p>
+ *
+ * @author SITA Lab (kevin.osullivan@sita.aero)
+ * @author dswitkin@google.com (Daniel Switkin)
+ * @author Guenther Grau
+ */
+export default class Detector {
+    private static INDEXES_START_PATTERN;
+    private static INDEXES_STOP_PATTERN;
+    private static MAX_AVG_VARIANCE;
+    private static MAX_INDIVIDUAL_VARIANCE;
+    private static START_PATTERN;
+    private static STOP_PATTERN;
+    private static MAX_PIXEL_DRIFT;
+    private static MAX_PATTERN_DRIFT;
+    private static SKIPPED_ROW_COUNT_MAX;
+    private static ROW_STEP;
+    private static BARCODE_MIN_HEIGHT;
+    /**
+     * <p>Detects a PDF417 Code in an image. Only checks 0 and 180 degree rotations.</p>
+     *
+     * @param image barcode image to decode
+     * @param hints optional hints to detector
+     * @param multiple if true, then the image is searched for multiple codes. If false, then at most one code will
+     * be found and returned
+     * @return {@link PDF417DetectorResult} encapsulating results of detecting a PDF417 code
+     * @throws NotFoundException if no PDF417 Code can be found
+     */
+    static detectMultiple(image: BinaryBitmap, hints: Map<DecodeHintType, any>, multiple: boolean): PDF417DetectorResult;
+    /**
+     * Detects PDF417 codes in an image. Only checks 0 degree rotation
+     * @param multiple if true, then the image is searched for multiple codes. If false, then at most one code will
+     * be found and returned
+     * @param bitMatrix bit matrix to detect barcodes in
+     * @return List of ResultPoint arrays containing the coordinates of found barcodes
+     */
+    private static detect;
+    /**
+     * Locate the vertices and the codewords area of a black blob using the Start
+     * and Stop patterns as locators.
+     *
+     * @param matrix the scanned barcode image.
+     * @return an array containing the vertices:
+     *           vertices[0] x, y top left barcode
+     *           vertices[1] x, y bottom left barcode
+     *           vertices[2] x, y top right barcode
+     *           vertices[3] x, y bottom right barcode
+     *           vertices[4] x, y top left codeword area
+     *           vertices[5] x, y bottom left codeword area
+     *           vertices[6] x, y top right codeword area
+     *           vertices[7] x, y bottom right codeword area
+     */
+    private static findVertices;
+    private static copyToResult;
+    private static findRowsWithPattern;
+    /**
+     * @param matrix row of black/white values to search
+     * @param column x position to start search
+     * @param row y position to start search
+     * @param width the number of pixels to search on this row
+     * @param pattern pattern of counts of number of black and white pixels that are
+     *                 being searched for as a pattern
+     * @param counters array of counters, as long as pattern, to re-use
+     * @return start/end horizontal offset of guard pattern, as an array of two ints.
+     */
+    private static findGuardPattern;
+    /**
+     * Determines how closely a set of observed counts of runs of black/white
+     * values matches a given target pattern. This is reported as the ratio of
+     * the total variance from the expected pattern proportions across all
+     * pattern elements, to the length of the pattern.
+     *
+     * @param counters observed counters
+     * @param pattern expected pattern
+     * @param maxIndividualVariance The most any counter can differ before we give up
+     * @return ratio of total variance between counters and pattern compared to total pattern size
+     */
+    private static patternMatchVariance;
+}