@burdenoff/microfe-assethandler 2026.820.2 → 2026.820.4

package/dist/node_modules/qrcode/lib/core/mode.js

@@ -0,0 +1,74 @@
+import { __commonJSMin as e } from "../../../../_virtual/_rolldown/runtime.js";
+import { require_version_check as t } from "./version-check.js";
+import { require_regex as n } from "./regex.js";
+//#region node_modules/qrcode/lib/core/mode.js
+var r = /* @__PURE__ */ e(((e) => {
+	var r = t(), i = n();
+	e.NUMERIC = {
+		id: "Numeric",
+		bit: 1,
+		ccBits: [
+			10,
+			12,
+			14
+		]
+	}, e.ALPHANUMERIC = {
+		id: "Alphanumeric",
+		bit: 2,
+		ccBits: [
+			9,
+			11,
+			13
+		]
+	}, e.BYTE = {
+		id: "Byte",
+		bit: 4,
+		ccBits: [
+			8,
+			16,
+			16
+		]
+	}, e.KANJI = {
+		id: "Kanji",
+		bit: 8,
+		ccBits: [
+			8,
+			10,
+			12
+		]
+	}, e.MIXED = { bit: -1 }, e.getCharCountIndicator = function(e, t) {
+		if (!e.ccBits) throw Error("Invalid mode: " + e);
+		if (!r.isValid(t)) throw Error("Invalid version: " + t);
+		return t >= 1 && t < 10 ? e.ccBits[0] : t < 27 ? e.ccBits[1] : e.ccBits[2];
+	}, e.getBestModeForData = function(t) {
+		return i.testNumeric(t) ? e.NUMERIC : i.testAlphanumeric(t) ? e.ALPHANUMERIC : i.testKanji(t) ? e.KANJI : e.BYTE;
+	}, e.toString = function(e) {
+		if (e && e.id) return e.id;
+		throw Error("Invalid mode");
+	}, e.isValid = function(e) {
+		return e && e.bit && e.ccBits;
+	};
+	function a(t) {
+		if (typeof t != "string") throw Error("Param is not a string");
+		switch (t.toLowerCase()) {
+			case "numeric": return e.NUMERIC;
+			case "alphanumeric": return e.ALPHANUMERIC;
+			case "kanji": return e.KANJI;
+			case "byte": return e.BYTE;
+			default: throw Error("Unknown mode: " + t);
+		}
+	}
+	e.from = function(t, n) {
+		if (e.isValid(t)) return t;
+		try {
+			return a(t);
+		} catch {
+			return n;
+		}
+	};
+}));
+//#endregion
+export default r();
+export { r as require_mode };
+
+//# sourceMappingURL=mode.js.map

package/dist/node_modules/qrcode/lib/core/mode.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mode.js","names":[],"sources":["../../../../../node_modules/qrcode/lib/core/mode.js"],"sourcesContent":["const VersionCheck = require('./version-check')\nconst Regex = require('./regex')\n\n/**\n * Numeric mode encodes data from the decimal digit set (0 - 9)\n * (byte values 30HEX to 39HEX).\n * Normally, 3 data characters are represented by 10 bits.\n *\n * @type {Object}\n */\nexports.NUMERIC = {\n  id: 'Numeric',\n  bit: 1 << 0,\n  ccBits: [10, 12, 14]\n}\n\n/**\n * Alphanumeric mode encodes data from a set of 45 characters,\n * i.e. 10 numeric digits (0 - 9),\n *      26 alphabetic characters (A - Z),\n *   and 9 symbols (SP, $, %, *, +, -, ., /, :).\n * Normally, two input characters are represented by 11 bits.\n *\n * @type {Object}\n */\nexports.ALPHANUMERIC = {\n  id: 'Alphanumeric',\n  bit: 1 << 1,\n  ccBits: [9, 11, 13]\n}\n\n/**\n * In byte mode, data is encoded at 8 bits per character.\n *\n * @type {Object}\n */\nexports.BYTE = {\n  id: 'Byte',\n  bit: 1 << 2,\n  ccBits: [8, 16, 16]\n}\n\n/**\n * The Kanji mode efficiently encodes Kanji characters in accordance with\n * the Shift JIS system based on JIS X 0208.\n * The Shift JIS values are shifted from the JIS X 0208 values.\n * JIS X 0208 gives details of the shift coded representation.\n * Each two-byte character value is compacted to a 13-bit binary codeword.\n *\n * @type {Object}\n */\nexports.KANJI = {\n  id: 'Kanji',\n  bit: 1 << 3,\n  ccBits: [8, 10, 12]\n}\n\n/**\n * Mixed mode will contain a sequences of data in a combination of any of\n * the modes described above\n *\n * @type {Object}\n */\nexports.MIXED = {\n  bit: -1\n}\n\n/**\n * Returns the number of bits needed to store the data length\n * according to QR Code specifications.\n *\n * @param  {Mode}   mode    Data mode\n * @param  {Number} version QR Code version\n * @return {Number}         Number of bits\n */\nexports.getCharCountIndicator = function getCharCountIndicator (mode, version) {\n  if (!mode.ccBits) throw new Error('Invalid mode: ' + mode)\n\n  if (!VersionCheck.isValid(version)) {\n    throw new Error('Invalid version: ' + version)\n  }\n\n  if (version >= 1 && version < 10) return mode.ccBits[0]\n  else if (version < 27) return mode.ccBits[1]\n  return mode.ccBits[2]\n}\n\n/**\n * Returns the most efficient mode to store the specified data\n *\n * @param  {String} dataStr Input data string\n * @return {Mode}           Best mode\n */\nexports.getBestModeForData = function getBestModeForData (dataStr) {\n  if (Regex.testNumeric(dataStr)) return exports.NUMERIC\n  else if (Regex.testAlphanumeric(dataStr)) return exports.ALPHANUMERIC\n  else if (Regex.testKanji(dataStr)) return exports.KANJI\n  else return exports.BYTE\n}\n\n/**\n * Return mode name as string\n *\n * @param {Mode} mode Mode object\n * @returns {String}  Mode name\n */\nexports.toString = function toString (mode) {\n  if (mode && mode.id) return mode.id\n  throw new Error('Invalid mode')\n}\n\n/**\n * Check if input param is a valid mode object\n *\n * @param   {Mode}    mode Mode object\n * @returns {Boolean} True if valid mode, false otherwise\n */\nexports.isValid = function isValid (mode) {\n  return mode && mode.bit && mode.ccBits\n}\n\n/**\n * Get mode object from its name\n *\n * @param   {String} string Mode name\n * @returns {Mode}          Mode object\n */\nfunction fromString (string) {\n  if (typeof string !== 'string') {\n    throw new Error('Param is not a string')\n  }\n\n  const lcStr = string.toLowerCase()\n\n  switch (lcStr) {\n    case 'numeric':\n      return exports.NUMERIC\n    case 'alphanumeric':\n      return exports.ALPHANUMERIC\n    case 'kanji':\n      return exports.KANJI\n    case 'byte':\n      return exports.BYTE\n    default:\n      throw new Error('Unknown mode: ' + string)\n  }\n}\n\n/**\n * Returns mode from a value.\n * If value is not a valid mode, returns defaultValue\n *\n * @param  {Mode|String} value        Encoding mode\n * @param  {Mode}        defaultValue Fallback value\n * @return {Mode}                     Encoding mode\n */\nexports.from = function from (value, defaultValue) {\n  if (exports.isValid(value)) {\n    return value\n  }\n\n  try {\n    return fromString(value)\n  } catch (e) {\n    return defaultValue\n  }\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;;CAAA,IAAM,IAAA,GAAA,EACA,IAAA,GAAA;AAoHN,CA3GA,EAAQ,UAAU;EAChB,IAAI;EACJ,KAAK;EACL,QAAQ;GAAC;GAAI;GAAI;GAAG;EACrB,EAWD,EAAQ,eAAe;EACrB,IAAI;EACJ,KAAK;EACL,QAAQ;GAAC;GAAG;GAAI;GAAG;EACpB,EAOD,EAAQ,OAAO;EACb,IAAI;EACJ,KAAK;EACL,QAAQ;GAAC;GAAG;GAAI;GAAG;EACpB,EAWD,EAAQ,QAAQ;EACd,IAAI;EACJ,KAAK;EACL,QAAQ;GAAC;GAAG;GAAI;GAAG;EACpB,EAQD,EAAQ,QAAQ,EACd,KAAK,IACN,EAUD,EAAQ,wBAAwB,SAAgC,GAAM,GAAS;AAC7E,MAAI,CAAC,EAAK,OAAQ,OAAU,MAAM,mBAAmB,EAAK;AAE1D,MAAI,CAAC,EAAa,QAAQ,EAAQ,CAChC,OAAU,MAAM,sBAAsB,EAAQ;AAKhD,SAFI,KAAW,KAAK,IAAU,KAAW,EAAK,OAAO,KAC5C,IAAU,KAAW,EAAK,OAAO,KACnC,EAAK,OAAO;IASrB,EAAQ,qBAAqB,SAA6B,GAAS;AAI5D,SAHD,EAAM,YAAY,EAAQ,GAAS,EAAQ,UACtC,EAAM,iBAAiB,EAAQ,GAAS,EAAQ,eAChD,EAAM,UAAU,EAAQ,GAAS,EAAQ,QACtC,EAAQ;IAStB,EAAQ,WAAW,SAAmB,GAAM;AAC1C,MAAI,KAAQ,EAAK,GAAI,QAAO,EAAK;AACjC,QAAU,MAAM,eAAe;IASjC,EAAQ,UAAU,SAAkB,GAAM;AACxC,SAAO,KAAQ,EAAK,OAAO,EAAK;;CASlC,SAAS,EAAY,GAAQ;AAC3B,MAAI,OAAO,KAAW,SACpB,OAAU,MAAM,wBAAwB;AAK1C,UAFc,EAAO,aAAa,EAElC;GACE,KAAK,UACH,QAAO,EAAQ;GACjB,KAAK,eACH,QAAO,EAAQ;GACjB,KAAK,QACH,QAAO,EAAQ;GACjB,KAAK,OACH,QAAO,EAAQ;GACjB,QACE,OAAU,MAAM,mBAAmB,EAAO;;;AAYhD,GAAQ,OAAO,SAAe,GAAO,GAAc;AACjD,MAAI,EAAQ,QAAQ,EAAM,CACxB,QAAO;AAGT,MAAI;AACF,UAAO,EAAW,EAAM;UACd;AACV,UAAO"}

package/dist/node_modules/qrcode/lib/core/numeric-data.js

@@ -0,0 +1,26 @@
+import { __commonJSMin as e } from "../../../../_virtual/_rolldown/runtime.js";
+import { require_mode as t } from "./mode.js";
+//#region node_modules/qrcode/lib/core/numeric-data.js
+var n = /* @__PURE__ */ e(((e, n) => {
+	var r = t();
+	function i(e) {
+		this.mode = r.NUMERIC, this.data = e.toString();
+	}
+	i.getBitsLength = function(e) {
+		return 10 * Math.floor(e / 3) + (e % 3 ? e % 3 * 3 + 1 : 0);
+	}, i.prototype.getLength = function() {
+		return this.data.length;
+	}, i.prototype.getBitsLength = function() {
+		return i.getBitsLength(this.data.length);
+	}, i.prototype.write = function(e) {
+		let t, n, r;
+		for (t = 0; t + 3 <= this.data.length; t += 3) n = this.data.substr(t, 3), r = parseInt(n, 10), e.put(r, 10);
+		let i = this.data.length - t;
+		i > 0 && (n = this.data.substr(t), r = parseInt(n, 10), e.put(r, i * 3 + 1));
+	}, n.exports = i;
+}));
+//#endregion
+export default n();
+export { n as require_numeric_data };
+
+//# sourceMappingURL=numeric-data.js.map

package/dist/node_modules/qrcode/lib/core/numeric-data.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"numeric-data.js","names":[],"sources":["../../../../../node_modules/qrcode/lib/core/numeric-data.js"],"sourcesContent":["const Mode = require('./mode')\n\nfunction NumericData (data) {\n  this.mode = Mode.NUMERIC\n  this.data = data.toString()\n}\n\nNumericData.getBitsLength = function getBitsLength (length) {\n  return 10 * Math.floor(length / 3) + ((length % 3) ? ((length % 3) * 3 + 1) : 0)\n}\n\nNumericData.prototype.getLength = function getLength () {\n  return this.data.length\n}\n\nNumericData.prototype.getBitsLength = function getBitsLength () {\n  return NumericData.getBitsLength(this.data.length)\n}\n\nNumericData.prototype.write = function write (bitBuffer) {\n  let i, group, value\n\n  // The input data string is divided into groups of three digits,\n  // and each group is converted to its 10-bit binary equivalent.\n  for (i = 0; i + 3 <= this.data.length; i += 3) {\n    group = this.data.substr(i, 3)\n    value = parseInt(group, 10)\n\n    bitBuffer.put(value, 10)\n  }\n\n  // If the number of input digits is not an exact multiple of three,\n  // the final one or two digits are converted to 4 or 7 bits respectively.\n  const remainingNum = this.data.length - i\n  if (remainingNum > 0) {\n    group = this.data.substr(i)\n    value = parseInt(group, 10)\n\n    bitBuffer.put(value, remainingNum * 3 + 1)\n  }\n}\n\nmodule.exports = NumericData\n"],"x_google_ignoreList":[0],"mappings":";;;;CAAA,IAAM,IAAA,GAAA;CAEN,SAAS,EAAa,GAAM;AAE1B,EADA,KAAK,OAAO,EAAK,SACjB,KAAK,OAAO,EAAK,UAAU;;AAsC7B,CAnCA,EAAY,gBAAgB,SAAwB,GAAQ;AAC1D,SAAO,KAAK,KAAK,MAAM,IAAS,EAAE,IAAK,IAAS,IAAO,IAAS,IAAK,IAAI,IAAK;IAGhF,EAAY,UAAU,YAAY,WAAsB;AACtD,SAAO,KAAK,KAAK;IAGnB,EAAY,UAAU,gBAAgB,WAA0B;AAC9D,SAAO,EAAY,cAAc,KAAK,KAAK,OAAO;IAGpD,EAAY,UAAU,QAAQ,SAAgB,GAAW;EACvD,IAAI,GAAG,GAAO;AAId,OAAK,IAAI,GAAG,IAAI,KAAK,KAAK,KAAK,QAAQ,KAAK,EAI1C,CAHA,IAAQ,KAAK,KAAK,OAAO,GAAG,EAAE,EAC9B,IAAQ,SAAS,GAAO,GAAG,EAE3B,EAAU,IAAI,GAAO,GAAG;EAK1B,IAAM,IAAe,KAAK,KAAK,SAAS;AACxC,EAAI,IAAe,MACjB,IAAQ,KAAK,KAAK,OAAO,EAAE,EAC3B,IAAQ,SAAS,GAAO,GAAG,EAE3B,EAAU,IAAI,GAAO,IAAe,IAAI,EAAE;IAI9C,EAAO,UAAU"}

