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

package/template/node_modules/@zxing/library/esm/core/aztec/encoder/HighLevelEncoder.d.ts

@@ -0,0 +1,26 @@
+import BitArray from '../../common/BitArray';
+/**
+ * This produces nearly optimal encodings of text into the first-level of
+ * encoding used by Aztec code.
+ *
+ * It uses a dynamic algorithm.  For each prefix of the string, it determines
+ * a set of encodings that could lead to this prefix.  We repeatedly add a
+ * character and generate a new set of optimal encodings until we have read
+ * through the entire input.
+ *
+ * @author Frank Yellin
+ * @author Rustam Abdullaev
+ */
+export default class HighLevelEncoder {
+    private text;
+    constructor(text: Uint8Array);
+    /**
+     * @return text represented by this encoder encoded as a {@link BitArray}
+     */
+    encode(): BitArray;
+    private updateStateListForChar;
+    private updateStateForChar;
+    private static updateStateListForPair;
+    private static updateStateForPair;
+    private static simplifyStates;
+}

package/template/node_modules/@zxing/library/esm/core/aztec/encoder/HighLevelEncoder.js

@@ -0,0 +1,255 @@
+/*
+ * 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.");
+};
+// import java.util.Collection;
+// import java.util.Collections;
+import Collections from '../../util/Collections';
+// import java.util.Comparator;
+// import java.util.Iterator;
+// import java.util.LinkedList;
+import State from './State';
+import * as C from './EncoderConstants';
+import * as CharMap from './CharMap';
+import * as ShiftTable from './ShiftTable';
+import StringUtils from '../../common/StringUtils';
+/**
+ * This produces nearly optimal encodings of text into the first-level of
+ * encoding used by Aztec code.
+ *
+ * It uses a dynamic algorithm.  For each prefix of the string, it determines
+ * a set of encodings that could lead to this prefix.  We repeatedly add a
+ * character and generate a new set of optimal encodings until we have read
+ * through the entire input.
+ *
+ * @author Frank Yellin
+ * @author Rustam Abdullaev
+ */
+var HighLevelEncoder = /** @class */ (function () {
+    function HighLevelEncoder(text) {
+        this.text = text;
+    }
+    /**
+     * @return text represented by this encoder encoded as a {@link BitArray}
+     */
+    HighLevelEncoder.prototype.encode = function () {
+        var spaceCharCode = StringUtils.getCharCode(' ');
+        var lineBreakCharCode = StringUtils.getCharCode('\n');
+        var states = Collections.singletonList(State.INITIAL_STATE);
+        for (var index = 0; index < this.text.length; index++) {
+            var pairCode = void 0;
+            var nextChar = index + 1 < this.text.length ? this.text[index + 1] : 0;
+            switch (this.text[index]) {
+                case StringUtils.getCharCode('\r'):
+                    pairCode = nextChar === lineBreakCharCode ? 2 : 0;
+                    break;
+                case StringUtils.getCharCode('.'):
+                    pairCode = nextChar === spaceCharCode ? 3 : 0;
+                    break;
+                case StringUtils.getCharCode(','):
+                    pairCode = nextChar === spaceCharCode ? 4 : 0;
+                    break;
+                case StringUtils.getCharCode(':'):
+                    pairCode = nextChar === spaceCharCode ? 5 : 0;
+                    break;
+                default:
+                    pairCode = 0;
+            }
+            if (pairCode > 0) {
+                // We have one of the four special PUNCT pairs.  Treat them specially.
+                // Get a new set of states for the two new characters.
+                states = HighLevelEncoder.updateStateListForPair(states, index, pairCode);
+                index++;
+            }
+            else {
+                // Get a new set of states for the new character.
+                states = this.updateStateListForChar(states, index);
+            }
+        }
+        // We are left with a set of states.  Find the shortest one.
+        var minState = Collections.min(states, function (a, b) {
+            return a.getBitCount() - b.getBitCount();
+        });
+        // Convert it to a bit array, and return.
+        return minState.toBitArray(this.text);
+    };
+    // We update a set of states for a new character by updating each state
+    // for the new character, merging the results, and then removing the
+    // non-optimal states.
+    HighLevelEncoder.prototype.updateStateListForChar = function (states, index) {
+        var e_1, _a;
+        var result = [];
+        try {
+            for (var states_1 = __values(states), states_1_1 = states_1.next(); !states_1_1.done; states_1_1 = states_1.next()) {
+                var state = states_1_1.value /*State*/;
+                this.updateStateForChar(state, index, result);
+            }
+        }
+        catch (e_1_1) { e_1 = { error: e_1_1 }; }
+        finally {
+            try {
+                if (states_1_1 && !states_1_1.done && (_a = states_1.return)) _a.call(states_1);
+            }
+            finally { if (e_1) throw e_1.error; }
+        }
+        return HighLevelEncoder.simplifyStates(result);
+    };
+    // Return a set of states that represent the possible ways of updating this
+    // state for the next character.  The resulting set of states are added to
+    // the "result" list.
+    HighLevelEncoder.prototype.updateStateForChar = function (state, index, result) {
+        var ch = (this.text[index] & 0xff);
+        var charInCurrentTable = CharMap.CHAR_MAP[state.getMode()][ch] > 0;
+        var stateNoBinary = null;
+        for (var mode /*int*/ = 0; mode <= C.MODE_PUNCT; mode++) {
+            var charInMode = CharMap.CHAR_MAP[mode][ch];
+            if (charInMode > 0) {
+                if (stateNoBinary == null) {
+                    // Only create stateNoBinary the first time it's required.
+                    stateNoBinary = state.endBinaryShift(index);
+                }
+                // Try generating the character by latching to its mode
+                if (!charInCurrentTable ||
+                    mode === state.getMode() ||
+                    mode === C.MODE_DIGIT) {
+                    // If the character is in the current table, we don't want to latch to
+                    // any other mode except possibly digit (which uses only 4 bits).  Any
+                    // other latch would be equally successful *after* this character, and
+                    // so wouldn't save any bits.
+                    var latchState = stateNoBinary.latchAndAppend(mode, charInMode);
+                    result.push(latchState);
+                }
+                // Try generating the character by switching to its mode.
+                if (!charInCurrentTable &&
+                    ShiftTable.SHIFT_TABLE[state.getMode()][mode] >= 0) {
+                    // It never makes sense to temporarily shift to another mode if the
+                    // character exists in the current mode.  That can never save bits.
+                    var shiftState = stateNoBinary.shiftAndAppend(mode, charInMode);
+                    result.push(shiftState);
+                }
+            }
+        }
+        if (state.getBinaryShiftByteCount() > 0 ||
+            CharMap.CHAR_MAP[state.getMode()][ch] === 0) {
+            // It's never worthwhile to go into binary shift mode if you're not already
+            // in binary shift mode, and the character exists in your current mode.
+            // That can never save bits over just outputting the char in the current mode.
+            var binaryState = state.addBinaryShiftChar(index);
+            result.push(binaryState);
+        }
+    };
+    HighLevelEncoder.updateStateListForPair = function (states, index, pairCode) {
+        var e_2, _a;
+        var result = [];
+        try {
+            for (var states_2 = __values(states), states_2_1 = states_2.next(); !states_2_1.done; states_2_1 = states_2.next()) {
+                var state = states_2_1.value /*State*/;
+                this.updateStateForPair(state, index, pairCode, result);
+            }
+        }
+        catch (e_2_1) { e_2 = { error: e_2_1 }; }
+        finally {
+            try {
+                if (states_2_1 && !states_2_1.done && (_a = states_2.return)) _a.call(states_2);
+            }
+            finally { if (e_2) throw e_2.error; }
+        }
+        return this.simplifyStates(result);
+    };
+    HighLevelEncoder.updateStateForPair = function (state, index, pairCode, result) {
+        var stateNoBinary = state.endBinaryShift(index);
+        // Possibility 1.  Latch to C.MODE_PUNCT, and then append this code
+        result.push(stateNoBinary.latchAndAppend(C.MODE_PUNCT, pairCode));
+        if (state.getMode() !== C.MODE_PUNCT) {
+            // Possibility 2.  Shift to C.MODE_PUNCT, and then append this code.
+            // Every state except C.MODE_PUNCT (handled above) can shift
+            result.push(stateNoBinary.shiftAndAppend(C.MODE_PUNCT, pairCode));
+        }
+        if (pairCode === 3 || pairCode === 4) {
+            // both characters are in DIGITS.  Sometimes better to just add two digits
+            var digitState = stateNoBinary
+                .latchAndAppend(C.MODE_DIGIT, 16 - pairCode) // period or comma in DIGIT
+                .latchAndAppend(C.MODE_DIGIT, 1); // space in DIGIT
+            result.push(digitState);
+        }
+        if (state.getBinaryShiftByteCount() > 0) {
+            // It only makes sense to do the characters as binary if we're already
+            // in binary mode.
+            var binaryState = state
+                .addBinaryShiftChar(index)
+                .addBinaryShiftChar(index + 1);
+            result.push(binaryState);
+        }
+    };
+    HighLevelEncoder.simplifyStates = function (states) {
+        var e_3, _a, e_4, _b;
+        var result = [];
+        try {
+            for (var states_3 = __values(states), states_3_1 = states_3.next(); !states_3_1.done; states_3_1 = states_3.next()) {
+                var newState = states_3_1.value;
+                var add = true;
+                var _loop_1 = function (oldState) {
+                    if (oldState.isBetterThanOrEqualTo(newState)) {
+                        add = false;
+                        return "break";
+                    }
+                    if (newState.isBetterThanOrEqualTo(oldState)) {
+                        // iterator.remove();
+                        result = result.filter(function (x) { return x !== oldState; }); // remove old state
+                    }
+                };
+                try {
+                    for (var result_1 = (e_4 = void 0, __values(result)), result_1_1 = result_1.next(); !result_1_1.done; result_1_1 = result_1.next()) {
+                        var oldState = result_1_1.value;
+                        var state_1 = _loop_1(oldState);
+                        if (state_1 === "break")
+                            break;
+                    }
+                }
+                catch (e_4_1) { e_4 = { error: e_4_1 }; }
+                finally {
+                    try {
+                        if (result_1_1 && !result_1_1.done && (_b = result_1.return)) _b.call(result_1);
+                    }
+                    finally { if (e_4) throw e_4.error; }
+                }
+                if (add) {
+                    result.push(newState);
+                }
+            }
+        }
+        catch (e_3_1) { e_3 = { error: e_3_1 }; }
+        finally {
+            try {
+                if (states_3_1 && !states_3_1.done && (_a = states_3.return)) _a.call(states_3);
+            }
+            finally { if (e_3) throw e_3.error; }
+        }
+        return result;
+    };
+    return HighLevelEncoder;
+}());
+export default HighLevelEncoder;
+//# sourceMappingURL=HighLevelEncoder.js.map

