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

package/template/node_modules/@zxing/library/cjs/core/aztec/encoder/State.js

@@ -0,0 +1,195 @@
+"use strict";
+/*
+ * Copyright 2013 ZXing authors
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *      http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+var __values = (this && this.__values) || function(o) {
+    var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;
+    if (m) return m.call(o);
+    if (o && typeof o.length === "number") return {
+        next: function () {
+            if (o && i >= o.length) o = void 0;
+            return { value: o && o[i++], done: !o };
+        }
+    };
+    throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+// package com.google.zxing.aztec.encoder;
+// import java.util.Deque;
+// import java.util.LinkedList;
+// import com.google.zxing.common.BitArray;
+var BitArray_1 = require("../../common/BitArray");
+var TokenHelpers = require("./TokenHelpers");
+var C = require("./EncoderConstants");
+var LatchTable = require("./LatchTable");
+var ShiftTable = require("./ShiftTable");
+var StringUtils_1 = require("../../common/StringUtils");
+/**
+ * State represents all information about a sequence necessary to generate the current output.
+ * Note that a state is immutable.
+ */
+var State = /** @class */ (function () {
+    function State(token, mode, binaryBytes, bitCount) {
+        this.token = token;
+        this.mode = mode;
+        this.binaryShiftByteCount = binaryBytes;
+        this.bitCount = bitCount;
+        // Make sure we match the token
+        // int binaryShiftBitCount = (binaryShiftByteCount * 8) +
+        //    (binaryShiftByteCount === 0 ? 0 :
+        //     binaryShiftByteCount <= 31 ? 10 :
+        //     binaryShiftByteCount <= 62 ? 20 : 21);
+        // assert this.bitCount === token.getTotalBitCount() + binaryShiftBitCount;
+    }
+    State.prototype.getMode = function () {
+        return this.mode;
+    };
+    State.prototype.getToken = function () {
+        return this.token;
+    };
+    State.prototype.getBinaryShiftByteCount = function () {
+        return this.binaryShiftByteCount;
+    };
+    State.prototype.getBitCount = function () {
+        return this.bitCount;
+    };
+    // Create a new state representing this state with a latch to a (not
+    // necessary different) mode, and then a code.
+    State.prototype.latchAndAppend = function (mode, value) {
+        // assert binaryShiftByteCount === 0;
+        var bitCount = this.bitCount;
+        var token = this.token;
+        if (mode !== this.mode) {
+            var latch = LatchTable.LATCH_TABLE[this.mode][mode];
+            token = TokenHelpers.add(token, latch & 0xffff, latch >> 16);
+            bitCount += latch >> 16;
+        }
+        var latchModeBitCount = mode === C.MODE_DIGIT ? 4 : 5;
+        token = TokenHelpers.add(token, value, latchModeBitCount);
+        return new State(token, mode, 0, bitCount + latchModeBitCount);
+    };
+    // Create a new state representing this state, with a temporary shift
+    // to a different mode to output a single value.
+    State.prototype.shiftAndAppend = function (mode, value) {
+        // assert binaryShiftByteCount === 0 && this.mode !== mode;
+        var token = this.token;
+        var thisModeBitCount = this.mode === C.MODE_DIGIT ? 4 : 5;
+        // Shifts exist only to UPPER and PUNCT, both with tokens size 5.
+        token = TokenHelpers.add(token, ShiftTable.SHIFT_TABLE[this.mode][mode], thisModeBitCount);
+        token = TokenHelpers.add(token, value, 5);
+        return new State(token, this.mode, 0, this.bitCount + thisModeBitCount + 5);
+    };
+    // Create a new state representing this state, but an additional character
+    // output in Binary Shift mode.
+    State.prototype.addBinaryShiftChar = function (index) {
+        var token = this.token;
+        var mode = this.mode;
+        var bitCount = this.bitCount;
+        if (this.mode === C.MODE_PUNCT || this.mode === C.MODE_DIGIT) {
+            // assert binaryShiftByteCount === 0;
+            var latch = LatchTable.LATCH_TABLE[mode][C.MODE_UPPER];
+            token = TokenHelpers.add(token, latch & 0xffff, latch >> 16);
+            bitCount += latch >> 16;
+            mode = C.MODE_UPPER;
+        }
+        var deltaBitCount = this.binaryShiftByteCount === 0 || this.binaryShiftByteCount === 31
+            ? 18
+            : this.binaryShiftByteCount === 62
+                ? 9
+                : 8;
+        var result = new State(token, mode, this.binaryShiftByteCount + 1, bitCount + deltaBitCount);
+        if (result.binaryShiftByteCount === 2047 + 31) {
+            // The string is as long as it's allowed to be.  We should end it.
+            result = result.endBinaryShift(index + 1);
+        }
+        return result;
+    };
+    // Create the state identical to this one, but we are no longer in
+    // Binary Shift mode.
+    State.prototype.endBinaryShift = function (index) {
+        if (this.binaryShiftByteCount === 0) {
+            return this;
+        }
+        var token = this.token;
+        token = TokenHelpers.addBinaryShift(token, index - this.binaryShiftByteCount, this.binaryShiftByteCount);
+        // assert token.getTotalBitCount() === this.bitCount;
+        return new State(token, this.mode, 0, this.bitCount);
+    };
+    // Returns true if "this" state is better (equal: or) to be in than "that"
+    // state under all possible circumstances.
+    State.prototype.isBetterThanOrEqualTo = function (other) {
+        var newModeBitCount = this.bitCount + (LatchTable.LATCH_TABLE[this.mode][other.mode] >> 16);
+        if (this.binaryShiftByteCount < other.binaryShiftByteCount) {
+            // add additional B/S encoding cost of other, if any
+            newModeBitCount +=
+                State.calculateBinaryShiftCost(other) -
+                    State.calculateBinaryShiftCost(this);
+        }
+        else if (this.binaryShiftByteCount > other.binaryShiftByteCount &&
+            other.binaryShiftByteCount > 0) {
+            // maximum possible additional cost (it: h)
+            newModeBitCount += 10;
+        }
+        return newModeBitCount <= other.bitCount;
+    };
+    State.prototype.toBitArray = function (text) {
+        var e_1, _a;
+        // Reverse the tokens, so that they are in the order that they should
+        // be output
+        var symbols = [];
+        for (var token = this.endBinaryShift(text.length).token; token !== null; token = token.getPrevious()) {
+            symbols.unshift(token);
+        }
+        var bitArray = new BitArray_1.default();
+        try {
+            // Add each token to the result.
+            for (var symbols_1 = __values(symbols), symbols_1_1 = symbols_1.next(); !symbols_1_1.done; symbols_1_1 = symbols_1.next()) {
+                var symbol = symbols_1_1.value;
+                symbol.appendTo(bitArray, text);
+            }
+        }
+        catch (e_1_1) { e_1 = { error: e_1_1 }; }
+        finally {
+            try {
+                if (symbols_1_1 && !symbols_1_1.done && (_a = symbols_1.return)) _a.call(symbols_1);
+            }
+            finally { if (e_1) throw e_1.error; }
+        }
+        // assert bitArray.getSize() === this.bitCount;
+        return bitArray;
+    };
+    /**
+     * @Override
+     */
+    State.prototype.toString = function () {
+        return StringUtils_1.default.format('%s bits=%d bytes=%d', C.MODE_NAMES[this.mode], this.bitCount, this.binaryShiftByteCount);
+    };
+    State.calculateBinaryShiftCost = function (state) {
+        if (state.binaryShiftByteCount > 62) {
+            return 21; // B/S with extended length
+        }
+        if (state.binaryShiftByteCount > 31) {
+            return 20; // two B/S
+        }
+        if (state.binaryShiftByteCount > 0) {
+            return 10; // one B/S
+        }
+        return 0;
+    };
+    State.INITIAL_STATE = new State(C.EMPTY_TOKEN, C.MODE_UPPER, 0, 0);
+    return State;
+}());
+exports.default = State;
+//# sourceMappingURL=State.js.map