package/dist/node_modules/qrcode/lib/core/polynomial.js

@@ -0,0 +1,30 @@
+import { __commonJSMin as e } from "../../../../_virtual/_rolldown/runtime.js";
+import { require_galois_field as t } from "./galois-field.js";
+//#region node_modules/qrcode/lib/core/polynomial.js
+var n = /* @__PURE__ */ e(((e) => {
+	var n = t();
+	e.mul = function(e, t) {
+		let r = new Uint8Array(e.length + t.length - 1);
+		for (let i = 0; i < e.length; i++) for (let a = 0; a < t.length; a++) r[i + a] ^= n.mul(e[i], t[a]);
+		return r;
+	}, e.mod = function(e, t) {
+		let r = new Uint8Array(e);
+		for (; r.length - t.length >= 0;) {
+			let e = r[0];
+			for (let i = 0; i < t.length; i++) r[i] ^= n.mul(t[i], e);
+			let i = 0;
+			for (; i < r.length && r[i] === 0;) i++;
+			r = r.slice(i);
+		}
+		return r;
+	}, e.generateECPolynomial = function(t) {
+		let r = new Uint8Array([1]);
+		for (let i = 0; i < t; i++) r = e.mul(r, new Uint8Array([1, n.exp(i)]));
+		return r;
+	};
+}));
+//#endregion
+export default n();
+export { n as require_polynomial };
+
+//# sourceMappingURL=polynomial.js.map

package/dist/node_modules/qrcode/lib/core/polynomial.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"polynomial.js","names":[],"sources":["../../../../../node_modules/qrcode/lib/core/polynomial.js"],"sourcesContent":["const GF = require('./galois-field')\n\n/**\n * Multiplies two polynomials inside Galois Field\n *\n * @param  {Uint8Array} p1 Polynomial\n * @param  {Uint8Array} p2 Polynomial\n * @return {Uint8Array}    Product of p1 and p2\n */\nexports.mul = function mul (p1, p2) {\n  const coeff = new Uint8Array(p1.length + p2.length - 1)\n\n  for (let i = 0; i < p1.length; i++) {\n    for (let j = 0; j < p2.length; j++) {\n      coeff[i + j] ^= GF.mul(p1[i], p2[j])\n    }\n  }\n\n  return coeff\n}\n\n/**\n * Calculate the remainder of polynomials division\n *\n * @param  {Uint8Array} divident Polynomial\n * @param  {Uint8Array} divisor  Polynomial\n * @return {Uint8Array}          Remainder\n */\nexports.mod = function mod (divident, divisor) {\n  let result = new Uint8Array(divident)\n\n  while ((result.length - divisor.length) >= 0) {\n    const coeff = result[0]\n\n    for (let i = 0; i < divisor.length; i++) {\n      result[i] ^= GF.mul(divisor[i], coeff)\n    }\n\n    // remove all zeros from buffer head\n    let offset = 0\n    while (offset < result.length && result[offset] === 0) offset++\n    result = result.slice(offset)\n  }\n\n  return result\n}\n\n/**\n * Generate an irreducible generator polynomial of specified degree\n * (used by Reed-Solomon encoder)\n *\n * @param  {Number} degree Degree of the generator polynomial\n * @return {Uint8Array}    Buffer containing polynomial coefficients\n */\nexports.generateECPolynomial = function generateECPolynomial (degree) {\n  let poly = new Uint8Array([1])\n  for (let i = 0; i < degree; i++) {\n    poly = exports.mul(poly, new Uint8Array([1, GF.exp(i)]))\n  }\n\n  return poly\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;CAAA,IAAM,IAAA,GAAA;AAsDN,CA7CA,EAAQ,MAAM,SAAc,GAAI,GAAI;EAClC,IAAM,IAAQ,IAAI,WAAW,EAAG,SAAS,EAAG,SAAS,EAAE;AAEvD,OAAK,IAAI,IAAI,GAAG,IAAI,EAAG,QAAQ,IAC7B,MAAK,IAAI,IAAI,GAAG,IAAI,EAAG,QAAQ,IAC7B,GAAM,IAAI,MAAM,EAAG,IAAI,EAAG,IAAI,EAAG,GAAG;AAIxC,SAAO;IAUT,EAAQ,MAAM,SAAc,GAAU,GAAS;EAC7C,IAAI,IAAS,IAAI,WAAW,EAAS;AAErC,SAAQ,EAAO,SAAS,EAAQ,UAAW,IAAG;GAC5C,IAAM,IAAQ,EAAO;AAErB,QAAK,IAAI,IAAI,GAAG,IAAI,EAAQ,QAAQ,IAClC,GAAO,MAAM,EAAG,IAAI,EAAQ,IAAI,EAAM;GAIxC,IAAI,IAAS;AACb,UAAO,IAAS,EAAO,UAAU,EAAO,OAAY,GAAG;AACvD,OAAS,EAAO,MAAM,EAAO;;AAG/B,SAAO;IAUT,EAAQ,uBAAuB,SAA+B,GAAQ;EACpE,IAAI,IAAO,IAAI,WAAW,CAAC,EAAE,CAAC;AAC9B,OAAK,IAAI,IAAI,GAAG,IAAI,GAAQ,IAC1B,KAAO,EAAQ,IAAI,GAAM,IAAI,WAAW,CAAC,GAAG,EAAG,IAAI,EAAE,CAAC,CAAC,CAAC;AAG1D,SAAO"}

package/dist/node_modules/qrcode/lib/core/qrcode.js

@@ -0,0 +1,117 @@
+import { __commonJSMin as e } from "../../../../_virtual/_rolldown/runtime.js";
+import { require_utils as t } from "./utils.js";
+import { require_error_correction_level as n } from "./error-correction-level.js";
+import { require_bit_buffer as r } from "./bit-buffer.js";
+import { require_bit_matrix as i } from "./bit-matrix.js";
+import { require_alignment_pattern as a } from "./alignment-pattern.js";
+import { require_finder_pattern as o } from "./finder-pattern.js";
+import { require_mask_pattern as s } from "./mask-pattern.js";
+import { require_error_correction_code as c } from "./error-correction-code.js";
+import { require_reed_solomon_encoder as l } from "./reed-solomon-encoder.js";
+import { require_mode as u } from "./mode.js";
+import { require_version as d } from "./version.js";
+import { require_format_info as f } from "./format-info.js";
+import { require_segments as p } from "./segments.js";
+//#region node_modules/qrcode/lib/core/qrcode.js
+var m = /* @__PURE__ */ e(((e) => {
+	var m = t(), h = n(), g = r(), _ = i(), v = a(), y = o(), b = s(), x = c(), S = l(), C = d(), w = f(), T = u(), E = p();
+	function D(e, t) {
+		let n = e.size, r = y.getPositions(t);
+		for (let t = 0; t < r.length; t++) {
+			let i = r[t][0], a = r[t][1];
+			for (let t = -1; t <= 7; t++) if (!(i + t <= -1 || n <= i + t)) for (let r = -1; r <= 7; r++) a + r <= -1 || n <= a + r || (t >= 0 && t <= 6 && (r === 0 || r === 6) || r >= 0 && r <= 6 && (t === 0 || t === 6) || t >= 2 && t <= 4 && r >= 2 && r <= 4 ? e.set(i + t, a + r, !0, !0) : e.set(i + t, a + r, !1, !0));
+		}
+	}
+	function O(e) {
+		let t = e.size;
+		for (let n = 8; n < t - 8; n++) {
+			let t = n % 2 == 0;
+			e.set(n, 6, t, !0), e.set(6, n, t, !0);
+		}
+	}
+	function k(e, t) {
+		let n = v.getPositions(t);
+		for (let t = 0; t < n.length; t++) {
+			let r = n[t][0], i = n[t][1];
+			for (let t = -2; t <= 2; t++) for (let n = -2; n <= 2; n++) t === -2 || t === 2 || n === -2 || n === 2 || t === 0 && n === 0 ? e.set(r + t, i + n, !0, !0) : e.set(r + t, i + n, !1, !0);
+		}
+	}
+	function A(e, t) {
+		let n = e.size, r = C.getEncodedBits(t), i, a, o;
+		for (let t = 0; t < 18; t++) i = Math.floor(t / 3), a = t % 3 + n - 8 - 3, o = (r >> t & 1) == 1, e.set(i, a, o, !0), e.set(a, i, o, !0);
+	}
+	function j(e, t, n) {
+		let r = e.size, i = w.getEncodedBits(t, n), a, o;
+		for (a = 0; a < 15; a++) o = (i >> a & 1) == 1, a < 6 ? e.set(a, 8, o, !0) : a < 8 ? e.set(a + 1, 8, o, !0) : e.set(r - 15 + a, 8, o, !0), a < 8 ? e.set(8, r - a - 1, o, !0) : a < 9 ? e.set(8, 15 - a - 1 + 1, o, !0) : e.set(8, 15 - a - 1, o, !0);
+		e.set(r - 8, 8, 1, !0);
+	}
+	function M(e, t) {
+		let n = e.size, r = -1, i = n - 1, a = 7, o = 0;
+		for (let s = n - 1; s > 0; s -= 2) for (s === 6 && s--;;) {
+			for (let n = 0; n < 2; n++) if (!e.isReserved(i, s - n)) {
+				let r = !1;
+				o < t.length && (r = (t[o] >>> a & 1) == 1), e.set(i, s - n, r), a--, a === -1 && (o++, a = 7);
+			}
+			if (i += r, i < 0 || n <= i) {
+				i -= r, r = -r;
+				break;
+			}
+		}
+	}
+	function N(e, t, n) {
+		let r = new g();
+		n.forEach(function(t) {
+			r.put(t.mode.bit, 4), r.put(t.getLength(), T.getCharCountIndicator(t.mode, e)), t.write(r);
+		});
+		let i = (m.getSymbolTotalCodewords(e) - x.getTotalCodewordsCount(e, t)) * 8;
+		for (r.getLengthInBits() + 4 <= i && r.put(0, 4); r.getLengthInBits() % 8 != 0;) r.putBit(0);
+		let a = (i - r.getLengthInBits()) / 8;
+		for (let e = 0; e < a; e++) r.put(e % 2 ? 17 : 236, 8);
+		return P(r, e, t);
+	}
+	function P(e, t, n) {
+		let r = m.getSymbolTotalCodewords(t), i = r - x.getTotalCodewordsCount(t, n), a = x.getBlocksCount(t, n), o = a - r % a, s = Math.floor(r / a), c = Math.floor(i / a), l = c + 1, u = s - c, d = new S(u), f = 0, p = Array(a), h = Array(a), g = 0, _ = new Uint8Array(e.buffer);
+		for (let e = 0; e < a; e++) {
+			let t = e < o ? c : l;
+			p[e] = _.slice(f, f + t), h[e] = d.encode(p[e]), f += t, g = Math.max(g, t);
+		}
+		let v = new Uint8Array(r), y = 0, b, C;
+		for (b = 0; b < g; b++) for (C = 0; C < a; C++) b < p[C].length && (v[y++] = p[C][b]);
+		for (b = 0; b < u; b++) for (C = 0; C < a; C++) v[y++] = h[C][b];
+		return v;
+	}
+	function F(e, t, n, r) {
+		let i;
+		if (Array.isArray(e)) i = E.fromArray(e);
+		else if (typeof e == "string") {
+			let r = t;
+			if (!r) {
+				let t = E.rawSplit(e);
+				r = C.getBestVersionForData(t, n);
+			}
+			i = E.fromString(e, r || 40);
+		} else throw Error("Invalid data");
+		let a = C.getBestVersionForData(i, n);
+		if (!a) throw Error("The amount of data is too big to be stored in a QR Code");
+		if (!t) t = a;
+		else if (t < a) throw Error("\nThe chosen QR Code version cannot contain this amount of data.\nMinimum version required to store current data is: " + a + ".\n");
+		let o = N(t, n, i), s = new _(m.getSymbolSize(t));
+		return D(s, t), O(s), k(s, t), j(s, n, 0), t >= 7 && A(s, t), M(s, o), isNaN(r) && (r = b.getBestMask(s, j.bind(null, s, n))), b.applyMask(r, s), j(s, n, r), {
+			modules: s,
+			version: t,
+			errorCorrectionLevel: n,
+			maskPattern: r,
+			segments: i
+		};
+	}
+	e.create = function(e, t) {
+		if (e === void 0 || e === "") throw Error("No input text");
+		let n = h.M, r, i;
+		return t !== void 0 && (n = h.from(t.errorCorrectionLevel, h.M), r = C.from(t.version), i = b.from(t.maskPattern), t.toSJISFunc && m.setToSJISFunction(t.toSJISFunc)), F(e, r, n, i);
+	};
+}));
+//#endregion
+export default m();
+export { m as require_qrcode };
+
+//# sourceMappingURL=qrcode.js.map

