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

package/template/node_modules/@zxing/library/es2015/core/common/reedsolomon/GenericGFPoly.js

@@ -0,0 +1,254 @@
+/*
+ * 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.
+ */
+/*namespace com.google.zxing.common.reedsolomon {*/
+import AbstractGenericGF from './AbstractGenericGF';
+import System from '../../util/System';
+import IllegalArgumentException from '../../IllegalArgumentException';
+/**
+ * <p>Represents a polynomial whose coefficients are elements of a GF.
+ * Instances of this class are immutable.</p>
+ *
+ * <p>Much credit is due to William Rucklidge since portions of this code are an indirect
+ * port of his C++ Reed-Solomon implementation.</p>
+ *
+ * @author Sean Owen
+ */
+export default class GenericGFPoly {
+    /**
+     * @param field the {@link GenericGF} instance representing the field to use
+     * to perform computations
+     * @param coefficients coefficients as ints representing elements of GF(size), arranged
+     * from most significant (highest-power term) coefficient to least significant
+     * @throws IllegalArgumentException if argument is null or empty,
+     * or if leading coefficient is 0 and this is not a
+     * constant polynomial (that is, it is not the monomial "0")
+     */
+    constructor(field, coefficients) {
+        if (coefficients.length === 0) {
+            throw new IllegalArgumentException();
+        }
+        this.field = field;
+        const coefficientsLength = coefficients.length;
+        if (coefficientsLength > 1 && coefficients[0] === 0) {
+            // Leading term must be non-zero for anything except the constant polynomial "0"
+            let firstNonZero = 1;
+            while (firstNonZero < coefficientsLength && coefficients[firstNonZero] === 0) {
+                firstNonZero++;
+            }
+            if (firstNonZero === coefficientsLength) {
+                this.coefficients = Int32Array.from([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 /*int*/) {
+        return this.coefficients[this.coefficients.length - 1 - degree];
+    }
+    /**
+     * @return evaluation of this polynomial at a given point
+     */
+    evaluateAt(a /*int*/) {
+        if (a === 0) {
+            // Just return the x^0 coefficient
+            return this.getCoefficient(0);
+        }
+        const coefficients = this.coefficients;
+        let result;
+        if (a === 1) {
+            // Just the sum of the coefficients
+            result = 0;
+            for (let i = 0, length = coefficients.length; i !== length; i++) {
+                const coefficient = coefficients[i];
+                result = AbstractGenericGF.addOrSubtract(result, coefficient);
+            }
+            return result;
+        }
+        result = coefficients[0];
+        const size = coefficients.length;
+        const field = this.field;
+        for (let i = 1; i < size; i++) {
+            result = AbstractGenericGF.addOrSubtract(field.multiply(a, result), coefficients[i]);
+        }
+        return result;
+    }
+    addOrSubtract(other) {
+        if (!this.field.equals(other.field)) {
+            throw new IllegalArgumentException('GenericGFPolys do not have same GenericGF field');
+        }
+        if (this.isZero()) {
+            return other;
+        }
+        if (other.isZero()) {
+            return this;
+        }
+        let smallerCoefficients = this.coefficients;
+        let largerCoefficients = other.coefficients;
+        if (smallerCoefficients.length > largerCoefficients.length) {
+            const temp = smallerCoefficients;
+            smallerCoefficients = largerCoefficients;
+            largerCoefficients = temp;
+        }
+        let sumDiff = new Int32Array(largerCoefficients.length);
+        const lengthDiff = 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 = lengthDiff; i < largerCoefficients.length; i++) {
+            sumDiff[i] = AbstractGenericGF.addOrSubtract(smallerCoefficients[i - lengthDiff], largerCoefficients[i]);
+        }
+        return new GenericGFPoly(this.field, sumDiff);
+    }
+    multiply(other) {
+        if (!this.field.equals(other.field)) {
+            throw new IllegalArgumentException('GenericGFPolys do not have same GenericGF field');
+        }
+        if (this.isZero() || other.isZero()) {
+            return this.field.getZero();
+        }
+        const aCoefficients = this.coefficients;
+        const aLength = aCoefficients.length;
+        const bCoefficients = other.coefficients;
+        const bLength = bCoefficients.length;
+        const product = new Int32Array(aLength + bLength - 1);
+        const field = this.field;
+        for (let i = 0; i < aLength; i++) {
+            const aCoeff = aCoefficients[i];
+            for (let j = 0; j < bLength; j++) {
+                product[i + j] = AbstractGenericGF.addOrSubtract(product[i + j], field.multiply(aCoeff, bCoefficients[j]));
+            }
+        }
+        return new GenericGFPoly(field, product);
+    }
+    multiplyScalar(scalar /*int*/) {
+        if (scalar === 0) {
+            return this.field.getZero();
+        }
+        if (scalar === 1) {
+            return this;
+        }
+        const size = this.coefficients.length;
+        const field = this.field;
+        const product = new Int32Array(size);
+        const coefficients = this.coefficients;
+        for (let i = 0; i < size; i++) {
+            product[i] = field.multiply(coefficients[i], scalar);
+        }
+        return new GenericGFPoly(field, product);
+    }
+    multiplyByMonomial(degree /*int*/, coefficient /*int*/) {
+        if (degree < 0) {
+            throw new IllegalArgumentException();
+        }
+        if (coefficient === 0) {
+            return this.field.getZero();
+        }
+        const coefficients = this.coefficients;
+        const size = coefficients.length;
+        const product = new Int32Array(size + degree);
+        const field = this.field;
+        for (let i = 0; i < size; i++) {
+            product[i] = field.multiply(coefficients[i], coefficient);
+        }
+        return new GenericGFPoly(field, product);
+    }
+    divide(other) {
+        if (!this.field.equals(other.field)) {
+            throw new IllegalArgumentException('GenericGFPolys do not have same GenericGF field');
+        }
+        if (other.isZero()) {
+            throw new IllegalArgumentException('Divide by 0');
+        }
+        const field = this.field;
+        let quotient = field.getZero();
+        let remainder = this;
+        const denominatorLeadingTerm = other.getCoefficient(other.getDegree());
+        const inverseDenominatorLeadingTerm = field.inverse(denominatorLeadingTerm);
+        while (remainder.getDegree() >= other.getDegree() && !remainder.isZero()) {
+            const degreeDifference = remainder.getDegree() - other.getDegree();
+            const scale = field.multiply(remainder.getCoefficient(remainder.getDegree()), inverseDenominatorLeadingTerm);
+            const term = other.multiplyByMonomial(degreeDifference, scale);
+            const iterationQuotient = field.buildMonomial(degreeDifference, scale);
+            quotient = quotient.addOrSubtract(iterationQuotient);
+            remainder = remainder.addOrSubtract(term);
+        }
+        return [quotient, remainder];
+    }
+    /*@Override*/
+    toString() {
+        let result = '';
+        for (let degree = this.getDegree(); degree >= 0; degree--) {
+            let coefficient = this.getCoefficient(degree);
+            if (coefficient !== 0) {
+                if (coefficient < 0) {
+                    result += ' - ';
+                    coefficient = -coefficient;
+                }
+                else {
+                    if (result.length > 0) {
+                        result += ' + ';
+                    }
+                }
+                if (degree === 0 || coefficient !== 1) {
+                    const alphaPower = this.field.log(coefficient);
+                    if (alphaPower === 0) {
+                        result += '1';
+                    }
+                    else if (alphaPower === 1) {
+                        result += 'a';
+                    }
+                    else {
+                        result += 'a^';
+                        result += alphaPower;
+                    }
+                }
+                if (degree !== 0) {
+                    if (degree === 1) {
+                        result += 'x';
+                    }
+                    else {
+                        result += 'x^';
+                        result += degree;
+                    }
+                }
+            }
+        }
+        return result;
+    }
+}
+//# sourceMappingURL=GenericGFPoly.js.map

package/template/node_modules/@zxing/library/es2015/core/common/reedsolomon/GenericGFPoly.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GenericGFPoly.js","sourceRoot":"","sources":["../../../../../src/core/common/reedsolomon/GenericGFPoly.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,mDAAmD;AAEnD,OAAO,iBAAiB,MAAM,qBAAqB,CAAC;AAEpD,OAAO,MAAM,MAAM,mBAAmB,CAAC;AACvC,OAAO,wBAAwB,MAAM,gCAAgC,CAAC;AAEtE;;;;;;;;GAQG;AACH,MAAM,CAAC,OAAO,OAAO,aAAa;IAK9B;;;;;;;;OAQG;IACH,YAAmB,KAAwB,EAAE,YAAwB;QACjE,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE;YAC3B,MAAM,IAAI,wBAAwB,EAAE,CAAC;SACxC;QACD,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,MAAM,kBAAkB,GAAG,YAAY,CAAC,MAAM,CAAC;QAC/C,IAAI,kBAAkB,GAAG,CAAC,IAAI,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE;YACjD,gFAAgF;YAChF,IAAI,YAAY,GAAG,CAAC,CAAC;YACrB,OAAO,YAAY,GAAG,kBAAkB,IAAI,YAAY,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE;gBAC1E,YAAY,EAAE,CAAC;aAClB;YACD,IAAI,YAAY,KAAK,kBAAkB,EAAE;gBACrC,IAAI,CAAC,YAAY,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;aAC5C;iBAAM;gBACH,IAAI,CAAC,YAAY,GAAG,IAAI,UAAU,CAAC,kBAAkB,GAAG,YAAY,CAAC,CAAC;gBACtE,MAAM,CAAC,SAAS,CAAC,YAAY,EACzB,YAAY,EACZ,IAAI,CAAC,YAAY,EACjB,CAAC,EACD,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;aACjC;SACJ;aAAM;YACH,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;SACpC;IACL,CAAC;IAEM,eAAe;QAClB,OAAO,IAAI,CAAC,YAAY,CAAC;IAC7B,CAAC;IAED;;OAEG;IACI,SAAS;QACZ,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC;IACxC,CAAC;IAED;;OAEG;IACI,MAAM;QACT,OAAO,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IACtC,CAAC;IAED;;OAEG;IACI,cAAc,CAAC,MAAc,CAAC,OAAO;QACxC,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;IACpE,CAAC;IAED;;OAEG;IACI,UAAU,CAAC,CAAS,CAAC,OAAO;QAC/B,IAAI,CAAC,KAAK,CAAC,EAAE;YACT,kCAAkC;YAClC,OAAO,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;SACjC;QACD,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC;QACvC,IAAI,MAAc,CAAC;QACnB,IAAI,CAAC,KAAK,CAAC,EAAE;YACT,mCAAmC;YACnC,MAAM,GAAG,CAAC,CAAC;YACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,MAAM,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,KAAK,MAAM,EAAE,CAAC,EAAE,EAAE;gBAC7D,MAAM,WAAW,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;gBACpC,MAAM,GAAG,iBAAiB,CAAC,aAAa,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;aACjE;YACD,OAAO,MAAM,CAAC;SACjB;QACD,MAAM,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QACzB,MAAM,IAAI,GAAG,YAAY,CAAC,MAAM,CAAC;QACjC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE;YAC3B,MAAM,GAAG,iBAAiB,CAAC,aAAa,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;SACxF;QACD,OAAO,MAAM,CAAC;IAClB,CAAC;IAEM,aAAa,CAAC,KAAoB;QACrC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE;YACjC,MAAM,IAAI,wBAAwB,CAAC,iDAAiD,CAAC,CAAC;SACzF;QACD,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE;YACf,OAAO,KAAK,CAAC;SAChB;QACD,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE;YAChB,OAAO,IAAI,CAAC;SACf;QAED,IAAI,mBAAmB,GAAG,IAAI,CAAC,YAAY,CAAC;QAC5C,IAAI,kBAAkB,GAAG,KAAK,CAAC,YAAY,CAAC;QAC5C,IAAI,mBAAmB,CAAC,MAAM,GAAG,kBAAkB,CAAC,MAAM,EAAE;YACxD,MAAM,IAAI,GAAG,mBAAmB,CAAC;YACjC,mBAAmB,GAAG,kBAAkB,CAAC;YACzC,kBAAkB,GAAG,IAAI,CAAC;SAC7B;QACD,IAAI,OAAO,GAAG,IAAI,UAAU,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC;QACxD,MAAM,UAAU,GAAG,kBAAkB,CAAC,MAAM,GAAG,mBAAmB,CAAC,MAAM,CAAC;QAC1E,8EAA8E;QAC9E,MAAM,CAAC,SAAS,CAAC,kBAAkB,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;QAEhE,KAAK,IAAI,CAAC,GAAG,UAAU,EAAE,CAAC,GAAG,kBAAkB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACzD,OAAO,CAAC,CAAC,CAAC,GAAG,iBAAiB,CAAC,aAAa,CAAC,mBAAmB,CAAC,CAAC,GAAG,UAAU,CAAC,EAAE,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC;SAC5G;QAED,OAAO,IAAI,aAAa,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAClD,CAAC;IAEM,QAAQ,CAAC,KAAoB;QAChC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE;YACjC,MAAM,IAAI,wBAAwB,CAAC,iDAAiD,CAAC,CAAC;SACzF;QACD,IAAI,IAAI,CAAC,MAAM,EAAE,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE;YACjC,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;SAC/B;QACD,MAAM,aAAa,GAAG,IAAI,CAAC,YAAY,CAAC;QACxC,MAAM,OAAO,GAAG,aAAa,CAAC,MAAM,CAAC;QACrC,MAAM,aAAa,GAAG,KAAK,CAAC,YAAY,CAAC;QACzC,MAAM,OAAO,GAAG,aAAa,CAAC,MAAM,CAAC;QACrC,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,OAAO,GAAG,OAAO,GAAG,CAAC,CAAC,CAAC;QACtD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE;YAC9B,MAAM,MAAM,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;YAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE;gBAC9B,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,iBAAiB,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,EAC3D,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;aACjD;SACJ;QACD,OAAO,IAAI,aAAa,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAC7C,CAAC;IAEM,cAAc,CAAC,MAAc,CAAC,OAAO;QACxC,IAAI,MAAM,KAAK,CAAC,EAAE;YACd,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;SAC/B;QACD,IAAI,MAAM,KAAK,CAAC,EAAE;YACd,OAAO,IAAI,CAAC;SACf;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;QACtC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC;QACrC,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC;QACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE;YAC3B,OAAO,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;SACxD;QACD,OAAO,IAAI,aAAa,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAC7C,CAAC;IAEM,kBAAkB,CAAC,MAAc,CAAC,OAAO,EAAE,WAAmB,CAAC,OAAO;QACzE,IAAI,MAAM,GAAG,CAAC,EAAE;YACZ,MAAM,IAAI,wBAAwB,EAAE,CAAC;SACxC;QACD,IAAI,WAAW,KAAK,CAAC,EAAE;YACnB,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;SAC/B;QACD,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC;QACvC,MAAM,IAAI,GAAG,YAAY,CAAC,MAAM,CAAC;QACjC,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,IAAI,GAAG,MAAM,CAAC,CAAC;QAC9C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE;YAC3B,OAAO,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;SAC7D;QACD,OAAO,IAAI,aAAa,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAC7C,CAAC;IAEM,MAAM,CAAC,KAAoB;QAC9B,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE;YACjC,MAAM,IAAI,wBAAwB,CAAC,iDAAiD,CAAC,CAAC;SACzF;QACD,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE;YAChB,MAAM,IAAI,wBAAwB,CAAC,aAAa,CAAC,CAAC;SACrD;QAED,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QAEzB,IAAI,QAAQ,GAAkB,KAAK,CAAC,OAAO,EAAE,CAAC;QAC9C,IAAI,SAAS,GAAkB,IAAI,CAAC;QAEpC,MAAM,sBAAsB,GAAG,KAAK,CAAC,cAAc,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,CAAC;QACvE,MAAM,6BAA6B,GAAG,KAAK,CAAC,OAAO,CAAC,sBAAsB,CAAC,CAAC;QAE5E,OAAO,SAAS,CAAC,SAAS,EAAE,IAAI,KAAK,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE;YACtE,MAAM,gBAAgB,GAAG,SAAS,CAAC,SAAS,EAAE,GAAG,KAAK,CAAC,SAAS,EAAE,CAAC;YACnE,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,cAAc,CAAC,SAAS,CAAC,SAAS,EAAE,CAAC,EAAE,6BAA6B,CAAC,CAAC;YAC7G,MAAM,IAAI,GAAG,KAAK,CAAC,kBAAkB,CAAC,gBAAgB,EAAE,KAAK,CAAC,CAAC;YAC/D,MAAM,iBAAiB,GAAG,KAAK,CAAC,aAAa,CAAC,gBAAgB,EAAE,KAAK,CAAC,CAAC;YACvE,QAAQ,GAAG,QAAQ,CAAC,aAAa,CAAC,iBAAiB,CAAC,CAAC;YACrD,SAAS,GAAG,SAAS,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;SAC7C;QAED,OAAO,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;IACjC,CAAC;IAED,aAAa;IACN,QAAQ;QACX,IAAI,MAAM,GAAG,EAAE,CAAC;QAChB,KAAK,IAAI,MAAM,GAAG,IAAI,CAAC,SAAS,EAAE,EAAE,MAAM,IAAI,CAAC,EAAE,MAAM,EAAE,EAAE;YACvD,IAAI,WAAW,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;YAC9C,IAAI,WAAW,KAAK,CAAC,EAAE;gBACnB,IAAI,WAAW,GAAG,CAAC,EAAE;oBACjB,MAAM,IAAI,KAAK,CAAC;oBAChB,WAAW,GAAG,CAAC,WAAW,CAAC;iBAC9B;qBAAM;oBACH,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE;wBACnB,MAAM,IAAI,KAAK,CAAC;qBACnB;iBACJ;gBACD,IAAI,MAAM,KAAK,CAAC,IAAI,WAAW,KAAK,CAAC,EAAE;oBACnC,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;oBAC/C,IAAI,UAAU,KAAK,CAAC,EAAE;wBAClB,MAAM,IAAI,GAAG,CAAC;qBACjB;yBAAM,IAAI,UAAU,KAAK,CAAC,EAAE;wBACzB,MAAM,IAAI,GAAG,CAAC;qBACjB;yBAAM;wBACH,MAAM,IAAI,IAAI,CAAC;wBACf,MAAM,IAAI,UAAU,CAAC;qBACxB;iBACJ;gBACD,IAAI,MAAM,KAAK,CAAC,EAAE;oBACd,IAAI,MAAM,KAAK,CAAC,EAAE;wBACd,MAAM,IAAI,GAAG,CAAC;qBACjB;yBAAM;wBACH,MAAM,IAAI,IAAI,CAAC;wBACf,MAAM,IAAI,MAAM,CAAC;qBACpB;iBACJ;aACJ;SACJ;QACD,OAAO,MAAM,CAAC;IAClB,CAAC;CAEJ"}

package/template/node_modules/@zxing/library/es2015/core/common/reedsolomon/ReedSolomonDecoder.d.ts

@@ -0,0 +1,40 @@
+import GenericGF from './GenericGF';
+/**
+ * <p>Implements Reed-Solomon decoding, as the name implies.</p>
+ *
+ * <p>The algorithm will not be explained here, but the following references were helpful
+ * in creating this implementation:</p>
+ *
+ * <ul>
+ * <li>Bruce Maggs.
+ * <a href="http://www.cs.cmu.edu/afs/cs.cmu.edu/project/pscico-guyb/realworld/www/rs_decode.ps">
+ * "Decoding Reed-Solomon Codes"</a> (see discussion of Forney's Formula)</li>
+ * <li>J.I. Hall. <a href="www.mth.msu.edu/~jhall/classes/codenotes/GRS.pdf">
+ * "Chapter 5. Generalized Reed-Solomon Codes"</a>
+ * (see discussion of Euclidean algorithm)</li>
+ * </ul>
+ *
+ * <p>Much credit is due to William Rucklidge since portions of this code are an indirect
+ * port of his C++ Reed-Solomon implementation.</p>
+ *
+ * @author Sean Owen
+ * @author William Rucklidge
+ * @author sanfordsquires
+ */
+export default class ReedSolomonDecoder {
+    private field;
+    constructor(field: GenericGF);
+    /**
+     * <p>Decodes given set of received codewords, which include both data and error-correction
+     * codewords. Really, this means it uses Reed-Solomon to detect and correct errors, in-place,
+     * in the input.</p>
+     *
+     * @param received data and error-correction codewords
+     * @param twoS number of error-correction codewords available
+     * @throws ReedSolomonException if decoding fails for any reason
+     */
+    decode(received: Int32Array, twoS: number): void;
+    private runEuclideanAlgorithm;
+    private findErrorLocations;
+    private findErrorMagnitudes;
+}

package/template/node_modules/@zxing/library/es2015/core/common/reedsolomon/ReedSolomonDecoder.js

@@ -0,0 +1,179 @@
+/*
+ * 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.
+ */
+/*namespace com.google.zxing.common.reedsolomon {*/
+import GenericGF from './GenericGF';
+import GenericGFPoly from './GenericGFPoly';
+import ReedSolomonException from '../../ReedSolomonException';
+import IllegalStateException from '../../IllegalStateException';
+/**
+ * <p>Implements Reed-Solomon decoding, as the name implies.</p>
+ *
+ * <p>The algorithm will not be explained here, but the following references were helpful
+ * in creating this implementation:</p>
+ *
+ * <ul>
+ * <li>Bruce Maggs.
+ * <a href="http://www.cs.cmu.edu/afs/cs.cmu.edu/project/pscico-guyb/realworld/www/rs_decode.ps">
+ * "Decoding Reed-Solomon Codes"</a> (see discussion of Forney's Formula)</li>
+ * <li>J.I. Hall. <a href="www.mth.msu.edu/~jhall/classes/codenotes/GRS.pdf">
+ * "Chapter 5. Generalized Reed-Solomon Codes"</a>
+ * (see discussion of Euclidean algorithm)</li>
+ * </ul>
+ *
+ * <p>Much credit is due to William Rucklidge since portions of this code are an indirect
+ * port of his C++ Reed-Solomon implementation.</p>
+ *
+ * @author Sean Owen
+ * @author William Rucklidge
+ * @author sanfordsquires
+ */
+export default class ReedSolomonDecoder {
+    constructor(field) {
+        this.field = field;
+    }
+    /**
+     * <p>Decodes given set of received codewords, which include both data and error-correction
+     * codewords. Really, this means it uses Reed-Solomon to detect and correct errors, in-place,
+     * in the input.</p>
+     *
+     * @param received data and error-correction codewords
+     * @param twoS number of error-correction codewords available
+     * @throws ReedSolomonException if decoding fails for any reason
+     */
+    decode(received, twoS /*int*/) {
+        const field = this.field;
+        const poly = new GenericGFPoly(field, received);
+        const syndromeCoefficients = new Int32Array(twoS);
+        let noError = true;
+        for (let i = 0; i < twoS; i++) {
+            const evalResult = poly.evaluateAt(field.exp(i + field.getGeneratorBase()));
+            syndromeCoefficients[syndromeCoefficients.length - 1 - i] = evalResult;
+            if (evalResult !== 0) {
+                noError = false;
+            }
+        }
+        if (noError) {
+            return;
+        }
+        const syndrome = new GenericGFPoly(field, syndromeCoefficients);
+        const sigmaOmega = this.runEuclideanAlgorithm(field.buildMonomial(twoS, 1), syndrome, twoS);
+        const sigma = sigmaOmega[0];
+        const omega = sigmaOmega[1];
+        const errorLocations = this.findErrorLocations(sigma);
+        const errorMagnitudes = this.findErrorMagnitudes(omega, errorLocations);
+        for (let i = 0; i < errorLocations.length; i++) {
+            const position = received.length - 1 - field.log(errorLocations[i]);
+            if (position < 0) {
+                throw new ReedSolomonException('Bad error location');
+            }
+            received[position] = GenericGF.addOrSubtract(received[position], errorMagnitudes[i]);
+        }
+    }
+    runEuclideanAlgorithm(a, b, R /*int*/) {
+        // Assume a's degree is >= b's
+        if (a.getDegree() < b.getDegree()) {
+            const temp = a;
+            a = b;
+            b = temp;
+        }
+        const field = this.field;
+        let rLast = a;
+        let r = b;
+        let tLast = field.getZero();
+        let t = field.getOne();
+        // Run Euclidean algorithm until r's degree is less than R/2
+        while (r.getDegree() >= (R / 2 | 0)) {
+            let rLastLast = rLast;
+            let tLastLast = tLast;
+            rLast = r;
+            tLast = t;
+            // Divide rLastLast by rLast, with quotient in q and remainder in r
+            if (rLast.isZero()) {
+                // Oops, Euclidean algorithm already terminated?
+                throw new ReedSolomonException('r_{i-1} was zero');
+            }
+            r = rLastLast;
+            let q = field.getZero();
+            const denominatorLeadingTerm = rLast.getCoefficient(rLast.getDegree());
+            const dltInverse = field.inverse(denominatorLeadingTerm);
+            while (r.getDegree() >= rLast.getDegree() && !r.isZero()) {
+                const degreeDiff = r.getDegree() - rLast.getDegree();
+                const scale = field.multiply(r.getCoefficient(r.getDegree()), dltInverse);
+                q = q.addOrSubtract(field.buildMonomial(degreeDiff, scale));
+                r = r.addOrSubtract(rLast.multiplyByMonomial(degreeDiff, scale));
+            }
+            t = q.multiply(tLast).addOrSubtract(tLastLast);
+            if (r.getDegree() >= rLast.getDegree()) {
+                throw new IllegalStateException('Division algorithm failed to reduce polynomial?');
+            }
+        }
+        const sigmaTildeAtZero = t.getCoefficient(0);
+        if (sigmaTildeAtZero === 0) {
+            throw new ReedSolomonException('sigmaTilde(0) was zero');
+        }
+        const inverse = field.inverse(sigmaTildeAtZero);
+        const sigma = t.multiplyScalar(inverse);
+        const omega = r.multiplyScalar(inverse);
+        return [sigma, omega];
+    }
+    findErrorLocations(errorLocator) {
+        // This is a direct application of Chien's search
+        const numErrors = errorLocator.getDegree();
+        if (numErrors === 1) { // shortcut
+            return Int32Array.from([errorLocator.getCoefficient(1)]);
+        }
+        const result = new Int32Array(numErrors);
+        let e = 0;
+        const field = this.field;
+        for (let i = 1; i < field.getSize() && e < numErrors; i++) {
+            if (errorLocator.evaluateAt(i) === 0) {
+                result[e] = field.inverse(i);
+                e++;
+            }
+        }
+        if (e !== numErrors) {
+            throw new ReedSolomonException('Error locator degree does not match number of roots');
+        }
+        return result;
+    }
+    findErrorMagnitudes(errorEvaluator, errorLocations) {
+        // This is directly applying Forney's Formula
+        const s = errorLocations.length;
+        const result = new Int32Array(s);
+        const field = this.field;
+        for (let i = 0; i < s; i++) {
+            const xiInverse = field.inverse(errorLocations[i]);
+            let denominator = 1;
+            for (let j = 0; j < s; j++) {
+                if (i !== j) {
+                    // denominator = field.multiply(denominator,
+                    //    GenericGF.addOrSubtract(1, field.multiply(errorLocations[j], xiInverse)))
+                    // Above should work but fails on some Apple and Linux JDKs due to a Hotspot bug.
+                    // Below is a funny-looking workaround from Steven Parkes
+                    const term = field.multiply(errorLocations[j], xiInverse);
+                    const termPlus1 = (term & 0x1) === 0 ? term | 1 : term & ~1;
+                    denominator = field.multiply(denominator, termPlus1);
+                }
+            }
+            result[i] = field.multiply(errorEvaluator.evaluateAt(xiInverse), field.inverse(denominator));
+            if (field.getGeneratorBase() !== 0) {
+                result[i] = field.multiply(result[i], xiInverse);
+            }
+        }
+        return result;
+    }
+}
+//# sourceMappingURL=ReedSolomonDecoder.js.map

package/template/node_modules/@zxing/library/es2015/core/common/reedsolomon/ReedSolomonDecoder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ReedSolomonDecoder.js","sourceRoot":"","sources":["../../../../../src/core/common/reedsolomon/ReedSolomonDecoder.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,mDAAmD;AAEnD,OAAO,SAAS,MAAM,aAAa,CAAC;AACpC,OAAO,aAAa,MAAM,iBAAiB,CAAC;AAE5C,OAAO,oBAAoB,MAAM,4BAA4B,CAAC;AAC9D,OAAO,qBAAqB,MAAM,6BAA6B,CAAC;AAEhE;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAM,CAAC,OAAO,OAAO,kBAAkB;IAEnC,YAA2B,KAAgB;QAAhB,UAAK,GAAL,KAAK,CAAW;IAAI,CAAC;IAEhD;;;;;;;;OAQG;IACI,MAAM,CAAC,QAAoB,EAAE,IAAY,CAAC,OAAO;QACpD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,MAAM,IAAI,GAAG,IAAI,aAAa,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;QAChD,MAAM,oBAAoB,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC;QAClD,IAAI,OAAO,GAAY,IAAI,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE;YAC3B,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,gBAAgB,EAAE,CAAC,CAAC,CAAC;YAC5E,oBAAoB,CAAC,oBAAoB,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC;YACvE,IAAI,UAAU,KAAK,CAAC,EAAE;gBAClB,OAAO,GAAG,KAAK,CAAC;aACnB;SACJ;QACD,IAAI,OAAO,EAAE;YACT,OAAO;SACV;QACD,MAAM,QAAQ,GAAG,IAAI,aAAa,CAAC,KAAK,EAAE,oBAAoB,CAAC,CAAC;QAChE,MAAM,UAAU,GAAG,IAAI,CAAC,qBAAqB,CAAC,KAAK,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;QAC5F,MAAM,KAAK,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,KAAK,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,cAAc,GAAG,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAC;QACtD,MAAM,eAAe,GAAG,IAAI,CAAC,mBAAmB,CAAC,KAAK,EAAE,cAAc,CAAC,CAAC;QACxE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC5C,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;YACpE,IAAI,QAAQ,GAAG,CAAC,EAAE;gBACd,MAAM,IAAI,oBAAoB,CAAC,oBAAoB,CAAC,CAAC;aACxD;YACD,QAAQ,CAAC,QAAQ,CAAC,GAAG,SAAS,CAAC,aAAa,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC;SACxF;IACL,CAAC;IAEO,qBAAqB,CAAC,CAAgB,EAAE,CAAgB,EAAE,CAAS,CAAC,OAAO;QAC/E,8BAA8B;QAC9B,IAAI,CAAC,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE;YAC/B,MAAM,IAAI,GAAG,CAAC,CAAC;YACf,CAAC,GAAG,CAAC,CAAC;YACN,CAAC,GAAG,IAAI,CAAC;SACZ;QAED,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QAEzB,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,KAAK,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;QAC5B,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QAEvB,4DAA4D;QAC5D,OAAO,CAAC,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE;YACjC,IAAI,SAAS,GAAG,KAAK,CAAC;YACtB,IAAI,SAAS,GAAG,KAAK,CAAC;YACtB,KAAK,GAAG,CAAC,CAAC;YACV,KAAK,GAAG,CAAC,CAAC;YAEV,mEAAmE;YACnE,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE;gBAChB,gDAAgD;gBAChD,MAAM,IAAI,oBAAoB,CAAC,kBAAkB,CAAC,CAAC;aACtD;YACD,CAAC,GAAG,SAAS,CAAC;YACd,IAAI,CAAC,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;YACxB,MAAM,sBAAsB,GAAG,KAAK,CAAC,cAAc,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,CAAC;YACvE,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,sBAAsB,CAAC,CAAC;YACzD,OAAO,CAAC,CAAC,SAAS,EAAE,IAAI,KAAK,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE;gBACtD,MAAM,UAAU,GAAG,CAAC,CAAC,SAAS,EAAE,GAAG,KAAK,CAAC,SAAS,EAAE,CAAC;gBACrD,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;gBAC1E,CAAC,GAAG,CAAC,CAAC,aAAa,CAAC,KAAK,CAAC,aAAa,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC,CAAC;gBAC5D,CAAC,GAAG,CAAC,CAAC,aAAa,CAAC,KAAK,CAAC,kBAAkB,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC,CAAC;aACpE;YAED,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;YAE/C,IAAI,CAAC,CAAC,SAAS,EAAE,IAAI,KAAK,CAAC,SAAS,EAAE,EAAE;gBACpC,MAAM,IAAI,qBAAqB,CAAC,iDAAiD,CAAC,CAAC;aACtF;SACJ;QAED,MAAM,gBAAgB,GAAG,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;QAC7C,IAAI,gBAAgB,KAAK,CAAC,EAAE;YACxB,MAAM,IAAI,oBAAoB,CAAC,wBAAwB,CAAC,CAAC;SAC5D;QAED,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAC;QAChD,MAAM,KAAK,GAAG,CAAC,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;QACxC,MAAM,KAAK,GAAG,CAAC,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;QACxC,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IAC1B,CAAC;IAEO,kBAAkB,CAAC,YAA2B;QAClD,iDAAiD;QACjD,MAAM,SAAS,GAAG,YAAY,CAAC,SAAS,EAAE,CAAC;QAC3C,IAAI,SAAS,KAAK,CAAC,EAAE,EAAE,WAAW;YAC9B,OAAO,UAAU,CAAC,IAAI,CAAC,CAAC,YAAY,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAC5D;QACD,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,SAAS,CAAC,CAAC;QACzC,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE;YACvD,IAAI,YAAY,CAAC,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE;gBAClC,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBAC7B,CAAC,EAAE,CAAC;aACP;SACJ;QACD,IAAI,CAAC,KAAK,SAAS,EAAE;YACjB,MAAM,IAAI,oBAAoB,CAAC,qDAAqD,CAAC,CAAC;SACzF;QACD,OAAO,MAAM,CAAC;IAClB,CAAC;IAEO,mBAAmB,CAAC,cAA6B,EAAE,cAA0B;QACjF,6CAA6C;QAC7C,MAAM,CAAC,GAAG,cAAc,CAAC,MAAM,CAAC;QAChC,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;QACjC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YACxB,MAAM,SAAS,GAAG,KAAK,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;YACnD,IAAI,WAAW,GAAG,CAAC,CAAC;YACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBACxB,IAAI,CAAC,KAAK,CAAC,EAAE;oBACT,4CAA4C;oBAC5C,+EAA+E;oBAC/E,iFAAiF;oBACjF,yDAAyD;oBACzD,MAAM,IAAI,GAAG,KAAK,CAAC,QAAQ,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;oBAC1D,MAAM,SAAS,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;oBAC5D,WAAW,GAAG,KAAK,CAAC,QAAQ,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;iBACxD;aACJ;YACD,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,cAAc,CAAC,UAAU,CAAC,SAAS,CAAC,EAC3D,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC;YAChC,IAAI,KAAK,CAAC,gBAAgB,EAAE,KAAK,CAAC,EAAE;gBAChC,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;aACpD;SACJ;QACD,OAAO,MAAM,CAAC;IAClB,CAAC;CAEJ"}

package/template/node_modules/@zxing/library/es2015/core/common/reedsolomon/ReedSolomonEncoder.d.ts

@@ -0,0 +1,41 @@
+import GenericGF from './GenericGF';
+/**
+ * <p>Implements Reed-Solomon encoding, as the name implies.</p>
+ *
+ * @author Sean Owen
+ * @author William Rucklidge
+ */
+export default class ReedSolomonEncoder {
+    private field;
+    private cachedGenerators;
+    /**
+     * A reed solomon error-correcting encoding constructor is created by
+     * passing as Galois Field with of size equal to the number of code
+     * words (symbols) in the alphabet (the number of values in each
+     * element of arrays that are encoded/decoded).
+     * @param field A galois field with a number of elements equal to the size
+     * of the alphabet of symbols to encode.
+     */
+    constructor(field: GenericGF);
+    private buildGenerator;
+    /**
+     * <p>Encode a sequence of code words (symbols) using Reed-Solomon to allow decoders
+     * to detect and correct errors that may have been introduced when the resulting
+     * data is stored or transmitted.</p>
+     *
+     * @param toEncode array used for both and output. Caller initializes the array with
+     * the code words (symbols) to be encoded followed by empty elements allocated to make
+     * space for error-correction code words in the encoded output. The array contains
+     * the encdoded output when encode returns. Code words are encoded as numbers from
+     * 0 to n-1, where n is the number of possible code words (symbols), as determined
+     * by the size of the Galois Field passed in the constructor of this object.
+     * @param ecBytes the number of elements reserved in the array (first parameter)
+     * to store error-correction code words. Thus, the number of code words (symbols)
+     * to encode in the first parameter is thus toEncode.length - ecBytes.
+     * Note, the use of "bytes" in the name of this parameter is misleading, as there may
+     * be more or fewer than 256 symbols being encoded, as determined by the number of
+     * elements in the Galois Field passed as a constructor to this object.
+     * @throws IllegalArgumentException thrown in response to validation errros.
+     */
+    encode(toEncode: Int32Array, ecBytes: number): void;
+}

package/template/node_modules/@zxing/library/es2015/core/common/reedsolomon/ReedSolomonEncoder.js

@@ -0,0 +1,93 @@
+/*
+ * Copyright 2008 ZXing authors
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *      http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+import GenericGFPoly from './GenericGFPoly';
+import System from '../../util/System';
+import IllegalArgumentException from '../../IllegalArgumentException';
+/**
+ * <p>Implements Reed-Solomon encoding, as the name implies.</p>
+ *
+ * @author Sean Owen
+ * @author William Rucklidge
+ */
+export default class ReedSolomonEncoder {
+    /**
+     * A reed solomon error-correcting encoding constructor is created by
+     * passing as Galois Field with of size equal to the number of code
+     * words (symbols) in the alphabet (the number of values in each
+     * element of arrays that are encoded/decoded).
+     * @param field A galois field with a number of elements equal to the size
+     * of the alphabet of symbols to encode.
+     */
+    constructor(field) {
+        this.field = field;
+        this.cachedGenerators = [];
+        this.cachedGenerators.push(new GenericGFPoly(field, Int32Array.from([1])));
+    }
+    buildGenerator(degree /*int*/) {
+        const cachedGenerators = this.cachedGenerators;
+        if (degree >= cachedGenerators.length) {
+            let lastGenerator = cachedGenerators[cachedGenerators.length - 1];
+            const field = this.field;
+            for (let d = cachedGenerators.length; d <= degree; d++) {
+                const nextGenerator = lastGenerator.multiply(new GenericGFPoly(field, Int32Array.from([1, field.exp(d - 1 + field.getGeneratorBase())])));
+                cachedGenerators.push(nextGenerator);
+                lastGenerator = nextGenerator;
+            }
+        }
+        return cachedGenerators[degree];
+    }
+    /**
+     * <p>Encode a sequence of code words (symbols) using Reed-Solomon to allow decoders
+     * to detect and correct errors that may have been introduced when the resulting
+     * data is stored or transmitted.</p>
+     *
+     * @param toEncode array used for both and output. Caller initializes the array with
+     * the code words (symbols) to be encoded followed by empty elements allocated to make
+     * space for error-correction code words in the encoded output. The array contains
+     * the encdoded output when encode returns. Code words are encoded as numbers from
+     * 0 to n-1, where n is the number of possible code words (symbols), as determined
+     * by the size of the Galois Field passed in the constructor of this object.
+     * @param ecBytes the number of elements reserved in the array (first parameter)
+     * to store error-correction code words. Thus, the number of code words (symbols)
+     * to encode in the first parameter is thus toEncode.length - ecBytes.
+     * Note, the use of "bytes" in the name of this parameter is misleading, as there may
+     * be more or fewer than 256 symbols being encoded, as determined by the number of
+     * elements in the Galois Field passed as a constructor to this object.
+     * @throws IllegalArgumentException thrown in response to validation errros.
+     */
+    encode(toEncode, ecBytes /*int*/) {
+        if (ecBytes === 0) {
+            throw new IllegalArgumentException('No error correction bytes');
+        }
+        const dataBytes = toEncode.length - ecBytes;
+        if (dataBytes <= 0) {
+            throw new IllegalArgumentException('No data bytes provided');
+        }
+        const generator = this.buildGenerator(ecBytes);
+        const infoCoefficients = new Int32Array(dataBytes);
+        System.arraycopy(toEncode, 0, infoCoefficients, 0, dataBytes);
+        let info = new GenericGFPoly(this.field, infoCoefficients);
+        info = info.multiplyByMonomial(ecBytes, 1);
+        const remainder = info.divide(generator)[1];
+        const coefficients = remainder.getCoefficients();
+        const numZeroCoefficients = ecBytes - coefficients.length;
+        for (let i = 0; i < numZeroCoefficients; i++) {
+            toEncode[dataBytes + i] = 0;
+        }
+        System.arraycopy(coefficients, 0, toEncode, dataBytes + numZeroCoefficients, coefficients.length);
+    }
+}
+//# sourceMappingURL=ReedSolomonEncoder.js.map

package/template/node_modules/@zxing/library/es2015/core/common/reedsolomon/ReedSolomonEncoder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ReedSolomonEncoder.js","sourceRoot":"","sources":["../../../../../src/core/common/reedsolomon/ReedSolomonEncoder.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAQH,OAAO,aAAa,MAAM,iBAAiB,CAAC;AAE5C,OAAO,MAAM,MAAM,mBAAmB,CAAC;AACvC,OAAO,wBAAwB,MAAM,gCAAgC,CAAC;AAEtE;;;;;GAKG;AACH,MAAM,CAAC,OAAO,OAAO,kBAAkB;IAKnC;;;;;;;OAOG;IACH,YAAmB,KAAgB;QAC/B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,gBAAgB,GAAG,EAAE,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,aAAa,CAAC,KAAK,EAAE,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/E,CAAC;IAEO,cAAc,CAAC,MAAc,CAAC,OAAO;QACzC,MAAM,gBAAgB,GAAG,IAAI,CAAC,gBAAgB,CAAC;QAC/C,IAAI,MAAM,IAAI,gBAAgB,CAAC,MAAM,EAAE;YACnC,IAAI,aAAa,GAAG,gBAAgB,CAAC,gBAAgB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAClE,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;YACzB,KAAK,IAAI,CAAC,GAAG,gBAAgB,CAAC,MAAM,EAAE,CAAC,IAAI,MAAM,EAAE,CAAC,EAAE,EAAE;gBACpD,MAAM,aAAa,GAAG,aAAa,CAAC,QAAQ,CACxC,IAAI,aAAa,CAAC,KAAK,EAAE,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,gBAAgB,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACjG,gBAAgB,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;gBACrC,aAAa,GAAG,aAAa,CAAC;aACjC;SACJ;QACD,OAAO,gBAAgB,CAAC,MAAM,CAAC,CAAC;IACpC,CAAC;IAED;;;;;;;;;;;;;;;;;;OAkBG;IACI,MAAM,CAAC,QAAoB,EAAE,OAAe,CAAC,OAAO;QACvD,IAAI,OAAO,KAAK,CAAC,EAAE;YACf,MAAM,IAAI,wBAAwB,CAAC,2BAA2B,CAAC,CAAC;SACnE;QACD,MAAM,SAAS,GAAG,QAAQ,CAAC,MAAM,GAAG,OAAO,CAAC;QAC5C,IAAI,SAAS,IAAI,CAAC,EAAE;YAChB,MAAM,IAAI,wBAAwB,CAAC,wBAAwB,CAAC,CAAC;SAChE;QACD,MAAM,SAAS,GAAG,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;QAC/C,MAAM,gBAAgB,GAAe,IAAI,UAAU,CAAC,SAAS,CAAC,CAAC;QAC/D,MAAM,CAAC,SAAS,CAAC,QAAQ,EAAE,CAAC,EAAE,gBAAgB,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;QAC9D,IAAI,IAAI,GAAG,IAAI,aAAa,CAAC,IAAI,CAAC,KAAK,EAAE,gBAAgB,CAAC,CAAC;QAC3D,IAAI,GAAG,IAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QAC3C,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5C,MAAM,YAAY,GAAG,SAAS,CAAC,eAAe,EAAE,CAAC;QACjD,MAAM,mBAAmB,GAAG,OAAO,GAAG,YAAY,CAAC,MAAM,CAAC;QAC1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,mBAAmB,EAAE,CAAC,EAAE,EAAE;YAC1C,QAAQ,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;SAC/B;QACD,MAAM,CAAC,SAAS,CAAC,YAAY,EAAE,CAAC,EAAE,QAAQ,EAAE,SAAS,GAAG,mBAAmB,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC;IACtG,CAAC;CAEJ"}