package/template/node_modules/@zxing/library/esm/core/aztec/encoder/HighLevelEncoder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"HighLevelEncoder.js","sourceRoot":"","sources":["../../../../../src/core/aztec/encoder/HighLevelEncoder.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;;;;;;;;;;;;AASH,+BAA+B;AAC/B,gCAAgC;AAChC,OAAO,WAAW,MAAM,wBAAwB,CAAC;AACjD,+BAA+B;AAC/B,6BAA6B;AAC7B,+BAA+B;AAE/B,OAAO,KAAK,MAAM,SAAS,CAAC;AAC5B,OAAO,KAAK,CAAC,MAAM,oBAAoB,CAAC;AACxC,OAAO,KAAK,OAAO,MAAM,WAAW,CAAC;AACrC,OAAO,KAAK,UAAU,MAAM,cAAc,CAAC;AAE3C,OAAO,WAAW,MAAM,0BAA0B,CAAC;AAInD;;;;;;;;;;;GAWG;AACH;IAWE,0BAAmB,IAAgB;QACjC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;IAED;;OAEG;IACI,iCAAM,GAAb;QAEE,IAAM,aAAa,GAAG,WAAW,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QACnD,IAAM,iBAAiB,GAAG,WAAW,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QAExD,IAAI,MAAM,GAAG,WAAW,CAAC,aAAa,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;QAC5D,KAAK,IAAI,KAAK,GAAQ,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE;YAC1D,IAAI,QAAQ,SAAK,CAAC;YAClB,IAAI,QAAQ,GACV,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1D,QAAQ,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE;gBACxB,KAAK,WAAW,CAAC,WAAW,CAAC,IAAI,CAAC;oBAChC,QAAQ,GAAG,QAAQ,KAAK,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBAClD,MAAM;gBACR,KAAK,WAAW,CAAC,WAAW,CAAC,GAAG,CAAC;oBAC/B,QAAQ,GAAG,QAAQ,KAAK,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC9C,MAAM;gBACR,KAAK,WAAW,CAAC,WAAW,CAAC,GAAG,CAAC;oBAC/B,QAAQ,GAAG,QAAQ,KAAK,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC9C,MAAM;gBACR,KAAK,WAAW,CAAC,WAAW,CAAC,GAAG,CAAC;oBAC/B,QAAQ,GAAG,QAAQ,KAAK,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC9C,MAAM;gBACR;oBACE,QAAQ,GAAG,CAAC,CAAC;aAChB;YACD,IAAI,QAAQ,GAAG,CAAC,EAAE;gBAChB,sEAAsE;gBACtE,sDAAsD;gBACtD,MAAM,GAAG,gBAAgB,CAAC,sBAAsB,CAC9C,MAAM,EACN,KAAK,EACL,QAAQ,CACT,CAAC;gBACF,KAAK,EAAE,CAAC;aACT;iBAAM;gBACL,iDAAiD;gBACjD,MAAM,GAAG,IAAI,CAAC,sBAAsB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;aACrD;SACF;QACD,4DAA4D;QAC5D,IAAM,QAAQ,GAAU,WAAW,CAAC,GAAG,CAAC,MAAM,EAAE,UAAC,CAAQ,EAAE,CAAQ;YACjE,OAAO,CAAC,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC;QAC3C,CAAC,CAAC,CAAC;QAEH,yCAAyC;QACzC,OAAO,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxC,CAAC;IAED,uEAAuE;IACvE,oEAAoE;IACpE,sBAAsB;IACd,iDAAsB,GAA9B,UACE,MAAe,EACf,KAAU;;QAEV,IAAM,MAAM,GAAY,EAAE,CAAC;;YAC3B,KAA4B,IAAA,WAAA,SAAA,MAAM,CAAA,8BAAA,kDAAE;gBAA/B,IAAI,KAAK,mBAAA,CAAC,SAAS;gBACtB,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;aAC/C;;;;;;;;;QACD,OAAO,gBAAgB,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;IACjD,CAAC;IAED,2EAA2E;IAC3E,0EAA0E;IAC1E,qBAAqB;IACb,6CAAkB,GAA1B,UACE,KAAY,EACZ,KAAU,EACV,MAAyB;QAEzB,IAAI,EAAE,GAAe,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,CAAC;QAC/C,IAAI,kBAAkB,GAAY,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;QAC5E,IAAI,aAAa,GAAU,IAAI,CAAC;QAChC,KAAK,IAAI,IAAI,CAAC,OAAO,GAAG,CAAC,EAAE,IAAI,IAAI,CAAC,CAAC,UAAU,EAAE,IAAI,EAAE,EAAE;YACvD,IAAI,UAAU,GAAQ,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC;YACjD,IAAI,UAAU,GAAG,CAAC,EAAE;gBAClB,IAAI,aAAa,IAAI,IAAI,EAAE;oBACzB,0DAA0D;oBAC1D,aAAa,GAAG,KAAK,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;iBAC7C;gBACD,uDAAuD;gBACvD,IACE,CAAC,kBAAkB;oBACnB,IAAI,KAAK,KAAK,CAAC,OAAO,EAAE;oBACxB,IAAI,KAAK,CAAC,CAAC,UAAU,EACrB;oBACA,sEAAsE;oBACtE,sEAAsE;oBACtE,sEAAsE;oBACtE,6BAA6B;oBAC7B,IAAM,UAAU,GAAU,aAAa,CAAC,cAAc,CACpD,IAAI,EACJ,UAAU,CACX,CAAC;oBACF,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;iBACzB;gBACD,yDAAyD;gBACzD,IACE,CAAC,kBAAkB;oBACnB,UAAU,CAAC,WAAW,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAClD;oBACA,mEAAmE;oBACnE,mEAAmE;oBACnE,IAAM,UAAU,GAAU,aAAa,CAAC,cAAc,CACpD,IAAI,EACJ,UAAU,CACX,CAAC;oBACF,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;iBACzB;aACF;SACF;QACD,IACE,KAAK,CAAC,uBAAuB,EAAE,GAAG,CAAC;YACnC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EAC3C;YACA,2EAA2E;YAC3E,uEAAuE;YACvE,8EAA8E;YAC9E,IAAI,WAAW,GAAU,KAAK,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAC;YACzD,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;SAC1B;IACH,CAAC;IAEc,uCAAsB,GAArC,UACE,MAAe,EACf,KAAU,EACV,QAAa;;QAEb,IAAM,MAAM,GAAY,EAAE,CAAC;;YAC3B,KAA4B,IAAA,WAAA,SAAA,MAAM,CAAA,8BAAA,kDAAE;gBAA/B,IAAI,KAAK,mBAAA,CAAC,SAAS;gBACtB,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;aACzD;;;;;;;;;QACD,OAAO,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;IACrC,CAAC;IAEc,mCAAkB,GAAjC,UACE,KAAY,EACZ,KAAU,EACV,QAAa,EACb,MAAyB;QAEzB,IAAI,aAAa,GAAU,KAAK,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;QACvD,mEAAmE;QACnE,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,cAAc,CAAC,CAAC,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC,CAAC;QAClE,IAAI,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,UAAU,EAAE;YACpC,oEAAoE;YACpE,4DAA4D;YAC5D,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,cAAc,CAAC,CAAC,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC,CAAC;SACnE;QACD,IAAI,QAAQ,KAAK,CAAC,IAAI,QAAQ,KAAK,CAAC,EAAE;YACpC,0EAA0E;YAC1E,IAAI,UAAU,GAAU,aAAa;iBAClC,cAAc,CAAC,CAAC,CAAC,UAAU,EAAE,EAAE,GAAG,QAAQ,CAAC,CAAC,2BAA2B;iBACvE,cAAc,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,CAAC,iBAAiB;YACrD,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;SACzB;QACD,IAAI,KAAK,CAAC,uBAAuB,EAAE,GAAG,CAAC,EAAE;YACvC,sEAAsE;YACtE,kBAAkB;YAClB,IAAI,WAAW,GAAU,KAAK;iBAC3B,kBAAkB,CAAC,KAAK,CAAC;iBACzB,kBAAkB,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;SAC1B;IACH,CAAC;IAEc,+BAAc,GAA7B,UAA8B,MAAe;;QAC3C,IAAI,MAAM,GAAsB,EAAE,CAAC;;YACnC,KAAuB,IAAA,WAAA,SAAA,MAAM,CAAA,8BAAA,kDAAE;gBAA1B,IAAM,QAAQ,mBAAA;gBACjB,IAAI,GAAG,GAAY,IAAI,CAAC;wCACb,QAAQ;oBACjB,IAAI,QAAQ,CAAC,qBAAqB,CAAC,QAAQ,CAAC,EAAE;wBAC5C,GAAG,GAAG,KAAK,CAAC;;qBAEb;oBACD,IAAI,QAAQ,CAAC,qBAAqB,CAAC,QAAQ,CAAC,EAAE;wBAC5C,qBAAqB;wBACrB,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,UAAA,CAAC,IAAI,OAAA,CAAC,KAAK,QAAQ,EAAd,CAAc,CAAC,CAAC,CAAC,mBAAmB;qBACjE;;;oBARH,KAAuB,IAAA,0BAAA,SAAA,MAAM,CAAA,CAAA,8BAAA;wBAAxB,IAAM,QAAQ,mBAAA;8CAAR,QAAQ;;;qBASlB;;;;;;;;;gBACD,IAAI,GAAG,EAAE;oBACP,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;iBACvB;aACF;;;;;;;;;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAEH,uBAAC;AAAD,CAAC,AA9MD,IA8MC"}