package/dist/node_modules/qrcode/lib/core/qrcode.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"qrcode.js","names":[],"sources":["../../../../../node_modules/qrcode/lib/core/qrcode.js"],"sourcesContent":["const Utils = require('./utils')\nconst ECLevel = require('./error-correction-level')\nconst BitBuffer = require('./bit-buffer')\nconst BitMatrix = require('./bit-matrix')\nconst AlignmentPattern = require('./alignment-pattern')\nconst FinderPattern = require('./finder-pattern')\nconst MaskPattern = require('./mask-pattern')\nconst ECCode = require('./error-correction-code')\nconst ReedSolomonEncoder = require('./reed-solomon-encoder')\nconst Version = require('./version')\nconst FormatInfo = require('./format-info')\nconst Mode = require('./mode')\nconst Segments = require('./segments')\n\n/**\n * QRCode for JavaScript\n *\n * modified by Ryan Day for nodejs support\n * Copyright (c) 2011 Ryan Day\n *\n * Licensed under the MIT license:\n *   http://www.opensource.org/licenses/mit-license.php\n *\n//---------------------------------------------------------------------\n// QRCode for JavaScript\n//\n// Copyright (c) 2009 Kazuhiko Arase\n//\n// URL: http://www.d-project.com/\n//\n// Licensed under the MIT license:\n//   http://www.opensource.org/licenses/mit-license.php\n//\n// The word \"QR Code\" is registered trademark of\n// DENSO WAVE INCORPORATED\n//   http://www.denso-wave.com/qrcode/faqpatent-e.html\n//\n//---------------------------------------------------------------------\n*/\n\n/**\n * Add finder patterns bits to matrix\n *\n * @param  {BitMatrix} matrix  Modules matrix\n * @param  {Number}    version QR Code version\n */\nfunction setupFinderPattern (matrix, version) {\n  const size = matrix.size\n  const pos = FinderPattern.getPositions(version)\n\n  for (let i = 0; i < pos.length; i++) {\n    const row = pos[i][0]\n    const col = pos[i][1]\n\n    for (let r = -1; r <= 7; r++) {\n      if (row + r <= -1 || size <= row + r) continue\n\n      for (let c = -1; c <= 7; c++) {\n        if (col + c <= -1 || size <= col + c) continue\n\n        if ((r >= 0 && r <= 6 && (c === 0 || c === 6)) ||\n          (c >= 0 && c <= 6 && (r === 0 || r === 6)) ||\n          (r >= 2 && r <= 4 && c >= 2 && c <= 4)) {\n          matrix.set(row + r, col + c, true, true)\n        } else {\n          matrix.set(row + r, col + c, false, true)\n        }\n      }\n    }\n  }\n}\n\n/**\n * Add timing pattern bits to matrix\n *\n * Note: this function must be called before {@link setupAlignmentPattern}\n *\n * @param  {BitMatrix} matrix Modules matrix\n */\nfunction setupTimingPattern (matrix) {\n  const size = matrix.size\n\n  for (let r = 8; r < size - 8; r++) {\n    const value = r % 2 === 0\n    matrix.set(r, 6, value, true)\n    matrix.set(6, r, value, true)\n  }\n}\n\n/**\n * Add alignment patterns bits to matrix\n *\n * Note: this function must be called after {@link setupTimingPattern}\n *\n * @param  {BitMatrix} matrix  Modules matrix\n * @param  {Number}    version QR Code version\n */\nfunction setupAlignmentPattern (matrix, version) {\n  const pos = AlignmentPattern.getPositions(version)\n\n  for (let i = 0; i < pos.length; i++) {\n    const row = pos[i][0]\n    const col = pos[i][1]\n\n    for (let r = -2; r <= 2; r++) {\n      for (let c = -2; c <= 2; c++) {\n        if (r === -2 || r === 2 || c === -2 || c === 2 ||\n          (r === 0 && c === 0)) {\n          matrix.set(row + r, col + c, true, true)\n        } else {\n          matrix.set(row + r, col + c, false, true)\n        }\n      }\n    }\n  }\n}\n\n/**\n * Add version info bits to matrix\n *\n * @param  {BitMatrix} matrix  Modules matrix\n * @param  {Number}    version QR Code version\n */\nfunction setupVersionInfo (matrix, version) {\n  const size = matrix.size\n  const bits = Version.getEncodedBits(version)\n  let row, col, mod\n\n  for (let i = 0; i < 18; i++) {\n    row = Math.floor(i / 3)\n    col = i % 3 + size - 8 - 3\n    mod = ((bits >> i) & 1) === 1\n\n    matrix.set(row, col, mod, true)\n    matrix.set(col, row, mod, true)\n  }\n}\n\n/**\n * Add format info bits to matrix\n *\n * @param  {BitMatrix} matrix               Modules matrix\n * @param  {ErrorCorrectionLevel}    errorCorrectionLevel Error correction level\n * @param  {Number}    maskPattern          Mask pattern reference value\n */\nfunction setupFormatInfo (matrix, errorCorrectionLevel, maskPattern) {\n  const size = matrix.size\n  const bits = FormatInfo.getEncodedBits(errorCorrectionLevel, maskPattern)\n  let i, mod\n\n  for (i = 0; i < 15; i++) {\n    mod = ((bits >> i) & 1) === 1\n\n    // vertical\n    if (i < 6) {\n      matrix.set(i, 8, mod, true)\n    } else if (i < 8) {\n      matrix.set(i + 1, 8, mod, true)\n    } else {\n      matrix.set(size - 15 + i, 8, mod, true)\n    }\n\n    // horizontal\n    if (i < 8) {\n      matrix.set(8, size - i - 1, mod, true)\n    } else if (i < 9) {\n      matrix.set(8, 15 - i - 1 + 1, mod, true)\n    } else {\n      matrix.set(8, 15 - i - 1, mod, true)\n    }\n  }\n\n  // fixed module\n  matrix.set(size - 8, 8, 1, true)\n}\n\n/**\n * Add encoded data bits to matrix\n *\n * @param  {BitMatrix}  matrix Modules matrix\n * @param  {Uint8Array} data   Data codewords\n */\nfunction setupData (matrix, data) {\n  const size = matrix.size\n  let inc = -1\n  let row = size - 1\n  let bitIndex = 7\n  let byteIndex = 0\n\n  for (let col = size - 1; col > 0; col -= 2) {\n    if (col === 6) col--\n\n    while (true) {\n      for (let c = 0; c < 2; c++) {\n        if (!matrix.isReserved(row, col - c)) {\n          let dark = false\n\n          if (byteIndex < data.length) {\n            dark = (((data[byteIndex] >>> bitIndex) & 1) === 1)\n          }\n\n          matrix.set(row, col - c, dark)\n          bitIndex--\n\n          if (bitIndex === -1) {\n            byteIndex++\n            bitIndex = 7\n          }\n        }\n      }\n\n      row += inc\n\n      if (row < 0 || size <= row) {\n        row -= inc\n        inc = -inc\n        break\n      }\n    }\n  }\n}\n\n/**\n * Create encoded codewords from data input\n *\n * @param  {Number}   version              QR Code version\n * @param  {ErrorCorrectionLevel}   errorCorrectionLevel Error correction level\n * @param  {ByteData} data                 Data input\n * @return {Uint8Array}                    Buffer containing encoded codewords\n */\nfunction createData (version, errorCorrectionLevel, segments) {\n  // Prepare data buffer\n  const buffer = new BitBuffer()\n\n  segments.forEach(function (data) {\n    // prefix data with mode indicator (4 bits)\n    buffer.put(data.mode.bit, 4)\n\n    // Prefix data with character count indicator.\n    // The character count indicator is a string of bits that represents the\n    // number of characters that are being encoded.\n    // The character count indicator must be placed after the mode indicator\n    // and must be a certain number of bits long, depending on the QR version\n    // and data mode\n    // @see {@link Mode.getCharCountIndicator}.\n    buffer.put(data.getLength(), Mode.getCharCountIndicator(data.mode, version))\n\n    // add binary data sequence to buffer\n    data.write(buffer)\n  })\n\n  // Calculate required number of bits\n  const totalCodewords = Utils.getSymbolTotalCodewords(version)\n  const ecTotalCodewords = ECCode.getTotalCodewordsCount(version, errorCorrectionLevel)\n  const dataTotalCodewordsBits = (totalCodewords - ecTotalCodewords) * 8\n\n  // Add a terminator.\n  // If the bit string is shorter than the total number of required bits,\n  // a terminator of up to four 0s must be added to the right side of the string.\n  // If the bit string is more than four bits shorter than the required number of bits,\n  // add four 0s to the end.\n  if (buffer.getLengthInBits() + 4 <= dataTotalCodewordsBits) {\n    buffer.put(0, 4)\n  }\n\n  // If the bit string is fewer than four bits shorter, add only the number of 0s that\n  // are needed to reach the required number of bits.\n\n  // After adding the terminator, if the number of bits in the string is not a multiple of 8,\n  // pad the string on the right with 0s to make the string's length a multiple of 8.\n  while (buffer.getLengthInBits() % 8 !== 0) {\n    buffer.putBit(0)\n  }\n\n  // Add pad bytes if the string is still shorter than the total number of required bits.\n  // Extend the buffer to fill the data capacity of the symbol corresponding to\n  // the Version and Error Correction Level by adding the Pad Codewords 11101100 (0xEC)\n  // and 00010001 (0x11) alternately.\n  const remainingByte = (dataTotalCodewordsBits - buffer.getLengthInBits()) / 8\n  for (let i = 0; i < remainingByte; i++) {\n    buffer.put(i % 2 ? 0x11 : 0xEC, 8)\n  }\n\n  return createCodewords(buffer, version, errorCorrectionLevel)\n}\n\n/**\n * Encode input data with Reed-Solomon and return codewords with\n * relative error correction bits\n *\n * @param  {BitBuffer} bitBuffer            Data to encode\n * @param  {Number}    version              QR Code version\n * @param  {ErrorCorrectionLevel} errorCorrectionLevel Error correction level\n * @return {Uint8Array}                     Buffer containing encoded codewords\n */\nfunction createCodewords (bitBuffer, version, errorCorrectionLevel) {\n  // Total codewords for this QR code version (Data + Error correction)\n  const totalCodewords = Utils.getSymbolTotalCodewords(version)\n\n  // Total number of error correction codewords\n  const ecTotalCodewords = ECCode.getTotalCodewordsCount(version, errorCorrectionLevel)\n\n  // Total number of data codewords\n  const dataTotalCodewords = totalCodewords - ecTotalCodewords\n\n  // Total number of blocks\n  const ecTotalBlocks = ECCode.getBlocksCount(version, errorCorrectionLevel)\n\n  // Calculate how many blocks each group should contain\n  const blocksInGroup2 = totalCodewords % ecTotalBlocks\n  const blocksInGroup1 = ecTotalBlocks - blocksInGroup2\n\n  const totalCodewordsInGroup1 = Math.floor(totalCodewords / ecTotalBlocks)\n\n  const dataCodewordsInGroup1 = Math.floor(dataTotalCodewords / ecTotalBlocks)\n  const dataCodewordsInGroup2 = dataCodewordsInGroup1 + 1\n\n  // Number of EC codewords is the same for both groups\n  const ecCount = totalCodewordsInGroup1 - dataCodewordsInGroup1\n\n  // Initialize a Reed-Solomon encoder with a generator polynomial of degree ecCount\n  const rs = new ReedSolomonEncoder(ecCount)\n\n  let offset = 0\n  const dcData = new Array(ecTotalBlocks)\n  const ecData = new Array(ecTotalBlocks)\n  let maxDataSize = 0\n  const buffer = new Uint8Array(bitBuffer.buffer)\n\n  // Divide the buffer into the required number of blocks\n  for (let b = 0; b < ecTotalBlocks; b++) {\n    const dataSize = b < blocksInGroup1 ? dataCodewordsInGroup1 : dataCodewordsInGroup2\n\n    // extract a block of data from buffer\n    dcData[b] = buffer.slice(offset, offset + dataSize)\n\n    // Calculate EC codewords for this data block\n    ecData[b] = rs.encode(dcData[b])\n\n    offset += dataSize\n    maxDataSize = Math.max(maxDataSize, dataSize)\n  }\n\n  // Create final data\n  // Interleave the data and error correction codewords from each block\n  const data = new Uint8Array(totalCodewords)\n  let index = 0\n  let i, r\n\n  // Add data codewords\n  for (i = 0; i < maxDataSize; i++) {\n    for (r = 0; r < ecTotalBlocks; r++) {\n      if (i < dcData[r].length) {\n        data[index++] = dcData[r][i]\n      }\n    }\n  }\n\n  // Apped EC codewords\n  for (i = 0; i < ecCount; i++) {\n    for (r = 0; r < ecTotalBlocks; r++) {\n      data[index++] = ecData[r][i]\n    }\n  }\n\n  return data\n}\n\n/**\n * Build QR Code symbol\n *\n * @param  {String} data                 Input string\n * @param  {Number} version              QR Code version\n * @param  {ErrorCorretionLevel} errorCorrectionLevel Error level\n * @param  {MaskPattern} maskPattern     Mask pattern\n * @return {Object}                      Object containing symbol data\n */\nfunction createSymbol (data, version, errorCorrectionLevel, maskPattern) {\n  let segments\n\n  if (Array.isArray(data)) {\n    segments = Segments.fromArray(data)\n  } else if (typeof data === 'string') {\n    let estimatedVersion = version\n\n    if (!estimatedVersion) {\n      const rawSegments = Segments.rawSplit(data)\n\n      // Estimate best version that can contain raw splitted segments\n      estimatedVersion = Version.getBestVersionForData(rawSegments, errorCorrectionLevel)\n    }\n\n    // Build optimized segments\n    // If estimated version is undefined, try with the highest version\n    segments = Segments.fromString(data, estimatedVersion || 40)\n  } else {\n    throw new Error('Invalid data')\n  }\n\n  // Get the min version that can contain data\n  const bestVersion = Version.getBestVersionForData(segments, errorCorrectionLevel)\n\n  // If no version is found, data cannot be stored\n  if (!bestVersion) {\n    throw new Error('The amount of data is too big to be stored in a QR Code')\n  }\n\n  // If not specified, use min version as default\n  if (!version) {\n    version = bestVersion\n\n  // Check if the specified version can contain the data\n  } else if (version < bestVersion) {\n    throw new Error('\\n' +\n      'The chosen QR Code version cannot contain this amount of data.\\n' +\n      'Minimum version required to store current data is: ' + bestVersion + '.\\n'\n    )\n  }\n\n  const dataBits = createData(version, errorCorrectionLevel, segments)\n\n  // Allocate matrix buffer\n  const moduleCount = Utils.getSymbolSize(version)\n  const modules = new BitMatrix(moduleCount)\n\n  // Add function modules\n  setupFinderPattern(modules, version)\n  setupTimingPattern(modules)\n  setupAlignmentPattern(modules, version)\n\n  // Add temporary dummy bits for format info just to set them as reserved.\n  // This is needed to prevent these bits from being masked by {@link MaskPattern.applyMask}\n  // since the masking operation must be performed only on the encoding region.\n  // These blocks will be replaced with correct values later in code.\n  setupFormatInfo(modules, errorCorrectionLevel, 0)\n\n  if (version >= 7) {\n    setupVersionInfo(modules, version)\n  }\n\n  // Add data codewords\n  setupData(modules, dataBits)\n\n  if (isNaN(maskPattern)) {\n    // Find best mask pattern\n    maskPattern = MaskPattern.getBestMask(modules,\n      setupFormatInfo.bind(null, modules, errorCorrectionLevel))\n  }\n\n  // Apply mask pattern\n  MaskPattern.applyMask(maskPattern, modules)\n\n  // Replace format info bits with correct values\n  setupFormatInfo(modules, errorCorrectionLevel, maskPattern)\n\n  return {\n    modules: modules,\n    version: version,\n    errorCorrectionLevel: errorCorrectionLevel,\n    maskPattern: maskPattern,\n    segments: segments\n  }\n}\n\n/**\n * QR Code\n *\n * @param {String | Array} data                 Input data\n * @param {Object} options                      Optional configurations\n * @param {Number} options.version              QR Code version\n * @param {String} options.errorCorrectionLevel Error correction level\n * @param {Function} options.toSJISFunc         Helper func to convert utf8 to sjis\n */\nexports.create = function create (data, options) {\n  if (typeof data === 'undefined' || data === '') {\n    throw new Error('No input text')\n  }\n\n  let errorCorrectionLevel = ECLevel.M\n  let version\n  let mask\n\n  if (typeof options !== 'undefined') {\n    // Use higher error correction level as default\n    errorCorrectionLevel = ECLevel.from(options.errorCorrectionLevel, ECLevel.M)\n    version = Version.from(options.version)\n    mask = MaskPattern.from(options.maskPattern)\n\n    if (options.toSJISFunc) {\n      Utils.setToSJISFunction(options.toSJISFunc)\n    }\n  }\n\n  return createSymbol(data, version, errorCorrectionLevel, mask)\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;;;;;;;;;;;;;CAAA,IAAM,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA;CAkCN,SAAS,EAAoB,GAAQ,GAAS;EAC5C,IAAM,IAAO,EAAO,MACd,IAAM,EAAc,aAAa,EAAQ;AAE/C,OAAK,IAAI,IAAI,GAAG,IAAI,EAAI,QAAQ,KAAK;GACnC,IAAM,IAAM,EAAI,GAAG,IACb,IAAM,EAAI,GAAG;AAEnB,QAAK,IAAI,IAAI,IAAI,KAAK,GAAG,IACnB,WAAM,KAAK,MAAM,KAAQ,IAAM,GAEnC,MAAK,IAAI,IAAI,IAAI,KAAK,GAAG,IACnB,KAAM,KAAK,MAAM,KAAQ,IAAM,MAE9B,KAAK,KAAK,KAAK,MAAM,MAAM,KAAK,MAAM,MACxC,KAAK,KAAK,KAAK,MAAM,MAAM,KAAK,MAAM,MACtC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,IACpC,EAAO,IAAI,IAAM,GAAG,IAAM,GAAG,IAAM,GAAK,GAExC,EAAO,IAAI,IAAM,GAAG,IAAM,GAAG,IAAO,GAAK;;;CAcnD,SAAS,EAAoB,GAAQ;EACnC,IAAM,IAAO,EAAO;AAEpB,OAAK,IAAI,IAAI,GAAG,IAAI,IAAO,GAAG,KAAK;GACjC,IAAM,IAAQ,IAAI,KAAM;AAExB,GADA,EAAO,IAAI,GAAG,GAAG,GAAO,GAAK,EAC7B,EAAO,IAAI,GAAG,GAAG,GAAO,GAAK;;;CAYjC,SAAS,EAAuB,GAAQ,GAAS;EAC/C,IAAM,IAAM,EAAiB,aAAa,EAAQ;AAElD,OAAK,IAAI,IAAI,GAAG,IAAI,EAAI,QAAQ,KAAK;GACnC,IAAM,IAAM,EAAI,GAAG,IACb,IAAM,EAAI,GAAG;AAEnB,QAAK,IAAI,IAAI,IAAI,KAAK,GAAG,IACvB,MAAK,IAAI,IAAI,IAAI,KAAK,GAAG,IACvB,CAAI,MAAM,MAAM,MAAM,KAAK,MAAM,MAAM,MAAM,KAC1C,MAAM,KAAK,MAAM,IAClB,EAAO,IAAI,IAAM,GAAG,IAAM,GAAG,IAAM,GAAK,GAExC,EAAO,IAAI,IAAM,GAAG,IAAM,GAAG,IAAO,GAAK;;;CAanD,SAAS,EAAkB,GAAQ,GAAS;EAC1C,IAAM,IAAO,EAAO,MACd,IAAO,EAAQ,eAAe,EAAQ,EACxC,GAAK,GAAK;AAEd,OAAK,IAAI,IAAI,GAAG,IAAI,IAAI,IAMtB,CALA,IAAM,KAAK,MAAM,IAAI,EAAE,EACvB,IAAM,IAAI,IAAI,IAAO,IAAI,GACzB,KAAQ,KAAQ,IAAK,MAAO,GAE5B,EAAO,IAAI,GAAK,GAAK,GAAK,GAAK,EAC/B,EAAO,IAAI,GAAK,GAAK,GAAK,GAAK;;CAWnC,SAAS,EAAiB,GAAQ,GAAsB,GAAa;EACnE,IAAM,IAAO,EAAO,MACd,IAAO,EAAW,eAAe,GAAsB,EAAY,EACrE,GAAG;AAEP,OAAK,IAAI,GAAG,IAAI,IAAI,IAalB,CAZA,KAAQ,KAAQ,IAAK,MAAO,GAGxB,IAAI,IACN,EAAO,IAAI,GAAG,GAAG,GAAK,GAAK,GAClB,IAAI,IACb,EAAO,IAAI,IAAI,GAAG,GAAG,GAAK,GAAK,GAE/B,EAAO,IAAI,IAAO,KAAK,GAAG,GAAG,GAAK,GAAK,EAIrC,IAAI,IACN,EAAO,IAAI,GAAG,IAAO,IAAI,GAAG,GAAK,GAAK,GAC7B,IAAI,IACb,EAAO,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,GAAK,GAAK,GAExC,EAAO,IAAI,GAAG,KAAK,IAAI,GAAG,GAAK,GAAK;AAKxC,IAAO,IAAI,IAAO,GAAG,GAAG,GAAG,GAAK;;CASlC,SAAS,EAAW,GAAQ,GAAM;EAChC,IAAM,IAAO,EAAO,MAChB,IAAM,IACN,IAAM,IAAO,GACb,IAAW,GACX,IAAY;AAEhB,OAAK,IAAI,IAAM,IAAO,GAAG,IAAM,GAAG,KAAO,EAGvC,MAFI,MAAQ,KAAG,OAEF;AACX,QAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IACrB,KAAI,CAAC,EAAO,WAAW,GAAK,IAAM,EAAE,EAAE;IACpC,IAAI,IAAO;AASX,IAPI,IAAY,EAAK,WACnB,KAAU,EAAK,OAAe,IAAY,MAAO,IAGnD,EAAO,IAAI,GAAK,IAAM,GAAG,EAAK,EAC9B,KAEI,MAAa,OACf,KACA,IAAW;;AAOjB,OAFA,KAAO,GAEH,IAAM,KAAK,KAAQ,GAAK;AAE1B,IADA,KAAO,GACP,IAAM,CAAC;AACP;;;;CAcR,SAAS,EAAY,GAAS,GAAsB,GAAU;EAE5D,IAAM,IAAS,IAAI,GAAW;AAE9B,IAAS,QAAQ,SAAU,GAAM;AAc/B,GAZA,EAAO,IAAI,EAAK,KAAK,KAAK,EAAE,EAS5B,EAAO,IAAI,EAAK,WAAW,EAAE,EAAK,sBAAsB,EAAK,MAAM,EAAQ,CAAC,EAG5E,EAAK,MAAM,EAAO;IAClB;EAKF,IAAM,KAFiB,EAAM,wBAAwB,EAAQ,GACpC,EAAO,uBAAuB,GAAS,EAAqB,IAChB;AAgBrE,OATI,EAAO,iBAAiB,GAAG,KAAK,KAClC,EAAO,IAAI,GAAG,EAAE,EAQX,EAAO,iBAAiB,GAAG,KAAM,GACtC,GAAO,OAAO,EAAE;EAOlB,IAAM,KAAiB,IAAyB,EAAO,iBAAiB,IAAI;AAC5E,OAAK,IAAI,IAAI,GAAG,IAAI,GAAe,IACjC,GAAO,IAAI,IAAI,IAAI,KAAO,KAAM,EAAE;AAGpC,SAAO,EAAgB,GAAQ,GAAS,EAAqB;;CAY/D,SAAS,EAAiB,GAAW,GAAS,GAAsB;EAElE,IAAM,IAAiB,EAAM,wBAAwB,EAAQ,EAMvD,IAAqB,IAHF,EAAO,uBAAuB,GAAS,EAAqB,EAM/E,IAAgB,EAAO,eAAe,GAAS,EAAqB,EAIpE,IAAiB,IADA,IAAiB,GAGlC,IAAyB,KAAK,MAAM,IAAiB,EAAc,EAEnE,IAAwB,KAAK,MAAM,IAAqB,EAAc,EACtE,IAAwB,IAAwB,GAGhD,IAAU,IAAyB,GAGnC,IAAK,IAAI,EAAmB,EAAQ,EAEtC,IAAS,GACP,IAAa,MAAM,EAAc,EACjC,IAAa,MAAM,EAAc,EACnC,IAAc,GACZ,IAAS,IAAI,WAAW,EAAU,OAAO;AAG/C,OAAK,IAAI,IAAI,GAAG,IAAI,GAAe,KAAK;GACtC,IAAM,IAAW,IAAI,IAAiB,IAAwB;AAS9D,GANA,EAAO,KAAK,EAAO,MAAM,GAAQ,IAAS,EAAS,EAGnD,EAAO,KAAK,EAAG,OAAO,EAAO,GAAG,EAEhC,KAAU,GACV,IAAc,KAAK,IAAI,GAAa,EAAS;;EAK/C,IAAM,IAAO,IAAI,WAAW,EAAe,EACvC,IAAQ,GACR,GAAG;AAGP,OAAK,IAAI,GAAG,IAAI,GAAa,IAC3B,MAAK,IAAI,GAAG,IAAI,GAAe,IAC7B,CAAI,IAAI,EAAO,GAAG,WAChB,EAAK,OAAW,EAAO,GAAG;AAMhC,OAAK,IAAI,GAAG,IAAI,GAAS,IACvB,MAAK,IAAI,GAAG,IAAI,GAAe,IAC7B,GAAK,OAAW,EAAO,GAAG;AAI9B,SAAO;;CAYT,SAAS,EAAc,GAAM,GAAS,GAAsB,GAAa;EACvE,IAAI;AAEJ,MAAI,MAAM,QAAQ,EAAK,CACrB,KAAW,EAAS,UAAU,EAAK;WAC1B,OAAO,KAAS,UAAU;GACnC,IAAI,IAAmB;AAEvB,OAAI,CAAC,GAAkB;IACrB,IAAM,IAAc,EAAS,SAAS,EAAK;AAG3C,QAAmB,EAAQ,sBAAsB,GAAa,EAAqB;;AAKrF,OAAW,EAAS,WAAW,GAAM,KAAoB,GAAG;QAE5D,OAAU,MAAM,eAAe;EAIjC,IAAM,IAAc,EAAQ,sBAAsB,GAAU,EAAqB;AAGjF,MAAI,CAAC,EACH,OAAU,MAAM,0DAA0D;AAI5E,MAAI,CAAC,EACH,KAAU;WAGD,IAAU,EACnB,OAAU,MAAM,0HAE0C,IAAc,MACvE;EAGH,IAAM,IAAW,EAAW,GAAS,GAAsB,EAAS,EAI9D,IAAU,IAAI,EADA,EAAM,cAAc,EAAQ,CACN;AAgC1C,SA7BA,EAAmB,GAAS,EAAQ,EACpC,EAAmB,EAAQ,EAC3B,EAAsB,GAAS,EAAQ,EAMvC,EAAgB,GAAS,GAAsB,EAAE,EAE7C,KAAW,KACb,EAAiB,GAAS,EAAQ,EAIpC,EAAU,GAAS,EAAS,EAExB,MAAM,EAAY,KAEpB,IAAc,EAAY,YAAY,GACpC,EAAgB,KAAK,MAAM,GAAS,EAAqB,CAAC,GAI9D,EAAY,UAAU,GAAa,EAAQ,EAG3C,EAAgB,GAAS,GAAsB,EAAY,EAEpD;GACI;GACA;GACa;GACT;GACH;GACX;;AAYH,GAAQ,SAAS,SAAiB,GAAM,GAAS;AAC/C,MAAW,MAAS,UAAe,MAAS,GAC1C,OAAU,MAAM,gBAAgB;EAGlC,IAAI,IAAuB,EAAQ,GAC/B,GACA;AAaJ,SAXW,MAAY,WAErB,IAAuB,EAAQ,KAAK,EAAQ,sBAAsB,EAAQ,EAAE,EAC5E,IAAU,EAAQ,KAAK,EAAQ,QAAQ,EACvC,IAAO,EAAY,KAAK,EAAQ,YAAY,EAExC,EAAQ,cACV,EAAM,kBAAkB,EAAQ,WAAW,GAIxC,EAAa,GAAM,GAAS,GAAsB,EAAK"}