package/template/node_modules/@zxing/library/cjs/core/aztec/encoder/State.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"State.js","sourceRoot":"","sources":["../../../../../src/core/aztec/encoder/State.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;GAcG;;;;;;;;;;;;;AAEH,0CAA0C;AAE1C,0BAA0B;AAC1B,+BAA+B;AAE/B,2CAA2C;AAC3C,kDAA6C;AAG7C,6CAA+C;AAC/C,sCAAwC;AACxC,yCAA2C;AAC3C,yCAA2C;AAC3C,wDAAmD;AAInD;;;GAGG;AACH;IAoBE,eACE,KAAY,EACZ,IAAS,EACT,WAAgB,EAChB,QAAa;QAEb,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,oBAAoB,GAAG,WAAW,CAAC;QACxC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,+BAA+B;QAC/B,yDAAyD;QACzD,uCAAuC;QACvC,wCAAwC;QACxC,6CAA6C;QAC7C,2EAA2E;IAC7E,CAAC;IAED,uBAAO,GAAP;QACE,OAAO,IAAI,CAAC,IAAI,CAAC;IACnB,CAAC;IAED,wBAAQ,GAAR;QACE,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,uCAAuB,GAAvB;QACE,OAAO,IAAI,CAAC,oBAAoB,CAAC;IACnC,CAAC;IAED,2BAAW,GAAX;QACE,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IAED,oEAAoE;IACpE,8CAA8C;IAC9C,8BAAc,GAAd,UAAe,IAAS,EAAE,KAAU;QAClC,qCAAqC;QACrC,IAAI,QAAQ,GAAQ,IAAI,CAAC,QAAQ,CAAC;QAClC,IAAI,KAAK,GAAU,IAAI,CAAC,KAAK,CAAC;QAC9B,IAAI,IAAI,KAAK,IAAI,CAAC,IAAI,EAAE;YACtB,IAAI,KAAK,GAAQ,UAAU,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;YACzD,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,GAAG,MAAM,EAAE,KAAK,IAAI,EAAE,CAAC,CAAC;YAC7D,QAAQ,IAAI,KAAK,IAAI,EAAE,CAAC;SACzB;QACD,IAAI,iBAAiB,GAAQ,IAAI,KAAK,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3D,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,EAAE,iBAAiB,CAAC,CAAC;QAC1D,OAAO,IAAI,KAAK,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE,QAAQ,GAAG,iBAAiB,CAAC,CAAC;IACjE,CAAC;IAED,qEAAqE;IACrE,gDAAgD;IAChD,8BAAc,GAAd,UAAe,IAAS,EAAE,KAAU;QAClC,2DAA2D;QAC3D,IAAI,KAAK,GAAU,IAAI,CAAC,KAAK,CAAC;QAC9B,IAAI,gBAAgB,GAAQ,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/D,iEAAiE;QACjE,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,KAAK,EAC5B,UAAU,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,EACvC,gBAAgB,CACjB,CAAC;QACF,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;QAC1C,OAAO,IAAI,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,QAAQ,GAAG,gBAAgB,GAAG,CAAC,CAAC,CAAC;IAC9E,CAAC;IAED,0EAA0E;IAC1E,+BAA+B;IAC/B,kCAAkB,GAAlB,UAAmB,KAAU;QAC3B,IAAI,KAAK,GAAU,IAAI,CAAC,KAAK,CAAC;QAC9B,IAAI,IAAI,GAAQ,IAAI,CAAC,IAAI,CAAC;QAC1B,IAAI,QAAQ,GAAQ,IAAI,CAAC,QAAQ,CAAC;QAClC,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC,UAAU,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC,UAAU,EAAE;YAC5D,qCAAqC;YACrC,IAAI,KAAK,GAAQ,UAAU,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;YAC5D,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,GAAG,MAAM,EAAE,KAAK,IAAI,EAAE,CAAC,CAAC;YAC7D,QAAQ,IAAI,KAAK,IAAI,EAAE,CAAC;YACxB,IAAI,GAAG,CAAC,CAAC,UAAU,CAAC;SACrB;QACD,IAAI,aAAa,GACf,IAAI,CAAC,oBAAoB,KAAK,CAAC,IAAI,IAAI,CAAC,oBAAoB,KAAK,EAAE;YACjE,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC,IAAI,CAAC,oBAAoB,KAAK,EAAE;gBAClC,CAAC,CAAC,CAAC;gBACH,CAAC,CAAC,CAAC,CAAC;QACR,IAAI,MAAM,GAAU,IAAI,KAAK,CAC3B,KAAK,EACL,IAAI,EACJ,IAAI,CAAC,oBAAoB,GAAG,CAAC,EAC7B,QAAQ,GAAG,aAAa,CACzB,CAAC;QACF,IAAI,MAAM,CAAC,oBAAoB,KAAK,IAAI,GAAG,EAAE,EAAE;YAC7C,kEAAkE;YAClE,MAAM,GAAG,MAAM,CAAC,cAAc,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;SAC3C;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,kEAAkE;IAClE,qBAAqB;IACrB,8BAAc,GAAd,UAAe,KAAU;QACvB,IAAI,IAAI,CAAC,oBAAoB,KAAK,CAAC,EAAE;YACnC,OAAO,IAAI,CAAC;SACb;QACD,IAAI,KAAK,GAAU,IAAI,CAAC,KAAK,CAAC;QAC9B,KAAK,GAAG,YAAY,CAAC,cAAc,CAAC,KAAK,EACvC,KAAK,GAAG,IAAI,CAAC,oBAAoB,EACjC,IAAI,CAAC,oBAAoB,CAC1B,CAAC;QACF,qDAAqD;QACrD,OAAO,IAAI,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IACvD,CAAC;IAED,0EAA0E;IAC1E,0CAA0C;IAC1C,qCAAqB,GAArB,UAAsB,KAAY;QAChC,IAAI,eAAe,GACjB,IAAI,CAAC,QAAQ,GAAG,CAAC,UAAU,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;QACxE,IAAI,IAAI,CAAC,oBAAoB,GAAG,KAAK,CAAC,oBAAoB,EAAE;YAC1D,oDAAoD;YACpD,eAAe;gBACb,KAAK,CAAC,wBAAwB,CAAC,KAAK,CAAC;oBACrC,KAAK,CAAC,wBAAwB,CAAC,IAAI,CAAC,CAAC;SACxC;aAAM,IACL,IAAI,CAAC,oBAAoB,GAAG,KAAK,CAAC,oBAAoB;YACtD,KAAK,CAAC,oBAAoB,GAAG,CAAC,EAC9B;YACA,2CAA2C;YAC3C,eAAe,IAAI,EAAE,CAAC;SACvB;QACD,OAAO,eAAe,IAAI,KAAK,CAAC,QAAQ,CAAC;IAC3C,CAAC;IAED,0BAAU,GAAV,UAAW,IAAgB;;QACzB,qEAAqE;QACrE,YAAY;QACZ,IAAI,OAAO,GAAiB,EAAE,CAAC;QAC/B,KACE,IAAI,KAAK,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,KAAK,EAClD,KAAK,KAAK,IAAI,EACd,KAAK,GAAG,KAAK,CAAC,WAAW,EAAE,EAC3B;YACA,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;SACxB;QACD,IAAI,QAAQ,GAAa,IAAI,kBAAQ,EAAE,CAAC;;YACxC,gCAAgC;YAChC,KAAqB,IAAA,YAAA,SAAA,OAAO,CAAA,gCAAA,qDAAE;gBAAzB,IAAM,MAAM,oBAAA;gBACf,MAAM,CAAC,QAAQ,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;aACjC;;;;;;;;;QACD,+CAA+C;QAC/C,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACI,wBAAQ,GAAf;QACE,OAAO,qBAAW,CAAC,MAAM,CACvB,qBAAqB,EACrB,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EACvB,IAAI,CAAC,QAAQ,EACb,IAAI,CAAC,oBAAoB,CAC1B,CAAC;IACJ,CAAC;IAEc,8BAAwB,GAAvC,UAAwC,KAAY;QAClD,IAAI,KAAK,CAAC,oBAAoB,GAAG,EAAE,EAAE;YACnC,OAAO,EAAE,CAAC,CAAC,2BAA2B;SACvC;QACD,IAAI,KAAK,CAAC,oBAAoB,GAAG,EAAE,EAAE;YACnC,OAAO,EAAE,CAAC,CAAC,UAAU;SACtB;QACD,IAAI,KAAK,CAAC,oBAAoB,GAAG,CAAC,EAAE;YAClC,OAAO,EAAE,CAAC,CAAC,UAAU;SACtB;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAlMgB,mBAAa,GAAU,IAAI,KAAK,CAC/C,CAAC,CAAC,WAAW,EACb,CAAC,CAAC,UAAU,EACZ,CAAC,EACD,CAAC,CACF,CAAC;IA+LJ,YAAC;CAAA,AArMD,IAqMC;kBArM8B,KAAK"}