package/template/node_modules/@zxing/library/esm/core/aztec/encoder/LatchTable.d.ts

@@ -0,0 +1 @@
+export declare const LATCH_TABLE: Int32Array[];

package/template/node_modules/@zxing/library/esm/core/aztec/encoder/LatchTable.js

@@ -0,0 +1,44 @@
+// The Latch Table shows, for each pair of Modes, the optimal method for
+// getting from one mode to another.  In the worst possible case, this can
+// be up to 14 bits.  In the best possible case, we are already there!
+// The high half-word of each entry gives the number of bits.
+// The low half-word of each entry are the actual bits necessary to change
+export var LATCH_TABLE = [
+    Int32Array.from([
+        0,
+        (5 << 16) + 28,
+        (5 << 16) + 30,
+        (5 << 16) + 29,
+        (10 << 16) + (29 << 5) + 30 // UPPER -> MIXED -> PUNCT
+    ]),
+    Int32Array.from([
+        (9 << 16) + (30 << 4) + 14,
+        0,
+        (5 << 16) + 30,
+        (5 << 16) + 29,
+        (10 << 16) + (29 << 5) + 30 // LOWER -> MIXED -> PUNCT
+    ]),
+    Int32Array.from([
+        (4 << 16) + 14,
+        (9 << 16) + (14 << 5) + 28,
+        0,
+        (9 << 16) + (14 << 5) + 29,
+        (14 << 16) + (14 << 10) + (29 << 5) + 30
+        // DIGIT -> UPPER -> MIXED -> PUNCT
+    ]),
+    Int32Array.from([
+        (5 << 16) + 29,
+        (5 << 16) + 28,
+        (10 << 16) + (29 << 5) + 30,
+        0,
+        (5 << 16) + 30 // MIXED -> PUNCT
+    ]),
+    Int32Array.from([
+        (5 << 16) + 31,
+        (10 << 16) + (31 << 5) + 28,
+        (10 << 16) + (31 << 5) + 30,
+        (10 << 16) + (31 << 5) + 29,
+        0
+    ])
+];
+//# sourceMappingURL=LatchTable.js.map

