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

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

@@ -1,107 +0,0 @@
-/**
- * <p>A simple, fast array of bits, represented compactly by an array of ints internally.</p>
- *
- * @author Sean Owen
- */
-export default class BitArray {
-    private size;
-    private bits;
-    constructor(size?: number, bits?: Int32Array);
-    getSize(): number;
-    getSizeInBytes(): number;
-    private ensureCapacity;
-    /**
-     * @param i bit to get
-     * @return true iff bit i is set
-     */
-    get(i: number): boolean;
-    /**
-     * Sets bit i.
-     *
-     * @param i bit to set
-     */
-    set(i: number): void;
-    /**
-     * Flips bit i.
-     *
-     * @param i bit to set
-     */
-    flip(i: number): void;
-    /**
-     * @param from first bit to check
-     * @return index of first bit that is set, starting from the given index, or size if none are set
-     *  at or beyond this given index
-     * @see #getNextUnset(int)
-     */
-    getNextSet(from: number): number;
-    /**
-     * @param from index to start looking for unset bit
-     * @return index of next unset bit, or {@code size} if none are unset until the end
-     * @see #getNextSet(int)
-     */
-    getNextUnset(from: number): number;
-    /**
-     * Sets a block of 32 bits, starting at bit i.
-     *
-     * @param i first bit to set
-     * @param newBits the new value of the next 32 bits. Note again that the least-significant bit
-     * corresponds to bit i, the next-least-significant to i+1, and so on.
-     */
-    setBulk(i: number, newBits: number): void;
-    /**
-     * Sets a range of bits.
-     *
-     * @param start start of range, inclusive.
-     * @param end end of range, exclusive
-     */
-    setRange(start: number, end: number): void;
-    /**
-     * Clears all bits (sets to false).
-     */
-    clear(): void;
-    /**
-     * Efficient method to check if a range of bits is set, or not set.
-     *
-     * @param start start of range, inclusive.
-     * @param end end of range, exclusive
-     * @param value if true, checks that bits in range are set, otherwise checks that they are not set
-     * @return true iff all bits are set or not set in range, according to value argument
-     * @throws IllegalArgumentException if end is less than start or the range is not contained in the array
-     */
-    isRange(start: number, end: number, value: boolean): boolean;
-    appendBit(bit: boolean): void;
-    /**
-     * Appends the least-significant bits, from value, in order from most-significant to
-     * least-significant. For example, appending 6 bits from 0x000001E will append the bits
-     * 0, 1, 1, 1, 1, 0 in that order.
-     *
-     * @param value {@code int} containing bits to append
-     * @param numBits bits from value to append
-     */
-    appendBits(value: number, numBits: number): void;
-    appendBitArray(other: BitArray): void;
-    xor(other: BitArray): void;
-    /**
-     *
-     * @param bitOffset first bit to start writing
-     * @param array array to write into. Bytes are written most-significant byte first. This is the opposite
-     *  of the internal representation, which is exposed by {@link #getBitArray()}
-     * @param offset position in array to start writing
-     * @param numBytes how many bytes to write
-     */
-    toBytes(bitOffset: number, array: Uint8Array, offset: number, numBytes: number): void;
-    /**
-     * @return underlying array of ints. The first element holds the first 32 bits, and the least
-     *         significant bit is bit 0.
-     */
-    getBitArray(): Int32Array;
-    /**
-     * Reverses all bits in the array.
-     */
-    reverse(): void;
-    private static makeArray;
-    equals(o: any): boolean;
-    hashCode(): number;
-    toString(): string;
-    clone(): BitArray;
-}

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

