@unicom-cloud/ui 0.8.115 → 0.8.117

package/qr-code/index.js

@@ -1,1273 +1,93 @@
-import { jsx as P, jsxs as U, Fragment as Q } from "react/jsx-runtime";
-import A, { useContext as tt } from "react";
-import { a as et } from "../chunk/DstheLSK.js";
-import "../chunk/DsaQZE4X.js";
+/* 2025-11-03 10:27:46 */
+import { jsx as r } from "react/jsx-runtime";
+import { useContext as z } from "react";
+import "../config-provider/ConfigProvider.js";
+import "../dist/ui-common/utils/is.js";
+import "@unicom-cloud/utils/is";
 import "@unicom-cloud/utils/constant/platform";
-import "../chunk/CdXR6dj7.js";
+import "../dist/ui-common/hooks/utils/isDev.js";
 import "@unicom-cloud/utils/js-cookie";
 import "dayjs";
 import "lodash/debounce";
 import "@unicom-cloud/utils/screenfull";
-import "../chunk/ClNkxEcR.js";
+import "../dist/ui-common/hooks/use-request/src/plugins/useAutoRunPlugin.js";
+import "lodash/castArray";
+import "../dist/ui-common/hooks/use-request/src/utils/subscribeReVisible.js";
+import "../dist/ui-common/hooks/use-request/src/utils/subscribeFocus.js";
 import "lodash/throttle";
-import "lodash/isPlainObject";
+import "../dist/ui-common/hooks/use-text-selection/index.js";
 import "@unicom-cloud/utils/query-string";
 import "react-router";
-import "lodash/isEqualWith";
+import "../dist/ui-common/hooks/use-intersection-observer/index.js";
 import "@unicom-cloud/utils/constant/keyboardCode";
-import "lodash/isNumber";
-import "lodash/merge";
-import "../chunk/BcdTSJks.js";
-import "../chunk/CEAeR6xB.js";
-import { u as st } from "../chunk/FgWHhRFz.js";
-import "../chunk/exc7v_Hl.js";
+import P from "../dist/ui-common/hooks/use-merge-props/index.js";
+import "../dist/ui-common/utils/reactDOM.js";
 import "@unicom-cloud/utils/constant";