package/template/node_modules/@zxing/library/esm/core/aztec/encoder/LatchTable.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"LatchTable.js","sourceRoot":"","sources":["../../../../../src/core/aztec/encoder/LatchTable.ts"],"names":[],"mappings":"AAAA,wEAAwE;AACxE,0EAA0E;AAC1E,sEAAsE;AACtE,6DAA6D;AAC7D,0EAA0E;AAC1E,MAAM,CAAC,IAAM,WAAW,GAAiB;IACvC,UAAU,CAAC,IAAI,CAAC;QACd,CAAC;QACD,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE;QACd,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE;QACd,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE;QACd,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,0BAA0B;KACvD,CAAC;IACF,UAAU,CAAC,IAAI,CAAC;QACd,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,EAAE;QAC1B,CAAC;QACD,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE;QACd,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE;QACd,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,0BAA0B;KACvD,CAAC;IACF,UAAU,CAAC,IAAI,CAAC;QACd,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE;QACd,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,EAAE;QAC1B,CAAC;QACD,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,EAAE;QAC1B,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,EAAE;QACxC,mCAAmC;KACpC,CAAC;IACF,UAAU,CAAC,IAAI,CAAC;QACd,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE;QACd,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE;QACd,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,EAAE;QAC3B,CAAC;QACD,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,iBAAiB;KACjC,CAAC;IACF,UAAU,CAAC,IAAI,CAAC;QACd,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE;QACd,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,EAAE;QAC3B,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,EAAE;QAC3B,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,EAAE;QAC3B,CAAC;KACF,CAAC;CACH,CAAC"}

