@solar-taro/ui-sun 1.6.4 → 2.0.0

package/index53.js

@@ -1,545 +1,528 @@
-import { commonjsGlobal as X } from "./index47.js";
-import { __module as m } from "./index65.js";
-import { __require as A } from "./index49.js";
-import { __require as W } from "./index52.js";
-var B;
-function j() {
-  return B ? m.exports : (B = 1, function(S, L) {
-    (function(u, v, c) {
-      S.exports = v(A(), W());
-    })(X, function(u) {
-      u.lib.Cipher || function(v) {
-        var c = u, s = c.lib, p = s.Base, h = s.WordArray, y = s.BufferedBlockAlgorithm, x = c.enc;
-        x.Utf8;
-        var C = x.Base64, g = c.algo, k = g.EvpKDF, f = s.Cipher = y.extend({
-          /**
-           * Configuration options.
-           *
-           * @property {WordArray} iv The IV to use for this operation.
-           */
-          cfg: p.extend(),
-          /**
-           * Creates this cipher in encryption mode.
-           *
-           * @param {WordArray} key The key.
-           * @param {Object} cfg (Optional) The configuration options to use for this operation.
-           *
-           * @return {Cipher} A cipher instance.
-           *
-           * @static
-           *
-           * @example
-           *
-           *     var cipher = CryptoJS.algo.AES.createEncryptor(keyWordArray, { iv: ivWordArray });
-           */
-          createEncryptor: function(e, t) {
-            return this.create(this._ENC_XFORM_MODE, e, t);
-          },
-          /**
-           * Creates this cipher in decryption mode.
-           *
-           * @param {WordArray} key The key.
-           * @param {Object} cfg (Optional) The configuration options to use for this operation.
-           *
-           * @return {Cipher} A cipher instance.
-           *
-           * @static
-           *
-           * @example
-           *
-           *     var cipher = CryptoJS.algo.AES.createDecryptor(keyWordArray, { iv: ivWordArray });
-           */
-          createDecryptor: function(e, t) {
-            return this.create(this._DEC_XFORM_MODE, e, t);
-          },
-          /**
-           * Initializes a newly created cipher.
-           *
-           * @param {number} xformMode Either the encryption or decryption transormation mode constant.
-           * @param {WordArray} key The key.
-           * @param {Object} cfg (Optional) The configuration options to use for this operation.
-           *
-           * @example
-           *
-           *     var cipher = CryptoJS.algo.AES.create(CryptoJS.algo.AES._ENC_XFORM_MODE, keyWordArray, { iv: ivWordArray });
-           */
-          init: function(e, t, i) {
-            this.cfg = this.cfg.extend(i), this._xformMode = e, this._key = t, this.reset();
-          },
-          /**
-           * Resets this cipher to its initial state.
-           *
-           * @example
-           *
-           *     cipher.reset();
-           */
-          reset: function() {
-            y.reset.call(this), this._doReset();
-          },
-          /**
-           * Adds data to be encrypted or decrypted.
-           *
-           * @param {WordArray|string} dataUpdate The data to encrypt or decrypt.
-           *
-           * @return {WordArray} The data after processing.
-           *
-           * @example
-           *
-           *     var encrypted = cipher.process('data');
-           *     var encrypted = cipher.process(wordArray);
-           */
-          process: function(e) {
-            return this._append(e), this._process();
-          },
-          /**
-           * Finalizes the encryption or decryption process.
-           * Note that the finalize operation is effectively a destructive, read-once operation.
-           *
-           * @param {WordArray|string} dataUpdate The final data to encrypt or decrypt.
-           *
-           * @return {WordArray} The data after final processing.
-           *
-           * @example
-           *
-           *     var encrypted = cipher.finalize();
-           *     var encrypted = cipher.finalize('data');
-           *     var encrypted = cipher.finalize(wordArray);
-           */
-          finalize: function(e) {
-            e && this._append(e);
-            var t = this._doFinalize();
-            return t;
-          },
-          keySize: 128 / 32,
-          ivSize: 128 / 32,
-          _ENC_XFORM_MODE: 1,
-          _DEC_XFORM_MODE: 2,
-          /**
-           * Creates shortcut functions to a cipher's object interface.
-           *
-           * @param {Cipher} cipher The cipher to create a helper for.
-           *
-           * @return {Object} An object with encrypt and decrypt shortcut functions.
-           *
-           * @static
-           *
-           * @example
-           *
-           *     var AES = CryptoJS.lib.Cipher._createHelper(CryptoJS.algo.AES);
-           */
-          _createHelper: /* @__PURE__ */ function() {
-            function e(t) {
-              return typeof t == "string" ? q : l;
-            }
-            return function(t) {
-              return {
-                encrypt: function(i, r, n) {
-                  return e(r).encrypt(t, i, r, n);
-                },
-                decrypt: function(i, r, n) {
-                  return e(r).decrypt(t, i, r, n);
-                }
-              };
-            };
-          }()
-        });
-        s.StreamCipher = f.extend({
-          _doFinalize: function() {
-            var e = this._process(!0);
-            return e;
-          },
-          blockSize: 1
-        });
-        var z = c.mode = {}, E = s.BlockCipherMode = p.extend({
-          /**
-           * Creates this mode for encryption.
-           *
-           * @param {Cipher} cipher A block cipher instance.
-           * @param {Array} iv The IV words.
-           *
-           * @static
-           *
-           * @example
-           *
-           *     var mode = CryptoJS.mode.CBC.createEncryptor(cipher, iv.words);
-           */
-          createEncryptor: function(e, t) {
-            return this.Encryptor.create(e, t);
-          },
-          /**
-           * Creates this mode for decryption.
-           *
-           * @param {Cipher} cipher A block cipher instance.
-           * @param {Array} iv The IV words.
-           *
-           * @static
-           *
-           * @example
-           *
-           *     var mode = CryptoJS.mode.CBC.createDecryptor(cipher, iv.words);
-           */
-          createDecryptor: function(e, t) {
-            return this.Decryptor.create(e, t);
-          },
-          /**
-           * Initializes a newly created mode.
-           *
-           * @param {Cipher} cipher A block cipher instance.
-           * @param {Array} iv The IV words.
-           *
-           * @example
-           *
-           *     var mode = CryptoJS.mode.CBC.Encryptor.create(cipher, iv.words);
-           */
-          init: function(e, t) {
-            this._cipher = e, this._iv = t;
-          }
-        }), b = z.CBC = function() {
-          var e = E.extend();
-          e.Encryptor = e.extend({
-            /**
-             * Processes the data block at offset.
-             *
-             * @param {Array} words The data words to operate on.
-             * @param {number} offset The offset where the block starts.
-             *
-             * @example
-             *
-             *     mode.processBlock(data.words, offset);
-             */
-            processBlock: function(i, r) {
-              var n = this._cipher, a = n.blockSize;
-              t.call(this, i, r, a), n.encryptBlock(i, r), this._prevBlock = i.slice(r, r + a);
-            }
-          }), e.Decryptor = e.extend({
-            /**
-             * Processes the data block at offset.
-             *
-             * @param {Array} words The data words to operate on.
-             * @param {number} offset The offset where the block starts.
-             *
-             * @example
-             *
-             *     mode.processBlock(data.words, offset);
-             */
-            processBlock: function(i, r) {
-              var n = this._cipher, a = n.blockSize, o = i.slice(r, r + a);
-              n.decryptBlock(i, r), t.call(this, i, r, a), this._prevBlock = o;
-            }
-          });
-          function t(i, r, n) {
-            var a, o = this._iv;
-            o ? (a = o, this._iv = v) : a = this._prevBlock;
-            for (var d = 0; d < n; d++)
-              i[r + d] ^= a[d];
-          }
-          return e;
-        }(), D = c.pad = {}, M = D.Pkcs7 = {
-          /**
-           * Pads data using the algorithm defined in PKCS #5/7.
-           *
-           * @param {WordArray} data The data to pad.
-           * @param {number} blockSize The multiple that the data should be padded to.
-           *
-           * @static
-           *
-           * @example
-           *
-           *     CryptoJS.pad.Pkcs7.pad(wordArray, 4);
-           */
-          pad: function(e, t) {
-            for (var i = t * 4, r = i - e.sigBytes % i, n = r << 24 | r << 16 | r << 8 | r, a = [], o = 0; o < r; o += 4)
-              a.push(n);
-            var d = h.create(a, r);
-            e.concat(d);
-          },
-          /**
-           * Unpads data that had been padded using the algorithm defined in PKCS #5/7.
-           *
-           * @param {WordArray} data The data to unpad.
-           *
-           * @static
-           *
-           * @example
-           *
-           *     CryptoJS.pad.Pkcs7.unpad(wordArray);
-           */
-          unpad: function(e) {
-            var t = e.words[e.sigBytes - 1 >>> 2] & 255;
-            e.sigBytes -= t;
-          }
-        };
-        s.BlockCipher = f.extend({
-          /**
-           * Configuration options.
-           *
-           * @property {Mode} mode The block mode to use. Default: CBC
-           * @property {Padding} padding The padding strategy to use. Default: Pkcs7
-           */
-          cfg: f.cfg.extend({
-            mode: b,
-            padding: M
-          }),
-          reset: function() {
-            var e;
-            f.reset.call(this);
-            var t = this.cfg, i = t.iv, r = t.mode;
-            this._xformMode == this._ENC_XFORM_MODE ? e = r.createEncryptor : (e = r.createDecryptor, this._minBufferSize = 1), this._mode && this._mode.__creator == e ? this._mode.init(this, i && i.words) : (this._mode = e.call(r, this, i && i.words), this._mode.__creator = e);
-          },
-          _doProcessBlock: function(e, t) {
-            this._mode.processBlock(e, t);
-          },
-          _doFinalize: function() {
-            var e, t = this.cfg.padding;
-            return this._xformMode == this._ENC_XFORM_MODE ? (t.pad(this._data, this.blockSize), e = this._process(!0)) : (e = this._process(!0), t.unpad(e)), e;
-          },
-          blockSize: 128 / 32
-        });
-        var _ = s.CipherParams = p.extend({
-          /**
-           * Initializes a newly created cipher params object.
-           *
-           * @param {Object} cipherParams An object with any of the possible cipher parameters.
-           *
-           * @example
-           *
-           *     var cipherParams = CryptoJS.lib.CipherParams.create({
-           *         ciphertext: ciphertextWordArray,
-           *         key: keyWordArray,
-           *         iv: ivWordArray,
-           *         salt: saltWordArray,
-           *         algorithm: CryptoJS.algo.AES,
-           *         mode: CryptoJS.mode.CBC,
-           *         padding: CryptoJS.pad.PKCS7,
-           *         blockSize: 4,
-           *         formatter: CryptoJS.format.OpenSSL
-           *     });
-           */
-          init: function(e) {
-            this.mixIn(e);
-          },
-          /**
-           * Converts this cipher params object to a string.
-           *
-           * @param {Format} formatter (Optional) The formatting strategy to use.
-           *
-           * @return {string} The stringified cipher params.
-           *
-           * @throws Error If neither the formatter nor the default formatter is set.
-           *
-           * @example
-           *
-           *     var string = cipherParams + '';
-           *     var string = cipherParams.toString();
-           *     var string = cipherParams.toString(CryptoJS.format.OpenSSL);
-           */
-          toString: function(e) {
-            return (e || this.formatter).stringify(this);
-          }
-        }), O = c.format = {}, P = O.OpenSSL = {
-          /**
-           * Converts a cipher params object to an OpenSSL-compatible string.
-           *
-           * @param {CipherParams} cipherParams The cipher params object.
-           *
-           * @return {string} The OpenSSL-compatible string.
-           *
-           * @static
-           *
-           * @example
-           *
-           *     var openSSLString = CryptoJS.format.OpenSSL.stringify(cipherParams);
-           */
-          stringify: function(e) {
-            var t, i = e.ciphertext, r = e.salt;
-            return r ? t = h.create([1398893684, 1701076831]).concat(r).concat(i) : t = i, t.toString(C);
-          },
-          /**
-           * Converts an OpenSSL-compatible string to a cipher params object.
-           *
-           * @param {string} openSSLStr The OpenSSL-compatible string.
-           *
-           * @return {CipherParams} The cipher params object.
-           *
-           * @static
-           *
-           * @example
-           *
-           *     var cipherParams = CryptoJS.format.OpenSSL.parse(openSSLString);
-           */
-          parse: function(e) {
-            var t, i = C.parse(e), r = i.words;
-            return r[0] == 1398893684 && r[1] == 1701076831 && (t = h.create(r.slice(2, 4)), r.splice(0, 4), i.sigBytes -= 16), _.create({ ciphertext: i, salt: t });
-          }
-        }, l = s.SerializableCipher = p.extend({
-          /**
-           * Configuration options.
-           *
-           * @property {Formatter} format The formatting strategy to convert cipher param objects to and from a string. Default: OpenSSL
-           */
-          cfg: p.extend({
-            format: P
-          }),
-          /**
-           * Encrypts a message.
-           *
-           * @param {Cipher} cipher The cipher algorithm to use.
-           * @param {WordArray|string} message The message to encrypt.
-           * @param {WordArray} key The key.
-           * @param {Object} cfg (Optional) The configuration options to use for this operation.
-           *
-           * @return {CipherParams} A cipher params object.
-           *
-           * @static
-           *
-           * @example
-           *
-           *     var ciphertextParams = CryptoJS.lib.SerializableCipher.encrypt(CryptoJS.algo.AES, message, key);
-           *     var ciphertextParams = CryptoJS.lib.SerializableCipher.encrypt(CryptoJS.algo.AES, message, key, { iv: iv });
-           *     var ciphertextParams = CryptoJS.lib.SerializableCipher.encrypt(CryptoJS.algo.AES, message, key, { iv: iv, format: CryptoJS.format.OpenSSL });
-           */
-          encrypt: function(e, t, i, r) {
-            r = this.cfg.extend(r);
-            var n = e.createEncryptor(i, r), a = n.finalize(t), o = n.cfg;
-            return _.create({
-              ciphertext: a,
-              key: i,
-              iv: o.iv,
-              algorithm: e,
-              mode: o.mode,
-              padding: o.padding,
-              blockSize: e.blockSize,
-              formatter: r.format
-            });
-          },
-          /**
-           * Decrypts serialized ciphertext.
-           *
-           * @param {Cipher} cipher The cipher algorithm to use.
-           * @param {CipherParams|string} ciphertext The ciphertext to decrypt.
-           * @param {WordArray} key The key.
-           * @param {Object} cfg (Optional) The configuration options to use for this operation.
-           *
-           * @return {WordArray} The plaintext.
-           *
-           * @static
-           *
-           * @example
-           *
-           *     var plaintext = CryptoJS.lib.SerializableCipher.decrypt(CryptoJS.algo.AES, formattedCiphertext, key, { iv: iv, format: CryptoJS.format.OpenSSL });
-           *     var plaintext = CryptoJS.lib.SerializableCipher.decrypt(CryptoJS.algo.AES, ciphertextParams, key, { iv: iv, format: CryptoJS.format.OpenSSL });
-           */
-          decrypt: function(e, t, i, r) {
-            r = this.cfg.extend(r), t = this._parse(t, r.format);
-            var n = e.createDecryptor(i, r).finalize(t.ciphertext);
-            return n;
-          },
-          /**
-           * Converts serialized ciphertext to CipherParams,
-           * else assumed CipherParams already and returns ciphertext unchanged.
-           *
-           * @param {CipherParams|string} ciphertext The ciphertext.
-           * @param {Formatter} format The formatting strategy to use to parse serialized ciphertext.
-           *
-           * @return {CipherParams} The unserialized ciphertext.
-           *
-           * @static
-           *
-           * @example
-           *
-           *     var ciphertextParams = CryptoJS.lib.SerializableCipher._parse(ciphertextStringOrParams, format);
-           */
-          _parse: function(e, t) {
-            return typeof e == "string" ? t.parse(e, this) : e;
-          }
-        }), F = c.kdf = {}, R = F.OpenSSL = {
-          /**
-           * Derives a key and IV from a password.
-           *
-           * @param {string} password The password to derive from.
-           * @param {number} keySize The size in words of the key to generate.
-           * @param {number} ivSize The size in words of the IV to generate.
-           * @param {WordArray|string} salt (Optional) A 64-bit salt to use. If omitted, a salt will be generated randomly.
-           *
-           * @return {CipherParams} A cipher params object with the key, IV, and salt.
-           *
-           * @static
-           *
-           * @example
-           *
-           *     var derivedParams = CryptoJS.kdf.OpenSSL.execute('Password', 256/32, 128/32);
-           *     var derivedParams = CryptoJS.kdf.OpenSSL.execute('Password', 256/32, 128/32, 'saltsalt');
-           */
-          execute: function(e, t, i, r, n) {
-            if (r || (r = h.random(64 / 8)), n)
-              var a = k.create({ keySize: t + i, hasher: n }).compute(e, r);
-            else
-              var a = k.create({ keySize: t + i }).compute(e, r);
-            var o = h.create(a.words.slice(t), i * 4);
-            return a.sigBytes = t * 4, _.create({ key: a, iv: o, salt: r });
-          }
-        }, q = s.PasswordBasedCipher = l.extend({
-          /**
-           * Configuration options.
-           *
-           * @property {KDF} kdf The key derivation function to use to generate a key and IV from a password. Default: OpenSSL
-           */
-          cfg: l.cfg.extend({
-            kdf: R
-          }),
-          /**
-           * Encrypts a message using a password.
-           *
-           * @param {Cipher} cipher The cipher algorithm to use.
-           * @param {WordArray|string} message The message to encrypt.
-           * @param {string} password The password.
-           * @param {Object} cfg (Optional) The configuration options to use for this operation.
-           *
-           * @return {CipherParams} A cipher params object.
-           *
-           * @static
-           *
-           * @example
-           *
-           *     var ciphertextParams = CryptoJS.lib.PasswordBasedCipher.encrypt(CryptoJS.algo.AES, message, 'password');
-           *     var ciphertextParams = CryptoJS.lib.PasswordBasedCipher.encrypt(CryptoJS.algo.AES, message, 'password', { format: CryptoJS.format.OpenSSL });
-           */
-          encrypt: function(e, t, i, r) {
-            r = this.cfg.extend(r);
-            var n = r.kdf.execute(i, e.keySize, e.ivSize, r.salt, r.hasher);
-            r.iv = n.iv;
-            var a = l.encrypt.call(this, e, t, n.key, r);
-            return a.mixIn(n), a;
-          },
-          /**
-           * Decrypts serialized ciphertext using a password.
-           *
-           * @param {Cipher} cipher The cipher algorithm to use.
-           * @param {CipherParams|string} ciphertext The ciphertext to decrypt.
-           * @param {string} password The password.
-           * @param {Object} cfg (Optional) The configuration options to use for this operation.
-           *
-           * @return {WordArray} The plaintext.
-           *
-           * @static
-           *
-           * @example
-           *
-           *     var plaintext = CryptoJS.lib.PasswordBasedCipher.decrypt(CryptoJS.algo.AES, formattedCiphertext, 'password', { format: CryptoJS.format.OpenSSL });
-           *     var plaintext = CryptoJS.lib.PasswordBasedCipher.decrypt(CryptoJS.algo.AES, ciphertextParams, 'password', { format: CryptoJS.format.OpenSSL });
-           */
-          decrypt: function(e, t, i, r) {
-            r = this.cfg.extend(r), t = this._parse(t, r.format);
-            var n = r.kdf.execute(i, e.keySize, e.ivSize, t.salt, r.hasher);
-            r.iv = n.iv;
-            var a = l.decrypt.call(this, e, t, n.key, r);
-            return a;
-          }
-        });
-      }();
-    });
-  }(m), m.exports);
+const r = class r {
+  /*-- Constructor (low level) and fields --*/
+  // Creates a new QR Code with the given version number,
+  // error correction level, data codeword bytes, and mask number.
+  // This is a low-level API that most users should not use directly.
+  // A mid-level API is the encodeSegments() function.
+  constructor(t, s, e, i) {
+    if (this.version = t, this.errorCorrectionLevel = s, this.modules = [], this.isFunction = [], t < r.MIN_VERSION || t > r.MAX_VERSION)
+      throw new RangeError("Version value out of range");
+    if (i < -1 || i > 7)
+      throw new RangeError("Mask value out of range");
+    this.size = t * 4 + 17;
+    const o = [];
+    for (let n = 0; n < this.size; n++)
+      o.push(!1);
+    for (let n = 0; n < this.size; n++)
+      this.modules.push(o.slice()), this.isFunction.push(o.slice());
+    this.drawFunctionPatterns();
+    const a = this.addEccAndInterleave(e);
+    if (this.drawCodewords(a), i == -1) {
+      let n = 1e9;
+      for (let h = 0; h < 8; h++) {
+        this.applyMask(h), this.drawFormatBits(h);
+        const l = this.getPenaltyScore();
+        l < n && (i = h, n = l), this.applyMask(h);
+      }
+    }
+    E(0 <= i && i <= 7), this.mask = i, this.applyMask(i), this.drawFormatBits(i), this.isFunction = [];
+  }
+  /*-- Static factory functions (high level) --*/
+  // Returns a QR Code representing the given Unicode text string at the given error correction level.
+  // As a conservative upper bound, this function is guaranteed to succeed for strings that have 738 or fewer
+  // Unicode code points (not UTF-16 code units) if the low error correction level is used. The smallest possible
+  // QR Code version is automatically chosen for the output. The ECC level of the result may be higher than the
+  // ecl argument if it can be done without increasing the version.
+  static encodeText(t, s) {
+    const e = P.makeSegments(t);
+    return r.encodeSegments(e, s);
+  }
+  // Returns a QR Code representing the given binary data at the given error correction level.
+  // This function always encodes using the binary segment mode, not any text mode. The maximum number of
+  // bytes allowed is 2953. The smallest possible QR Code version is automatically chosen for the output.
+  // The ECC level of the result may be higher than the ecl argument if it can be done without increasing the version.
+  static encodeBinary(t, s) {
+    const e = P.makeBytes(t);
+    return r.encodeSegments([e], s);
+  }
+  /*-- Static factory functions (mid level) --*/
+  // Returns a QR Code representing the given segments with the given encoding parameters.
+  // The smallest possible QR Code version within the given range is automatically
+  // chosen for the output. Iff boostEcl is true, then the ECC level of the result
+  // may be higher than the ecl argument if it can be done without increasing the
+  // version. The mask number is either between 0 to 7 (inclusive) to force that
+  // mask, or -1 to automatically choose an appropriate mask (which may be slow).
+  // This function allows the user to create a custom sequence of segments that switches
+  // between modes (such as alphanumeric and byte) to encode text in less space.
+  // This is a mid-level API; the high-level API is encodeText() and encodeBinary().
+  static encodeSegments(t, s, e = 1, i = 40, o = -1, a = !0) {
+    if (!(r.MIN_VERSION <= e && e <= i && i <= r.MAX_VERSION) || o < -1 || o > 7)
+      throw new RangeError("Invalid value");
+    let n, h;
+    for (n = e; ; n++) {
+      const c = r.getNumDataCodewords(n, s) * 8, d = P.getTotalBits(t, n);
+      if (d <= c) {
+        h = d;
+        break;
+      }
+      if (n >= i)
+        throw new RangeError("Data too long");
+    }
+    for (const c of [p.MEDIUM, p.QUARTILE, p.HIGH])
+      a && h <= r.getNumDataCodewords(n, c) * 8 && (s = c);
+    const l = [];
+    for (const c of t) {
+      f(c.mode.modeBits, 4, l), f(c.numChars, c.mode.numCharCountBits(n), l);
+      for (const d of c.getData())
+        l.push(d);
+    }
+    E(l.length == h);
+    const C = r.getNumDataCodewords(n, s) * 8;
+    E(l.length <= C), f(0, Math.min(4, C - l.length), l), f(0, (8 - l.length % 8) % 8, l), E(l.length % 8 == 0);
+    for (let c = 236; l.length < C; c ^= 253)
+      f(c, 8, l);
+    const M = [];
+    for (; M.length * 8 < l.length; )
+      M.push(0);
+    return l.forEach((c, d) => M[d >>> 3] |= c << 7 - (d & 7)), new r(n, s, M, o);
+  }
+  /*-- Accessor methods --*/
+  // Returns the color of the module (pixel) at the given coordinates, which is false
+  // for light or true for dark. The top left corner has the coordinates (x=0, y=0).
+  // If the given coordinates are out of bounds, then false (light) is returned.
+  getModule(t, s) {
+    return 0 <= t && t < this.size && 0 <= s && s < this.size && this.modules[s][t];
+  }
+  /*-- Private helper methods for constructor: Drawing function modules --*/
+  // Reads this object's version field, and draws and marks all function modules.
+  drawFunctionPatterns() {
+    for (let e = 0; e < this.size; e++)
+      this.setFunctionModule(6, e, e % 2 == 0), this.setFunctionModule(e, 6, e % 2 == 0);
+    this.drawFinderPattern(3, 3), this.drawFinderPattern(this.size - 4, 3), this.drawFinderPattern(3, this.size - 4);
+    const t = this.getAlignmentPatternPositions(), s = t.length;
+    for (let e = 0; e < s; e++)
+      for (let i = 0; i < s; i++)
+        e == 0 && i == 0 || e == 0 && i == s - 1 || e == s - 1 && i == 0 || this.drawAlignmentPattern(t[e], t[i]);
+    this.drawFormatBits(0), this.drawVersion();
+  }
+  // Draws two copies of the format bits (with its own error correction code)
+  // based on the given mask and this object's error correction level field.
+  drawFormatBits(t) {
+    const s = this.errorCorrectionLevel.formatBits << 3 | t;
+    let e = s;
+    for (let o = 0; o < 10; o++)
+      e = e << 1 ^ (e >>> 9) * 1335;
+    const i = (s << 10 | e) ^ 21522;
+    E(i >>> 15 == 0);
+    for (let o = 0; o <= 5; o++)
+      this.setFunctionModule(8, o, g(i, o));
+    this.setFunctionModule(8, 7, g(i, 6)), this.setFunctionModule(8, 8, g(i, 7)), this.setFunctionModule(7, 8, g(i, 8));
+    for (let o = 9; o < 15; o++)
+      this.setFunctionModule(14 - o, 8, g(i, o));
+    for (let o = 0; o < 8; o++)
+      this.setFunctionModule(this.size - 1 - o, 8, g(i, o));
+    for (let o = 8; o < 15; o++)
+      this.setFunctionModule(8, this.size - 15 + o, g(i, o));
+    this.setFunctionModule(8, this.size - 8, !0);
+  }
+  // Draws two copies of the version bits (with its own error correction code),
+  // based on this object's version field, iff 7 <= version <= 40.
+  drawVersion() {
+    if (this.version < 7)
+      return;
+    let t = this.version;
+    for (let e = 0; e < 12; e++)
+      t = t << 1 ^ (t >>> 11) * 7973;
+    const s = this.version << 12 | t;
+    E(s >>> 18 == 0);
+    for (let e = 0; e < 18; e++) {
+      const i = g(s, e), o = this.size - 11 + e % 3, a = Math.floor(e / 3);
+      this.setFunctionModule(o, a, i), this.setFunctionModule(a, o, i);
+    }
+  }
+  // Draws a 9*9 finder pattern including the border separator,
+  // with the center module at (x, y). Modules can be out of bounds.
+  drawFinderPattern(t, s) {
+    for (let e = -4; e <= 4; e++)
+      for (let i = -4; i <= 4; i++) {
+        const o = Math.max(Math.abs(i), Math.abs(e)), a = t + i, n = s + e;
+        0 <= a && a < this.size && 0 <= n && n < this.size && this.setFunctionModule(a, n, o != 2 && o != 4);
+      }
+  }
+  // Draws a 5*5 alignment pattern, with the center module
+  // at (x, y). All modules must be in bounds.
+  drawAlignmentPattern(t, s) {
+    for (let e = -2; e <= 2; e++)
+      for (let i = -2; i <= 2; i++)
+        this.setFunctionModule(t + i, s + e, Math.max(Math.abs(i), Math.abs(e)) != 1);
+  }
+  // Sets the color of a module and marks it as a function module.
+  // Only used by the constructor. Coordinates must be in bounds.
+  setFunctionModule(t, s, e) {
+    this.modules[s][t] = e, this.isFunction[s][t] = !0;
+  }
+  /*-- Private helper methods for constructor: Codewords and masking --*/
+  // Returns a new byte string representing the given data with the appropriate error correction
+  // codewords appended to it, based on this object's version and error correction level.
+  addEccAndInterleave(t) {
+    const s = this.version, e = this.errorCorrectionLevel;
+    if (t.length != r.getNumDataCodewords(s, e))
+      throw new RangeError("Invalid argument");
+    const i = r.NUM_ERROR_CORRECTION_BLOCKS[e.ordinal][s], o = r.ECC_CODEWORDS_PER_BLOCK[e.ordinal][s], a = Math.floor(r.getNumRawDataModules(s) / 8), n = i - a % i, h = Math.floor(a / i), l = [], C = r.reedSolomonComputeDivisor(o);
+    for (let c = 0, d = 0; c < i; c++) {
+      const R = t.slice(d, d + h - o + (c < n ? 0 : 1));
+      d += R.length;
+      const b = r.reedSolomonComputeRemainder(R, C);
+      c < n && R.push(0), l.push(R.concat(b));
+    }
+    const M = [];
+    for (let c = 0; c < l[0].length; c++)
+      l.forEach((d, R) => {
+        (c != h - o || R >= n) && M.push(d[c]);
+      });
+    return E(M.length == a), M;
+  }
+  // Draws the given sequence of 8-bit codewords (data and error correction) onto the entire
+  // data area of this QR Code. Function modules need to be marked off before this is called.
+  drawCodewords(t) {
+    if (t.length != Math.floor(r.getNumRawDataModules(this.version) / 8))
+      throw new RangeError("Invalid argument");
+    let s = 0;
+    for (let e = this.size - 1; e >= 1; e -= 2) {
+      e == 6 && (e = 5);
+      for (let i = 0; i < this.size; i++)
+        for (let o = 0; o < 2; o++) {
+          const a = e - o, h = (e + 1 & 2) == 0 ? this.size - 1 - i : i;
+          !this.isFunction[h][a] && s < t.length * 8 && (this.modules[h][a] = g(t[s >>> 3], 7 - (s & 7)), s++);
+        }
+    }
+    E(s == t.length * 8);
+  }
+  // XORs the codeword modules in this QR Code with the given mask pattern.
+  // The function modules must be marked and the codeword bits must be drawn
+  // before masking. Due to the arithmetic of XOR, calling applyMask() with
+  // the same mask value a second time will undo the mask. A final well-formed
+  // QR Code needs exactly one (not zero, two, etc.) mask applied.
+  applyMask(t) {
+    if (t < 0 || t > 7)
+      throw new RangeError("Mask value out of range");
+    for (let s = 0; s < this.size; s++)
+      for (let e = 0; e < this.size; e++) {
+        let i;
+        switch (t) {
+          case 0:
+            i = (e + s) % 2 == 0;
+            break;
+          case 1:
+            i = s % 2 == 0;
+            break;
+          case 2:
+            i = e % 3 == 0;
+            break;
+          case 3:
+            i = (e + s) % 3 == 0;
+            break;
+          case 4:
+            i = (Math.floor(e / 3) + Math.floor(s / 2)) % 2 == 0;
+            break;
+          case 5:
+            i = e * s % 2 + e * s % 3 == 0;
+            break;
+          case 6:
+            i = (e * s % 2 + e * s % 3) % 2 == 0;
+            break;
+          case 7:
+            i = ((e + s) % 2 + e * s % 3) % 2 == 0;
+            break;
+          default:
+            throw new Error("Unreachable");
+        }
+        !this.isFunction[s][e] && i && (this.modules[s][e] = !this.modules[s][e]);
+      }
+  }
+  // Calculates and returns the penalty score based on state of this QR Code's current modules.
+  // This is used by the automatic mask choice algorithm to find the mask pattern that yields the lowest score.
+  getPenaltyScore() {
+    let t = 0;
+    for (let o = 0; o < this.size; o++) {
+      let a = !1, n = 0;
+      const h = [0, 0, 0, 0, 0, 0, 0];
+      for (let l = 0; l < this.size; l++)
+        this.modules[o][l] == a ? (n++, n == 5 ? t += r.PENALTY_N1 : n > 5 && t++) : (this.finderPenaltyAddHistory(n, h), a || (t += this.finderPenaltyCountPatterns(h) * r.PENALTY_N3), a = this.modules[o][l], n = 1);
+      t += this.finderPenaltyTerminateAndCount(a, n, h) * r.PENALTY_N3;
+    }
+    for (let o = 0; o < this.size; o++) {
+      let a = !1, n = 0;
+      const h = [0, 0, 0, 0, 0, 0, 0];
+      for (let l = 0; l < this.size; l++)
+        this.modules[l][o] == a ? (n++, n == 5 ? t += r.PENALTY_N1 : n > 5 && t++) : (this.finderPenaltyAddHistory(n, h), a || (t += this.finderPenaltyCountPatterns(h) * r.PENALTY_N3), a = this.modules[l][o], n = 1);
+      t += this.finderPenaltyTerminateAndCount(a, n, h) * r.PENALTY_N3;
+    }
+    for (let o = 0; o < this.size - 1; o++)
+      for (let a = 0; a < this.size - 1; a++) {
+        const n = this.modules[o][a];
+        n == this.modules[o][a + 1] && n == this.modules[o + 1][a] && n == this.modules[o + 1][a + 1] && (t += r.PENALTY_N2);
+      }
+    let s = 0;
+    for (const o of this.modules)
+      s = o.reduce((a, n) => a + (n ? 1 : 0), s);
+    const e = this.size * this.size, i = Math.ceil(Math.abs(s * 20 - e * 10) / e) - 1;
+    return E(0 <= i && i <= 9), t += i * r.PENALTY_N4, E(0 <= t && t <= 2568888), t;
+  }
+  /*-- Private helper functions --*/
+  // Returns an ascending list of positions of alignment patterns for this version number.
+  // Each position is in the range [0,177), and are used on both the x and y axes.
+  // This could be implemented as lookup table of 40 variable-length lists of integers.
+  getAlignmentPatternPositions() {
+    if (this.version == 1)
+      return [];
+    {
+      const t = Math.floor(this.version / 7) + 2, s = Math.floor((this.version * 8 + t * 3 + 5) / (t * 4 - 4)) * 2, e = [6];
+      for (let i = this.size - 7; e.length < t; i -= s)
+        e.splice(1, 0, i);
+      return e;
+    }
+  }
+  // Returns the number of data bits that can be stored in a QR Code of the given version number, after
+  // all function modules are excluded. This includes remainder bits, so it might not be a multiple of 8.
+  // The result is in the range [208, 29648]. This could be implemented as a 40-entry lookup table.
+  static getNumRawDataModules(t) {
+    if (t < r.MIN_VERSION || t > r.MAX_VERSION)
+      throw new RangeError("Version number out of range");
+    let s = (16 * t + 128) * t + 64;
+    if (t >= 2) {
+      const e = Math.floor(t / 7) + 2;
+      s -= (25 * e - 10) * e - 55, t >= 7 && (s -= 36);
+    }
+    return E(208 <= s && s <= 29648), s;
+  }
+  // Returns the number of 8-bit data (i.e. not error correction) codewords contained in any
+  // QR Code of the given version number and error correction level, with remainder bits discarded.
+  // This stateless pure function could be implemented as a (40*4)-cell lookup table.
+  static getNumDataCodewords(t, s) {
+    return Math.floor(r.getNumRawDataModules(t) / 8) - r.ECC_CODEWORDS_PER_BLOCK[s.ordinal][t] * r.NUM_ERROR_CORRECTION_BLOCKS[s.ordinal][t];
+  }
+  // Returns a Reed-Solomon ECC generator polynomial for the given degree. This could be
+  // implemented as a lookup table over all possible parameter values, instead of as an algorithm.
+  static reedSolomonComputeDivisor(t) {
+    if (t < 1 || t > 255)
+      throw new RangeError("Degree out of range");
+    const s = [];
+    for (let i = 0; i < t - 1; i++)
+      s.push(0);
+    s.push(1);
+    let e = 1;
+    for (let i = 0; i < t; i++) {
+      for (let o = 0; o < s.length; o++)
+        s[o] = r.reedSolomonMultiply(s[o], e), o + 1 < s.length && (s[o] ^= s[o + 1]);
+      e = r.reedSolomonMultiply(e, 2);
+    }
+    return s;
+  }
+  // Returns the Reed-Solomon error correction codeword for the given data and divisor polynomials.
+  static reedSolomonComputeRemainder(t, s) {
+    const e = s.map((i) => 0);
+    for (const i of t) {
+      const o = i ^ e.shift();
+      e.push(0), s.forEach((a, n) => e[n] ^= r.reedSolomonMultiply(a, o));
+    }
+    return e;
+  }
+  // Returns the product of the two given field elements modulo GF(2^8/0x11D). The arguments and result
+  // are unsigned 8-bit integers. This could be implemented as a lookup table of 256*256 entries of uint8.
+  static reedSolomonMultiply(t, s) {
+    if (t >>> 8 || s >>> 8)
+      throw new RangeError("Byte out of range");
+    let e = 0;
+    for (let i = 7; i >= 0; i--)
+      e = e << 1 ^ (e >>> 7) * 285, e ^= (s >>> i & 1) * t;
+    return E(e >>> 8 == 0), e;
+  }
+  // Can only be called immediately after a light run is added, and
+  // returns either 0, 1, or 2. A helper function for getPenaltyScore().
+  finderPenaltyCountPatterns(t) {
+    const s = t[1];
+    E(s <= this.size * 3);
+    const e = s > 0 && t[2] == s && t[3] == s * 3 && t[4] == s && t[5] == s;
+    return (e && t[0] >= s * 4 && t[6] >= s ? 1 : 0) + (e && t[6] >= s * 4 && t[0] >= s ? 1 : 0);
+  }
+  // Must be called at the end of a line (row or column) of modules. A helper function for getPenaltyScore().
+  finderPenaltyTerminateAndCount(t, s, e) {
+    return t && (this.finderPenaltyAddHistory(s, e), s = 0), s += this.size, this.finderPenaltyAddHistory(s, e), this.finderPenaltyCountPatterns(e);
+  }
+  // Pushes the given value to the front and drops the last value. A helper function for getPenaltyScore().
+  finderPenaltyAddHistory(t, s) {
+    s[0] == 0 && (t += this.size), s.pop(), s.unshift(t);
+  }
+};
+r.MIN_VERSION = 1, r.MAX_VERSION = 40, r.PENALTY_N1 = 3, r.PENALTY_N2 = 3, r.PENALTY_N3 = 40, r.PENALTY_N4 = 10, r.ECC_CODEWORDS_PER_BLOCK = [
+  // Version: (note that index 0 is for padding, and is set to an illegal value)
+  //0,  1,  2,  3,  4,  5,  6,  7,  8,  9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40    Error correction level
+  [-1, 7, 10, 15, 20, 26, 18, 20, 24, 30, 18, 20, 24, 26, 30, 22, 24, 28, 30, 28, 28, 28, 28, 30, 30, 26, 28, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30],
+  // Low
+  [-1, 10, 16, 26, 18, 24, 16, 18, 22, 22, 26, 30, 22, 22, 24, 24, 28, 28, 26, 26, 26, 26, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28],
+  // Medium
+  [-1, 13, 22, 18, 26, 18, 24, 18, 22, 20, 24, 28, 26, 24, 20, 30, 24, 28, 28, 26, 30, 28, 30, 30, 30, 30, 28, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30],
+  // Quartile
+  [-1, 17, 28, 22, 16, 22, 28, 26, 26, 24, 28, 24, 28, 22, 24, 24, 30, 28, 28, 26, 28, 30, 24, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
+  // High
+], r.NUM_ERROR_CORRECTION_BLOCKS = [
+  // Version: (note that index 0 is for padding, and is set to an illegal value)
+  //0, 1, 2, 3, 4, 5, 6, 7, 8, 9,10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40    Error correction level
+  [-1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 4, 4, 4, 4, 4, 6, 6, 6, 6, 7, 8, 8, 9, 9, 10, 12, 12, 12, 13, 14, 15, 16, 17, 18, 19, 19, 20, 21, 22, 24, 25],
+  // Low
+  [-1, 1, 1, 1, 2, 2, 4, 4, 4, 5, 5, 5, 8, 9, 9, 10, 10, 11, 13, 14, 16, 17, 17, 18, 20, 21, 23, 25, 26, 28, 29, 31, 33, 35, 37, 38, 40, 43, 45, 47, 49],
+  // Medium
+  [-1, 1, 1, 2, 2, 4, 4, 6, 6, 8, 8, 8, 10, 12, 16, 12, 17, 16, 18, 21, 20, 23, 23, 25, 27, 29, 34, 34, 35, 38, 40, 43, 45, 48, 51, 53, 56, 59, 62, 65, 68],
+  // Quartile
+  [-1, 1, 1, 2, 4, 4, 4, 5, 6, 8, 8, 11, 11, 16, 16, 18, 16, 19, 21, 25, 25, 25, 34, 30, 32, 35, 37, 40, 42, 45, 48, 51, 54, 57, 60, 63, 66, 70, 74, 77, 81]
+  // High
+];
+let I = r;
+function f(A, t, s) {
+  if (t < 0 || t > 31 || A >>> t)
+    throw new RangeError("Value out of range");
+  for (let e = t - 1; e >= 0; e--)
+    s.push(A >>> e & 1);
+}
+function g(A, t) {
+  return (A >>> t & 1) != 0;
+}
+function E(A) {
+  if (!A)
+    throw new Error("Assertion error");
 }
+const u = class u {
+  /*-- Constructor (low level) and fields --*/
+  // Creates a new QR Code segment with the given attributes and data.
+  // The character count (numChars) must agree with the mode and the bit buffer length,
+  // but the constraint isn't checked. The given bit buffer is cloned and stored.
+  constructor(t, s, e) {
+    if (this.mode = t, this.numChars = s, this.bitData = e, s < 0)
+      throw new RangeError("Invalid argument");
+    this.bitData = e.slice();
+  }
+  /*-- Static factory functions (mid level) --*/
+  // Returns a segment representing the given binary data encoded in
+  // byte mode. All input byte arrays are acceptable. Any text string
+  // can be converted to UTF-8 bytes and encoded as a byte mode segment.
+  static makeBytes(t) {
+    const s = [];
+    for (const e of t)
+      f(e, 8, s);
+    return new u(N.BYTE, t.length, s);
+  }
+  // Returns a segment representing the given string of decimal digits encoded in numeric mode.
+  static makeNumeric(t) {
+    if (!u.isNumeric(t))
+      throw new RangeError("String contains non-numeric characters");
+    const s = [];
+    for (let e = 0; e < t.length; ) {
+      const i = Math.min(t.length - e, 3);
+      f(parseInt(t.substring(e, e + i), 10), i * 3 + 1, s), e += i;
+    }
+    return new u(N.NUMERIC, t.length, s);
+  }
+  // Returns a segment representing the given text string encoded in alphanumeric mode.
+  // The characters allowed are: 0 to 9, A to Z (uppercase only), space,
+  // dollar, percent, asterisk, plus, hyphen, period, slash, colon.
+  static makeAlphanumeric(t) {
+    if (!u.isAlphanumeric(t))
+      throw new RangeError("String contains unencodable characters in alphanumeric mode");
+    const s = [];
+    let e;
+    for (e = 0; e + 2 <= t.length; e += 2) {
+      let i = u.ALPHANUMERIC_CHARSET.indexOf(t.charAt(e)) * 45;
+      i += u.ALPHANUMERIC_CHARSET.indexOf(t.charAt(e + 1)), f(i, 11, s);
+    }
+    return e < t.length && f(u.ALPHANUMERIC_CHARSET.indexOf(t.charAt(e)), 6, s), new u(N.ALPHANUMERIC, t.length, s);
+  }
+  // Returns a new mutable list of zero or more segments to represent the given Unicode text string.
+  // The result may use various segment modes and switch modes to optimize the length of the bit stream.
+  static makeSegments(t) {
+    return t == "" ? [] : u.isNumeric(t) ? [u.makeNumeric(t)] : u.isAlphanumeric(t) ? [u.makeAlphanumeric(t)] : [u.makeBytes(u.toUtf8ByteArray(t))];
+  }
+  // Returns a segment representing an Extended Channel Interpretation
+  // (ECI) designator with the given assignment value.
+  static makeEci(t) {
+    const s = [];
+    if (t < 0)
+      throw new RangeError("ECI assignment value out of range");
+    if (t < 128)
+      f(t, 8, s);
+    else if (t < 16384)
+      f(2, 2, s), f(t, 14, s);
+    else if (t < 1e6)
+      f(6, 3, s), f(t, 21, s);
+    else
+      throw new RangeError("ECI assignment value out of range");
+    return new u(N.ECI, 0, s);
+  }
+  // Tests whether the given string can be encoded as a segment in numeric mode.
+  // A string is encodable iff each character is in the range 0 to 9.
+  static isNumeric(t) {
+    return u.NUMERIC_REGEX.test(t);
+  }
+  // Tests whether the given string can be encoded as a segment in alphanumeric mode.
+  // A string is encodable iff each character is in the following set: 0 to 9, A to Z
+  // (uppercase only), space, dollar, percent, asterisk, plus, hyphen, period, slash, colon.
+  static isAlphanumeric(t) {
+    return u.ALPHANUMERIC_REGEX.test(t);
+  }
+  /*-- Methods --*/
+  // Returns a new copy of the data bits of this segment.
+  getData() {
+    return this.bitData.slice();
+  }
+  // (Package-private) Calculates and returns the number of bits needed to encode the given segments at
+  // the given version. The result is infinity if a segment has too many characters to fit its length field.
+  static getTotalBits(t, s) {
+    let e = 0;
+    for (const i of t) {
+      const o = i.mode.numCharCountBits(s);
+      if (i.numChars >= 1 << o)
+        return 1 / 0;
+      e += 4 + o + i.bitData.length;
+    }
+    return e;
+  }
+  // Returns a new array of bytes representing the given string encoded in UTF-8.
+  static toUtf8ByteArray(t) {
+    t = encodeURI(t);
+    const s = [];
+    for (let e = 0; e < t.length; e++)
+      t.charAt(e) != "%" ? s.push(t.charCodeAt(e)) : (s.push(parseInt(t.substring(e + 1, e + 3), 16)), e += 2);
+    return s;
+  }
+};
+u.NUMERIC_REGEX = /^[0-9]*$/, u.ALPHANUMERIC_REGEX = /^[A-Z0-9 $%*+./:-]*$/, u.ALPHANUMERIC_CHARSET = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ $%*+-./:";
+let P = u;
+const w = class w {
+  // The QR Code can tolerate about 30% erroneous codewords
+  /*-- Constructor and fields --*/
+  constructor(t, s) {
+    this.ordinal = t, this.formatBits = s;
+  }
+};
+w.LOW = new w(0, 1), w.MEDIUM = new w(1, 0), w.QUARTILE = new w(2, 3), w.HIGH = new w(3, 2);
+let p = w;
+const m = class m {
+  /*-- Constructor and fields --*/
+  constructor(t, s) {
+    this.modeBits = t, this.numBitsCharCount = s;
+  }
+  /*-- Method --*/
+  // (Package-private) Returns the bit width of the character count field for a segment in
+  // this mode in a QR Code at the given version number. The result is in the range [0, 16].
+  numCharCountBits(t) {
+    return this.numBitsCharCount[Math.floor((t + 7) / 17)];
+  }
+};
+m.NUMERIC = new m(1, [10, 12, 14]), m.ALPHANUMERIC = new m(2, [9, 11, 13]), m.BYTE = new m(4, [8, 16, 16]), m.KANJI = new m(8, [8, 10, 12]), m.ECI = new m(7, [0, 0, 0]);
+let N = m;
 export {
-  j as __require
+  I as QrCode,
+  p as QrCodeEcc,
+  P as QrSegment,
+  N as QrSegmentMode
 };