package/template/node_modules/@zxing/library/cjs/core/aztec/encoder/Token.d.ts

@@ -0,0 +1,10 @@
+import BitArray from '../../common/BitArray';
+import { int } from '../../../customTypings';
+export default abstract class Token {
+    private previous;
+    constructor(previous: Token);
+    getPrevious(): Token;
+    abstract add(value: int, bitCount: int): Token;
+    abstract addBinaryShift(start: int, byteCount: int): Token;
+    abstract appendTo(bitArray: BitArray, text: Uint8Array): void;
+}

package/template/node_modules/@zxing/library/cjs/core/aztec/encoder/Token.js

@@ -0,0 +1,28 @@
+"use strict";
+/*
+* Copyright 2013 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.
+*/
+Object.defineProperty(exports, "__esModule", { value: true });
+var Token = /** @class */ (function () {
+    function Token(previous) {
+        this.previous = previous;
+    }
+    Token.prototype.getPrevious = function () {
+        return this.previous;
+    };
+    return Token;
+}());
+exports.default = Token;
+//# sourceMappingURL=Token.js.map

package/template/node_modules/@zxing/library/cjs/core/aztec/encoder/Token.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Token.js","sourceRoot":"","sources":["../../../../../src/core/aztec/encoder/Token.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;EAcE;;AASF;IAIE,eAAY,QAAe;QACzB,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;IAC3B,CAAC;IAEgB,2BAAW,GAA5B;QACE,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IAQH,YAAC;AAAD,CAAC,AAlBD,IAkBC"}