package/template/node_modules/@zxing/library/esm/core/aztec/encoder/ShiftTable.d.ts

@@ -0,0 +1,2 @@
+export declare function static_SHIFT_TABLE(SHIFT_TABLE: Int32Array[]): Int32Array[];
+export declare const /*final*/ SHIFT_TABLE: Int32Array[];

package/template/node_modules/@zxing/library/esm/core/aztec/encoder/ShiftTable.js

@@ -0,0 +1,38 @@
+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.");
+};
+import Arrays from '../../util/Arrays';
+import * as C from './EncoderConstants';
+export function static_SHIFT_TABLE(SHIFT_TABLE) {
+    var e_1, _a;
+    try {
+        for (var SHIFT_TABLE_1 = __values(SHIFT_TABLE), SHIFT_TABLE_1_1 = SHIFT_TABLE_1.next(); !SHIFT_TABLE_1_1.done; SHIFT_TABLE_1_1 = SHIFT_TABLE_1.next()) {
+            var table = SHIFT_TABLE_1_1.value /*Int32Array*/;
+            Arrays.fill(table, -1);
+        }
+    }
+    catch (e_1_1) { e_1 = { error: e_1_1 }; }
+    finally {
+        try {
+            if (SHIFT_TABLE_1_1 && !SHIFT_TABLE_1_1.done && (_a = SHIFT_TABLE_1.return)) _a.call(SHIFT_TABLE_1);
+        }
+        finally { if (e_1) throw e_1.error; }
+    }
+    SHIFT_TABLE[C.MODE_UPPER][C.MODE_PUNCT] = 0;
+    SHIFT_TABLE[C.MODE_LOWER][C.MODE_PUNCT] = 0;
+    SHIFT_TABLE[C.MODE_LOWER][C.MODE_UPPER] = 28;
+    SHIFT_TABLE[C.MODE_MIXED][C.MODE_PUNCT] = 0;
+    SHIFT_TABLE[C.MODE_DIGIT][C.MODE_PUNCT] = 0;
+    SHIFT_TABLE[C.MODE_DIGIT][C.MODE_UPPER] = 15;
+    return SHIFT_TABLE;
+}
+export var /*final*/ SHIFT_TABLE = static_SHIFT_TABLE(Arrays.createInt32Array(6, 6)); // mode shift codes, per table
+//# sourceMappingURL=ShiftTable.js.map

