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

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

@@ -0,0 +1,250 @@
+/*
+* 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.
+*/
+// package com.google.zxing.pdf417.decoder.ec;
+import IllegalArgumentException from '../../../IllegalArgumentException';
+import System from '../../../util/System';
+import StringBuilder from '../../../util/StringBuilder';
+/**
+ * @author Sean Owen
+ * @see com.google.zxing.common.reedsolomon.GenericGFPoly
+ */
+export default /*final*/ class ModulusPoly {
+    constructor(field, coefficients) {
+        if (coefficients.length === 0) {
+            throw new IllegalArgumentException();
+        }
+        this.field = field;
+        let coefficientsLength = /*int*/ coefficients.length;
+        if (coefficientsLength > 1 && coefficients[0] === 0) {
+            // Leading term must be non-zero for anything except the constant polynomial "0"
+            let 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.arraycopy(coefficients, firstNonZero, this.coefficients, 0, this.coefficients.length);
+            }
+        }
+        else {
+            this.coefficients = coefficients;
+        }
+    }
+    getCoefficients() {
+        return this.coefficients;
+    }
+    /**
+     * @return degree of this polynomial
+     */
+    getDegree() {
+        return this.coefficients.length - 1;
+    }
+    /**
+     * @return true iff this polynomial is the monomial "0"
+     */
+    isZero() {
+        return this.coefficients[0] === 0;
+    }
+    /**
+     * @return coefficient of x^degree term in this polynomial
+     */
+    getCoefficient(degree) {
+        return this.coefficients[this.coefficients.length - 1 - degree];
+    }
+    /**
+     * @return evaluation of this polynomial at a given point
+     */
+    evaluateAt(a) {
+        if (a === 0) {
+            // Just return the x^0 coefficient
+            return this.getCoefficient(0);
+        }
+        if (a === 1) {
+            // Just the sum of the coefficients
+            let sum = /*int*/ 0;
+            for (let coefficient /*int*/ of this.coefficients) {
+                sum = this.field.add(sum, coefficient);
+            }
+            return sum;
+        }
+        let result = /*int*/ this.coefficients[0];
+        let size = /*int*/ this.coefficients.length;
+        for (let i /*int*/ = 1; i < size; i++) {
+            result = this.field.add(this.field.multiply(a, result), this.coefficients[i]);
+        }
+        return result;
+    }
+    add(other) {
+        if (!this.field.equals(other.field)) {
+            throw new IllegalArgumentException('ModulusPolys do not have same ModulusGF field');
+        }
+        if (this.isZero()) {
+            return other;
+        }
+        if (other.isZero()) {
+            return this;
+        }
+        let smallerCoefficients = this.coefficients;
+        let largerCoefficients = other.coefficients;
+        if (smallerCoefficients.length > largerCoefficients.length) {
+            let temp = smallerCoefficients;
+            smallerCoefficients = largerCoefficients;
+            largerCoefficients = temp;
+        }
+        let sumDiff = new Int32Array(largerCoefficients.length);
+        let lengthDiff = /*int*/ largerCoefficients.length - smallerCoefficients.length;
+        // Copy high-order terms only found in higher-degree polynomial's coefficients
+        System.arraycopy(largerCoefficients, 0, sumDiff, 0, lengthDiff);
+        for (let i /*int*/ = lengthDiff; i < largerCoefficients.length; i++) {
+            sumDiff[i] = this.field.add(smallerCoefficients[i - lengthDiff], largerCoefficients[i]);
+        }
+        return new ModulusPoly(this.field, sumDiff);
+    }
+    subtract(other) {
+        if (!this.field.equals(other.field)) {
+            throw new IllegalArgumentException('ModulusPolys do not have same ModulusGF field');
+        }
+        if (other.isZero()) {
+            return this;
+        }
+        return this.add(other.negative());
+    }
+    multiply(other) {
+        if (other instanceof ModulusPoly) {
+            return this.multiplyOther(other);
+        }
+        return this.multiplyScalar(other);
+    }
+    multiplyOther(other) {
+        if (!this.field.equals(other.field)) {
+            throw new IllegalArgumentException('ModulusPolys do not have same ModulusGF field');
+        }
+        if (this.isZero() || other.isZero()) {
+            // return this.field.getZero();
+            return new ModulusPoly(this.field, new Int32Array([0]));
+        }
+        let aCoefficients = this.coefficients;
+        let aLength = /*int*/ aCoefficients.length;
+        let bCoefficients = other.coefficients;
+        let bLength = /*int*/ bCoefficients.length;
+        let product = new Int32Array(aLength + bLength - 1);
+        for (let i /*int*/ = 0; i < aLength; i++) {
+            let aCoeff = /*int*/ aCoefficients[i];
+            for (let 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);
+    }
+    negative() {
+        let size = /*int*/ this.coefficients.length;
+        let negativeCoefficients = new Int32Array(size);
+        for (let i /*int*/ = 0; i < size; i++) {
+            negativeCoefficients[i] = this.field.subtract(0, this.coefficients[i]);
+        }
+        return new ModulusPoly(this.field, negativeCoefficients);
+    }
+    multiplyScalar(scalar) {
+        if (scalar === 0) {
+            return new ModulusPoly(this.field, new Int32Array([0]));
+        }
+        if (scalar === 1) {
+            return this;
+        }
+        let size = /*int*/ this.coefficients.length;
+        let product = new Int32Array(size);
+        for (let i /*int*/ = 0; i < size; i++) {
+            product[i] = this.field.multiply(this.coefficients[i], scalar);
+        }
+        return new ModulusPoly(this.field, product);
+    }
+    multiplyByMonomial(degree, coefficient) {
+        if (degree < 0) {
+            throw new IllegalArgumentException();
+        }
+        if (coefficient === 0) {
+            return new ModulusPoly(this.field, new Int32Array([0]));
+        }
+        let size = /*int*/ this.coefficients.length;
+        let product = new Int32Array(size + degree);
+        for (let 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
+    toString() {
+        let result = new StringBuilder( /*8 * this.getDegree()*/); // dynamic string size in JS
+        for (let degree /*int*/ = this.getDegree(); degree >= 0; degree--) {
+            let 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();
+    }
+}
+//# sourceMappingURL=ModulusPoly.js.map

package/template/node_modules/@zxing/library/es2015/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,OAAO,wBAAwB,MAAM,mCAAmC,CAAC;AACzE,OAAO,MAAM,MAAM,sBAAsB,CAAC;AAC1C,OAAO,aAAa,MAAM,6BAA6B,CAAC;AAGxD;;;GAGG;AACH,MAAM,CAAC,OAAO,CAAC,SAAS,OAAO,WAAW;IAKxC,YAAY,KAAkB,EAAE,YAAwB;QACtD,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE;YAC7B,MAAM,IAAI,wBAAwB,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,MAAM,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,eAAe;QACb,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,SAAS;QACP,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC;IACtC,CAAC;IAED;;OAEG;IACH,MAAM;QACJ,OAAO,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IACpC,CAAC;IAED;;OAEG;IACH,cAAc,CAAC,MAAsB;QACnC,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;IAClE,CAAC;IAED;;OAEG;IACH,UAAU,CAAC,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;YAC5B,KAAK,IAAI,WAAW,CAAC,OAAO,IAAI,IAAI,CAAC,YAAY,EAAE;gBACjD,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,WAAW,CAAC,CAAC;aACxC;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,GAAG,CAAC,KAAkB;QACpB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE;YACnC,MAAM,IAAI,wBAAwB,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,MAAM,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,QAAQ,CAAC,KAAkB;QACzB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE;YACnC,MAAM,IAAI,wBAAwB,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,QAAQ,CAAC,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,aAAa,CAAC,KAAkB;QAC9B,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE;YACnC,MAAM,IAAI,wBAAwB,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,QAAQ;QACN,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,cAAc,CAAC,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,kBAAkB,CAAC,MAAsB,EAAE,WAA2B;QACpE,IAAI,MAAM,GAAG,CAAC,EAAE;YACd,MAAM,IAAI,wBAAwB,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,QAAQ;QACb,IAAI,MAAM,GAAkB,IAAI,aAAa,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;CAEF"}

package/template/node_modules/@zxing/library/es2015/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;
+}

package/template/node_modules/@zxing/library/es2015/core/pdf417/detector/Detector.js

@@ -0,0 +1,312 @@
+/*
+* Copyright 2009 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 com.google.zxing.NotFoundException;
+// import com.google.zxing.ResultPoint;
+import ResultPoint from '../../ResultPoint';
+import System from '../../util/System';
+import Arrays from '../../util/Arrays';
+import PDF417DetectorResult from './PDF417DetectorResult';
+// import java.util.ArrayList;
+// import java.util.Arrays;
+// import java.util.List;
+// import java.util.Map;
+/**
+ * <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 /*public*/ /*final*/ class Detector {
+    /**
+     * <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, hints, multiple) {
+        // TODO detection improvement, tryHarder could try several different luminance thresholds/blackpoints or even
+        // different binarizers
+        // boolean tryHarder = hints != null && hints.containsKey(DecodeHintType.TRY_HARDER);
+        let bitMatrix = image.getBlackMatrix();
+        let barcodeCoordinates = Detector.detect(multiple, bitMatrix);
+        if (!barcodeCoordinates.length) {
+            bitMatrix = bitMatrix.clone();
+            bitMatrix.rotate180();
+            barcodeCoordinates = Detector.detect(multiple, bitMatrix);
+        }
+        return new PDF417DetectorResult(bitMatrix, barcodeCoordinates);
+    }
+    /**
+     * 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
+     */
+    static detect(multiple, bitMatrix) {
+        const barcodeCoordinates = new Array();
+        let row = 0;
+        let column = 0;
+        let foundBarcodeInRow = false;
+        while (row < bitMatrix.getHeight()) {
+            const vertices = Detector.findVertices(bitMatrix, row, column);
+            if (vertices[0] == null && vertices[3] == null) {
+                if (!foundBarcodeInRow) {
+                    // we didn't find any barcode so that's the end of searching
+                    break;
+                }
+                // we didn't find a barcode starting at the given column and row. Try again from the first column and slightly
+                // below the lowest barcode we found so far.
+                foundBarcodeInRow = false;
+                column = 0;
+                for (const barcodeCoordinate of barcodeCoordinates) {
+                    if (barcodeCoordinate[1] != null) {
+                        row = Math.trunc(Math.max(row, barcodeCoordinate[1].getY()));
+                    }
+                    if (barcodeCoordinate[3] != null) {
+                        row = Math.max(row, Math.trunc(barcodeCoordinate[3].getY()));
+                    }
+                }
+                row += Detector.ROW_STEP;
+                continue;
+            }
+            foundBarcodeInRow = true;
+            barcodeCoordinates.push(vertices);
+            if (!multiple) {
+                break;
+            }
+            // if we didn't find a right row indicator column, then continue the search for the next barcode after the
+            // start pattern of the barcode just found.
+            if (vertices[2] != null) {
+                column = Math.trunc(vertices[2].getX());
+                row = Math.trunc(vertices[2].getY());
+            }
+            else {
+                column = Math.trunc(vertices[4].getX());
+                row = Math.trunc(vertices[4].getY());
+            }
+        }
+        return barcodeCoordinates;
+    }
+    /**
+     * 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
+     */
+    static findVertices(matrix, startRow, startColumn) {
+        const height = matrix.getHeight();
+        const width = matrix.getWidth();
+        // const result = new ResultPoint[8];
+        const result = new Array(8);
+        Detector.copyToResult(result, Detector.findRowsWithPattern(matrix, height, width, startRow, startColumn, Detector.START_PATTERN), Detector.INDEXES_START_PATTERN);
+        if (result[4] != null) {
+            startColumn = Math.trunc(result[4].getX());
+            startRow = Math.trunc(result[4].getY());
+        }
+        Detector.copyToResult(result, Detector.findRowsWithPattern(matrix, height, width, startRow, startColumn, Detector.STOP_PATTERN), Detector.INDEXES_STOP_PATTERN);
+        return result;
+    }
+    static copyToResult(result, tmpResult, destinationIndexes) {
+        for (let i = 0; i < destinationIndexes.length; i++) {
+            result[destinationIndexes[i]] = tmpResult[i];
+        }
+    }
+    static findRowsWithPattern(matrix, height, width, startRow, startColumn, pattern) {
+        // const result = new ResultPoint[4];
+        const result = new Array(4);
+        let found = false;
+        const counters = new Int32Array(pattern.length);
+        for (; startRow < height; startRow += Detector.ROW_STEP) {
+            let loc = Detector.findGuardPattern(matrix, startColumn, startRow, width, false, pattern, counters);
+            if (loc != null) {
+                while (startRow > 0) {
+                    const previousRowLoc = Detector.findGuardPattern(matrix, startColumn, --startRow, width, false, pattern, counters);
+                    if (previousRowLoc != null) {
+                        loc = previousRowLoc;
+                    }
+                    else {
+                        startRow++;
+                        break;
+                    }
+                }
+                result[0] = new ResultPoint(loc[0], startRow);
+                result[1] = new ResultPoint(loc[1], startRow);
+                found = true;
+                break;
+            }
+        }
+        let stopRow = startRow + 1;
+        // Last row of the current symbol that contains pattern
+        if (found) {
+            let skippedRowCount = 0;
+            let previousRowLoc = Int32Array.from([Math.trunc(result[0].getX()), Math.trunc(result[1].getX())]);
+            for (; stopRow < height; stopRow++) {
+                const loc = Detector.findGuardPattern(matrix, previousRowLoc[0], stopRow, width, false, pattern, counters);
+                // a found pattern is only considered to belong to the same barcode if the start and end positions
+                // don't differ too much. Pattern drift should be not bigger than two for consecutive rows. With
+                // a higher number of skipped rows drift could be larger. To keep it simple for now, we allow a slightly
+                // larger drift and don't check for skipped rows.
+                if (loc != null &&
+                    Math.abs(previousRowLoc[0] - loc[0]) < Detector.MAX_PATTERN_DRIFT &&
+                    Math.abs(previousRowLoc[1] - loc[1]) < Detector.MAX_PATTERN_DRIFT) {
+                    previousRowLoc = loc;
+                    skippedRowCount = 0;
+                }
+                else {
+                    if (skippedRowCount > Detector.SKIPPED_ROW_COUNT_MAX) {
+                        break;
+                    }
+                    else {
+                        skippedRowCount++;
+                    }
+                }
+            }
+            stopRow -= skippedRowCount + 1;
+            result[2] = new ResultPoint(previousRowLoc[0], stopRow);
+            result[3] = new ResultPoint(previousRowLoc[1], stopRow);
+        }
+        if (stopRow - startRow < Detector.BARCODE_MIN_HEIGHT) {
+            Arrays.fill(result, null);
+        }
+        return result;
+    }
+    /**
+     * @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.
+     */
+    static findGuardPattern(matrix, column, row, width, whiteFirst, pattern, counters) {
+        Arrays.fillWithin(counters, 0, counters.length, 0);
+        let patternStart = column;
+        let pixelDrift = 0;
+        // if there are black pixels left of the current pixel shift to the left, but only for MAX_PIXEL_DRIFT pixels
+        while (matrix.get(patternStart, row) && patternStart > 0 && pixelDrift++ < Detector.MAX_PIXEL_DRIFT) {
+            patternStart--;
+        }
+        let x = patternStart;
+        let counterPosition = 0;
+        let patternLength = pattern.length;
+        for (let isWhite = whiteFirst; x < width; x++) {
+            let pixel = matrix.get(x, row);
+            if (pixel !== isWhite) {
+                counters[counterPosition]++;
+            }
+            else {
+                if (counterPosition === patternLength - 1) {
+                    if (Detector.patternMatchVariance(counters, pattern, Detector.MAX_INDIVIDUAL_VARIANCE) < Detector.MAX_AVG_VARIANCE) {
+                        return new Int32Array([patternStart, x]);
+                    }
+                    patternStart += counters[0] + counters[1];
+                    System.arraycopy(counters, 2, counters, 0, counterPosition - 1);
+                    counters[counterPosition - 1] = 0;
+                    counters[counterPosition] = 0;
+                    counterPosition--;
+                }
+                else {
+                    counterPosition++;
+                }
+                counters[counterPosition] = 1;
+                isWhite = !isWhite;
+            }
+        }
+        if (counterPosition === patternLength - 1 &&
+            Detector.patternMatchVariance(counters, pattern, Detector.MAX_INDIVIDUAL_VARIANCE) < Detector.MAX_AVG_VARIANCE) {
+            return new Int32Array([patternStart, x - 1]);
+        }
+        return null;
+    }
+    /**
+     * 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
+     */
+    static patternMatchVariance(counters, pattern, maxIndividualVariance) {
+        let numCounters = counters.length;
+        let total = 0;
+        let patternLength = 0;
+        for (let i = 0; i < numCounters; i++) {
+            total += counters[i];
+            patternLength += pattern[i];
+        }
+        if (total < patternLength) {
+            // If we don't even have one pixel per unit of bar width, assume this
+            // is too small to reliably match, so fail:
+            return /*Float.POSITIVE_INFINITY*/ Infinity;
+        }
+        // We're going to fake floating-point math in integers. We just need to use more bits.
+        // Scale up patternLength so that intermediate values below like scaledCounter will have
+        // more "significant digits".
+        let unitBarWidth = total / patternLength;
+        maxIndividualVariance *= unitBarWidth;
+        let totalVariance = 0.0;
+        for (let x = 0; x < numCounters; x++) {
+            let counter = counters[x];
+            let scaledPattern = pattern[x] * unitBarWidth;
+            let variance = counter > scaledPattern ? counter - scaledPattern : scaledPattern - counter;
+            if (variance > maxIndividualVariance) {
+                return /*Float.POSITIVE_INFINITY*/ Infinity;
+            }
+            totalVariance += variance;
+        }
+        return totalVariance / total;
+    }
+}
+Detector.INDEXES_START_PATTERN = Int32Array.from([0, 4, 1, 5]);
+Detector.INDEXES_STOP_PATTERN = Int32Array.from([6, 2, 7, 3]);
+Detector.MAX_AVG_VARIANCE = 0.42;
+Detector.MAX_INDIVIDUAL_VARIANCE = 0.8;
+// B S B S B S B S Bar/Space pattern
+// 11111111 0 1 0 1 0 1 000
+Detector.START_PATTERN = Int32Array.from([8, 1, 1, 1, 1, 1, 1, 3]);
+// 1111111 0 1 000 1 0 1 00 1
+Detector.STOP_PATTERN = Int32Array.from([7, 1, 1, 3, 1, 1, 1, 2, 1]);
+Detector.MAX_PIXEL_DRIFT = 3;
+Detector.MAX_PATTERN_DRIFT = 5;
+// if we set the value too low, then we don't detect the correct height of the bar if the start patterns are damaged.
+// if we set the value too high, then we might detect the start pattern from a neighbor barcode.
+Detector.SKIPPED_ROW_COUNT_MAX = 25;
+// A PDF471 barcode should have at least 3 rows, with each row being >= 3 times the module width. Therefore it should be at least
+// 9 pixels tall. To be conservative, we use about half the size to ensure we don't miss it.
+Detector.ROW_STEP = 5;
+Detector.BARCODE_MIN_HEIGHT = 10;
+//# sourceMappingURL=Detector.js.map