package/dist/node_modules/qrcode/lib/core/reed-solomon-encoder.js

@@ -0,0 +1,27 @@
+import { __commonJSMin as e } from "../../../../_virtual/_rolldown/runtime.js";
+import { require_polynomial as t } from "./polynomial.js";
+//#region node_modules/qrcode/lib/core/reed-solomon-encoder.js
+var n = /* @__PURE__ */ e(((e, n) => {
+	var r = t();
+	function i(e) {
+		this.genPoly = void 0, this.degree = e, this.degree && this.initialize(this.degree);
+	}
+	i.prototype.initialize = function(e) {
+		this.degree = e, this.genPoly = r.generateECPolynomial(this.degree);
+	}, i.prototype.encode = function(e) {
+		if (!this.genPoly) throw Error("Encoder not initialized");
+		let t = new Uint8Array(e.length + this.degree);
+		t.set(e);
+		let n = r.mod(t, this.genPoly), i = this.degree - n.length;
+		if (i > 0) {
+			let e = new Uint8Array(this.degree);
+			return e.set(n, i), e;
+		}
+		return n;
+	}, n.exports = i;
+}));
+//#endregion
+export default n();
+export { n as require_reed_solomon_encoder };
+
+//# sourceMappingURL=reed-solomon-encoder.js.map