package/template/node_modules/@zxing/library/esm/core/aztec/encoder/ShiftTable.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ShiftTable.js","sourceRoot":"","sources":["../../../../../src/core/aztec/encoder/ShiftTable.ts"],"names":[],"mappings":";;;;;;;;;;;AAAA,OAAO,MAAM,MAAM,mBAAmB,CAAC;AACvC,OAAO,KAAK,CAAC,MAAM,oBAAoB,CAAC;AAExC,MAAM,UAAU,kBAAkB,CAAC,WAAyB;;;QAC1D,KAAiC,IAAA,gBAAA,SAAA,WAAW,CAAA,wCAAA,iEAAE;YAAzC,IAAI,KAAK,wBAAA,CAAC,cAAc;YAC3B,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;SACxB;;;;;;;;;IACD,WAAW,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;IAC5C,WAAW,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;IAC5C,WAAW,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,EAAE,CAAC;IAC7C,WAAW,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;IAC5C,WAAW,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;IAC5C,WAAW,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,EAAE,CAAC;IAC7C,OAAO,WAAW,CAAC;AACrB,CAAC;AAED,MAAM,CAAC,IAAM,SAAS,CAAC,WAAW,GAAiB,kBAAkB,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,8BAA8B"}

package/template/node_modules/@zxing/library/esm/core/aztec/encoder/SimpleToken.d.ts