-import ot from "@unicom-cloud/utils/class-name";
-var L;
-((E) => {
-  class i {
-    /*-- 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, o) {
-      if (this.version = t, this.errorCorrectionLevel = s, this.modules = [], this.isFunction = [], t < i.MIN_VERSION || t > i.MAX_VERSION)
-        throw new RangeError("Version value out of range");
-      if (o < -1 || o > 7) throw new RangeError("Mask value out of range");
-      this.size = t * 4 + 17;
-      const n = [];
-      for (let r = 0; r < this.size; r++) n.push(!1);
-      for (let r = 0; r < this.size; r++)
-        this.modules.push(n.slice()), this.isFunction.push(n.slice());
-      this.drawFunctionPatterns();
-      const a = this.addEccAndInterleave(e);
-      if (this.drawCodewords(a), o == -1) {
-        let r = 1e9;
-        for (let f = 0; f < 8; f++) {
-          this.applyMask(f), this.drawFormatBits(f);
-          const h = this.getPenaltyScore();
-          h < r && (o = f, r = h), this.applyMask(f);
-        }
-      }
-      u(0 <= o && o <= 7), this.mask = o, this.applyMask(o), this.drawFormatBits(o), 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 = E.QrSegment.makeSegments(t);
-      return i.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 = E.QrSegment.makeBytes(t);
-      return i.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, o = 40, n = -1, a = !0) {
-      if (!(i.MIN_VERSION <= e && e <= o && o <= i.MAX_VERSION) || n < -1 || n > 7)
-        throw new RangeError("Invalid value");
-      let r, f;
-      for (r = e; ; r++) {
-        const m = i.getNumDataCodewords(r, s) * 8, w = l.getTotalBits(t, r);
-        if (w <= m) {
-          f = w;
-          break;
-        }
-        if (r >= o)
-          throw new RangeError("Data too long");
-      }
-      for (const m of [
-        i.Ecc.MEDIUM,
-        i.Ecc.QUARTILE,
-        i.Ecc.HIGH
-      ])
-        a && f <= i.getNumDataCodewords(r, m) * 8 && (s = m);
-      const h = [];
-      for (const m of t) {
-        c(m.mode.modeBits, 4, h), c(m.numChars, m.mode.numCharCountBits(r), h);
-        for (const w of m.getData()) h.push(w);
-      }
-      u(h.length == f);
-      const M = i.getNumDataCodewords(r, s) * 8;
-      u(h.length <= M), c(0, Math.min(4, M - h.length), h), c(0, (8 - h.length % 8) % 8, h), u(h.length % 8 == 0);
-      for (let m = 236; h.length < M; m ^= 253)
-        c(m, 8, h);
-      const p = [];
-      for (; p.length * 8 < h.length; ) p.push(0);
-      return h.forEach(
-        (m, w) => p[w >>> 3] |= m << 7 - (w & 7)
-      ), new i(r, s, p, n);
-    }
-    /*-- 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];
-    }
-    // Modified to expose modules for easy access
-    getModules() {
-      return this.modules;
-    }
-    /*-- 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 o = 0; o < s; o++)
-          e == 0 && o == 0 || e == 0 && o == s - 1 || e == s - 1 && o == 0 || this.drawAlignmentPattern(t[e], t[o]);
-      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 n = 0; n < 10; n++) e = e << 1 ^ (e >>> 9) * 1335;
-      const o = (s << 10 | e) ^ 21522;
-      u(o >>> 15 == 0);
-      for (let n = 0; n <= 5; n++)
-        this.setFunctionModule(8, n, d(o, n));
-      this.setFunctionModule(8, 7, d(o, 6)), this.setFunctionModule(8, 8, d(o, 7)), this.setFunctionModule(7, 8, d(o, 8));
-      for (let n = 9; n < 15; n++)
-        this.setFunctionModule(14 - n, 8, d(o, n));
-      for (let n = 0; n < 8; n++)
-        this.setFunctionModule(this.size - 1 - n, 8, d(o, n));
-      for (let n = 8; n < 15; n++)
-        this.setFunctionModule(8, this.size - 15 + n, d(o, n));
-      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;
-      u(s >>> 18 == 0);
-      for (let e = 0; e < 18; e++) {
-        const o = d(s, e), n = this.size - 11 + e % 3, a = Math.floor(e / 3);
-        this.setFunctionModule(n, a, o), this.setFunctionModule(a, n, o);
-      }
-    }
-    // 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 o = -4; o <= 4; o++) {
-          const n = Math.max(Math.abs(o), Math.abs(e)), a = t + o, r = s + e;
-          0 <= a && a < this.size && 0 <= r && r < this.size && this.setFunctionModule(a, r, n != 2 && n != 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 o = -2; o <= 2; o++)
-          this.setFunctionModule(
-            t + o,
-            s + e,
-            Math.max(Math.abs(o), 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 != i.getNumDataCodewords(s, e))
-        throw new RangeError("Invalid argument");
-      const o = i.NUM_ERROR_CORRECTION_BLOCKS[e.ordinal][s], n = i.ECC_CODEWORDS_PER_BLOCK[e.ordinal][s], a = Math.floor(
-        i.getNumRawDataModules(s) / 8
-      ), r = o - a % o, f = Math.floor(a / o), h = [], M = i.reedSolomonComputeDivisor(n);
-      for (let m = 0, w = 0; m < o; m++) {
-        const R = t.slice(
-          w,
-          w + f - n + (m < r ? 0 : 1)
-        );
-        w += R.length;
-        const I = i.reedSolomonComputeRemainder(R, M);
-        m < r && R.push(0), h.push(R.concat(I));
-      }
-      const p = [];
-      for (let m = 0; m < h[0].length; m++)
-        h.forEach((w, R) => {
-          (m != f - n || R >= r) && p.push(w[m]);
-        });
-      return u(p.length == a), p;
-    }
-    // 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(i.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 o = 0; o < this.size; o++)
-          for (let n = 0; n < 2; n++) {
-            const a = e - n, f = (e + 1 & 2) == 0 ? this.size - 1 - o : o;
-            !this.isFunction[f][a] && s < t.length * 8 && (this.modules[f][a] = d(t[s >>> 3], 7 - (s & 7)), s++);
-          }
-      }
-      u(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 o;
-          switch (t) {
-            case 0:
-              o = (e + s) % 2 == 0;
-              break;
-            case 1:
-              o = s % 2 == 0;
-              break;
-            case 2:
-              o = e % 3 == 0;
-              break;
-            case 3:
-              o = (e + s) % 3 == 0;
-              break;
-            case 4:
-              o = (Math.floor(e / 3) + Math.floor(s / 2)) % 2 == 0;
-              break;
-            case 5:
-              o = e * s % 2 + e * s % 3 == 0;
-              break;
-            case 6:
-              o = (e * s % 2 + e * s % 3) % 2 == 0;
-              break;
-            case 7:
-              o = ((e + s) % 2 + e * s % 3) % 2 == 0;
-              break;
-            default:
-              throw new Error("Unreachable");
-          }
-          !this.isFunction[s][e] && o && (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 n = 0; n < this.size; n++) {
-        let a = !1, r = 0;
-        const f = [0, 0, 0, 0, 0, 0, 0];
-        for (let h = 0; h < this.size; h++)
-          this.modules[n][h] == a ? (r++, r == 5 ? t += i.PENALTY_N1 : r > 5 && t++) : (this.finderPenaltyAddHistory(r, f), a || (t += this.finderPenaltyCountPatterns(f) * i.PENALTY_N3), a = this.modules[n][h], r = 1);
-        t += this.finderPenaltyTerminateAndCount(a, r, f) * i.PENALTY_N3;
-      }
-      for (let n = 0; n < this.size; n++) {
-        let a = !1, r = 0;
-        const f = [0, 0, 0, 0, 0, 0, 0];
-        for (let h = 0; h < this.size; h++)
-          this.modules[h][n] == a ? (r++, r == 5 ? t += i.PENALTY_N1 : r > 5 && t++) : (this.finderPenaltyAddHistory(r, f), a || (t += this.finderPenaltyCountPatterns(f) * i.PENALTY_N3), a = this.modules[h][n], r = 1);
-        t += this.finderPenaltyTerminateAndCount(a, r, f) * i.PENALTY_N3;
-      }
-      for (let n = 0; n < this.size - 1; n++)
-        for (let a = 0; a < this.size - 1; a++) {
-          const r = this.modules[n][a];
-          r == this.modules[n][a + 1] && r == this.modules[n + 1][a] && r == this.modules[n + 1][a + 1] && (t += i.PENALTY_N2);
-        }
-      let s = 0;
-      for (const n of this.modules)
-        s = n.reduce((a, r) => a + (r ? 1 : 0), s);
-      const e = this.size * this.size, o = Math.ceil(Math.abs(s * 20 - e * 10) / e) - 1;
-      return u(0 <= o && o <= 9), t += o * i.PENALTY_N4, u(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 o = this.size - 7; e.length < t; o -= s)
-          e.splice(1, 0, o);
-        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 < i.MIN_VERSION || t > i.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 u(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(i.getNumRawDataModules(t) / 8) - i.ECC_CODEWORDS_PER_BLOCK[s.ordinal][t] * i.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 o = 0; o < t - 1; o++) s.push(0);
-      s.push(1);
-      let e = 1;
-      for (let o = 0; o < t; o++) {
-        for (let n = 0; n < s.length; n++)
-          s[n] = i.reedSolomonMultiply(s[n], e), n + 1 < s.length && (s[n] ^= s[n + 1]);
-        e = i.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((o) => 0);
-      for (const o of t) {
-        const n = o ^ e.shift();
-        e.push(0), s.forEach(
-          (a, r) => e[r] ^= i.reedSolomonMultiply(a, n)
-        );
-      }
-      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 o = 7; o >= 0; o--)
-        e = e << 1 ^ (e >>> 7) * 285, e ^= (s >>> o & 1) * t;
-      return u(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];
-      u(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);
-    }
-    static {
-      this.MIN_VERSION = 1;
-    }
-    static {
-      this.MAX_VERSION = 40;
-    }
-    static {
-      this.PENALTY_N1 = 3;
-    }
-    static {
-      this.PENALTY_N2 = 3;
-    }
-    static {
-      this.PENALTY_N3 = 40;
-    }
-    static {
-      this.PENALTY_N4 = 10;
-    }
-    static {
-      this.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
-      ];
-    }
-    static {
-      this.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
-      ];
-    }
-  }
-  E.QrCode = i;
-  function c(g, t, s) {
-    if (t < 0 || t > 31 || g >>> t)
-      throw new RangeError("Value out of range");
-    for (let e = t - 1; e >= 0; e--)
-      s.push(g >>> e & 1);
-  }
-  function d(g, t) {
-    return (g >>> t & 1) != 0;
-  }
-  function u(g) {
-    if (!g) 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, 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) c(e, 8, s);
-      return new l(l.Mode.BYTE, t.length, s);
-    }
-    // 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 s = [];
-      for (let e = 0; e < t.length; ) {
-        const o = Math.min(t.length - e, 3);
-        c(parseInt(t.substring(e, e + o), 10), o * 3 + 1, s), e += o;
-      }
-      return new l(l.Mode.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 (!l.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 o = l.ALPHANUMERIC_CHARSET.indexOf(t.charAt(e)) * 45;
-        o += l.ALPHANUMERIC_CHARSET.indexOf(t.charAt(e + 1)), c(o, 11, s);
-      }
-      return e < t.length && c(
-        l.ALPHANUMERIC_CHARSET.indexOf(t.charAt(e)),
-        6,
-        s
-      ), new l(l.Mode.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 == "" ? [] : l.isNumeric(t) ? [l.makeNumeric(t)] : l.isAlphanumeric(t) ? [l.makeAlphanumeric(t)] : [l.makeBytes(l.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) c(t, 8, s);
-      else if (t < 16384)
-        c(2, 2, s), c(t, 14, s);
-      else if (t < 1e6)
-        c(6, 3, s), c(t, 21, s);
-      else throw new RangeError("ECI assignment value out of range");
-      return new l(l.Mode.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 l.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 l.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 o of t) {
-        const n = o.mode.numCharCountBits(s);
-        if (o.numChars >= 1 << n) return 1 / 0;
-        e += 4 + n + o.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;
-    }
-    static {
-      this.NUMERIC_REGEX = /^[0-9]*$/;
-    }
-    static {
-      this.ALPHANUMERIC_REGEX = /^[A-Z0-9 $%*+./:-]*$/;
-    }
-    static {
-      this.ALPHANUMERIC_CHARSET = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ $%*+-./:";
-    }
-  }
-  E.QrSegment = l;
-})(L || (L = {}));
-((E) => {
-  ((i) => {
-    class c {
-      // The QR Code can tolerate about 30% erroneous codewords
-      /*-- Constructor and fields --*/
-      constructor(u, l) {
-        this.ordinal = u, 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);
-      }
-    }
-    i.Ecc = c;
-  })(E.QrCode || (E.QrCode = {}));
-})(L || (L = {}));
-((E) => {
-  ((i) => {
-    class c {
-      /*-- Constructor and fields --*/
-      constructor(u, l) {
-        this.modeBits = u, 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(u) {
-        return this.numBitsCharCount[Math.floor((u + 7) / 17)];
-      }
-    }
-    i.Mode = c;
-  })(E.QrSegment || (E.QrSegment = {}));
-})(L || (L = {}));
-const b = L, nt = {
-  L: b.QrCode.Ecc.LOW,
-  M: b.QrCode.Ecc.MEDIUM,
-  Q: b.QrCode.Ecc.QUARTILE,
-  H: b.QrCode.Ecc.HIGH
-}, k = 128, H = "L", $ = "#FFFFFF", x = "#000000", Y = 1, it = 0, rt = 0.1;
-function G(E, i = 0) {
-  const c = [];
-  return E.forEach(function(d, u) {
-    let l = null;
-    d.forEach(function(g, t) {
-      if (!g && l !== null) {
-        c.push(
-          `M${l + i} ${u + i}h${t - l}v1H${l + i}z`
-        ), l = null;
-        return;
-      }
-      if (t === d.length - 1) {
-        if (!g)
-          return;
-        l === null ? c.push(`M${t + i},${u + i} h1v1H${t + i}z`) : c.push(
-          `M${l + i},${u + i} h${t + 1 - l}v1H${l + i}z`
-        );
-        return;
-      }
-      g && l === null && (l = t);
-    });
-  }), c.join("");
-}
-function V(E, i) {
-  return E.slice().map((c, d) => d < i.y || d >= i.y + i.h ? c : c.map((u, l) => l < i.x || l >= i.x + i.w ? u : !1));
-}
-function lt(E, i, c, d) {
-  if (d == null)
-    return null;
-  const u = E.length + c * 2, l = Math.floor(i * rt), g = u / i, t = (d.width || l) * g, s = (d.height || l) * g, e = d.x == null ? E.length / 2 - t / 2 : d.x * g, o = d.y == null ? E.length / 2 - s / 2 : d.y * g, n = d.opacity == null ? 1 : d.opacity;
-  let a = null;
-  if (d.excavate) {
-    const f = Math.floor(e), h = Math.floor(o), M = Math.ceil(t + e - f), p = Math.ceil(s + o - h);
-    a = { x: f, y: h, w: M, h: p };
-  }
-  const r = d.crossOrigin;
-  return { x: e, y: o, h: s, w: t, excavation: a, opacity: n, crossOrigin: r };
-}
-function at(E) {
-  return E != null ? Math.max(Math.floor(E), 0) : it;
-}
-function X({
-  value: E,
-  level: i,
-  minVersion: c,
-  marginSize: d,
-  imageSettings: u,
-  size: l,
-  boostLevel: g
-}) {
-  const t = A.useMemo(() => {
-    const r = (Array.isArray(E) ? E : [E]).reduce((f, h) => (f.push(...b.QrSegment.makeSegments(h)), f), []);
-    return b.QrCode.encodeSegments(
-      r,
-      nt[i],
-      c,
-      void 0,
-      void 0,
-      g
-    );
-  }, [E, i, c, g]), { cells: s, margin: e, numCells: o, calculatedImageSettings: n } = A.useMemo(() => {
-    const a = t.getModules(), r = at(d), f = a.length + r * 2, h = lt(
-      a,
-      l,
-      r,
-      u
-    );
-    return {
-      cells: a,
-      margin: r,
-      numCells: f,
-      calculatedImageSettings: h
-    };
-  }, [t, l, u, d]);
-  return {
-    qrcode: t,
-    margin: e,
-    cells: s,
-    numCells: o,
-    calculatedImageSettings: n
-  };
-}
-const ct = (function() {
-  try {
-    new Path2D().addPath(new Path2D());
-  } catch {
-    return !1;
-  }
-  return !0;
-})(), K = A.forwardRef(
-  function(i, c) {
-    const {
-      value: d,
-      size: u = k,
-      level: l = H,
-      bgColor: g = $,
-      fgColor: t = x,
-      minVersion: s = Y,
-      boostLevel: e,
-      marginSize: o,
-      imageSettings: n,
-      ...a
-    } = i, { style: r, ...f } = a, h = n?.src, M = A.useRef(null), p = A.useRef(null), m = A.useCallback(
-      (y) => {
-        M.current = y, typeof c == "function" ? c(y) : c && (c.current = y);
-      },
-      [c]
-    ), [w, R] = A.useState(!1), { margin: I, cells: O, numCells: F, calculatedImageSettings: C } = X({
-      value: d,
-      level: l,
-      minVersion: s,
-      boostLevel: e,
-      marginSize: o,
-      imageSettings: n,
-      size: u
-    });
-    A.useEffect(() => {
-      if (M.current != null) {
-        const y = M.current, N = y.getContext("2d");
-        if (!N)
-          return;
-        let B = O;
-        const v = p.current, T = C != null && v !== null && v.complete && v.naturalHeight !== 0 && v.naturalWidth !== 0;
-        T && C.excavation != null && (B = V(
-          O,
-          C.excavation
-        ));
-        const D = window.devicePixelRatio || 1;
-        y.height = y.width = u * D;
-        const S = u / F * D;
-        N.scale(S, S), N.fillStyle = g, N.fillRect(0, 0, F, F), N.fillStyle = t, ct ? N.fill(new Path2D(G(B, I))) : O.forEach(function(Z, q) {
-          Z.forEach(function(J, _) {
-            J && N.fillRect(_ + I, q + I, 1, 1);
-          });
-        }), C && (N.globalAlpha = C.opacity), T && N.drawImage(
-          v,
-          C.x + I,
-          C.y + I,
-          C.w,
-          C.h
-        );
-      }
-    }), A.useEffect(() => {
-      R(!1);
-    }, [h]);
-    const j = { height: u, width: u, ...r };
-    let z = null;
-    return h != null && (z = /* @__PURE__ */ P(
-      "img",
-      {
-        src: h,
-        style: { display: "none" },
-        onLoad: () => {
-          R(!0);
-        },
-        ref: p,
-        crossOrigin: C?.crossOrigin
-      },
-      h
-    )), /* @__PURE__ */ U(Q, { children: [
-      /* @__PURE__ */ P(
-        "canvas",
-        {
-          style: j,
-          height: u,
-          width: u,
-          ref: m,
-          role: "img",
-          ...f
-        }
-      ),
-      z
-    ] });
-  }
-);
-K.displayName = "QRCodeCanvas";
-const W = A.forwardRef(
-  function(i, c) {
-    const {
-      value: d,
-      size: u = k,
-      level: l = H,
-      bgColor: g = $,
-      fgColor: t = x,
-      minVersion: s = Y,
-      boostLevel: e,
-      title: o,
-      marginSize: n,
-      imageSettings: a,
-      ...r
-    } = i, { margin: f, cells: h, numCells: M, calculatedImageSettings: p } = X({
-      value: d,
-      level: l,
-      minVersion: s,
-      boostLevel: e,
-      marginSize: n,
-      imageSettings: a,
-      size: u
-    });
-    let m = h, w = null;
-    a != null && p != null && (p.excavation != null && (m = V(
-      h,
-      p.excavation
-    )), w = /* @__PURE__ */ P(
-      "image",
-      {
-        href: a.src,
-        height: p.h,
-        width: p.w,
-        x: p.x + f,
-        y: p.y + f,
-        preserveAspectRatio: "none",
-        opacity: p.opacity,
-        crossOrigin: p.crossOrigin
-      }
-    ));
-    const R = G(m, f);
-    return /* @__PURE__ */ U(
-      "svg",
-      {
-        height: u,
-        width: u,
-        viewBox: `0 0 ${M} ${M}`,
-        ref: c,
-        role: "img",
-        ...r,
-        children: [
-          !!o && /* @__PURE__ */ P("title", { children: o }),
-          /* @__PURE__ */ P(
-            "path",
-            {
-              fill: g,
-              d: `M0,0 h${M}v${M}H0z`,
-              shapeRendering: "crispEdges"
-            }
-          ),
-          /* @__PURE__ */ P("path", { fill: t, d: R, shapeRendering: "crispEdges" }),
-          w
-        ]
-      }
-    );
-  }
-);
-W.displayName = "QRCodeSVG";
-const ht = {
+import "lodash/merge";
+import "@unicom-cloud/utils/dom-helpers/reflow";
+import Q from "@unicom-cloud/utils/class-name";
+import { QRCodeCanvas as R, QRCodeSVG as S } from "./src/index.js";
+import { default as po } from "./src/qrcodegen.js";
+import h from "../config-provider/context.js";
+const N = {
   renderAs: "svg",
   size: 160,
   bordered: !0,
   errorLevel: "M",
-  fgColor: "#000000",
-  bgColor: "#ffffff",
+  fgColor: "var(--pqb-color-text-1, #000000)",
+  bgColor: "var(--pqb-color-bg-2, #ffffff)",
   marginSize: 0,
-  value: "qr-code"
-}, St = (E) => {
-  const { getPrefixCls: i, componentConfig: c } = tt(et), d = st(
-    E,
-    ht,
-    c?.QRCode
+  value: "二维码组件"
+}, to = (p) => {
+  const { getPrefixCls: s, componentConfig: n } = z(h), d = P(
+    p,
+    N,
+    n?.QRCode
   ), {
-    value: u,
-    renderAs: l,
-    size: g,
+    value: l,
+    renderAs: e,
+    size: o,
     bordered: t,
-    errorLevel: s,
-    fgColor: e,
-    bgColor: o,
-    marginSize: n = 0,
-    imageSettings: a,
-    className: r,
-    style: f
-  } = d, h = i?.("qrcode"), M = g - (t ? 12 : 0), p = () => {
+    errorLevel: a,
+    fgColor: c,
+    bgColor: f,
+    marginSize: C = 0,
+    imageSettings: g,
+    className: v,
+    style: u,
+    ...b
+  } = d, i = s?.("qrcode"), x = o - (t ? 12 : 0), q = () => {
     const m = {
-      value: u,
-      size: M,
-      level: s,
-      fgColor: e,
-      bgColor: o,
-      marginSize: n,
-      imageSettings: a
+      value: l,
+      size: x,
+      level: a,
+      fgColor: c,
+      bgColor: f,
+      marginSize: C,
+      imageSettings: g,
+      ...b
     };
-    return l === "canvas" ? /* @__PURE__ */ P(K, { ...m }) : /* @__PURE__ */ P(W, { ...m });
+    return e === "canvas" ? /* @__PURE__ */ r(R, { ...m }) : /* @__PURE__ */ r(S, { ...m });
   };
-  return /* @__PURE__ */ P(
+  return /* @__PURE__ */ r(
     "div",
     {
-      className: ot(
-        h,
-        t && `${h}-bordered`,
-        r,
-        `qrcode-${l}`
+      className: Q(
+        i,
+        t && `${i}-bordered`,
+        v,
+        `qrcode-${e}`
       ),
       style: {
-        width: g,
-        height: g,
-        ...f
+        width: o,
+        height: o,
+        ...u
       },
-      children: p()
+      children: q()
     }
   );
 };
 export {
-  St as default,
-  b as qrcodegen
+  to as default,
+  po as qrcodegen
 };