package/dist/node_modules/qrcode/lib/core/reed-solomon-encoder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"reed-solomon-encoder.js","names":[],"sources":["../../../../../node_modules/qrcode/lib/core/reed-solomon-encoder.js"],"sourcesContent":["const Polynomial = require('./polynomial')\n\nfunction ReedSolomonEncoder (degree) {\n  this.genPoly = undefined\n  this.degree = degree\n\n  if (this.degree) this.initialize(this.degree)\n}\n\n/**\n * Initialize the encoder.\n * The input param should correspond to the number of error correction codewords.\n *\n * @param  {Number} degree\n */\nReedSolomonEncoder.prototype.initialize = function initialize (degree) {\n  // create an irreducible generator polynomial\n  this.degree = degree\n  this.genPoly = Polynomial.generateECPolynomial(this.degree)\n}\n\n/**\n * Encodes a chunk of data\n *\n * @param  {Uint8Array} data Buffer containing input data\n * @return {Uint8Array}      Buffer containing encoded data\n */\nReedSolomonEncoder.prototype.encode = function encode (data) {\n  if (!this.genPoly) {\n    throw new Error('Encoder not initialized')\n  }\n\n  // Calculate EC for this data block\n  // extends data size to data+genPoly size\n  const paddedData = new Uint8Array(data.length + this.degree)\n  paddedData.set(data)\n\n  // The error correction codewords are the remainder after dividing the data codewords\n  // by a generator polynomial\n  const remainder = Polynomial.mod(paddedData, this.genPoly)\n\n  // return EC data blocks (last n byte, where n is the degree of genPoly)\n  // If coefficients number in remainder are less than genPoly degree,\n  // pad with 0s to the left to reach the needed number of coefficients\n  const start = this.degree - remainder.length\n  if (start > 0) {\n    const buff = new Uint8Array(this.degree)\n    buff.set(remainder, start)\n\n    return buff\n  }\n\n  return remainder\n}\n\nmodule.exports = ReedSolomonEncoder\n"],"x_google_ignoreList":[0],"mappings":";;;;CAAA,IAAM,IAAA,GAAA;CAEN,SAAS,EAAoB,GAAQ;AAInC,EAHA,KAAK,UAAU,KAAA,GACf,KAAK,SAAS,GAEV,KAAK,UAAQ,KAAK,WAAW,KAAK,OAAO;;AAiD/C,CAxCA,EAAmB,UAAU,aAAa,SAAqB,GAAQ;AAGrE,EADA,KAAK,SAAS,GACd,KAAK,UAAU,EAAW,qBAAqB,KAAK,OAAO;IAS7D,EAAmB,UAAU,SAAS,SAAiB,GAAM;AAC3D,MAAI,CAAC,KAAK,QACR,OAAU,MAAM,0BAA0B;EAK5C,IAAM,IAAa,IAAI,WAAW,EAAK,SAAS,KAAK,OAAO;AAC5D,IAAW,IAAI,EAAK;EAIpB,IAAM,IAAY,EAAW,IAAI,GAAY,KAAK,QAAQ,EAKpD,IAAQ,KAAK,SAAS,EAAU;AACtC,MAAI,IAAQ,GAAG;GACb,IAAM,IAAO,IAAI,WAAW,KAAK,OAAO;AAGxC,UAFA,EAAK,IAAI,GAAW,EAAM,EAEnB;;AAGT,SAAO;IAGT,EAAO,UAAU"}