@@ -0,0 +1,18 @@
+import BitArray from '../../common/BitArray';
+import Token from './Token';
+import { int } from '../../../customTypings';
+export default class SimpleToken extends Token {
+    private value;
+    private bitCount;
+    constructor(previous: Token, value: int, bitCount: int);
+    /**
+     * @Override
+     */
+    appendTo(bitArray: BitArray, text: Uint8Array): void;
+    add(value: int, bitCount: int): Token;
+    addBinaryShift(start: int, byteCount: int): Token;
+    /**
+     * @Override
+     */
+    toString(): String;
+}

package/template/node_modules/@zxing/library/esm/core/aztec/encoder/SimpleToken.js

@@ -0,0 +1,64 @@
+/*
+* 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 __extends = (this && this.__extends) || (function () {
+    var extendStatics = function (d, b) {
+        extendStatics = Object.setPrototypeOf ||
+            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
+            function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };
+        return extendStatics(d, b);
+    };
+    return function (d, b) {
+        extendStatics(d, b);
+        function __() { this.constructor = d; }
+        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
+    };
+})();
+import Token from './Token';
+import Integer from '../../util/Integer';
+var SimpleToken = /** @class */ (function (_super) {
+    __extends(SimpleToken, _super);
+    function SimpleToken(previous, value, bitCount) {
+        var _this = _super.call(this, previous) || this;
+        _this.value = value;
+        _this.bitCount = bitCount;
+        return _this;
+    }
+    /**
+     * @Override
+     */
+    SimpleToken.prototype.appendTo = function (bitArray, text) {
+        bitArray.appendBits(this.value, this.bitCount);
+    };
+    SimpleToken.prototype.add = function (value, bitCount) {
+        return new SimpleToken(this, value, bitCount);
+    };
+    SimpleToken.prototype.addBinaryShift = function (start, byteCount) {
+        // no-op can't binary shift a simple token
+        console.warn('addBinaryShift on SimpleToken, this simply returns a copy of this token');
+        return new SimpleToken(this, start, byteCount);
+    };
+    /**
+     * @Override
+     */
+    SimpleToken.prototype.toString = function () {
+        var value = this.value & ((1 << this.bitCount) - 1);
+        value |= 1 << this.bitCount;
+        return '<' + Integer.toBinaryString(value | (1 << this.bitCount)).substring(1) + '>';
+    };
+    return SimpleToken;
+}(Token));
+export default SimpleToken;
+//# sourceMappingURL=SimpleToken.js.map