@@ -1,356 +0,0 @@
-/*
- * 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 {*/
-/*import java.util.Arrays;*/
-import IllegalArgumentException from '../IllegalArgumentException';
-import Arrays from '../util/Arrays';
-import Integer from '../util/Integer';
-import System from '../util/System';
-/**
- * <p>A simple, fast array of bits, represented compactly by an array of ints internally.</p>
- *
- * @author Sean Owen
- */
-export default class BitArray /*implements Cloneable*/ {
-    // public constructor() {
-    //   this.size = 0
-    //   this.bits = new Int32Array(1)
-    // }
-    // public constructor(size?: number /*int*/) {
-    //   if (undefined === size) {
-    //     this.size = 0
-    //   } else {
-    //     this.size = size
-    //   }
-    //   this.bits = this.makeArray(size)
-    // }
-    // For testing only
-    constructor(size /*int*/, bits) {
-        if (undefined === size) {
-            this.size = 0;
-            this.bits = new Int32Array(1);
-        }
-        else {
-            this.size = size;
-            if (undefined === bits || null === bits) {
-                this.bits = BitArray.makeArray(size);
-            }
-            else {
-                this.bits = bits;
-            }
-        }
-    }
-    getSize() {
-        return this.size;
-    }
-    getSizeInBytes() {
-        return Math.floor((this.size + 7) / 8);
-    }
-    ensureCapacity(size /*int*/) {
-        if (size > this.bits.length * 32) {
-            const newBits = BitArray.makeArray(size);
-            System.arraycopy(this.bits, 0, newBits, 0, this.bits.length);
-            this.bits = newBits;
-        }
-    }
-    /**
-     * @param i bit to get
-     * @return true iff bit i is set
-     */
-    get(i /*int*/) {
-        return (this.bits[Math.floor(i / 32)] & (1 << (i & 0x1F))) !== 0;
-    }
-    /**
-     * Sets bit i.
-     *
-     * @param i bit to set
-     */
-    set(i /*int*/) {
-        this.bits[Math.floor(i / 32)] |= 1 << (i & 0x1F);
-    }
-    /**
-     * Flips bit i.
-     *
-     * @param i bit to set
-     */
-    flip(i /*int*/) {
-        this.bits[Math.floor(i / 32)] ^= 1 << (i & 0x1F);
-    }
-    /**
-     * @param from first bit to check
-     * @return index of first bit that is set, starting from the given index, or size if none are set
-     *  at or beyond this given index
-     * @see #getNextUnset(int)
-     */
-    getNextSet(from /*int*/) {
-        const size = this.size;
-        if (from >= size) {
-            return size;
-        }
-        const bits = this.bits;
-        let bitsOffset = Math.floor(from / 32);
-        let currentBits = bits[bitsOffset];
-        // mask off lesser bits first
-        currentBits &= ~((1 << (from & 0x1F)) - 1);
-        const length = bits.length;
-        while (currentBits === 0) {
-            if (++bitsOffset === length) {
-                return size;
-            }
-            currentBits = bits[bitsOffset];
-        }
-        const result = (bitsOffset * 32) + Integer.numberOfTrailingZeros(currentBits);
-        return result > size ? size : result;
-    }
-    /**
-     * @param from index to start looking for unset bit
-     * @return index of next unset bit, or {@code size} if none are unset until the end
-     * @see #getNextSet(int)
-     */
-    getNextUnset(from /*int*/) {
-        const size = this.size;
-        if (from >= size) {
-            return size;
-        }
-        const bits = this.bits;
-        let bitsOffset = Math.floor(from / 32);
-        let currentBits = ~bits[bitsOffset];
-        // mask off lesser bits first
-        currentBits &= ~((1 << (from & 0x1F)) - 1);
-        const length = bits.length;
-        while (currentBits === 0) {
-            if (++bitsOffset === length) {
-                return size;
-            }
-            currentBits = ~bits[bitsOffset];
-        }
-        const result = (bitsOffset * 32) + Integer.numberOfTrailingZeros(currentBits);
-        return result > size ? size : result;
-    }
-    /**
-     * Sets a block of 32 bits, starting at bit i.
-     *
-     * @param i first bit to set
-     * @param newBits the new value of the next 32 bits. Note again that the least-significant bit
-     * corresponds to bit i, the next-least-significant to i+1, and so on.
-     */
-    setBulk(i /*int*/, newBits /*int*/) {
-        this.bits[Math.floor(i / 32)] = newBits;
-    }
-    /**
-     * Sets a range of bits.
-     *
-     * @param start start of range, inclusive.
-     * @param end end of range, exclusive
-     */
-    setRange(start /*int*/, end /*int*/) {
-        if (end < start || start < 0 || end > this.size) {
-            throw new IllegalArgumentException();
-        }
-        if (end === start) {
-            return;
-        }
-        end--; // will be easier to treat this as the last actually set bit -- inclusive
-        const firstInt = Math.floor(start / 32);
-        const lastInt = Math.floor(end / 32);
-        const bits = this.bits;
-        for (let i = firstInt; i <= lastInt; i++) {
-            const firstBit = i > firstInt ? 0 : start & 0x1F;
-            const lastBit = i < lastInt ? 31 : end & 0x1F;
-            // Ones from firstBit to lastBit, inclusive
-            const mask = (2 << lastBit) - (1 << firstBit);
-            bits[i] |= mask;
-        }
-    }
-    /**
-     * Clears all bits (sets to false).
-     */
-    clear() {
-        const max = this.bits.length;
-        const bits = this.bits;
-        for (let i = 0; i < max; i++) {
-            bits[i] = 0;
-        }
-    }
-    /**
-     * Efficient method to check if a range of bits is set, or not set.
-     *
-     * @param start start of range, inclusive.
-     * @param end end of range, exclusive
-     * @param value if true, checks that bits in range are set, otherwise checks that they are not set
-     * @return true iff all bits are set or not set in range, according to value argument
-     * @throws IllegalArgumentException if end is less than start or the range is not contained in the array
-     */
-    isRange(start /*int*/, end /*int*/, value) {
-        if (end < start || start < 0 || end > this.size) {
-            throw new IllegalArgumentException();
-        }
-        if (end === start) {
-            return true; // empty range matches
-        }
-        end--; // will be easier to treat this as the last actually set bit -- inclusive
-        const firstInt = Math.floor(start / 32);
-        const lastInt = Math.floor(end / 32);
-        const bits = this.bits;
-        for (let i = firstInt; i <= lastInt; i++) {
-            const firstBit = i > firstInt ? 0 : start & 0x1F;
-            const lastBit = i < lastInt ? 31 : end & 0x1F;
-            // Ones from firstBit to lastBit, inclusive
-            const mask = (2 << lastBit) - (1 << firstBit) & 0xFFFFFFFF;
-            // TYPESCRIPTPORT: & 0xFFFFFFFF added to discard anything after 32 bits, as ES has 53 bits
-            // Return false if we're looking for 1s and the masked bits[i] isn't all 1s (is: that,
-            // equals the mask, or we're looking for 0s and the masked portion is not all 0s
-            if ((bits[i] & mask) !== (value ? mask : 0)) {
-                return false;
-            }
-        }
-        return true;
-    }
-    appendBit(bit) {
-        this.ensureCapacity(this.size + 1);
-        if (bit) {
-            this.bits[Math.floor(this.size / 32)] |= 1 << (this.size & 0x1F);
-        }
-        this.size++;
-    }
-    /**
-     * Appends the least-significant bits, from value, in order from most-significant to
-     * least-significant. For example, appending 6 bits from 0x000001E will append the bits
-     * 0, 1, 1, 1, 1, 0 in that order.
-     *
-     * @param value {@code int} containing bits to append
-     * @param numBits bits from value to append
-     */
-    appendBits(value /*int*/, numBits /*int*/) {
-        if (numBits < 0 || numBits > 32) {
-            throw new IllegalArgumentException('Num bits must be between 0 and 32');
-        }
-        this.ensureCapacity(this.size + numBits);
-        // const appendBit = this.appendBit;
-        for (let numBitsLeft = numBits; numBitsLeft > 0; numBitsLeft--) {
-            this.appendBit(((value >> (numBitsLeft - 1)) & 0x01) === 1);
-        }
-    }
-    appendBitArray(other) {
-        const otherSize = other.size;
-        this.ensureCapacity(this.size + otherSize);
-        // const appendBit = this.appendBit;
-        for (let i = 0; i < otherSize; i++) {
-            this.appendBit(other.get(i));
-        }
-    }
-    xor(other) {
-        if (this.size !== other.size) {
-            throw new IllegalArgumentException('Sizes don\'t match');
-        }
-        const bits = this.bits;
-        for (let i = 0, length = bits.length; i < length; i++) {
-            // The last int could be incomplete (i.e. not have 32 bits in
-            // it) but there is no problem since 0 XOR 0 == 0.
-            bits[i] ^= other.bits[i];
-        }
-    }
-    /**
-     *
-     * @param bitOffset first bit to start writing
-     * @param array array to write into. Bytes are written most-significant byte first. This is the opposite
-     *  of the internal representation, which is exposed by {@link #getBitArray()}
-     * @param offset position in array to start writing
-     * @param numBytes how many bytes to write
-     */
-    toBytes(bitOffset /*int*/, array, offset /*int*/, numBytes /*int*/) {
-        for (let i = 0; i < numBytes; i++) {
-            let theByte = 0;
-            for (let j = 0; j < 8; j++) {
-                if (this.get(bitOffset)) {
-                    theByte |= 1 << (7 - j);
-                }
-                bitOffset++;
-            }
-            array[offset + i] = /*(byte)*/ theByte;
-        }
-    }
-    /**
-     * @return underlying array of ints. The first element holds the first 32 bits, and the least
-     *         significant bit is bit 0.
-     */
-    getBitArray() {
-        return this.bits;
-    }
-    /**
-     * Reverses all bits in the array.
-     */
-    reverse() {
-        const newBits = new Int32Array(this.bits.length);
-        // reverse all int's first
-        const len = Math.floor((this.size - 1) / 32);
-        const oldBitsLen = len + 1;
-        const bits = this.bits;
-        for (let i = 0; i < oldBitsLen; i++) {
-            let x = bits[i];
-            x = ((x >> 1) & 0x55555555) | ((x & 0x55555555) << 1);
-            x = ((x >> 2) & 0x33333333) | ((x & 0x33333333) << 2);
-            x = ((x >> 4) & 0x0f0f0f0f) | ((x & 0x0f0f0f0f) << 4);
-            x = ((x >> 8) & 0x00ff00ff) | ((x & 0x00ff00ff) << 8);
-            x = ((x >> 16) & 0x0000ffff) | ((x & 0x0000ffff) << 16);
-            newBits[len - i] = /*(int)*/ x;
-        }
-        // now correct the int's if the bit size isn't a multiple of 32
-        if (this.size !== oldBitsLen * 32) {
-            const leftOffset = oldBitsLen * 32 - this.size;
-            let currentInt = newBits[0] >>> leftOffset;
-            for (let i = 1; i < oldBitsLen; i++) {
-                const nextInt = newBits[i];
-                currentInt |= nextInt << (32 - leftOffset);
-                newBits[i - 1] = currentInt;
-                currentInt = nextInt >>> leftOffset;
-            }
-            newBits[oldBitsLen - 1] = currentInt;
-        }
-        this.bits = newBits;
-    }
-    static makeArray(size /*int*/) {
-        return new Int32Array(Math.floor((size + 31) / 32));
-    }
-    /*@Override*/
-    equals(o) {
-        if (!(o instanceof BitArray)) {
-            return false;
-        }
-        const other = o;
-        return this.size === other.size && Arrays.equals(this.bits, other.bits);
-    }
-    /*@Override*/
-    hashCode() {
-        return 31 * this.size + Arrays.hashCode(this.bits);
-    }
-    /*@Override*/
-    toString() {
-        let result = '';
-        for (let i = 0, size = this.size; i < size; i++) {
-            if ((i & 0x07) === 0) {
-                result += ' ';
-            }
-            result += this.get(i) ? 'X' : '.';
-        }
-        return result;
-    }
-    /*@Override*/
-    clone() {
-        return new BitArray(this.size, this.bits.slice());
-    }
-}
-//# sourceMappingURL=BitArray.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"BitArray.js","sourceRoot":"","sources":["../../../../src/core/common/BitArray.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,uCAAuC;AAEvC,4BAA4B;AAE5B,OAAO,wBAAwB,MAAM,6BAA6B,CAAC;AACnE,OAAO,MAAM,MAAM,gBAAgB,CAAC;AACpC,OAAO,OAAO,MAAM,iBAAiB,CAAC;AACtC,OAAO,MAAM,MAAM,gBAAgB,CAAC;AAGpC;;;;GAIG;AACH,MAAM,CAAC,OAAO,OAAO,QAAQ,CAAC,wBAAwB;IAKpD,yBAAyB;IACzB,kBAAkB;IAClB,kCAAkC;IAClC,IAAI;IAEJ,8CAA8C;IAC9C,8BAA8B;IAC9B,oBAAoB;IACpB,aAAa;IACb,uBAAuB;IACvB,MAAM;IACN,qCAAqC;IACrC,IAAI;IAEJ,mBAAmB;IACnB,YAAmB,IAAa,CAAC,OAAO,EAAE,IAAiB;QACzD,IAAI,SAAS,KAAK,IAAI,EAAE;YACtB,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;YACd,IAAI,CAAC,IAAI,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;SAC/B;aAAM;YACL,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;YACjB,IAAI,SAAS,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,EAAE;gBACvC,IAAI,CAAC,IAAI,GAAG,QAAQ,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;aACtC;iBAAM;gBACL,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;aAClB;SACF;IACH,CAAC;IAEM,OAAO;QACZ,OAAO,IAAI,CAAC,IAAI,CAAC;IACnB,CAAC;IAEM,cAAc;QACnB,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACzC,CAAC;IAEO,cAAc,CAAC,IAAY,CAAC,OAAO;QACzC,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,EAAE,EAAE;YAChC,MAAM,OAAO,GAAG,QAAQ,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;YACzC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC7D,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;SACrB;IACH,CAAC;IAED;;;OAGG;IACI,GAAG,CAAC,CAAS,CAAC,OAAO;QAC1B,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IACnE,CAAC;IAED;;;;OAIG;IACI,GAAG,CAAC,CAAS,CAAC,OAAO;QAC1B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;IACnD,CAAC;IAED;;;;OAIG;IACI,IAAI,CAAC,CAAS,CAAC,OAAO;QAC3B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;IACnD,CAAC;IAED;;;;;OAKG;IACI,UAAU,CAAC,IAAY,CAAC,OAAO;QACpC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACvB,IAAI,IAAI,IAAI,IAAI,EAAE;YAChB,OAAO,IAAI,CAAC;SACb;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACvB,IAAI,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC;QACvC,IAAI,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC;QACnC,6BAA6B;QAC7B,WAAW,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC3C,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC3B,OAAO,WAAW,KAAK,CAAC,EAAE;YACxB,IAAI,EAAE,UAAU,KAAK,MAAM,EAAE;gBAC3B,OAAO,IAAI,CAAC;aACb;YACD,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC;SAChC;QACD,MAAM,MAAM,GAAG,CAAC,UAAU,GAAG,EAAE,CAAC,GAAG,OAAO,CAAC,qBAAqB,CAAC,WAAW,CAAC,CAAC;QAC9E,OAAO,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC;IACvC,CAAC;IAED;;;;OAIG;IACI,YAAY,CAAC,IAAY,CAAC,OAAO;QACtC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACvB,IAAI,IAAI,IAAI,IAAI,EAAE;YAChB,OAAO,IAAI,CAAC;SACb;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACvB,IAAI,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC;QACvC,IAAI,WAAW,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACpC,6BAA6B;QAC7B,WAAW,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC3C,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC3B,OAAO,WAAW,KAAK,CAAC,EAAE;YACxB,IAAI,EAAE,UAAU,KAAK,MAAM,EAAE;gBAC3B,OAAO,IAAI,CAAC;aACb;YACD,WAAW,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;SACjC;QACD,MAAM,MAAM,GAAG,CAAC,UAAU,GAAG,EAAE,CAAC,GAAG,OAAO,CAAC,qBAAqB,CAAC,WAAW,CAAC,CAAC;QAC9E,OAAO,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC;IACvC,CAAC;IAED;;;;;;OAMG;IACI,OAAO,CAAC,CAAS,CAAC,OAAO,EAAE,OAAe,CAAC,OAAO;QACvD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC;IAC1C,CAAC;IAED;;;;;OAKG;IACI,QAAQ,CAAC,KAAa,CAAC,OAAO,EAAE,GAAW,CAAC,OAAO;QACxD,IAAI,GAAG,GAAG,KAAK,IAAI,KAAK,GAAG,CAAC,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,EAAE;YAC/C,MAAM,IAAI,wBAAwB,EAAE,CAAC;SACtC;QACD,IAAI,GAAG,KAAK,KAAK,EAAE;YACjB,OAAO;SACR;QACD,GAAG,EAAE,CAAC,CAAC,yEAAyE;QAChF,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,EAAE,CAAC,CAAC;QACxC,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC;QACrC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACvB,KAAK,IAAI,CAAC,GAAG,QAAQ,EAAE,CAAC,IAAI,OAAO,EAAE,CAAC,EAAE,EAAE;YACxC,MAAM,QAAQ,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC;YACjD,MAAM,OAAO,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC;YAC9C,2CAA2C;YAC3C,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC;YAC9C,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;SACjB;IACH,CAAC;IAED;;OAEG;IACI,KAAK;QACV,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;QAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;YAC5B,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;SACb;IACH,CAAC;IAED;;;;;;;;OAQG;IACI,OAAO,CAAC,KAAa,CAAC,OAAO,EAAE,GAAW,CAAC,OAAO,EAAE,KAAc;QACvE,IAAI,GAAG,GAAG,KAAK,IAAI,KAAK,GAAG,CAAC,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,EAAE;YAC/C,MAAM,IAAI,wBAAwB,EAAE,CAAC;SACtC;QACD,IAAI,GAAG,KAAK,KAAK,EAAE;YACjB,OAAO,IAAI,CAAC,CAAC,sBAAsB;SACpC;QACD,GAAG,EAAE,CAAC,CAAC,yEAAyE;QAChF,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,EAAE,CAAC,CAAC;QACxC,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC;QACrC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACvB,KAAK,IAAI,CAAC,GAAG,QAAQ,EAAE,CAAC,IAAI,OAAO,EAAE,CAAC,EAAE,EAAE;YACxC,MAAM,QAAQ,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC;YACjD,MAAM,OAAO,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC;YAC9C,2CAA2C;YAC3C,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,QAAQ,CAAC,GAAG,UAAU,CAAC;YAC3D,0FAA0F;YAC1F,sFAAsF;YACtF,gFAAgF;YAChF,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;gBAC3C,OAAO,KAAK,CAAC;aACd;SACF;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAEM,SAAS,CAAC,GAAY;QAC3B,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;QACnC,IAAI,GAAG,EAAE;YACP,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC;SAClE;QACD,IAAI,CAAC,IAAI,EAAE,CAAC;IACd,CAAC;IAED;;;;;;;OAOG;IACI,UAAU,CAAC,KAAa,CAAC,OAAO,EAAE,OAAe,CAAC,OAAO;QAC9D,IAAI,OAAO,GAAG,CAAC,IAAI,OAAO,GAAG,EAAE,EAAE;YAC/B,MAAM,IAAI,wBAAwB,CAAC,mCAAmC,CAAC,CAAC;SACzE;QACD,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC,CAAC;QACzC,oCAAoC;QACpC,KAAK,IAAI,WAAW,GAAG,OAAO,EAAE,WAAW,GAAG,CAAC,EAAE,WAAW,EAAE,EAAE;YAC9D,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;SAC7D;IACH,CAAC;IAEM,cAAc,CAAC,KAAe;QACnC,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC;QAC7B,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC,CAAC;QAC3C,oCAAoC;QACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE;YAClC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;SAC9B;IACH,CAAC;IAEM,GAAG,CAAC,KAAe;QACxB,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI,EAAE;YAC5B,MAAM,IAAI,wBAAwB,CAAC,oBAAoB,CAAC,CAAC;SAC1D;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;YACrD,6DAA6D;YAC7D,kDAAkD;YAClD,IAAI,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;SAC1B;IACH,CAAC;IAED;;;;;;;OAOG;IACI,OAAO,CAAC,SAAiB,CAAC,OAAO,EAAE,KAAiB,EAAE,MAAc,CAAC,OAAO,EAAE,QAAgB,CAAC,OAAO;QAC3G,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE;YACjC,IAAI,OAAO,GAAG,CAAC,CAAC;YAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC1B,IAAI,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE;oBACvB,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;iBACzB;gBACD,SAAS,EAAE,CAAC;aACb;YACD,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,OAAO,CAAC;SACxC;IACH,CAAC;IAED;;;OAGG;IACI,WAAW;QAChB,OAAO,IAAI,CAAC,IAAI,CAAC;IACnB,CAAC;IAED;;OAEG;IACI,OAAO;QACZ,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACjD,0BAA0B;QAC1B,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QAC7C,MAAM,UAAU,GAAG,GAAG,GAAG,CAAC,CAAC;QAC3B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE;YACnC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YAChB,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;YACtD,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;YACtD,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;YACtD,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;YACtD,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC;YACxD,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC;SAChC;QACD,+DAA+D;QAC/D,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,GAAG,EAAE,EAAE;YACjC,MAAM,UAAU,GAAG,UAAU,GAAG,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC;YAC/C,IAAI,UAAU,GAAG,OAAO,CAAC,CAAC,CAAC,KAAK,UAAU,CAAC;YAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE;gBACnC,MAAM,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;gBAC3B,UAAU,IAAI,OAAO,IAAI,CAAC,EAAE,GAAG,UAAU,CAAC,CAAC;gBAC3C,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC;gBAC5B,UAAU,GAAG,OAAO,KAAK,UAAU,CAAC;aACrC;YACD,OAAO,CAAC,UAAU,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC;SACtC;QACD,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;IACtB,CAAC;IAEO,MAAM,CAAC,SAAS,CAAC,IAAY,CAAC,OAAO;QAC3C,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACtD,CAAC;IAED,aAAa;IACN,MAAM,CAAC,CAAM;QAClB,IAAI,CAAC,CAAC,CAAC,YAAY,QAAQ,CAAC,EAAE;YAC5B,OAAO,KAAK,CAAC;SACd;QACD,MAAM,KAAK,GAAa,CAAC,CAAC;QAC1B,OAAO,IAAI,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI,IAAI,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;IAC1E,CAAC;IAED,aAAa;IACN,QAAQ;QACb,OAAO,EAAE,GAAG,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrD,CAAC;IAED,aAAa;IACN,QAAQ;QACb,IAAI,MAAM,GAAG,EAAE,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE;YAC/C,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE;gBACpB,MAAM,IAAI,GAAG,CAAC;aACf;YACD,MAAM,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;SACnC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,aAAa;IACN,KAAK;QACV,OAAO,IAAI,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;IACpD,CAAC;CAEF"}

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