package/dist/node_modules/qrcode/lib/core/regex.js

@@ -0,0 +1,21 @@
+import { __commonJSMin as e } from "../../../../_virtual/_rolldown/runtime.js";
+//#region node_modules/qrcode/lib/core/regex.js
+var t = /* @__PURE__ */ e(((e) => {
+	var t = "[0-9]+", n = "[A-Z $%*+\\-./:]+", r = "(?:[u3000-u303F]|[u3040-u309F]|[u30A0-u30FF]|[uFF00-uFFEF]|[u4E00-u9FAF]|[u2605-u2606]|[u2190-u2195]|u203B|[u2010u2015u2018u2019u2025u2026u201Cu201Du2225u2260]|[u0391-u0451]|[u00A7u00A8u00B1u00B4u00D7u00F7])+";
+	r = r.replace(/u/g, "\\u");
+	var i = "(?:(?![A-Z0-9 $%*+\\-./:]|" + r + ")(?:.|[\r\n]))+";
+	e.KANJI = new RegExp(r, "g"), e.BYTE_KANJI = /* @__PURE__ */ RegExp("[^A-Z0-9 $%*+\\-./:]+", "g"), e.BYTE = new RegExp(i, "g"), e.NUMERIC = new RegExp(t, "g"), e.ALPHANUMERIC = new RegExp(n, "g");
+	var a = RegExp("^" + r + "$"), o = RegExp("^" + t + "$"), s = /* @__PURE__ */ RegExp("^[A-Z0-9 $%*+\\-./:]+$");
+	e.testKanji = function(e) {
+		return a.test(e);
+	}, e.testNumeric = function(e) {
+		return o.test(e);
+	}, e.testAlphanumeric = function(e) {
+		return s.test(e);
+	};
+}));
+//#endregion
+export default t();
+export { t as require_regex };
+
+//# sourceMappingURL=regex.js.map

package/dist/node_modules/qrcode/lib/core/regex.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"regex.js","names":[],"sources":["../../../../../node_modules/qrcode/lib/core/regex.js"],"sourcesContent":["const numeric = '[0-9]+'\nconst alphanumeric = '[A-Z $%*+\\\\-./:]+'\nlet kanji = '(?:[u3000-u303F]|[u3040-u309F]|[u30A0-u30FF]|' +\n  '[uFF00-uFFEF]|[u4E00-u9FAF]|[u2605-u2606]|[u2190-u2195]|u203B|' +\n  '[u2010u2015u2018u2019u2025u2026u201Cu201Du2225u2260]|' +\n  '[u0391-u0451]|[u00A7u00A8u00B1u00B4u00D7u00F7])+'\nkanji = kanji.replace(/u/g, '\\\\u')\n\nconst byte = '(?:(?![A-Z0-9 $%*+\\\\-./:]|' + kanji + ')(?:.|[\\r\\n]))+'\n\nexports.KANJI = new RegExp(kanji, 'g')\nexports.BYTE_KANJI = new RegExp('[^A-Z0-9 $%*+\\\\-./:]+', 'g')\nexports.BYTE = new RegExp(byte, 'g')\nexports.NUMERIC = new RegExp(numeric, 'g')\nexports.ALPHANUMERIC = new RegExp(alphanumeric, 'g')\n\nconst TEST_KANJI = new RegExp('^' + kanji + '$')\nconst TEST_NUMERIC = new RegExp('^' + numeric + '$')\nconst TEST_ALPHANUMERIC = new RegExp('^[A-Z0-9 $%*+\\\\-./:]+$')\n\nexports.testKanji = function testKanji (str) {\n  return TEST_KANJI.test(str)\n}\n\nexports.testNumeric = function testNumeric (str) {\n  return TEST_NUMERIC.test(str)\n}\n\nexports.testAlphanumeric = function testAlphanumeric (str) {\n  return TEST_ALPHANUMERIC.test(str)\n}\n"],"x_google_ignoreList":[0],"mappings":";;;CAAA,IAAM,IAAU,UACV,IAAe,qBACjB,IAAQ;AAIZ,KAAQ,EAAM,QAAQ,MAAM,MAAM;CAElC,IAAM,IAAO,+BAA+B,IAAQ;AAMpD,CAJA,EAAQ,QAAQ,IAAI,OAAO,GAAO,IAAI,EACtC,EAAQ,aAAa,gBAAI,OAAO,yBAAyB,IAAI,EAC7D,EAAQ,OAAO,IAAI,OAAO,GAAM,IAAI,EACpC,EAAQ,UAAU,IAAI,OAAO,GAAS,IAAI,EAC1C,EAAQ,eAAe,IAAI,OAAO,GAAc,IAAI;CAEpD,IAAM,IAAiB,OAAO,MAAM,IAAQ,IAAI,EAC1C,IAAmB,OAAO,MAAM,IAAU,IAAI,EAC9C,IAAoB,gBAAI,OAAO,yBAAyB;AAU9D,CARA,EAAQ,YAAY,SAAoB,GAAK;AAC3C,SAAO,EAAW,KAAK,EAAI;IAG7B,EAAQ,cAAc,SAAsB,GAAK;AAC/C,SAAO,EAAa,KAAK,EAAI;IAG/B,EAAQ,mBAAmB,SAA2B,GAAK;AACzD,SAAO,EAAkB,KAAK,EAAI"}

package/dist/node_modules/qrcode/lib/core/segments.js

@@ -0,0 +1,144 @@
+import { __commonJSMin as e } from "../../../../_virtual/_rolldown/runtime.js";
+import { require_utils as t } from "./utils.js";
+import { require_regex as n } from "./regex.js";
+import { require_mode as r } from "./mode.js";
+import { require_numeric_data as i } from "./numeric-data.js";
+import { require_alphanumeric_data as a } from "./alphanumeric-data.js";
+import { require_byte_data as o } from "./byte-data.js";
+import { require_kanji_data as s } from "./kanji-data.js";
+import { require_dijkstra as c } from "../../../dijkstrajs/dijkstra.js";
+//#region node_modules/qrcode/lib/core/segments.js
+var l = /* @__PURE__ */ e(((e) => {
+	var l = r(), u = i(), d = a(), f = o(), p = s(), m = n(), h = t(), g = c();
+	function _(e) {
+		return unescape(encodeURIComponent(e)).length;
+	}
+	function v(e, t, n) {
+		let r = [], i;
+		for (; (i = e.exec(n)) !== null;) r.push({
+			data: i[0],
+			index: i.index,
+			mode: t,
+			length: i[0].length
+		});
+		return r;
+	}
+	function y(e) {
+		let t = v(m.NUMERIC, l.NUMERIC, e), n = v(m.ALPHANUMERIC, l.ALPHANUMERIC, e), r, i;
+		return h.isKanjiModeEnabled() ? (r = v(m.BYTE, l.BYTE, e), i = v(m.KANJI, l.KANJI, e)) : (r = v(m.BYTE_KANJI, l.BYTE, e), i = []), t.concat(n, r, i).sort(function(e, t) {
+			return e.index - t.index;
+		}).map(function(e) {
+			return {
+				data: e.data,
+				mode: e.mode,
+				length: e.length
+			};
+		});
+	}
+	function b(e, t) {
+		switch (t) {
+			case l.NUMERIC: return u.getBitsLength(e);
+			case l.ALPHANUMERIC: return d.getBitsLength(e);
+			case l.KANJI: return p.getBitsLength(e);
+			case l.BYTE: return f.getBitsLength(e);
+		}
+	}
+	function x(e) {
+		return e.reduce(function(e, t) {
+			let n = e.length - 1 >= 0 ? e[e.length - 1] : null;
+			return n && n.mode === t.mode ? (e[e.length - 1].data += t.data, e) : (e.push(t), e);
+		}, []);
+	}
+	function S(e) {
+		let t = [];
+		for (let n = 0; n < e.length; n++) {
+			let r = e[n];
+			switch (r.mode) {
+				case l.NUMERIC:
+					t.push([
+						r,
+						{
+							data: r.data,
+							mode: l.ALPHANUMERIC,
+							length: r.length
+						},
+						{
+							data: r.data,
+							mode: l.BYTE,
+							length: r.length
+						}
+					]);
+					break;
+				case l.ALPHANUMERIC:
+					t.push([r, {
+						data: r.data,
+						mode: l.BYTE,
+						length: r.length
+					}]);
+					break;
+				case l.KANJI:
+					t.push([r, {
+						data: r.data,
+						mode: l.BYTE,
+						length: _(r.data)
+					}]);
+					break;
+				case l.BYTE: t.push([{
+					data: r.data,
+					mode: l.BYTE,
+					length: _(r.data)
+				}]);
+			}
+		}
+		return t;
+	}
+	function C(e, t) {
+		let n = {}, r = { start: {} }, i = ["start"];
+		for (let a = 0; a < e.length; a++) {
+			let o = e[a], s = [];
+			for (let e = 0; e < o.length; e++) {
+				let c = o[e], u = "" + a + e;
+				s.push(u), n[u] = {
+					node: c,
+					lastCount: 0
+				}, r[u] = {};
+				for (let e = 0; e < i.length; e++) {
+					let a = i[e];
+					n[a] && n[a].node.mode === c.mode ? (r[a][u] = b(n[a].lastCount + c.length, c.mode) - b(n[a].lastCount, c.mode), n[a].lastCount += c.length) : (n[a] && (n[a].lastCount = c.length), r[a][u] = b(c.length, c.mode) + 4 + l.getCharCountIndicator(c.mode, t));
+				}
+			}
+			i = s;
+		}
+		for (let e = 0; e < i.length; e++) r[i[e]].end = 0;
+		return {
+			map: r,
+			table: n
+		};
+	}
+	function w(e, t) {
+		let n, r = l.getBestModeForData(e);
+		if (n = l.from(t, r), n !== l.BYTE && n.bit < r.bit) throw Error("\"" + e + "\" cannot be encoded with mode " + l.toString(n) + ".\n Suggested mode is: " + l.toString(r));
+		switch (n === l.KANJI && !h.isKanjiModeEnabled() && (n = l.BYTE), n) {
+			case l.NUMERIC: return new u(e);
+			case l.ALPHANUMERIC: return new d(e);
+			case l.KANJI: return new p(e);
+			case l.BYTE: return new f(e);
+		}
+	}
+	e.fromArray = function(e) {
+		return e.reduce(function(e, t) {
+			return typeof t == "string" ? e.push(w(t, null)) : t.data && e.push(w(t.data, t.mode)), e;
+		}, []);
+	}, e.fromString = function(t, n) {
+		let r = C(S(y(t, h.isKanjiModeEnabled())), n), i = g.find_path(r.map, "start", "end"), a = [];
+		for (let e = 1; e < i.length - 1; e++) a.push(r.table[i[e]].node);
+		return e.fromArray(x(a));
+	}, e.rawSplit = function(t) {
+		return e.fromArray(y(t, h.isKanjiModeEnabled()));
+	};
+}));
+//#endregion
+export default l();
+export { l as require_segments };
+
+//# sourceMappingURL=segments.js.map

