@unicom-cloud/ui 0.8.152 → 0.8.153

package/qr-code/src/qrcodegen.js

@@ -1,938 +1,780 @@
-var p;
-((g) => {
-  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, i, s, e) {
-      if (this.version = t, this.errorCorrectionLevel = i, t < r.MIN_VERSION || t > r.MAX_VERSION)
-        throw new RangeError("Version value out of range");
-      if (e < -1 || e > 7) throw new RangeError("Mask value out of range");
-      this.size = t * 4 + 17;
-      const n = [];
-      for (let o = 0; o < this.size; o++) n.push(!1);
-      for (let o = 0; o < this.size; o++)
-        this.#t.push(n.slice()), this.#i.push(n.slice());
-      this.#a();
-      const a = this.#R(s);
-      if (this.#A(a), e == -1) {
-        let o = 1e9;
-        for (let f = 0; f < 8; f++) {
-          this.#c(f), this.#e(f);
-          const h = this.#b();
-          h < o && (e = f, o = h), this.#c(f);
-        }
-      }
-      w(0 <= e && e <= 7), this.mask = e, this.#c(e), this.#e(e), this.#i = [];
-    }
-    /*-- 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, i) {
-      const s = g.QrSegment.makeSegments(t);
-      return r.encodeSegments(s, i);
-    }
-    // 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, i) {
-      const s = g.QrSegment.makeBytes(t);
-      return r.encodeSegments([s], i);
-    }
-    /*-- 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, i, s = 1, e = 40, n = -1, a = !0) {
-      if (!(r.MIN_VERSION <= s && s <= e && e <= r.MAX_VERSION) || n < -1 || n > 7)
-        throw new RangeError("Invalid value");
-      let o, f;
-      for (o = s; ; o++) {
-        const u = r.#n(o, i) * 8, E = l.getTotalBits(t, o);
-        if (E <= u) {
-          f = E;
-          break;
-        }
-        if (o >= e)
-          throw new RangeError("Data too long");
-      }
-      for (const u of [
-        r.Ecc.MEDIUM,
-        r.Ecc.QUARTILE,
-        r.Ecc.HIGH
-      ])
-        a && f <= r.#n(o, u) * 8 && (i = u);
-      const h = [];
-      for (const u of t) {
-        c(u.mode.modeBits, 4, h), c(u.numChars, u.mode.numCharCountBits(o), h);
-        for (const E of u.getData()) h.push(E);
-      }
-      w(h.length == f);
-      const b = r.#n(o, i) * 8;
-      w(h.length <= b), c(0, Math.min(4, b - h.length), h), c(0, (8 - h.length % 8) % 8, h), w(h.length % 8 == 0);
-      for (let u = 236; h.length < b; u ^= 253)
-        c(u, 8, h);
-      const m = [];
-      for (; m.length * 8 < h.length; ) m.push(0);
-      return h.forEach(
-        (u, E) => m[E >>> 3] |= u << 7 - (E & 7)
-      ), new r(o, i, m, n);
-    }
-    // The modules of this QR Code (false = light, true = dark).
-    // Immutable after constructor finishes. Accessed through getModule().
-    #t = [];
-    // Indicates function modules that are not subjected to masking. Discarded when constructor finishes.
-    #i = [];
-    /*-- 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, i) {
-      return 0 <= t && t < this.size && 0 <= i && i < this.size && this.#t[i][t];
-    }
-    // Modified to expose modules for easy access
-    getModules() {
-      return this.#t;
-    }
-    /*-- Private helper methods for constructor: Drawing function modules --*/
-    // Reads this object's version field, and draws and marks all function modules.
-    #a() {
-      for (let s = 0; s < this.size; s++)
-        this.#s(6, s, s % 2 == 0), this.#s(s, 6, s % 2 == 0);
-      this.#h(3, 3), this.#h(this.size - 4, 3), this.#h(3, this.size - 4);
-      const t = this.#I(), i = t.length;
-      for (let s = 0; s < i; s++)
-        for (let e = 0; e < i; e++)
-          s == 0 && e == 0 || s == 0 && e == i - 1 || s == i - 1 && e == 0 || this.#p(t[s], t[e]);
-      this.#e(0), this.#m();
-    }
-    // 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.
-    #e(t) {
-      const i = this.errorCorrectionLevel.formatBits << 3 | t;
-      let s = i;
-      for (let n = 0; n < 10; n++) s = s << 1 ^ (s >>> 9) * 1335;
-      const e = (i << 10 | s) ^ 21522;
-      w(e >>> 15 == 0);
-      for (let n = 0; n <= 5; n++)
-        this.#s(8, n, M(e, n));
-      this.#s(8, 7, M(e, 6)), this.#s(8, 8, M(e, 7)), this.#s(7, 8, M(e, 8));
-      for (let n = 9; n < 15; n++)
-        this.#s(14 - n, 8, M(e, n));
-      for (let n = 0; n < 8; n++)
-        this.#s(this.size - 1 - n, 8, M(e, n));
-      for (let n = 8; n < 15; n++)
-        this.#s(8, this.size - 15 + n, M(e, n));
-      this.#s(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.
-    #m() {
-      if (this.version < 7) return;
-      let t = this.version;
-      for (let s = 0; s < 12; s++) t = t << 1 ^ (t >>> 11) * 7973;
-      const i = this.version << 12 | t;
-      w(i >>> 18 == 0);
-      for (let s = 0; s < 18; s++) {
-        const e = M(i, s), n = this.size - 11 + s % 3, a = Math.floor(s / 3);
-        this.#s(n, a, e), this.#s(a, n, e);
-      }
-    }
-    // Draws a 9*9 finder pattern including the border separator,
-    // with the center module at (x, y). Modules can be out of bounds.
-    #h(t, i) {
-      for (let s = -4; s <= 4; s++)
-        for (let e = -4; e <= 4; e++) {
-          const n = Math.max(Math.abs(e), Math.abs(s)), a = t + e, o = i + s;
-          0 <= a && a < this.size && 0 <= o && o < this.size && this.#s(a, o, n != 2 && n != 4);
-        }
-    }
-    // Draws a 5*5 alignment pattern, with the center module
-    // at (x, y). All modules must be in bounds.
-    #p(t, i) {
-      for (let s = -2; s <= 2; s++)
-        for (let e = -2; e <= 2; e++)
-          this.#s(
-            t + e,
-            i + s,
-            Math.max(Math.abs(e), Math.abs(s)) != 1
-          );
-    }
-    // Sets the color of a module and marks it as a function module.
-    // Only used by the constructor. Coordinates must be in bounds.
-    #s(t, i, s) {
-      this.#t[i][t] = s, this.#i[i][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.
-    #R(t) {
-      const i = this.version, s = this.errorCorrectionLevel;
-      if (t.length != r.#n(i, s))
-        throw new RangeError("Invalid argument");
-      const e = r.#M[s.ordinal][i], n = r.#g[s.ordinal][i], a = Math.floor(
-        r.#l(i) / 8
-      ), o = e - a % e, f = Math.floor(a / e), h = [], b = r.#N(n);
-      for (let u = 0, E = 0; u < e; u++) {
-        const A = t.slice(
-          E,
-          E + f - n + (u < o ? 0 : 1)
-        );
-        E += A.length;
-        const I = r.#d(
-          A,
-          b
-        );
-        u < o && A.push(0), h.push(A.concat(I));
-      }
-      const m = [];
-      for (let u = 0; u < h[0].length; u++)
-        h.forEach((E, A) => {
-          (u != f - n || A >= o) && m.push(E[u]);
-        });
-      return w(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.
-    #A(t) {
-      if (t.length != Math.floor(r.#l(this.version) / 8))
-        throw new RangeError("Invalid argument");
-      let i = 0;
-      for (let s = this.size - 1; s >= 1; s -= 2) {
-        s == 6 && (s = 5);
-        for (let e = 0; e < this.size; e++)
-          for (let n = 0; n < 2; n++) {
-            const a = s - n, f = (s + 1 & 2) == 0 ? this.size - 1 - e : e;
-            !this.#i[f][a] && i < t.length * 8 && (this.#t[f][a] = M(t[i >>> 3], 7 - (i & 7)), i++);
-          }
-      }
-      w(i == 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.
-    #c(t) {
-      if (t < 0 || t > 7) throw new RangeError("Mask value out of range");
-      for (let i = 0; i < this.size; i++)
-        for (let s = 0; s < this.size; s++) {
-          let e;
-          switch (t) {
-            case 0:
-              e = (s + i) % 2 == 0;
-              break;
-            case 1:
-              e = i % 2 == 0;
-              break;
-            case 2:
-              e = s % 3 == 0;
-              break;
-            case 3:
-              e = (s + i) % 3 == 0;
-              break;
-            case 4:
-              e = (Math.floor(s / 3) + Math.floor(i / 2)) % 2 == 0;
-              break;
-            case 5:
-              e = s * i % 2 + s * i % 3 == 0;
-              break;
-            case 6:
-              e = (s * i % 2 + s * i % 3) % 2 == 0;
-              break;
-            case 7:
-              e = ((s + i) % 2 + s * i % 3) % 2 == 0;
-              break;
-            default:
-              throw new Error("Unreachable");
-          }
-          !this.#i[i][s] && e && (this.#t[i][s] = !this.#t[i][s]);
-        }
-    }
-    // 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.
-    #b() {
-      let t = 0;
-      for (let n = 0; n < this.size; n++) {
-        let a = !1, o = 0;
-        const f = [0, 0, 0, 0, 0, 0, 0];
-        for (let h = 0; h < this.size; h++)
-          this.#t[n][h] == a ? (o++, o == 5 ? t += r.#E : o > 5 && t++) : (this.#o(o, f), a || (t += this.#u(f) * r.#r), a = this.#t[n][h], o = 1);
-        t += this.#w(a, o, f) * r.#r;
-      }
-      for (let n = 0; n < this.size; n++) {
-        let a = !1, o = 0;
-        const f = [0, 0, 0, 0, 0, 0, 0];
-        for (let h = 0; h < this.size; h++)
-          this.#t[h][n] == a ? (o++, o == 5 ? t += r.#E : o > 5 && t++) : (this.#o(o, f), a || (t += this.#u(f) * r.#r), a = this.#t[h][n], o = 1);
-        t += this.#w(a, o, f) * r.#r;
-      }
-      for (let n = 0; n < this.size - 1; n++)
-        for (let a = 0; a < this.size - 1; a++) {
-          const o = this.#t[n][a];
-          o == this.#t[n][a + 1] && o == this.#t[n + 1][a] && o == this.#t[n + 1][a + 1] && (t += r.#B);
-        }
-      let i = 0;
-      for (const n of this.#t)
-        i = n.reduce((a, o) => a + (o ? 1 : 0), i);
-      const s = this.size * this.size, e = Math.ceil(Math.abs(i * 20 - s * 10) / s) - 1;
-      return w(0 <= e && e <= 9), t += e * r.#z, w(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.
-    #I() {
-      if (this.version == 1) return [];
-      {
-        const t = Math.floor(this.version / 7) + 2, i = Math.floor(
-          (this.version * 8 + t * 3 + 5) / (t * 4 - 4)
-        ) * 2, s = [6];
-        for (let e = this.size - 7; s.length < t; e -= i)
-          s.splice(1, 0, e);
-        return s;
-      }
-    }
-    // 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 #l(t) {
-      if (t < r.MIN_VERSION || t > r.MAX_VERSION)
-        throw new RangeError("Version number out of range");
-      let i = (16 * t + 128) * t + 64;
-      if (t >= 2) {
-        const s = Math.floor(t / 7) + 2;
-        i -= (25 * s - 10) * s - 55, t >= 7 && (i -= 36);
-      }
-      return w(208 <= i && i <= 29648), i;
-    }
-    // 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 #n(t, i) {
-      return Math.floor(r.#l(t) / 8) - r.#g[i.ordinal][t] * r.#M[i.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 #N(t) {
-      if (t < 1 || t > 255)
-        throw new RangeError("Degree out of range");
-      const i = [];
-      for (let e = 0; e < t - 1; e++) i.push(0);
-      i.push(1);
-      let s = 1;
-      for (let e = 0; e < t; e++) {
-        for (let n = 0; n < i.length; n++)
-          i[n] = r.#f(i[n], s), n + 1 < i.length && (i[n] ^= i[n + 1]);
-        s = r.#f(s, 2);
-      }
-      return i;
-    }
-    // Returns the Reed-Solomon error correction codeword for the given data and divisor polynomials.
-    static #d(t, i) {
-      const s = i.map((e) => 0);
-      for (const e of t) {
-        const n = e ^ s.shift();
-        s.push(0), i.forEach(
-          (a, o) => s[o] ^= r.#f(a, n)
-        );
-      }
-      return s;
-    }
-    // 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 #f(t, i) {
-      if (t >>> 8 || i >>> 8)
-        throw new RangeError("Byte out of range");
-      let s = 0;
-      for (let e = 7; e >= 0; e--)
-        s = s << 1 ^ (s >>> 7) * 285, s ^= (i >>> e & 1) * t;
-      return w(s >>> 8 == 0), s;
-    }
-    // Can only be called immediately after a light run is added, and
-    // returns either 0, 1, or 2. A helper function for getPenaltyScore().
-    #u(t) {
-      const i = t[1];
-      w(i <= this.size * 3);
-      const s = i > 0 && t[2] == i && t[3] == i * 3 && t[4] == i && t[5] == i;
-      return (s && t[0] >= i * 4 && t[6] >= i ? 1 : 0) + (s && t[6] >= i * 4 && t[0] >= i ? 1 : 0);
-    }
-    // Must be called at the end of a line (row or column) of modules. A helper function for getPenaltyScore().
-    #w(t, i, s) {
-      return t && (this.#o(i, s), i = 0), i += this.size, this.#o(i, s), this.#u(s);
-    }
-    // Pushes the given value to the front and drops the last value. A helper function for getPenaltyScore().
-    #o(t, i) {
-      i[0] == 0 && (t += this.size), i.pop(), i.unshift(t);
-    }
-    static {
-      this.MIN_VERSION = 1;
-    }
-    static {
-      this.MAX_VERSION = 40;
-    }
-    // For use in getPenaltyScore(), when evaluating which mask is best.
-    static #E = 3;
-    static #B = 3;
-    static #r = 40;
-    static #z = 10;
-    static #g = [
-      // 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
-    ];
-    static #M = [
-      // 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
-    ];
-  }
-  g.QrCode = r;
-  function c(R, t, i) {
-    if (t < 0 || t > 31 || R >>> t)
-      throw new RangeError("Value out of range");
-    for (let s = t - 1; s >= 0; s--)
-      i.push(R >>> s & 1);
-  }
-  function M(R, t) {
-    return (R >>> t & 1) != 0;
-  }
-  function w(R) {
-    if (!R) throw new Error("Assertion error");
-  }
-  class l {
-    /*-- 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, i, s) {
-      if (this.mode = t, this.numChars = i, this.bitData = s, i < 0) throw new RangeError("Invalid argument");
-      this.bitData = s.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 i = [];
-      for (const s of t) c(s, 8, i);
-      return new l(l.Mode.BYTE, t.length, i);
-    }
-    // Returns a segment representing the given string of decimal digits encoded in numeric mode.
-    static makeNumeric(t) {
-      if (!l.isNumeric(t))
-        throw new RangeError("String contains non-numeric characters");
-      const i = [];
-      for (let s = 0; s < t.length; ) {
-        const e = Math.min(t.length - s, 3);
-        c(parseInt(t.substring(s, s + e), 10), e * 3 + 1, i), s += e;
-      }
-      return new l(l.Mode.NUMERIC, t.length, i);
-    }
-    // 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 (!l.isAlphanumeric(t))
-        throw new RangeError(
-          "String contains unencodable characters in alphanumeric mode"
-        );
-      const i = [];
-      let s;
-      for (s = 0; s + 2 <= t.length; s += 2) {
-        let e = l.#e.indexOf(t.charAt(s)) * 45;
-        e += l.#e.indexOf(t.charAt(s + 1)), c(e, 11, i);
-      }
-      return s < t.length && c(
-        l.#e.indexOf(t.charAt(s)),
-        6,
-        i
-      ), new l(l.Mode.ALPHANUMERIC, t.length, i);
-    }
-    // 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 == "" ? [] : l.isNumeric(t) ? [l.makeNumeric(t)] : l.isAlphanumeric(t) ? [l.makeAlphanumeric(t)] : [l.makeBytes(l.#t(t))];
-    }
-    // Returns a segment representing an Extended Channel Interpretation
-    // (ECI) designator with the given assignment value.
-    static makeEci(t) {
-      const i = [];
-      if (t < 0)
-        throw new RangeError("ECI assignment value out of range");
-      if (t < 128) c(t, 8, i);
-      else if (t < 16384)
-        c(2, 2, i), c(t, 14, i);
-      else if (t < 1e6)
-        c(6, 3, i), c(t, 21, i);
-      else throw new RangeError("ECI assignment value out of range");
-      return new l(l.Mode.ECI, 0, i);
-    }
-    // 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 l.#i.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 l.#a.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, i) {
-      let s = 0;
-      for (const e of t) {
-        const n = e.mode.numCharCountBits(i);
-        if (e.numChars >= 1 << n) return 1 / 0;
-        s += 4 + n + e.bitData.length;
-      }
-      return s;
-    }
-    // Returns a new array of bytes representing the given string encoded in UTF-8.
-    static #t(t) {
-      t = encodeURI(t);
-      const i = [];
-      for (let s = 0; s < t.length; s++)
-        t.charAt(s) != "%" ? i.push(t.charCodeAt(s)) : (i.push(parseInt(t.substring(s + 1, s + 3), 16)), s += 2);
-      return i;
-    }
-    /*-- Constants --*/
-    // Describes precisely all strings that are encodable in numeric mode.
-    static #i = /^[0-9]*$/;
-    // Describes precisely all strings that are encodable in alphanumeric mode.
-    static #a = /^[A-Z0-9 $%*+./:-]*$/;
-    // The set of all legal characters in alphanumeric mode,
-    // where each character value maps to the index in the string.
-    static #e = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ $%*+-./:";
-  }
-  g.QrSegment = l;
-})(p || (p = {}));
-((g) => {
-  ((r) => {
-    class c {
-      // The QR Code can tolerate about 30% erroneous codewords
-      /*-- Constructor and fields --*/
-      constructor(w, l) {
-        this.ordinal = w, this.formatBits = l;
-      }
-      static {
-        this.LOW = new c(0, 1);
-      }
-      static {
-        this.MEDIUM = new c(1, 0);
-      }
-      static {
-        this.QUARTILE = new c(2, 3);
-      }
-      static {
-        this.HIGH = new c(3, 2);
-      }
-    }
-    r.Ecc = c;
-  })(g.QrCode || (g.QrCode = {}));
-})(p || (p = {}));
-((g) => {
-  ((r) => {
-    class c {
-      /*-- Constructor and fields --*/
-      constructor(w, l) {
-        this.modeBits = w, this.numBitsCharCount = l;
-      }
-      static {
-        this.NUMERIC = new c(1, [10, 12, 14]);
-      }
-      static {
-        this.ALPHANUMERIC = new c(2, [9, 11, 13]);
-      }
-      static {
-        this.BYTE = new c(4, [8, 16, 16]);
-      }
-      static {
-        this.KANJI = new c(8, [8, 10, 12]);
-      }
-      static {
-        this.ECI = new c(7, [0, 0, 0]);
-      }
-      /*-- 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(w) {
-        return this.numBitsCharCount[Math.floor((w + 7) / 17)];
-      }
-    }
-    r.Mode = c;
-  })(g.QrSegment || (g.QrSegment = {}));
-})(p || (p = {}));
-const N = p;
-export {
-  N as default
-};
+/* 潘启宝 2026-03-24 17:57:08 星期二 */
+//#region components/pc/qr-code/src/qrcodegen.js
+var e;
+((e) => {
+	class t {
+		constructor(e, n, r, a) {
+			if (this.version = e, this.errorCorrectionLevel = n, e < t.MIN_VERSION || e > t.MAX_VERSION) throw RangeError("Version value out of range");
+			if (a < -1 || a > 7) throw RangeError("Mask value out of range");
+			this.size = e * 4 + 17;
+			let o = [];
+			for (let e = 0; e < this.size; e++) o.push(!1);
+			for (let e = 0; e < this.size; e++) this.#e.push(o.slice()), this.#t.push(o.slice());
+			this.#n();
+			let s = this.#c(r);
+			if (this.#l(s), a == -1) {
+				let e = 1e9;
+				for (let t = 0; t < 8; t++) {
+					this.#u(t), this.#r(t);
+					let n = this.#d();
+					n < e && (a = t, e = n), this.#u(t);
+				}
+			}
+			i(0 <= a && a <= 7), this.mask = a, this.#u(a), this.#r(a), this.#t = [];
+		}
+		static encodeText(n, r) {
+			let i = e.QrSegment.makeSegments(n);
+			return t.encodeSegments(i, r);
+		}
+		static encodeBinary(n, r) {
+			let i = e.QrSegment.makeBytes(n);
+			return t.encodeSegments([i], r);
+		}
+		static encodeSegments(e, r, o = 1, s = 40, c = -1, l = !0) {
+			if (!(t.MIN_VERSION <= o && o <= s && s <= t.MAX_VERSION) || c < -1 || c > 7) throw RangeError("Invalid value");
+			let u, d;
+			for (u = o;; u++) {
+				let n = t.#m(u, r) * 8, i = a.getTotalBits(e, u);
+				if (i <= n) {
+					d = i;
+					break;
+				}
+				if (u >= s) throw RangeError("Data too long");
+			}
+			for (let e of [
+				t.Ecc.MEDIUM,
+				t.Ecc.QUARTILE,
+				t.Ecc.HIGH
+			]) l && d <= t.#m(u, e) * 8 && (r = e);
+			let f = [];
+			for (let t of e) {
+				n(t.mode.modeBits, 4, f), n(t.numChars, t.mode.numCharCountBits(u), f);
+				for (let e of t.getData()) f.push(e);
+			}
+			i(f.length == d);
+			let p = t.#m(u, r) * 8;
+			i(f.length <= p), n(0, Math.min(4, p - f.length), f), n(0, (8 - f.length % 8) % 8, f), i(f.length % 8 == 0);
+			for (let e = 236; f.length < p; e ^= 253) n(e, 8, f);
+			let m = [];
+			for (; m.length * 8 < f.length;) m.push(0);
+			return f.forEach((e, t) => m[t >>> 3] |= e << 7 - (t & 7)), new t(u, r, m, c);
+		}
+		#e = [];
+		#t = [];
+		getModule(e, t) {
+			return 0 <= e && e < this.size && 0 <= t && t < this.size && this.#e[t][e];
+		}
+		getModules() {
+			return this.#e;
+		}
+		#n() {
+			for (let e = 0; e < this.size; e++) this.#s(6, e, e % 2 == 0), this.#s(e, 6, e % 2 == 0);
+			this.#a(3, 3), this.#a(this.size - 4, 3), this.#a(3, this.size - 4);
+			let e = this.#f(), t = e.length;
+			for (let n = 0; n < t; n++) for (let r = 0; r < t; r++) n == 0 && r == 0 || n == 0 && r == t - 1 || n == t - 1 && r == 0 || this.#o(e[n], e[r]);
+			this.#r(0), this.#i();
+		}
+		#r(e) {
+			let t = this.errorCorrectionLevel.formatBits << 3 | e, n = t;
+			for (let e = 0; e < 10; e++) n = n << 1 ^ (n >>> 9) * 1335;
+			let a = (t << 10 | n) ^ 21522;
+			i(a >>> 15 == 0);
+			for (let e = 0; e <= 5; e++) this.#s(8, e, r(a, e));
+			this.#s(8, 7, r(a, 6)), this.#s(8, 8, r(a, 7)), this.#s(7, 8, r(a, 8));
+			for (let e = 9; e < 15; e++) this.#s(14 - e, 8, r(a, e));
+			for (let e = 0; e < 8; e++) this.#s(this.size - 1 - e, 8, r(a, e));
+			for (let e = 8; e < 15; e++) this.#s(8, this.size - 15 + e, r(a, e));
+			this.#s(8, this.size - 8, !0);
+		}
+		#i() {
+			if (this.version < 7) return;
+			let e = this.version;
+			for (let t = 0; t < 12; t++) e = e << 1 ^ (e >>> 11) * 7973;
+			let t = this.version << 12 | e;
+			i(t >>> 18 == 0);
+			for (let e = 0; e < 18; e++) {
+				let n = r(t, e), i = this.size - 11 + e % 3, a = Math.floor(e / 3);
+				this.#s(i, a, n), this.#s(a, i, n);
+			}
+		}
+		#a(e, t) {
+			for (let n = -4; n <= 4; n++) for (let r = -4; r <= 4; r++) {
+				let i = Math.max(Math.abs(r), Math.abs(n)), a = e + r, o = t + n;
+				0 <= a && a < this.size && 0 <= o && o < this.size && this.#s(a, o, i != 2 && i != 4);
+			}
+		}
+		#o(e, t) {
+			for (let n = -2; n <= 2; n++) for (let r = -2; r <= 2; r++) this.#s(e + r, t + n, Math.max(Math.abs(r), Math.abs(n)) != 1);
+		}
+		#s(e, t, n) {
+			this.#e[t][e] = n, this.#t[t][e] = !0;
+		}
+		#c(e) {
+			let n = this.version, r = this.errorCorrectionLevel;
+			if (e.length != t.#m(n, r)) throw RangeError("Invalid argument");
+			let a = t.#E[r.ordinal][n], o = t.#T[r.ordinal][n], s = Math.floor(t.#p(n) / 8), c = a - s % a, l = Math.floor(s / a), u = [], d = t.#h(o);
+			for (let n = 0, r = 0; n < a; n++) {
+				let i = e.slice(r, r + l - o + (n < c ? 0 : 1));
+				r += i.length;
+				let a = t.#g(i, d);
+				n < c && i.push(0), u.push(i.concat(a));
+			}
+			let f = [];
+			for (let e = 0; e < u[0].length; e++) u.forEach((t, n) => {
+				(e != l - o || n >= c) && f.push(t[e]);
+			});
+			return i(f.length == s), f;
+		}
+		#l(e) {
+			if (e.length != Math.floor(t.#p(this.version) / 8)) throw RangeError("Invalid argument");
+			let n = 0;
+			for (let t = this.size - 1; t >= 1; t -= 2) {
+				t == 6 && (t = 5);
+				for (let i = 0; i < this.size; i++) for (let a = 0; a < 2; a++) {
+					let o = t - a, s = t + 1 & 2 ? i : this.size - 1 - i;
+					!this.#t[s][o] && n < e.length * 8 && (this.#e[s][o] = r(e[n >>> 3], 7 - (n & 7)), n++);
+				}
+			}
+			i(n == e.length * 8);
+		}
+		#u(e) {
+			if (e < 0 || e > 7) throw RangeError("Mask value out of range");
+			for (let t = 0; t < this.size; t++) for (let n = 0; n < this.size; n++) {
+				let r;
+				switch (e) {
+					case 0:
+						r = (n + t) % 2 == 0;
+						break;
+					case 1:
+						r = t % 2 == 0;
+						break;
+					case 2:
+						r = n % 3 == 0;
+						break;
+					case 3:
+						r = (n + t) % 3 == 0;
+						break;
+					case 4:
+						r = (Math.floor(n / 3) + Math.floor(t / 2)) % 2 == 0;
+						break;
+					case 5:
+						r = n * t % 2 + n * t % 3 == 0;
+						break;
+					case 6:
+						r = (n * t % 2 + n * t % 3) % 2 == 0;
+						break;
+					case 7:
+						r = ((n + t) % 2 + n * t % 3) % 2 == 0;
+						break;
+					default: throw Error("Unreachable");
+				}
+				!this.#t[t][n] && r && (this.#e[t][n] = !this.#e[t][n]);
+			}
+		}
+		#d() {
+			let e = 0;
+			for (let n = 0; n < this.size; n++) {
+				let r = !1, i = 0, a = [
+					0,
+					0,
+					0,
+					0,
+					0,
+					0,
+					0
+				];
+				for (let o = 0; o < this.size; o++) this.#e[n][o] == r ? (i++, i == 5 ? e += t.#x : i > 5 && e++) : (this.#b(i, a), r || (e += this.#v(a) * t.#C), r = this.#e[n][o], i = 1);
+				e += this.#y(r, i, a) * t.#C;
+			}
+			for (let n = 0; n < this.size; n++) {
+				let r = !1, i = 0, a = [
+					0,
+					0,
+					0,
+					0,
+					0,
+					0,
+					0
+				];
+				for (let o = 0; o < this.size; o++) this.#e[o][n] == r ? (i++, i == 5 ? e += t.#x : i > 5 && e++) : (this.#b(i, a), r || (e += this.#v(a) * t.#C), r = this.#e[o][n], i = 1);
+				e += this.#y(r, i, a) * t.#C;
+			}
+			for (let n = 0; n < this.size - 1; n++) for (let r = 0; r < this.size - 1; r++) {
+				let i = this.#e[n][r];
+				i == this.#e[n][r + 1] && i == this.#e[n + 1][r] && i == this.#e[n + 1][r + 1] && (e += t.#S);
+			}
+			let n = 0;
+			for (let e of this.#e) n = e.reduce((e, t) => e + (t ? 1 : 0), n);
+			let r = this.size * this.size, a = Math.ceil(Math.abs(n * 20 - r * 10) / r) - 1;
+			return i(0 <= a && a <= 9), e += a * t.#w, i(0 <= e && e <= 2568888), e;
+		}
+		#f() {
+			if (this.version == 1) return [];
+			{
+				let e = Math.floor(this.version / 7) + 2, t = Math.floor((this.version * 8 + e * 3 + 5) / (e * 4 - 4)) * 2, n = [6];
+				for (let r = this.size - 7; n.length < e; r -= t) n.splice(1, 0, r);
+				return n;
+			}
+		}
+		static #p(e) {
+			if (e < t.MIN_VERSION || e > t.MAX_VERSION) throw RangeError("Version number out of range");
+			let n = (16 * e + 128) * e + 64;
+			if (e >= 2) {
+				let t = Math.floor(e / 7) + 2;
+				n -= (25 * t - 10) * t - 55, e >= 7 && (n -= 36);
+			}
+			return i(208 <= n && n <= 29648), n;
+		}
+		static #m(e, n) {
+			return Math.floor(t.#p(e) / 8) - t.#T[n.ordinal][e] * t.#E[n.ordinal][e];
+		}
+		static #h(e) {
+			if (e < 1 || e > 255) throw RangeError("Degree out of range");
+			let n = [];
+			for (let t = 0; t < e - 1; t++) n.push(0);
+			n.push(1);
+			let r = 1;
+			for (let i = 0; i < e; i++) {
+				for (let e = 0; e < n.length; e++) n[e] = t.#_(n[e], r), e + 1 < n.length && (n[e] ^= n[e + 1]);
+				r = t.#_(r, 2);
+			}
+			return n;
+		}
+		static #g(e, n) {
+			let r = n.map((e) => 0);
+			for (let i of e) {
+				let e = i ^ r.shift();
+				r.push(0), n.forEach((n, i) => r[i] ^= t.#_(n, e));
+			}
+			return r;
+		}
+		static #_(e, t) {
+			if (e >>> 8 || t >>> 8) throw RangeError("Byte out of range");
+			let n = 0;
+			for (let r = 7; r >= 0; r--) n = n << 1 ^ (n >>> 7) * 285, n ^= (t >>> r & 1) * e;
+			return i(n >>> 8 == 0), n;
+		}
+		#v(e) {
+			let t = e[1];
+			i(t <= this.size * 3);
+			let n = t > 0 && e[2] == t && e[3] == t * 3 && e[4] == t && e[5] == t;
+			return (n && e[0] >= t * 4 && e[6] >= t ? 1 : 0) + (n && e[6] >= t * 4 && e[0] >= t ? 1 : 0);
+		}
+		#y(e, t, n) {
+			return e && (this.#b(t, n), t = 0), t += this.size, this.#b(t, n), this.#v(n);
+		}
+		#b(e, t) {
+			t[0] == 0 && (e += this.size), t.pop(), t.unshift(e);
+		}
+		static {
+			this.MIN_VERSION = 1;
+		}
+		static {
+			this.MAX_VERSION = 40;
+		}
+		static #x = 3;
+		static #S = 3;
+		static #C = 40;
+		static #w = 10;
+		static #T = [
+			[
+				-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
+			],
+			[
+				-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
+			],
+			[
+				-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
+			],
+			[
+				-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
+			]
+		];
+		static #E = [
+			[
+				-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
+			],
+			[
+				-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
+			],
+			[
+				-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
+			],
+			[
+				-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
+			]
+		];
+	}
+	e.QrCode = t;
+	function n(e, t, n) {
+		if (t < 0 || t > 31 || e >>> t) throw RangeError("Value out of range");
+		for (let r = t - 1; r >= 0; r--) n.push(e >>> r & 1);
+	}
+	function r(e, t) {
+		return (e >>> t & 1) != 0;
+	}
+	function i(e) {
+		if (!e) throw Error("Assertion error");
+	}
+	class a {
+		constructor(e, t, n) {
+			if (this.mode = e, this.numChars = t, this.bitData = n, t < 0) throw RangeError("Invalid argument");
+			this.bitData = n.slice();
+		}
+		static makeBytes(e) {
+			let t = [];
+			for (let r of e) n(r, 8, t);
+			return new a(a.Mode.BYTE, e.length, t);
+		}
+		static makeNumeric(e) {
+			if (!a.isNumeric(e)) throw RangeError("String contains non-numeric characters");
+			let t = [];
+			for (let r = 0; r < e.length;) {
+				let i = Math.min(e.length - r, 3);
+				n(parseInt(e.substring(r, r + i), 10), i * 3 + 1, t), r += i;
+			}
+			return new a(a.Mode.NUMERIC, e.length, t);
+		}
+		static makeAlphanumeric(e) {
+			if (!a.isAlphanumeric(e)) throw RangeError("String contains unencodable characters in alphanumeric mode");
+			let t = [], r;
+			for (r = 0; r + 2 <= e.length; r += 2) {
+				let i = a.#r.indexOf(e.charAt(r)) * 45;
+				i += a.#r.indexOf(e.charAt(r + 1)), n(i, 11, t);
+			}
+			return r < e.length && n(a.#r.indexOf(e.charAt(r)), 6, t), new a(a.Mode.ALPHANUMERIC, e.length, t);
+		}
+		static makeSegments(e) {
+			return e == "" ? [] : a.isNumeric(e) ? [a.makeNumeric(e)] : a.isAlphanumeric(e) ? [a.makeAlphanumeric(e)] : [a.makeBytes(a.#e(e))];
+		}
+		static makeEci(e) {
+			let t = [];
+			if (e < 0) throw RangeError("ECI assignment value out of range");
+			if (e < 128) n(e, 8, t);
+			else if (e < 16384) n(2, 2, t), n(e, 14, t);
+			else if (e < 1e6) n(6, 3, t), n(e, 21, t);
+			else throw RangeError("ECI assignment value out of range");
+			return new a(a.Mode.ECI, 0, t);
+		}
+		static isNumeric(e) {
+			return a.#t.test(e);
+		}
+		static isAlphanumeric(e) {
+			return a.#n.test(e);
+		}
+		getData() {
+			return this.bitData.slice();
+		}
+		static getTotalBits(e, t) {
+			let n = 0;
+			for (let r of e) {
+				let e = r.mode.numCharCountBits(t);
+				if (r.numChars >= 1 << e) return Infinity;
+				n += 4 + e + r.bitData.length;
+			}
+			return n;
+		}
+		static #e(e) {
+			e = encodeURI(e);
+			let t = [];
+			for (let n = 0; n < e.length; n++) e.charAt(n) == "%" ? (t.push(parseInt(e.substring(n + 1, n + 3), 16)), n += 2) : t.push(e.charCodeAt(n));
+			return t;
+		}
+		static #t = /^[0-9]*$/;
+		static #n = /^[A-Z0-9 $%*+./:-]*$/;
+		static #r = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ $%*+-./:";
+	}
+	e.QrSegment = a;
+})(e ||= {}), ((e) => {
+	((e) => {
+		class t {
+			constructor(e, t) {
+				this.ordinal = e, this.formatBits = t;
+			}
+			static {
+				this.LOW = new t(0, 1);
+			}
+			static {
+				this.MEDIUM = new t(1, 0);
+			}
+			static {
+				this.QUARTILE = new t(2, 3);
+			}
+			static {
+				this.HIGH = new t(3, 2);
+			}
+		}
+		e.Ecc = t;
+	})(e.QrCode ||= {});
+})(e ||= {}), ((e) => {
+	((e) => {
+		class t {
+			constructor(e, t) {
+				this.modeBits = e, this.numBitsCharCount = t;
+			}
+			static {
+				this.NUMERIC = new t(1, [
+					10,
+					12,
+					14
+				]);
+			}
+			static {
+				this.ALPHANUMERIC = new t(2, [
+					9,
+					11,
+					13
+				]);
+			}
+			static {
+				this.BYTE = new t(4, [
+					8,
+					16,
+					16
+				]);
+			}
+			static {
+				this.KANJI = new t(8, [
+					8,
+					10,
+					12
+				]);
+			}
+			static {
+				this.ECI = new t(7, [
+					0,
+					0,
+					0
+				]);
+			}
+			numCharCountBits(e) {
+				return this.numBitsCharCount[Math.floor((e + 7) / 17)];
+			}
+		}
+		e.Mode = t;
+	})(e.QrSegment ||= {});
+})(e ||= {});
+var t = e;
+//#endregion
+export { t as N };
+/* 独立思考，明辨是非 */