sanity 3.74.2-corel.18 → 3.74.2-coreui.20

package/dist/QRCodeSVG-D6VfGEbM.mjs

@@ -1,648 +0,0 @@
-var y = Object.defineProperty;
-var F = (c, t, e) => t in c ? y(c, t, { enumerable: !0, configurable: !0, writable: !0, value: e }) : c[t] = e;
-var f = (c, t, e) => F(c, typeof t != "symbol" ? t + "" : t, e);
-import { jsxs as O, jsx as b } from "react/jsx-runtime";
-import { memo as T, useMemo as S } from "react";
-import { m as D } from "./v4-C78sE4Gb.mjs";
-/**
- * @license QR Code generator library (TypeScript)
- * Copyright (c) Project Nayuki.
- * SPDX-License-Identifier: MIT
- */
-const a = class a {
-  /*-- 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, e, s, n) {
-    /*-- Fields --*/
-    // The width and height of this QR Code, measured in modules, between
-    // 21 and 177 (inclusive). This is equal to version * 4 + 17.
-    // The index of the mask pattern used in this QR Code, which is between 0 and 7 (inclusive).
-    // Even if a QR Code is created with automatic masking requested (mask = -1),
-    // the resulting object still has a mask value between 0 and 7.
-    // The modules of this QR Code (false = light, true = dark).
-    // Immutable after constructor finishes. Accessed through getModule().
-    f(this, "modules", []);
-    // Indicates function modules that are not subjected to masking. Discarded when constructor finishes.
-    f(this, "isFunction", []);
-    if (this.version = t, this.errorCorrectionLevel = e, t < a.MIN_VERSION || t > a.MAX_VERSION) throw new RangeError("Version value out of range");
-    if (n < -1 || n > 7) throw new RangeError("Mask value out of range");
-    this.size = t * 4 + 17;
-    const o = [];
-    for (let i = 0; i < this.size; i++) o.push(!1);
-    for (let i = 0; i < this.size; i++)
-      this.modules.push(o.slice()), this.isFunction.push(o.slice());
-    this.drawFunctionPatterns();
-    const r = this.addEccAndInterleave(s);
-    if (this.drawCodewords(r), n == -1) {
-      let i = 1e9;
-      for (let u = 0; u < 8; u++) {
-        this.applyMask(u), this.drawFormatBits(u);
-        const h = this.getPenaltyScore();
-        h < i && (n = u, i = h), this.applyMask(u);
-      }
-    }
-    w(0 <= n && n <= 7), this.mask = n, this.applyMask(n), this.drawFormatBits(n), 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, e) {
-    const s = P.makeSegments(t);
-    return a.encodeSegments(s, e);
-  }
-  // 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, e) {
-    const s = P.makeBytes(t);
-    return a.encodeSegments([s], e);
-  }
-  /*-- 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, e, s = 1, n = 40, o = -1, r = !0) {
-    if (!(a.MIN_VERSION <= s && s <= n && n <= a.MAX_VERSION) || o < -1 || o > 7) throw new RangeError("Invalid value");
-    let i, u;
-    for (i = s; ; i++) {
-      const l = a.getNumDataCodewords(i, e) * 8, m = P.getTotalBits(t, i);
-      if (m <= l) {
-        u = m;
-        break;
-      }
-      if (i >= n)
-        throw new RangeError("Data too long");
-    }
-    for (const l of [p.MEDIUM, p.QUARTILE, p.HIGH])
-      r && u <= a.getNumDataCodewords(i, l) * 8 && (e = l);
-    const h = [];
-    for (const l of t) {
-      M(l.mode.modeBits, 4, h), M(l.numChars, l.mode.numCharCountBits(i), h);
-      for (const m of l.getData()) h.push(m);
-    }
-    w(h.length == u);
-    const g = a.getNumDataCodewords(i, e) * 8;
-    w(h.length <= g), M(0, Math.min(4, g - h.length), h), M(0, (8 - h.length % 8) % 8, h), w(h.length % 8 == 0);
-    for (let l = 236; h.length < g; l ^= 253) M(l, 8, h);
-    const E = [];
-    for (; E.length * 8 < h.length; ) E.push(0);
-    return h.forEach((l, m) => E[m >>> 3] |= l << 7 - (m & 7)), new a(i, e, E, 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, e) {
-    return 0 <= t && t < this.size && 0 <= e && e < this.size && this.modules[e][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 s = 0; s < this.size; s++)
-      this.setFunctionModule(6, s, s % 2 == 0), this.setFunctionModule(s, 6, s % 2 == 0);
-    this.drawFinderPattern(3, 3), this.drawFinderPattern(this.size - 4, 3), this.drawFinderPattern(3, this.size - 4);
-    const t = this.getAlignmentPatternPositions(), e = t.length;
-    for (let s = 0; s < e; s++)
-      for (let n = 0; n < e; n++)
-        s == 0 && n == 0 || s == 0 && n == e - 1 || s == e - 1 && n == 0 || this.drawAlignmentPattern(t[s], t[n]);
-    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 e = this.errorCorrectionLevel.formatBits << 3 | t;
-    let s = e;
-    for (let o = 0; o < 10; o++) s = s << 1 ^ (s >>> 9) * 1335;
-    const n = (e << 10 | s) ^ 21522;
-    w(n >>> 15 == 0);
-    for (let o = 0; o <= 5; o++) this.setFunctionModule(8, o, N(n, o));
-    this.setFunctionModule(8, 7, N(n, 6)), this.setFunctionModule(8, 8, N(n, 7)), this.setFunctionModule(7, 8, N(n, 8));
-    for (let o = 9; o < 15; o++) this.setFunctionModule(14 - o, 8, N(n, o));
-    for (let o = 0; o < 8; o++) this.setFunctionModule(this.size - 1 - o, 8, N(n, o));
-    for (let o = 8; o < 15; o++) this.setFunctionModule(8, this.size - 15 + o, N(n, 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 s = 0; s < 12; s++) t = t << 1 ^ (t >>> 11) * 7973;
-    const e = this.version << 12 | t;
-    w(e >>> 18 == 0);
-    for (let s = 0; s < 18; s++) {
-      const n = N(e, s), o = this.size - 11 + s % 3, r = Math.floor(s / 3);
-      this.setFunctionModule(o, r, n), this.setFunctionModule(r, o, n);
-    }
-  }
-  // 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, e) {
-    for (let s = -4; s <= 4; s++)
-      for (let n = -4; n <= 4; n++) {
-        const o = Math.max(Math.abs(n), Math.abs(s)), r = t + n, i = e + s;
-        0 <= r && r < this.size && 0 <= i && i < this.size && this.setFunctionModule(r, i, 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, e) {
-    for (let s = -2; s <= 2; s++)
-      for (let n = -2; n <= 2; n++) this.setFunctionModule(t + n, e + s, Math.max(Math.abs(n), 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.
-  setFunctionModule(t, e, s) {
-    this.modules[e][t] = s, this.isFunction[e][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 e = this.version, s = this.errorCorrectionLevel;
-    if (t.length != a.getNumDataCodewords(e, s)) throw new RangeError("Invalid argument");
-    const n = a.NUM_ERROR_CORRECTION_BLOCKS[s.ordinal][e], o = a.ECC_CODEWORDS_PER_BLOCK[s.ordinal][e], r = Math.floor(a.getNumRawDataModules(e) / 8), i = n - r % n, u = Math.floor(r / n), h = [], g = a.reedSolomonComputeDivisor(o);
-    for (let l = 0, m = 0; l < n; l++) {
-      const R = t.slice(m, m + u - o + (l < i ? 0 : 1));
-      m += R.length;
-      const L = a.reedSolomonComputeRemainder(R, g);
-      l < i && R.push(0), h.push(R.concat(L));
-    }
-    const E = [];
-    for (let l = 0; l < h[0].length; l++)
-      h.forEach((m, R) => {
-        (l != u - o || R >= i) && E.push(m[l]);
-      });
-    return w(E.length == r), E;
-  }
-  // 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(a.getNumRawDataModules(this.version) / 8)) throw new RangeError("Invalid argument");
-    let e = 0;
-    for (let s = this.size - 1; s >= 1; s -= 2) {
-      s == 6 && (s = 5);
-      for (let n = 0; n < this.size; n++)
-        for (let o = 0; o < 2; o++) {
-          const r = s - o, i = s + 1 & 2 ? n : this.size - 1 - n;
-          !this.isFunction[i][r] && e < t.length * 8 && (this.modules[i][r] = N(t[e >>> 3], 7 - (e & 7)), e++);
-        }
-    }
-    w(e == 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 e = 0; e < this.size; e++)
-      for (let s = 0; s < this.size; s++) {
-        let n;
-        switch (t) {
-          case 0:
-            n = (s + e) % 2 == 0;
-            break;
-          case 1:
-            n = e % 2 == 0;
-            break;
-          case 2:
-            n = s % 3 == 0;
-            break;
-          case 3:
-            n = (s + e) % 3 == 0;
-            break;
-          case 4:
-            n = (Math.floor(s / 3) + Math.floor(e / 2)) % 2 == 0;
-            break;
-          case 5:
-            n = s * e % 2 + s * e % 3 == 0;
-            break;
-          case 6:
-            n = (s * e % 2 + s * e % 3) % 2 == 0;
-            break;
-          case 7:
-            n = ((s + e) % 2 + s * e % 3) % 2 == 0;
-            break;
-          default:
-            throw new Error("Unreachable");
-        }
-        !this.isFunction[e][s] && n && (this.modules[e][s] = !this.modules[e][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.
-  getPenaltyScore() {
-    let t = 0;
-    for (let o = 0; o < this.size; o++) {
-      let r = !1, i = 0;
-      const u = [0, 0, 0, 0, 0, 0, 0];
-      for (let h = 0; h < this.size; h++)
-        this.modules[o][h] == r ? (i++, i == 5 ? t += a.PENALTY_N1 : i > 5 && t++) : (this.finderPenaltyAddHistory(i, u), r || (t += this.finderPenaltyCountPatterns(u) * a.PENALTY_N3), r = this.modules[o][h], i = 1);
-      t += this.finderPenaltyTerminateAndCount(r, i, u) * a.PENALTY_N3;
-    }
-    for (let o = 0; o < this.size; o++) {
-      let r = !1, i = 0;
-      const u = [0, 0, 0, 0, 0, 0, 0];
-      for (let h = 0; h < this.size; h++)
-        this.modules[h][o] == r ? (i++, i == 5 ? t += a.PENALTY_N1 : i > 5 && t++) : (this.finderPenaltyAddHistory(i, u), r || (t += this.finderPenaltyCountPatterns(u) * a.PENALTY_N3), r = this.modules[h][o], i = 1);
-      t += this.finderPenaltyTerminateAndCount(r, i, u) * a.PENALTY_N3;
-    }
-    for (let o = 0; o < this.size - 1; o++)
-      for (let r = 0; r < this.size - 1; r++) {
-        const i = this.modules[o][r];
-        i == this.modules[o][r + 1] && i == this.modules[o + 1][r] && i == this.modules[o + 1][r + 1] && (t += a.PENALTY_N2);
-      }
-    let e = 0;
-    for (const o of this.modules) e = o.reduce((r, i) => r + (i ? 1 : 0), e);
-    const s = this.size * this.size, n = Math.ceil(Math.abs(e * 20 - s * 10) / s) - 1;
-    return w(0 <= n && n <= 9), t += n * a.PENALTY_N4, 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.
-  getAlignmentPatternPositions() {
-    if (this.version == 1) return [];
-    {
-      const t = Math.floor(this.version / 7) + 2, e = this.version == 32 ? 26 : Math.ceil((this.version * 4 + 4) / (t * 2 - 2)) * 2, s = [6];
-      for (let n = this.size - 7; s.length < t; n -= e) s.splice(1, 0, n);
-      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 getNumRawDataModules(t) {
-    if (t < a.MIN_VERSION || t > a.MAX_VERSION) throw new RangeError("Version number out of range");
-    let e = (16 * t + 128) * t + 64;
-    if (t >= 2) {
-      const s = Math.floor(t / 7) + 2;
-      e -= (25 * s - 10) * s - 55, t >= 7 && (e -= 36);
-    }
-    return w(208 <= e && e <= 29648), e;
-  }
-  // 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, e) {
-    return Math.floor(a.getNumRawDataModules(t) / 8) - a.ECC_CODEWORDS_PER_BLOCK[e.ordinal][t] * a.NUM_ERROR_CORRECTION_BLOCKS[e.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 e = [];
-    for (let n = 0; n < t - 1; n++) e.push(0);
-    e.push(1);
-    let s = 1;
-    for (let n = 0; n < t; n++) {
-      for (let o = 0; o < e.length; o++)
-        e[o] = a.reedSolomonMultiply(e[o], s), o + 1 < e.length && (e[o] ^= e[o + 1]);
-      s = a.reedSolomonMultiply(s, 2);
-    }
-    return e;
-  }
-  // Returns the Reed-Solomon error correction codeword for the given data and divisor polynomials.
-  static reedSolomonComputeRemainder(t, e) {
-    const s = e.map((n) => 0);
-    for (const n of t) {
-      const o = n ^ s.shift();
-      s.push(0), e.forEach((r, i) => s[i] ^= a.reedSolomonMultiply(r, o));
-    }
-    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 reedSolomonMultiply(t, e) {
-    if (t >>> 8 || e >>> 8) throw new RangeError("Byte out of range");
-    let s = 0;
-    for (let n = 7; n >= 0; n--)
-      s = s << 1 ^ (s >>> 7) * 285, s ^= (e >>> n & 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().
-  finderPenaltyCountPatterns(t) {
-    const e = t[1];
-    w(e <= this.size * 3);
-    const s = e > 0 && t[2] == e && t[3] == e * 3 && t[4] == e && t[5] == e;
-    return (s && t[0] >= e * 4 && t[6] >= e ? 1 : 0) + (s && t[6] >= e * 4 && t[0] >= e ? 1 : 0);
-  }
-  // Must be called at the end of a line (row or column) of modules. A helper function for getPenaltyScore().
-  finderPenaltyTerminateAndCount(t, e, s) {
-    return t && (this.finderPenaltyAddHistory(e, s), e = 0), e += this.size, this.finderPenaltyAddHistory(e, s), this.finderPenaltyCountPatterns(s);
-  }
-  // Pushes the given value to the front and drops the last value. A helper function for getPenaltyScore().
-  finderPenaltyAddHistory(t, e) {
-    e[0] == 0 && (t += this.size), e.pop(), e.unshift(t);
-  }
-};
-/*-- Constants and tables --*/
-// The minimum version number supported in the QR Code Model 2 standard.
-f(a, "MIN_VERSION", 1), // The maximum version number supported in the QR Code Model 2 standard.
-f(a, "MAX_VERSION", 40), // For use in getPenaltyScore(), when evaluating which mask is best.
-f(a, "PENALTY_N1", 3), f(a, "PENALTY_N2", 3), f(a, "PENALTY_N3", 40), f(a, "PENALTY_N4", 10), f(a, "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
-]), f(a, "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 B = a;
-function M(c, t, e) {
-  if (t < 0 || t > 31 || c >>> t) throw new RangeError("Value out of range");
-  for (let s = t - 1; s >= 0; s--) e.push(c >>> s & 1);
-}
-function N(c, t) {
-  return (c >>> t & 1) != 0;
-}
-function w(c) {
-  if (!c) throw new Error("Assertion error");
-}
-const d = class d {
-  /*-- 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 e = [];
-    for (const s of t) M(s, 8, e);
-    return new d(I.BYTE, t.length, e);
-  }
-  // Returns a segment representing the given string of decimal digits encoded in numeric mode.
-  static makeNumeric(t) {
-    if (!d.isNumeric(t)) throw new RangeError("String contains non-numeric characters");
-    const e = [];
-    for (let s = 0; s < t.length; ) {
-      const n = Math.min(t.length - s, 3);
-      M(parseInt(t.substring(s, s + n), 10), n * 3 + 1, e), s += n;
-    }
-    return new d(I.NUMERIC, t.length, e);
-  }
-  // 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 (!d.isAlphanumeric(t)) throw new RangeError("String contains unencodable characters in alphanumeric mode");
-    const e = [];
-    let s;
-    for (s = 0; s + 2 <= t.length; s += 2) {
-      let n = d.ALPHANUMERIC_CHARSET.indexOf(t.charAt(s)) * 45;
-      n += d.ALPHANUMERIC_CHARSET.indexOf(t.charAt(s + 1)), M(n, 11, e);
-    }
-    return s < t.length && M(d.ALPHANUMERIC_CHARSET.indexOf(t.charAt(s)), 6, e), new d(I.ALPHANUMERIC, t.length, e);
-  }
-  // 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 == "" ? [] : d.isNumeric(t) ? [d.makeNumeric(t)] : d.isAlphanumeric(t) ? [d.makeAlphanumeric(t)] : [d.makeBytes(d.toUtf8ByteArray(t))];
-  }
-  // Returns a segment representing an Extended Channel Interpretation
-  // (ECI) designator with the given assignment value.
-  static makeEci(t) {
-    const e = [];
-    if (t < 0) throw new RangeError("ECI assignment value out of range");
-    if (t < 128) M(t, 8, e);
-    else if (t < 16384)
-      M(2, 2, e), M(t, 14, e);
-    else if (t < 1e6)
-      M(6, 3, e), M(t, 21, e);
-    else throw new RangeError("ECI assignment value out of range");
-    return new d(I.ECI, 0, e);
-  }
-  // 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 d.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 d.ALPHANUMERIC_REGEX.test(t);
-  }
-  /*-- 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, e, s) {
-    if (this.mode = t, this.numChars = e, this.bitData = s, e < 0) throw new RangeError("Invalid argument");
-    this.bitData = s.slice();
-  }
-  /*-- 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, e) {
-    let s = 0;
-    for (const n of t) {
-      const o = n.mode.numCharCountBits(e);
-      if (n.numChars >= 1 << o) return 1 / 0;
-      s += 4 + o + n.bitData.length;
-    }
-    return s;
-  }
-  // Returns a new array of bytes representing the given string encoded in UTF-8.
-  static toUtf8ByteArray(t) {
-    t = encodeURI(t);
-    const e = [];
-    for (let s = 0; s < t.length; s++)
-      t.charAt(s) != "%" ? e.push(t.charCodeAt(s)) : (e.push(parseInt(t.substring(s + 1, s + 3), 16)), s += 2);
-    return e;
-  }
-};
-/*-- Constants --*/
-// Describes precisely all strings that are encodable in numeric mode.
-f(d, "NUMERIC_REGEX", /^[0-9]*$/), // Describes precisely all strings that are encodable in alphanumeric mode.
-f(d, "ALPHANUMERIC_REGEX", /^[A-Z0-9 $%*+./:-]*$/), // The set of all legal characters in alphanumeric mode,
-// where each character value maps to the index in the string.
-f(d, "ALPHANUMERIC_CHARSET", "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ $%*+-./:");
-let P = d;
-const A = class A {
-  // The QR Code can tolerate about 30% erroneous codewords
-  /*-- Constructor and fields --*/
-  constructor(t, e) {
-    this.ordinal = t, this.formatBits = e;
-  }
-};
-/*-- Constants --*/
-f(A, "LOW", new A(0, 1)), // The QR Code can tolerate about  7% erroneous codewords
-f(A, "MEDIUM", new A(1, 0)), // The QR Code can tolerate about 15% erroneous codewords
-f(A, "QUARTILE", new A(2, 3)), // The QR Code can tolerate about 25% erroneous codewords
-f(A, "HIGH", new A(3, 2));
-let p = A;
-const C = class C {
-  /*-- Constructor and fields --*/
-  constructor(t, e) {
-    this.modeBits = t, this.numBitsCharCount = e;
-  }
-  /*-- 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)];
-  }
-};
-/*-- Constants --*/
-f(C, "NUMERIC", new C(1, [10, 12, 14])), f(C, "ALPHANUMERIC", new C(2, [9, 11, 13])), f(C, "BYTE", new C(4, [8, 16, 16])), f(C, "KANJI", new C(8, [8, 10, 12])), f(C, "ECI", new C(7, [0, 0, 0]));
-let I = C;
-const U = {
-  L: p.LOW,
-  M: p.MEDIUM,
-  Q: p.QUARTILE,
-  H: p.HIGH
-}, z = 128, v = "L", k = "#000000", H = !1, Y = 1, $ = 4, G = 0;
-function X(c, t = 0) {
-  const e = [];
-  return c.forEach(function(s, n) {
-    let o = null;
-    s.forEach(function(r, i) {
-      if (!r && o !== null) {
-        e.push(`M${o + t} ${n + t}h${i - o}v1H${o + t}z`), o = null;
-        return;
-      }
-      if (i === s.length - 1) {
-        if (!r)
-          return;
-        o === null ? e.push(`M${i + t},${n + t} h1v1H${i + t}z`) : e.push(`M${o + t},${n + t} h${i + 1 - o}v1H${o + t}z`);
-        return;
-      }
-      r && o === null && (o = i);
-    });
-  }), e.join("");
-}
-function V(c, t) {
-  return c.slice().map((e, s) => s < t.y || s >= t.y + t.h ? e : e.map((n, o) => o < t.x || o >= t.x + t.w ? n : !1));
-}
-function K(c, t, e, s) {
-  if (!s)
-    return null;
-  const n = (c.length + e * 2) / t, o = s * n, r = s * n, i = c.length / 2 - o / 2, u = c.length / 2 - r / 2, h = Math.floor(i), g = Math.floor(u), E = Math.ceil(o + i - h), l = Math.ceil(r + u - g);
-  return {
-    x: i,
-    y: u,
-    h: r,
-    w: o,
-    excavation: {
-      x: h,
-      y: g,
-      w: E,
-      h: l
-    }
-  };
-}
-function W(c, t) {
-  return t != null ? Math.max(Math.floor(t), 0) : c ? $ : G;
-}
-function j({
-  value: c,
-  level: t,
-  minVersion: e,
-  includeMargin: s,
-  marginSize: n,
-  logoSize: o,
-  size: r
-}) {
-  const i = S(() => {
-    const l = P.makeSegments(c);
-    return B.encodeSegments(l, U[t], e);
-  }, [c, t, e]), {
-    cells: u,
-    margin: h,
-    numCells: g,
-    calculatedImageSettings: E
-  } = S(() => {
-    const l = i.getModules(), m = W(s, n), R = l.length + m * 2, L = K(l, r, m, o);
-    return {
-      cells: l,
-      margin: m,
-      numCells: R,
-      calculatedImageSettings: L
-    };
-  }, [i, r, o, s, n]);
-  return {
-    qrcode: i,
-    margin: h,
-    cells: u,
-    numCells: g,
-    calculatedImageSettings: E
-  };
-}
-function Z(c) {
-  const {
-    value: t,
-    size: e = z,
-    level: s = v,
-    color: n = k,
-    minVersion: o = Y,
-    title: r,
-    logoSize: i
-  } = c, u = void 0, {
-    margin: h,
-    cells: g,
-    numCells: E,
-    calculatedImageSettings: l
-  } = j({
-    value: t,
-    level: s,
-    minVersion: o,
-    includeMargin: H,
-    marginSize: u,
-    logoSize: i,
-    size: e
-  }), m = S(() => i && (l != null && l.excavation) ? V(g, l.excavation) : g, [l == null ? void 0 : l.excavation, g, i]), R = X(m, h);
-  return /* @__PURE__ */ O("svg", { height: e, width: e, viewBox: `0 0 ${E} ${E}`, role: "img", children: [
-    !!r && /* @__PURE__ */ b("title", { children: r }),
-    /* @__PURE__ */ b(D.path, { fill: n, d: R, shapeRendering: "crispEdges", initial: {
-      opacity: 0
-    }, animate: {
-      opacity: 2
-    }, exit: {
-      opacity: -1
-    } })
-  ] });
-}
-const x = T(Z);
-x.displayName = "Memo(QRCodeSVG)";
-export {
-  x as default
-};
-//# sourceMappingURL=QRCodeSVG-D6VfGEbM.mjs.map