@@ -1,157 +0,0 @@
-import BitArray from './BitArray';
-import { int } from '../../customTypings';
-/**
- * <p>Represents a 2D matrix of bits. In function arguments below, and throughout the common
- * module, x is the column position, and y is the row position. The ordering is always x, y.
- * The origin is at the top-left.</p>
- *
- * <p>Internally the bits are represented in a 1-D array of 32-bit ints. However, each row begins
- * with a new int. This is done intentionally so that we can copy out a row into a BitArray very
- * efficiently.</p>
- *
- * <p>The ordering of bits is row-major. Within each int, the least significant bits are used first,
- * meaning they represent lower x values. This is compatible with BitArray's implementation.</p>
- *
- * @author Sean Owen
- * @author dswitkin@google.com (Daniel Switkin)
- */
-export default class BitMatrix {
-    private width;
-    private height?;
-    private rowSize?;
-    private bits?;
-    /**
-     * Creates an empty square {@link BitMatrix}.
-     *
-     * @param dimension height and width
-     */
-    /**
-     * Creates an empty {@link BitMatrix}.
-     *
-     * @param width bit matrix width
-     * @param height bit matrix height
-     */
-    constructor(width: number, height?: number, rowSize?: number, bits?: Int32Array);
-    /**
-     * Interprets a 2D array of booleans as a {@link BitMatrix}, where "true" means an "on" bit.
-     *
-     * @function parse
-     * @param image bits of the image, as a row-major 2D array. Elements are arrays representing rows
-     * @return {@link BitMatrix} representation of image
-     */
-    static parseFromBooleanArray(image: boolean[][]): BitMatrix;
-    /**
-     *
-     * @function parse
-     * @param stringRepresentation
-     * @param setString
-     * @param unsetString
-     */
-    static parseFromString(stringRepresentation: string, setString: string, unsetString: string): BitMatrix;
-    /**
-     * <p>Gets the requested bit, where true means black.</p>
-     *
-     * @param x The horizontal component (i.e. which column)
-     * @param y The vertical component (i.e. which row)
-     * @return value of given bit in matrix
-     */
-    get(x: number, y: number): boolean;
-    /**
-     * <p>Sets the given bit to true.</p>
-     *
-     * @param x The horizontal component (i.e. which column)
-     * @param y The vertical component (i.e. which row)
-     */
-    set(x: number, y: number): void;
-    unset(x: number, y: number): void;
-    /**
-     * <p>Flips the given bit.</p>
-     *
-     * @param x The horizontal component (i.e. which column)
-     * @param y The vertical component (i.e. which row)
-     */
-    flip(x: number, y: number): void;
-    /**
-     * Exclusive-or (XOR): Flip the bit in this {@code BitMatrix} if the corresponding
-     * mask bit is set.
-     *
-     * @param mask XOR mask
-     */
-    xor(mask: BitMatrix): void;
-    /**
-     * Clears all bits (sets to false).
-     */
-    clear(): void;
-    /**
-     * <p>Sets a square region of the bit matrix to true.</p>
-     *
-     * @param left The horizontal position to begin at (inclusive)
-     * @param top The vertical position to begin at (inclusive)
-     * @param width The width of the region
-     * @param height The height of the region
-     */
-    setRegion(left: number, top: number, width: number, height: number): void;
-    /**
-     * A fast method to retrieve one row of data from the matrix as a BitArray.
-     *
-     * @param y The row to retrieve
-     * @param row An optional caller-allocated BitArray, will be allocated if null or too small
-     * @return The resulting BitArray - this reference should always be used even when passing
-     *         your own row
-     */
-    getRow(y: number, row?: BitArray): BitArray;
-    /**
-     * @param y row to set
-     * @param row {@link BitArray} to copy from
-     */
-    setRow(y: number, row: BitArray): void;
-    /**
-     * Modifies this {@code BitMatrix} to represent the same but rotated 180 degrees
-     */
-    rotate180(): void;
-    /**
-     * This is useful in detecting the enclosing rectangle of a 'pure' barcode.
-     *
-     * @return {@code left,top,width,height} enclosing rectangle of all 1 bits, or null if it is all white
-     */
-    getEnclosingRectangle(): Int32Array;
-    /**
-     * This is useful in detecting a corner of a 'pure' barcode.
-     *
-     * @return {@code x,y} coordinate of top-left-most 1 bit, or null if it is all white
-     */
-    getTopLeftOnBit(): Int32Array;
-    getBottomRightOnBit(): Int32Array;
-    /**
-     * @return The width of the matrix
-     */
-    getWidth(): number;
-    /**
-     * @return The height of the matrix
-     */
-    getHeight(): number;
-    /**
-     * @return The row size of the matrix
-     */
-    getRowSize(): number;
-    equals(o: Object): boolean;
-    hashCode(): int;
-    /**
-     * @return string representation using "X" for set and " " for unset bits
-     */
-    /**
-     * @param setString representation of a set bit
-     * @param unsetString representation of an unset bit
-     * @return string representation of entire matrix utilizing given strings
-     */
-    /**
-     * @param setString representation of a set bit
-     * @param unsetString representation of an unset bit
-     * @param lineSeparator newline character in string representation
-     * @return string representation of entire matrix utilizing given strings and line separator
-     * @deprecated call {@link #toString(String,String)} only, which uses \n line separator always
-     */
-    toString(setString?: string, unsetString?: string, lineSeparator?: string): string;
-    private buildToString;
-    clone(): BitMatrix;
-}