package/dist/node_modules/qrcode/lib/core/segments.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"segments.js","names":[],"sources":["../../../../../node_modules/qrcode/lib/core/segments.js"],"sourcesContent":["const Mode = require('./mode')\nconst NumericData = require('./numeric-data')\nconst AlphanumericData = require('./alphanumeric-data')\nconst ByteData = require('./byte-data')\nconst KanjiData = require('./kanji-data')\nconst Regex = require('./regex')\nconst Utils = require('./utils')\nconst dijkstra = require('dijkstrajs')\n\n/**\n * Returns UTF8 byte length\n *\n * @param  {String} str Input string\n * @return {Number}     Number of byte\n */\nfunction getStringByteLength (str) {\n  return unescape(encodeURIComponent(str)).length\n}\n\n/**\n * Get a list of segments of the specified mode\n * from a string\n *\n * @param  {Mode}   mode Segment mode\n * @param  {String} str  String to process\n * @return {Array}       Array of object with segments data\n */\nfunction getSegments (regex, mode, str) {\n  const segments = []\n  let result\n\n  while ((result = regex.exec(str)) !== null) {\n    segments.push({\n      data: result[0],\n      index: result.index,\n      mode: mode,\n      length: result[0].length\n    })\n  }\n\n  return segments\n}\n\n/**\n * Extracts a series of segments with the appropriate\n * modes from a string\n *\n * @param  {String} dataStr Input string\n * @return {Array}          Array of object with segments data\n */\nfunction getSegmentsFromString (dataStr) {\n  const numSegs = getSegments(Regex.NUMERIC, Mode.NUMERIC, dataStr)\n  const alphaNumSegs = getSegments(Regex.ALPHANUMERIC, Mode.ALPHANUMERIC, dataStr)\n  let byteSegs\n  let kanjiSegs\n\n  if (Utils.isKanjiModeEnabled()) {\n    byteSegs = getSegments(Regex.BYTE, Mode.BYTE, dataStr)\n    kanjiSegs = getSegments(Regex.KANJI, Mode.KANJI, dataStr)\n  } else {\n    byteSegs = getSegments(Regex.BYTE_KANJI, Mode.BYTE, dataStr)\n    kanjiSegs = []\n  }\n\n  const segs = numSegs.concat(alphaNumSegs, byteSegs, kanjiSegs)\n\n  return segs\n    .sort(function (s1, s2) {\n      return s1.index - s2.index\n    })\n    .map(function (obj) {\n      return {\n        data: obj.data,\n        mode: obj.mode,\n        length: obj.length\n      }\n    })\n}\n\n/**\n * Returns how many bits are needed to encode a string of\n * specified length with the specified mode\n *\n * @param  {Number} length String length\n * @param  {Mode} mode     Segment mode\n * @return {Number}        Bit length\n */\nfunction getSegmentBitsLength (length, mode) {\n  switch (mode) {\n    case Mode.NUMERIC:\n      return NumericData.getBitsLength(length)\n    case Mode.ALPHANUMERIC:\n      return AlphanumericData.getBitsLength(length)\n    case Mode.KANJI:\n      return KanjiData.getBitsLength(length)\n    case Mode.BYTE:\n      return ByteData.getBitsLength(length)\n  }\n}\n\n/**\n * Merges adjacent segments which have the same mode\n *\n * @param  {Array} segs Array of object with segments data\n * @return {Array}      Array of object with segments data\n */\nfunction mergeSegments (segs) {\n  return segs.reduce(function (acc, curr) {\n    const prevSeg = acc.length - 1 >= 0 ? acc[acc.length - 1] : null\n    if (prevSeg && prevSeg.mode === curr.mode) {\n      acc[acc.length - 1].data += curr.data\n      return acc\n    }\n\n    acc.push(curr)\n    return acc\n  }, [])\n}\n\n/**\n * Generates a list of all possible nodes combination which\n * will be used to build a segments graph.\n *\n * Nodes are divided by groups. Each group will contain a list of all the modes\n * in which is possible to encode the given text.\n *\n * For example the text '12345' can be encoded as Numeric, Alphanumeric or Byte.\n * The group for '12345' will contain then 3 objects, one for each\n * possible encoding mode.\n *\n * Each node represents a possible segment.\n *\n * @param  {Array} segs Array of object with segments data\n * @return {Array}      Array of object with segments data\n */\nfunction buildNodes (segs) {\n  const nodes = []\n  for (let i = 0; i < segs.length; i++) {\n    const seg = segs[i]\n\n    switch (seg.mode) {\n      case Mode.NUMERIC:\n        nodes.push([seg,\n          { data: seg.data, mode: Mode.ALPHANUMERIC, length: seg.length },\n          { data: seg.data, mode: Mode.BYTE, length: seg.length }\n        ])\n        break\n      case Mode.ALPHANUMERIC:\n        nodes.push([seg,\n          { data: seg.data, mode: Mode.BYTE, length: seg.length }\n        ])\n        break\n      case Mode.KANJI:\n        nodes.push([seg,\n          { data: seg.data, mode: Mode.BYTE, length: getStringByteLength(seg.data) }\n        ])\n        break\n      case Mode.BYTE:\n        nodes.push([\n          { data: seg.data, mode: Mode.BYTE, length: getStringByteLength(seg.data) }\n        ])\n    }\n  }\n\n  return nodes\n}\n\n/**\n * Builds a graph from a list of nodes.\n * All segments in each node group will be connected with all the segments of\n * the next group and so on.\n *\n * At each connection will be assigned a weight depending on the\n * segment's byte length.\n *\n * @param  {Array} nodes    Array of object with segments data\n * @param  {Number} version QR Code version\n * @return {Object}         Graph of all possible segments\n */\nfunction buildGraph (nodes, version) {\n  const table = {}\n  const graph = { start: {} }\n  let prevNodeIds = ['start']\n\n  for (let i = 0; i < nodes.length; i++) {\n    const nodeGroup = nodes[i]\n    const currentNodeIds = []\n\n    for (let j = 0; j < nodeGroup.length; j++) {\n      const node = nodeGroup[j]\n      const key = '' + i + j\n\n      currentNodeIds.push(key)\n      table[key] = { node: node, lastCount: 0 }\n      graph[key] = {}\n\n      for (let n = 0; n < prevNodeIds.length; n++) {\n        const prevNodeId = prevNodeIds[n]\n\n        if (table[prevNodeId] && table[prevNodeId].node.mode === node.mode) {\n          graph[prevNodeId][key] =\n            getSegmentBitsLength(table[prevNodeId].lastCount + node.length, node.mode) -\n            getSegmentBitsLength(table[prevNodeId].lastCount, node.mode)\n\n          table[prevNodeId].lastCount += node.length\n        } else {\n          if (table[prevNodeId]) table[prevNodeId].lastCount = node.length\n\n          graph[prevNodeId][key] = getSegmentBitsLength(node.length, node.mode) +\n            4 + Mode.getCharCountIndicator(node.mode, version) // switch cost\n        }\n      }\n    }\n\n    prevNodeIds = currentNodeIds\n  }\n\n  for (let n = 0; n < prevNodeIds.length; n++) {\n    graph[prevNodeIds[n]].end = 0\n  }\n\n  return { map: graph, table: table }\n}\n\n/**\n * Builds a segment from a specified data and mode.\n * If a mode is not specified, the more suitable will be used.\n *\n * @param  {String} data             Input data\n * @param  {Mode | String} modesHint Data mode\n * @return {Segment}                 Segment\n */\nfunction buildSingleSegment (data, modesHint) {\n  let mode\n  const bestMode = Mode.getBestModeForData(data)\n\n  mode = Mode.from(modesHint, bestMode)\n\n  // Make sure data can be encoded\n  if (mode !== Mode.BYTE && mode.bit < bestMode.bit) {\n    throw new Error('\"' + data + '\"' +\n      ' cannot be encoded with mode ' + Mode.toString(mode) +\n      '.\\n Suggested mode is: ' + Mode.toString(bestMode))\n  }\n\n  // Use Mode.BYTE if Kanji support is disabled\n  if (mode === Mode.KANJI && !Utils.isKanjiModeEnabled()) {\n    mode = Mode.BYTE\n  }\n\n  switch (mode) {\n    case Mode.NUMERIC:\n      return new NumericData(data)\n\n    case Mode.ALPHANUMERIC:\n      return new AlphanumericData(data)\n\n    case Mode.KANJI:\n      return new KanjiData(data)\n\n    case Mode.BYTE:\n      return new ByteData(data)\n  }\n}\n\n/**\n * Builds a list of segments from an array.\n * Array can contain Strings or Objects with segment's info.\n *\n * For each item which is a string, will be generated a segment with the given\n * string and the more appropriate encoding mode.\n *\n * For each item which is an object, will be generated a segment with the given\n * data and mode.\n * Objects must contain at least the property \"data\".\n * If property \"mode\" is not present, the more suitable mode will be used.\n *\n * @param  {Array} array Array of objects with segments data\n * @return {Array}       Array of Segments\n */\nexports.fromArray = function fromArray (array) {\n  return array.reduce(function (acc, seg) {\n    if (typeof seg === 'string') {\n      acc.push(buildSingleSegment(seg, null))\n    } else if (seg.data) {\n      acc.push(buildSingleSegment(seg.data, seg.mode))\n    }\n\n    return acc\n  }, [])\n}\n\n/**\n * Builds an optimized sequence of segments from a string,\n * which will produce the shortest possible bitstream.\n *\n * @param  {String} data    Input string\n * @param  {Number} version QR Code version\n * @return {Array}          Array of segments\n */\nexports.fromString = function fromString (data, version) {\n  const segs = getSegmentsFromString(data, Utils.isKanjiModeEnabled())\n\n  const nodes = buildNodes(segs)\n  const graph = buildGraph(nodes, version)\n  const path = dijkstra.find_path(graph.map, 'start', 'end')\n\n  const optimizedSegs = []\n  for (let i = 1; i < path.length - 1; i++) {\n    optimizedSegs.push(graph.table[path[i]].node)\n  }\n\n  return exports.fromArray(mergeSegments(optimizedSegs))\n}\n\n/**\n * Splits a string in various segments with the modes which\n * best represent their content.\n * The produced segments are far from being optimized.\n * The output of this function is only used to estimate a QR Code version\n * which may contain the data.\n *\n * @param  {string} data Input string\n * @return {Array}       Array of segments\n */\nexports.rawSplit = function rawSplit (data) {\n  return exports.fromArray(\n    getSegmentsFromString(data, Utils.isKanjiModeEnabled())\n  )\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;;;;;;;;CAAA,IAAM,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA;CAQN,SAAS,EAAqB,GAAK;AACjC,SAAO,SAAS,mBAAmB,EAAI,CAAC,CAAC;;CAW3C,SAAS,EAAa,GAAO,GAAM,GAAK;EACtC,IAAM,IAAW,EAAE,EACf;AAEJ,UAAQ,IAAS,EAAM,KAAK,EAAI,MAAM,MACpC,GAAS,KAAK;GACZ,MAAM,EAAO;GACb,OAAO,EAAO;GACR;GACN,QAAQ,EAAO,GAAG;GACnB,CAAC;AAGJ,SAAO;;CAUT,SAAS,EAAuB,GAAS;EACvC,IAAM,IAAU,EAAY,EAAM,SAAS,EAAK,SAAS,EAAQ,EAC3D,IAAe,EAAY,EAAM,cAAc,EAAK,cAAc,EAAQ,EAC5E,GACA;AAYJ,SAVI,EAAM,oBAAoB,IAC5B,IAAW,EAAY,EAAM,MAAM,EAAK,MAAM,EAAQ,EACtD,IAAY,EAAY,EAAM,OAAO,EAAK,OAAO,EAAQ,KAEzD,IAAW,EAAY,EAAM,YAAY,EAAK,MAAM,EAAQ,EAC5D,IAAY,EAAE,GAGH,EAAQ,OAAO,GAAc,GAAU,EAAU,CAG3D,KAAK,SAAU,GAAI,GAAI;AACtB,UAAO,EAAG,QAAQ,EAAG;IACrB,CACD,IAAI,SAAU,GAAK;AAClB,UAAO;IACL,MAAM,EAAI;IACV,MAAM,EAAI;IACV,QAAQ,EAAI;IACb;IACD;;CAWN,SAAS,EAAsB,GAAQ,GAAM;AAC3C,UAAQ,GAAR;GACE,KAAK,EAAK,QACR,QAAO,EAAY,cAAc,EAAO;GAC1C,KAAK,EAAK,aACR,QAAO,EAAiB,cAAc,EAAO;GAC/C,KAAK,EAAK,MACR,QAAO,EAAU,cAAc,EAAO;GACxC,KAAK,EAAK,KACR,QAAO,EAAS,cAAc,EAAO;;;CAU3C,SAAS,EAAe,GAAM;AAC5B,SAAO,EAAK,OAAO,SAAU,GAAK,GAAM;GACtC,IAAM,IAAU,EAAI,SAAS,KAAK,IAAI,EAAI,EAAI,SAAS,KAAK;AAO5D,UANI,KAAW,EAAQ,SAAS,EAAK,QACnC,EAAI,EAAI,SAAS,GAAG,QAAQ,EAAK,MAC1B,MAGT,EAAI,KAAK,EAAK,EACP;KACN,EAAE,CAAC;;CAmBR,SAAS,EAAY,GAAM;EACzB,IAAM,IAAQ,EAAE;AAChB,OAAK,IAAI,IAAI,GAAG,IAAI,EAAK,QAAQ,KAAK;GACpC,IAAM,IAAM,EAAK;AAEjB,WAAQ,EAAI,MAAZ;IACE,KAAK,EAAK;AACR,OAAM,KAAK;MAAC;MACV;OAAE,MAAM,EAAI;OAAM,MAAM,EAAK;OAAc,QAAQ,EAAI;OAAQ;MAC/D;OAAE,MAAM,EAAI;OAAM,MAAM,EAAK;OAAM,QAAQ,EAAI;OAAQ;MACxD,CAAC;AACF;IACF,KAAK,EAAK;AACR,OAAM,KAAK,CAAC,GACV;MAAE,MAAM,EAAI;MAAM,MAAM,EAAK;MAAM,QAAQ,EAAI;MAAQ,CACxD,CAAC;AACF;IACF,KAAK,EAAK;AACR,OAAM,KAAK,CAAC,GACV;MAAE,MAAM,EAAI;MAAM,MAAM,EAAK;MAAM,QAAQ,EAAoB,EAAI,KAAK;MAAE,CAC3E,CAAC;AACF;IACF,KAAK,EAAK,KACR,GAAM,KAAK,CACT;KAAE,MAAM,EAAI;KAAM,MAAM,EAAK;KAAM,QAAQ,EAAoB,EAAI,KAAK;KAAE,CAC3E,CAAC;;;AAIR,SAAO;;CAeT,SAAS,EAAY,GAAO,GAAS;EACnC,IAAM,IAAQ,EAAE,EACV,IAAQ,EAAE,OAAO,EAAE,EAAE,EACvB,IAAc,CAAC,QAAQ;AAE3B,OAAK,IAAI,IAAI,GAAG,IAAI,EAAM,QAAQ,KAAK;GACrC,IAAM,IAAY,EAAM,IAClB,IAAiB,EAAE;AAEzB,QAAK,IAAI,IAAI,GAAG,IAAI,EAAU,QAAQ,KAAK;IACzC,IAAM,IAAO,EAAU,IACjB,IAAM,KAAK,IAAI;AAIrB,IAFA,EAAe,KAAK,EAAI,EACxB,EAAM,KAAO;KAAQ;KAAM,WAAW;KAAG,EACzC,EAAM,KAAO,EAAE;AAEf,SAAK,IAAI,IAAI,GAAG,IAAI,EAAY,QAAQ,KAAK;KAC3C,IAAM,IAAa,EAAY;AAE/B,KAAI,EAAM,MAAe,EAAM,GAAY,KAAK,SAAS,EAAK,QAC5D,EAAM,GAAY,KAChB,EAAqB,EAAM,GAAY,YAAY,EAAK,QAAQ,EAAK,KAAK,GAC1E,EAAqB,EAAM,GAAY,WAAW,EAAK,KAAK,EAE9D,EAAM,GAAY,aAAa,EAAK,WAEhC,EAAM,OAAa,EAAM,GAAY,YAAY,EAAK,SAE1D,EAAM,GAAY,KAAO,EAAqB,EAAK,QAAQ,EAAK,KAAK,GACnE,IAAI,EAAK,sBAAsB,EAAK,MAAM,EAAQ;;;AAK1D,OAAc;;AAGhB,OAAK,IAAI,IAAI,GAAG,IAAI,EAAY,QAAQ,IACtC,GAAM,EAAY,IAAI,MAAM;AAG9B,SAAO;GAAE,KAAK;GAAc;GAAO;;CAWrC,SAAS,EAAoB,GAAM,GAAW;EAC5C,IAAI,GACE,IAAW,EAAK,mBAAmB,EAAK;AAK9C,MAHA,IAAO,EAAK,KAAK,GAAW,EAAS,EAGjC,MAAS,EAAK,QAAQ,EAAK,MAAM,EAAS,IAC5C,OAAU,MAAM,OAAM,IAAO,oCACO,EAAK,SAAS,EAAK,GACrD,4BAA4B,EAAK,SAAS,EAAS,CAAC;AAQxD,UAJI,MAAS,EAAK,SAAS,CAAC,EAAM,oBAAoB,KACpD,IAAO,EAAK,OAGN,GAAR;GACE,KAAK,EAAK,QACR,QAAO,IAAI,EAAY,EAAK;GAE9B,KAAK,EAAK,aACR,QAAO,IAAI,EAAiB,EAAK;GAEnC,KAAK,EAAK,MACR,QAAO,IAAI,EAAU,EAAK;GAE5B,KAAK,EAAK,KACR,QAAO,IAAI,EAAS,EAAK;;;AAgE/B,CA7CA,EAAQ,YAAY,SAAoB,GAAO;AAC7C,SAAO,EAAM,OAAO,SAAU,GAAK,GAAK;AAOtC,UANI,OAAO,KAAQ,WACjB,EAAI,KAAK,EAAmB,GAAK,KAAK,CAAC,GAC9B,EAAI,QACb,EAAI,KAAK,EAAmB,EAAI,MAAM,EAAI,KAAK,CAAC,EAG3C;KACN,EAAE,CAAC;IAWR,EAAQ,aAAa,SAAqB,GAAM,GAAS;EAIvD,IAAM,IAAQ,EADA,EAFD,EAAsB,GAAM,EAAM,oBAAoB,CAAC,CAEtC,EACE,EAAQ,EAClC,IAAO,EAAS,UAAU,EAAM,KAAK,SAAS,MAAM,EAEpD,IAAgB,EAAE;AACxB,OAAK,IAAI,IAAI,GAAG,IAAI,EAAK,SAAS,GAAG,IACnC,GAAc,KAAK,EAAM,MAAM,EAAK,IAAI,KAAK;AAG/C,SAAO,EAAQ,UAAU,EAAc,EAAc,CAAC;IAaxD,EAAQ,WAAW,SAAmB,GAAM;AAC1C,SAAO,EAAQ,UACb,EAAsB,GAAM,EAAM,oBAAoB,CAAC,CACxD"}