package/template/node_modules/@zxing/library/esm/core/aztec/encoder/SimpleToken.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"SimpleToken.js","sourceRoot":"","sources":["../../../../../src/core/aztec/encoder/SimpleToken.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;EAcE;;;;;;;;;;;;;;AAOF,OAAO,KAAK,MAAM,SAAS,CAAC;AAC5B,OAAO,OAAO,MAAM,oBAAoB,CAAC;AAIzC;IAAmD,+BAAK;IAMtD,qBAAY,QAAe,EAAE,KAAU,EAAE,QAAa;QAAtD,YACE,kBAAM,QAAQ,CAAC,SAGhB;QAFC,KAAI,CAAC,KAAK,GAAU,KAAK,CAAC;QAC1B,KAAI,CAAC,QAAQ,GAAU,QAAQ,CAAC;;IAClC,CAAC;IAED;;OAEG;IACH,8BAAQ,GAAR,UAAS,QAAkB,EAAE,IAA0B;QACrD,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IACjD,CAAC;IAEgB,yBAAG,GAApB,UAAqB,KAAU,EAAE,QAAa;QAC5C,OAAO,IAAI,WAAW,CAAC,IAAI,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;IAChD,CAAC;IAEgB,oCAAc,GAA/B,UAAgC,KAAU,EAAE,SAAc;QACxD,0CAA0C;QAC1C,OAAO,CAAC,IAAI,CAAC,yEAAyE,CAAC,CAAC;QACxF,OAAO,IAAI,WAAW,CAAC,IAAI,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;IACjD,CAAC;IAED;;OAEG;IACI,8BAAQ,GAAf;QACE,IAAI,KAAK,GAAQ,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;QACzD,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC;QAC5B,OAAO,GAAG,GAAG,OAAO,CAAC,cAAc,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;IACvF,CAAC;IAEH,kBAAC;AAAD,CAAC,AAtCD,CAAmD,KAAK,GAsCvD"}

package/template/node_modules/@zxing/library/esm/core/aztec/encoder/State.d.ts

@@ -0,0 +1,30 @@
+import BitArray from '../../common/BitArray';
+import Token from './Token';
+import { int } from '../../../customTypings';
+/**
+ * State represents all information about a sequence necessary to generate the current output.
+ * Note that a state is immutable.
+ */
+export default class State {
+    static INITIAL_STATE: State;
+    private mode;
+    private token;
+    private binaryShiftByteCount;
+    private bitCount;
+    private constructor();
+    getMode(): int;
+    getToken(): Token;
+    getBinaryShiftByteCount(): int;
+    getBitCount(): int;
+    latchAndAppend(mode: int, value: int): State;
+    shiftAndAppend(mode: int, value: int): State;
+    addBinaryShiftChar(index: int): State;
+    endBinaryShift(index: int): State;
+    isBetterThanOrEqualTo(other: State): boolean;
+    toBitArray(text: Uint8Array): BitArray;
+    /**
+     * @Override
+     */
+    toString(): String;
+    private static calculateBinaryShiftCost;
+}