package/template/node_modules/@zxing/library/cjs/core/aztec/encoder/TokenHelpers.d.ts

@@ -0,0 +1,3 @@
+import Token from './Token';
+export declare function addBinaryShift(token: Token, start: number, byteCount: number): Token;
+export declare function add(token: Token, value: number, bitCount: number): Token;

package/template/node_modules/@zxing/library/cjs/core/aztec/encoder/TokenHelpers.js

@@ -0,0 +1,15 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.add = exports.addBinaryShift = void 0;
+var SimpleToken_1 = require("./SimpleToken");
+var BinaryShiftToken_1 = require("./BinaryShiftToken");
+function addBinaryShift(token, start, byteCount) {
+    // int bitCount = (byteCount * 8) + (byteCount <= 31 ? 10 : byteCount <= 62 ? 20 : 21);
+    return new BinaryShiftToken_1.default(token, start, byteCount);
+}
+exports.addBinaryShift = addBinaryShift;
+function add(token, value, bitCount) {
+    return new SimpleToken_1.default(token, value, bitCount);
+}
+exports.add = add;
+//# sourceMappingURL=TokenHelpers.js.map

package/template/node_modules/@zxing/library/cjs/core/aztec/encoder/TokenHelpers.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"TokenHelpers.js","sourceRoot":"","sources":["../../../../../src/core/aztec/encoder/TokenHelpers.ts"],"names":[],"mappings":";;;AACA,6CAAwC;AACxC,uDAAkD;AAElD,SAAgB,cAAc,CAC5B,KAAY,EACZ,KAAa,EACb,SAAiB;IAEjB,uFAAuF;IACvF,OAAO,IAAI,0BAAgB,CAAC,KAAK,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;AACvD,CAAC;AAPD,wCAOC;AAED,SAAgB,GAAG,CAAC,KAAY,EAAE,KAAa,EAAE,QAAgB;IAC/D,OAAO,IAAI,qBAAW,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;AACjD,CAAC;AAFD,kBAEC"}

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

@@ -0,0 +1,107 @@
+/**
+ * <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;
+}