package/dist/node_modules/qrcode/lib/core/utils.js

@@ -0,0 +1,70 @@
+import { __commonJSMin as e } from "../../../../_virtual/_rolldown/runtime.js";
+//#region node_modules/qrcode/lib/core/utils.js
+var t = /* @__PURE__ */ e(((e) => {
+	var t, n = [
+		0,
+		26,
+		44,
+		70,
+		100,
+		134,
+		172,
+		196,
+		242,
+		292,
+		346,
+		404,
+		466,
+		532,
+		581,
+		655,
+		733,
+		815,
+		901,
+		991,
+		1085,
+		1156,
+		1258,
+		1364,
+		1474,
+		1588,
+		1706,
+		1828,
+		1921,
+		2051,
+		2185,
+		2323,
+		2465,
+		2611,
+		2761,
+		2876,
+		3034,
+		3196,
+		3362,
+		3532,
+		3706
+	];
+	e.getSymbolSize = function(e) {
+		if (!e) throw Error("\"version\" cannot be null or undefined");
+		if (e < 1 || e > 40) throw Error("\"version\" should be in range from 1 to 40");
+		return e * 4 + 17;
+	}, e.getSymbolTotalCodewords = function(e) {
+		return n[e];
+	}, e.getBCHDigit = function(e) {
+		let t = 0;
+		for (; e !== 0;) t++, e >>>= 1;
+		return t;
+	}, e.setToSJISFunction = function(e) {
+		if (typeof e != "function") throw Error("\"toSJISFunc\" is not a valid function.");
+		t = e;
+	}, e.isKanjiModeEnabled = function() {
+		return t !== void 0;
+	}, e.toSJIS = function(e) {
+		return t(e);
+	};
+}));
+//#endregion
+export default t();
+export { t as require_utils };
+
+//# sourceMappingURL=utils.js.map

package/dist/node_modules/qrcode/lib/core/utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"utils.js","names":[],"sources":["../../../../../node_modules/qrcode/lib/core/utils.js"],"sourcesContent":["let toSJISFunction\nconst CODEWORDS_COUNT = [\n  0, // Not used\n  26, 44, 70, 100, 134, 172, 196, 242, 292, 346,\n  404, 466, 532, 581, 655, 733, 815, 901, 991, 1085,\n  1156, 1258, 1364, 1474, 1588, 1706, 1828, 1921, 2051, 2185,\n  2323, 2465, 2611, 2761, 2876, 3034, 3196, 3362, 3532, 3706\n]\n\n/**\n * Returns the QR Code size for the specified version\n *\n * @param  {Number} version QR Code version\n * @return {Number}         size of QR code\n */\nexports.getSymbolSize = function getSymbolSize (version) {\n  if (!version) throw new Error('\"version\" cannot be null or undefined')\n  if (version < 1 || version > 40) throw new Error('\"version\" should be in range from 1 to 40')\n  return version * 4 + 17\n}\n\n/**\n * Returns the total number of codewords used to store data and EC information.\n *\n * @param  {Number} version QR Code version\n * @return {Number}         Data length in bits\n */\nexports.getSymbolTotalCodewords = function getSymbolTotalCodewords (version) {\n  return CODEWORDS_COUNT[version]\n}\n\n/**\n * Encode data with Bose-Chaudhuri-Hocquenghem\n *\n * @param  {Number} data Value to encode\n * @return {Number}      Encoded value\n */\nexports.getBCHDigit = function (data) {\n  let digit = 0\n\n  while (data !== 0) {\n    digit++\n    data >>>= 1\n  }\n\n  return digit\n}\n\nexports.setToSJISFunction = function setToSJISFunction (f) {\n  if (typeof f !== 'function') {\n    throw new Error('\"toSJISFunc\" is not a valid function.')\n  }\n\n  toSJISFunction = f\n}\n\nexports.isKanjiModeEnabled = function () {\n  return typeof toSJISFunction !== 'undefined'\n}\n\nexports.toSJIS = function toSJIS (kanji) {\n  return toSJISFunction(kanji)\n}\n"],"x_google_ignoreList":[0],"mappings":";;;CAAA,IAAI,GACE,IAAkB;EACtB;EACA;EAAI;EAAI;EAAI;EAAK;EAAK;EAAK;EAAK;EAAK;EAAK;EAC1C;EAAK;EAAK;EAAK;EAAK;EAAK;EAAK;EAAK;EAAK;EAAK;EAC7C;EAAM;EAAM;EAAM;EAAM;EAAM;EAAM;EAAM;EAAM;EAAM;EACtD;EAAM;EAAM;EAAM;EAAM;EAAM;EAAM;EAAM;EAAM;EAAM;EACvD;AAqDD,CA7CA,EAAQ,gBAAgB,SAAwB,GAAS;AACvD,MAAI,CAAC,EAAS,OAAU,MAAM,0CAAwC;AACtE,MAAI,IAAU,KAAK,IAAU,GAAI,OAAU,MAAM,8CAA4C;AAC7F,SAAO,IAAU,IAAI;IASvB,EAAQ,0BAA0B,SAAkC,GAAS;AAC3E,SAAO,EAAgB;IASzB,EAAQ,cAAc,SAAU,GAAM;EACpC,IAAI,IAAQ;AAEZ,SAAO,MAAS,GAEd,CADA,KACA,OAAU;AAGZ,SAAO;IAGT,EAAQ,oBAAoB,SAA4B,GAAG;AACzD,MAAI,OAAO,KAAM,WACf,OAAU,MAAM,0CAAwC;AAG1D,MAAiB;IAGnB,EAAQ,qBAAqB,WAAY;AACvC,SAAc,MAAmB;IAGnC,EAAQ,SAAS,SAAiB,GAAO;AACvC,SAAO,EAAe,EAAM"}