asterui 0.12.1 → 0.12.3

package/dist/index125.js

@@ -1,147 +0,0 @@
-import { __exports as N } from "./index142.js";
-import { __require as T } from "./index124.js";
-import { __require as Y } from "./index143.js";
-import { __require as L } from "./index144.js";
-import { __require as y } from "./index145.js";
-import { __require as D } from "./index146.js";
-import { __require as j } from "./index141.js";
-import { __require as k } from "./index113.js";
-import { __require as J } from "./index147.js";
-var b;
-function V() {
-  return b ? N : (b = 1, (function(m) {
-    const r = T(), I = Y(), B = L(), _ = y(), q = D(), c = j(), p = k(), R = J();
-    function C(n) {
-      return unescape(encodeURIComponent(n)).length;
-    }
-    function h(n, o, t) {
-      const e = [];
-      let s;
-      for (; (s = n.exec(t)) !== null; )
-        e.push({
-          data: s[0],
-          index: s.index,
-          mode: o,
-          length: s[0].length
-        });
-      return e;
-    }
-    function M(n) {
-      const o = h(c.NUMERIC, r.NUMERIC, n), t = h(c.ALPHANUMERIC, r.ALPHANUMERIC, n);
-      let e, s;
-      return p.isKanjiModeEnabled() ? (e = h(c.BYTE, r.BYTE, n), s = h(c.KANJI, r.KANJI, n)) : (e = h(c.BYTE_KANJI, r.BYTE, n), s = []), o.concat(t, e, s).sort(function(a, l) {
-        return a.index - l.index;
-      }).map(function(a) {
-        return {
-          data: a.data,
-          mode: a.mode,
-          length: a.length
-        };
-      });
-    }
-    function E(n, o) {
-      switch (o) {
-        case r.NUMERIC:
-          return I.getBitsLength(n);
-        case r.ALPHANUMERIC:
-          return B.getBitsLength(n);
-        case r.KANJI:
-          return q.getBitsLength(n);
-        case r.BYTE:
-          return _.getBitsLength(n);
-      }
-    }
-    function U(n) {
-      return n.reduce(function(o, t) {
-        const e = o.length - 1 >= 0 ? o[o.length - 1] : null;
-        return e && e.mode === t.mode ? (o[o.length - 1].data += t.data, o) : (o.push(t), o);
-      }, []);
-    }
-    function w(n) {
-      const o = [];
-      for (let t = 0; t < n.length; t++) {
-        const e = n[t];
-        switch (e.mode) {
-          case r.NUMERIC:
-            o.push([
-              e,
-              { data: e.data, mode: r.ALPHANUMERIC, length: e.length },
-              { data: e.data, mode: r.BYTE, length: e.length }
-            ]);
-            break;
-          case r.ALPHANUMERIC:
-            o.push([
-              e,
-              { data: e.data, mode: r.BYTE, length: e.length }
-            ]);
-            break;
-          case r.KANJI:
-            o.push([
-              e,
-              { data: e.data, mode: r.BYTE, length: C(e.data) }
-            ]);
-            break;
-          case r.BYTE:
-            o.push([
-              { data: e.data, mode: r.BYTE, length: C(e.data) }
-            ]);
-        }
-      }
-      return o;
-    }
-    function K(n, o) {
-      const t = {}, e = { start: {} };
-      let s = ["start"];
-      for (let i = 0; i < n.length; i++) {
-        const a = n[i], l = [];
-        for (let g = 0; g < a.length; g++) {
-          const u = a[g], f = "" + i + g;
-          l.push(f), t[f] = { node: u, lastCount: 0 }, e[f] = {};
-          for (let A = 0; A < s.length; A++) {
-            const d = s[A];
-            t[d] && t[d].node.mode === u.mode ? (e[d][f] = E(t[d].lastCount + u.length, u.mode) - E(t[d].lastCount, u.mode), t[d].lastCount += u.length) : (t[d] && (t[d].lastCount = u.length), e[d][f] = E(u.length, u.mode) + 4 + r.getCharCountIndicator(u.mode, o));
-          }
-        }
-        s = l;
-      }
-      for (let i = 0; i < s.length; i++)
-        e[s[i]].end = 0;
-      return { map: e, table: t };
-    }
-    function S(n, o) {
-      let t;
-      const e = r.getBestModeForData(n);
-      if (t = r.from(o, e), t !== r.BYTE && t.bit < e.bit)
-        throw new Error('"' + n + '" cannot be encoded with mode ' + r.toString(t) + `.
- Suggested mode is: ` + r.toString(e));
-      switch (t === r.KANJI && !p.isKanjiModeEnabled() && (t = r.BYTE), t) {
-        case r.NUMERIC:
-          return new I(n);
-        case r.ALPHANUMERIC:
-          return new B(n);
-        case r.KANJI:
-          return new q(n);
-        case r.BYTE:
-          return new _(n);
-      }
-    }
-    m.fromArray = function(o) {
-      return o.reduce(function(t, e) {
-        return typeof e == "string" ? t.push(S(e, null)) : e.data && t.push(S(e.data, e.mode)), t;
-      }, []);
-    }, m.fromString = function(o, t) {
-      const e = M(o, p.isKanjiModeEnabled()), s = w(e), i = K(s, t), a = R.find_path(i.map, "start", "end"), l = [];
-      for (let g = 1; g < a.length - 1; g++)
-        l.push(i.table[a[g]].node);
-      return m.fromArray(U(l));
-    }, m.rawSplit = function(o) {
-      return m.fromArray(
-        M(o, p.isKanjiModeEnabled())
-      );
-    };
-  })(N), N);
-}
-export {
-  V as __require
-};
-//# sourceMappingURL=index125.js.map

package/dist/index125.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index125.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/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"],"names":["Mode","require$$0","NumericData","require$$1","AlphanumericData","require$$2","ByteData","require$$3","KanjiData","require$$4","Regex","require$$5","Utils","require$$6","dijkstra","require$$7","getStringByteLength","str","getSegments","regex","mode","segments","result","getSegmentsFromString","dataStr","numSegs","alphaNumSegs","byteSegs","kanjiSegs","s1","s2","obj","getSegmentBitsLength","length","mergeSegments","segs","acc","curr","prevSeg","buildNodes","nodes","i","seg","buildGraph","version","table","graph","prevNodeIds","nodeGroup","currentNodeIds","j","node","key","n","prevNodeId","buildSingleSegment","data","modesHint","bestMode","exports","array","path","optimizedSegs"],"mappings":";;;;;;;;;;;;AAAA,UAAMA,IAAOC,EAAA,GACPC,IAAcC,EAAA,GACdC,IAAmBC,EAAA,GACnBC,IAAWC,EAAA,GACXC,IAAYC,EAAA,GACZC,IAAQC,EAAA,GACRC,IAAQC,EAAA,GACRC,IAAWC,EAAA;AAQjB,aAASC,EAAqBC,GAAK;AACjC,aAAO,SAAS,mBAAmBA,CAAG,CAAC,EAAE;AAAA,IAC3C;AAUA,aAASC,EAAaC,GAAOC,GAAMH,GAAK;AACtC,YAAMI,IAAW,CAAA;AACjB,UAAIC;AAEJ,cAAQA,IAASH,EAAM,KAAKF,CAAG,OAAO;AACpC,QAAAI,EAAS,KAAK;AAAA,UACZ,MAAMC,EAAO,CAAC;AAAA,UACd,OAAOA,EAAO;AAAA,UACd,MAAMF;AAAA,UACN,QAAQE,EAAO,CAAC,EAAE;AAAA,SACnB;AAGH,aAAOD;AAAA,IACT;AASA,aAASE,EAAuBC,GAAS;AACvC,YAAMC,IAAUP,EAAYR,EAAM,SAASV,EAAK,SAASwB,CAAO,GAC1DE,IAAeR,EAAYR,EAAM,cAAcV,EAAK,cAAcwB,CAAO;AAC/E,UAAIG,GACAC;AAEJ,aAAIhB,EAAM,wBACRe,IAAWT,EAAYR,EAAM,MAAMV,EAAK,MAAMwB,CAAO,GACrDI,IAAYV,EAAYR,EAAM,OAAOV,EAAK,OAAOwB,CAAO,MAExDG,IAAWT,EAAYR,EAAM,YAAYV,EAAK,MAAMwB,CAAO,GAC3DI,IAAY,CAAA,IAGDH,EAAQ,OAAOC,GAAcC,GAAUC,CAAS,EAG1D,KAAK,SAAUC,GAAIC,GAAI;AACtB,eAAOD,EAAG,QAAQC,EAAG;AAAA,MAC3B,CAAK,EACA,IAAI,SAAUC,GAAK;AAClB,eAAO;AAAA,UACL,MAAMA,EAAI;AAAA,UACV,MAAMA,EAAI;AAAA,UACV,QAAQA,EAAI;AAAA,QACpB;AAAA,MACA,CAAK;AAAA,IACL;AAUA,aAASC,EAAsBC,GAAQb,GAAM;AAC3C,cAAQA,GAAI;AAAA,QACV,KAAKpB,EAAK;AACR,iBAAOE,EAAY,cAAc+B,CAAM;AAAA,QACzC,KAAKjC,EAAK;AACR,iBAAOI,EAAiB,cAAc6B,CAAM;AAAA,QAC9C,KAAKjC,EAAK;AACR,iBAAOQ,EAAU,cAAcyB,CAAM;AAAA,QACvC,KAAKjC,EAAK;AACR,iBAAOM,EAAS,cAAc2B,CAAM;AAAA,MAC1C;AAAA,IACA;AAQA,aAASC,EAAeC,GAAM;AAC5B,aAAOA,EAAK,OAAO,SAAUC,GAAKC,GAAM;AACtC,cAAMC,IAAUF,EAAI,SAAS,KAAK,IAAIA,EAAIA,EAAI,SAAS,CAAC,IAAI;AAC5D,eAAIE,KAAWA,EAAQ,SAASD,EAAK,QACnCD,EAAIA,EAAI,SAAS,CAAC,EAAE,QAAQC,EAAK,MAC1BD,MAGTA,EAAI,KAAKC,CAAI,GACND;AAAA,MACX,GAAK,CAAA,CAAE;AAAA,IACP;AAkBA,aAASG,EAAYJ,GAAM;AACzB,YAAMK,IAAQ,CAAA;AACd,eAASC,IAAI,GAAGA,IAAIN,EAAK,QAAQM,KAAK;AACpC,cAAMC,IAAMP,EAAKM,CAAC;AAElB,gBAAQC,EAAI,MAAI;AAAA,UACd,KAAK1C,EAAK;AACR,YAAAwC,EAAM,KAAK;AAAA,cAACE;AAAA,cACV,EAAE,MAAMA,EAAI,MAAM,MAAM1C,EAAK,cAAc,QAAQ0C,EAAI,OAAM;AAAA,cAC7D,EAAE,MAAMA,EAAI,MAAM,MAAM1C,EAAK,MAAM,QAAQ0C,EAAI,OAAM;AAAA,aACtD;AACD;AAAA,UACF,KAAK1C,EAAK;AACR,YAAAwC,EAAM,KAAK;AAAA,cAACE;AAAA,cACV,EAAE,MAAMA,EAAI,MAAM,MAAM1C,EAAK,MAAM,QAAQ0C,EAAI,OAAM;AAAA,aACtD;AACD;AAAA,UACF,KAAK1C,EAAK;AACR,YAAAwC,EAAM,KAAK;AAAA,cAACE;AAAA,cACV,EAAE,MAAMA,EAAI,MAAM,MAAM1C,EAAK,MAAM,QAAQgB,EAAoB0B,EAAI,IAAI,EAAC;AAAA,aACzE;AACD;AAAA,UACF,KAAK1C,EAAK;AACR,YAAAwC,EAAM,KAAK;AAAA,cACT,EAAE,MAAME,EAAI,MAAM,MAAM1C,EAAK,MAAM,QAAQgB,EAAoB0B,EAAI,IAAI,EAAC;AAAA,aACzE;AAAA,QACT;AAAA,MACA;AAEE,aAAOF;AAAA,IACT;AAcA,aAASG,EAAYH,GAAOI,GAAS;AACnC,YAAMC,IAAQ,CAAA,GACRC,IAAQ,EAAE,OAAO,CAAA,EAAE;AACzB,UAAIC,IAAc,CAAC,OAAO;AAE1B,eAAS,IAAI,GAAG,IAAIP,EAAM,QAAQ,KAAK;AACrC,cAAMQ,IAAYR,EAAM,CAAC,GACnBS,IAAiB,CAAA;AAEvB,iBAASC,IAAI,GAAGA,IAAIF,EAAU,QAAQE,KAAK;AACzC,gBAAMC,IAAOH,EAAUE,CAAC,GAClBE,IAAM,KAAK,IAAIF;AAErB,UAAAD,EAAe,KAAKG,CAAG,GACvBP,EAAMO,CAAG,IAAI,EAAE,MAAMD,GAAM,WAAW,EAAC,GACvCL,EAAMM,CAAG,IAAI,CAAA;AAEb,mBAASC,IAAI,GAAGA,IAAIN,EAAY,QAAQM,KAAK;AAC3C,kBAAMC,IAAaP,EAAYM,CAAC;AAEhC,YAAIR,EAAMS,CAAU,KAAKT,EAAMS,CAAU,EAAE,KAAK,SAASH,EAAK,QAC5DL,EAAMQ,CAAU,EAAEF,CAAG,IACnBpB,EAAqBa,EAAMS,CAAU,EAAE,YAAYH,EAAK,QAAQA,EAAK,IAAI,IACzEnB,EAAqBa,EAAMS,CAAU,EAAE,WAAWH,EAAK,IAAI,GAE7DN,EAAMS,CAAU,EAAE,aAAaH,EAAK,WAEhCN,EAAMS,CAAU,MAAGT,EAAMS,CAAU,EAAE,YAAYH,EAAK,SAE1DL,EAAMQ,CAAU,EAAEF,CAAG,IAAIpB,EAAqBmB,EAAK,QAAQA,EAAK,IAAI,IAClE,IAAInD,EAAK,sBAAsBmD,EAAK,MAAMP,CAAO;AAAA,UAE7D;AAAA,QACA;AAEI,QAAAG,IAAcE;AAAA,MAClB;AAEE,eAASI,IAAI,GAAGA,IAAIN,EAAY,QAAQM;AACtC,QAAAP,EAAMC,EAAYM,CAAC,CAAC,EAAE,MAAM;AAG9B,aAAO,EAAE,KAAKP,GAAO,OAAOD,EAAK;AAAA,IACnC;AAUA,aAASU,EAAoBC,GAAMC,GAAW;AAC5C,UAAIrC;AACJ,YAAMsC,IAAW1D,EAAK,mBAAmBwD,CAAI;AAK7C,UAHApC,IAAOpB,EAAK,KAAKyD,GAAWC,CAAQ,GAGhCtC,MAASpB,EAAK,QAAQoB,EAAK,MAAMsC,EAAS;AAC5C,cAAM,IAAI,MAAM,MAAMF,IAAO,mCACOxD,EAAK,SAASoB,CAAI,IACpD;AAAA,wBAA4BpB,EAAK,SAAS0D,CAAQ,CAAC;AAQvD,cAJItC,MAASpB,EAAK,SAAS,CAACY,EAAM,mBAAkB,MAClDQ,IAAOpB,EAAK,OAGNoB,GAAI;AAAA,QACV,KAAKpB,EAAK;AACR,iBAAO,IAAIE,EAAYsD,CAAI;AAAA,QAE7B,KAAKxD,EAAK;AACR,iBAAO,IAAII,EAAiBoD,CAAI;AAAA,QAElC,KAAKxD,EAAK;AACR,iBAAO,IAAIQ,EAAUgD,CAAI;AAAA,QAE3B,KAAKxD,EAAK;AACR,iBAAO,IAAIM,EAASkD,CAAI;AAAA,MAC9B;AAAA,IACA;AAiBAG,IAAAA,EAAA,YAAoB,SAAoBC,GAAO;AAC7C,aAAOA,EAAM,OAAO,SAAUxB,GAAKM,GAAK;AACtC,eAAI,OAAOA,KAAQ,WACjBN,EAAI,KAAKmB,EAAmBb,GAAK,IAAI,CAAC,IAC7BA,EAAI,QACbN,EAAI,KAAKmB,EAAmBb,EAAI,MAAMA,EAAI,IAAI,CAAC,GAG1CN;AAAA,MACX,GAAK,CAAA,CAAE;AAAA,IACP,GAUAuB,EAAA,aAAqB,SAAqBH,GAAMZ,GAAS;AACvD,YAAMT,IAAOZ,EAAsBiC,GAAM5C,EAAM,mBAAkB,CAAE,GAE7D4B,IAAQD,EAAWJ,CAAI,GACvBW,IAAQH,EAAWH,GAAOI,CAAO,GACjCiB,IAAO/C,EAAS,UAAUgC,EAAM,KAAK,SAAS,KAAK,GAEnDgB,IAAgB,CAAA;AACtB,eAASrB,IAAI,GAAGA,IAAIoB,EAAK,SAAS,GAAGpB;AACnC,QAAAqB,EAAc,KAAKhB,EAAM,MAAMe,EAAKpB,CAAC,CAAC,EAAE,IAAI;AAG9C,aAAOkB,EAAQ,UAAUzB,EAAc4B,CAAa,CAAC;AAAA,IACvD,GAYAH,EAAA,WAAmB,SAAmBH,GAAM;AAC1C,aAAOG,EAAQ;AAAA,QACbpC,EAAsBiC,GAAM5C,EAAM,mBAAkB,CAAE;AAAA,MAC1D;AAAA,IACA;AAAA;;","x_google_ignoreList":[0]}

package/dist/index126.js

@@ -1,5 +0,0 @@
-var a = {};
-export {
-  a as __exports
-};
-//# sourceMappingURL=index126.js.map

package/dist/index126.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index126.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/index127.js

@@ -1,59 +0,0 @@
-import { __exports as u } from "./index129.js";
-var s;
-function M() {
-  return s ? u : (s = 1, (function(l) {
-    function m(n) {
-      if (typeof n == "number" && (n = n.toString()), typeof n != "string")
-        throw new Error("Color should be defined as hex string");
-      let e = n.slice().replace("#", "").split("");
-      if (e.length < 3 || e.length === 5 || e.length > 8)
-        throw new Error("Invalid hex color: " + n);
-      (e.length === 3 || e.length === 4) && (e = Array.prototype.concat.apply([], e.map(function(t) {
-        return [t, t];
-      }))), e.length === 6 && e.push("F", "F");
-      const r = parseInt(e.join(""), 16);
-      return {
-        r: r >> 24 & 255,
-        g: r >> 16 & 255,
-        b: r >> 8 & 255,
-        a: r & 255,
-        hex: "#" + e.slice(0, 6).join("")
-      };
-    }
-    l.getOptions = function(e) {
-      e || (e = {}), e.color || (e.color = {});
-      const r = typeof e.margin > "u" || e.margin === null || e.margin < 0 ? 4 : e.margin, t = e.width && e.width >= 21 ? e.width : void 0, f = e.scale || 4;
-      return {
-        width: t,
-        scale: t ? 4 : f,
-        margin: r,
-        color: {
-          dark: m(e.color.dark || "#000000ff"),
-          light: m(e.color.light || "#ffffffff")
-        },
-        type: e.type,
-        rendererOpts: e.rendererOpts || {}
-      };
-    }, l.getScale = function(e, r) {
-      return r.width && r.width >= e + r.margin * 2 ? r.width / (e + r.margin * 2) : r.scale;
-    }, l.getImageWidth = function(e, r) {
-      const t = l.getScale(e, r);
-      return Math.floor((e + r.margin * 2) * t);
-    }, l.qrToImageData = function(e, r, t) {
-      const f = r.modules.size, w = r.modules.data, d = l.getScale(f, t), g = Math.floor((f + t.margin * 2) * d), a = t.margin * d, y = [t.color.light, t.color.dark];
-      for (let i = 0; i < g; i++)
-        for (let c = 0; c < g; c++) {
-          let h = (i * g + c) * 4, o = t.color.light;
-          if (i >= a && c >= a && i < g - a && c < g - a) {
-            const b = Math.floor((i - a) / d), I = Math.floor((c - a) / d);
-            o = y[w[b * f + I] ? 1 : 0];
-          }
-          e[h++] = o.r, e[h++] = o.g, e[h++] = o.b, e[h] = o.a;
-        }
-    };
-  })(u), u);
-}
-export {
-  M as __require
-};
-//# sourceMappingURL=index127.js.map

package/dist/index127.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index127.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/renderer/utils.js"],"sourcesContent":["function hex2rgba (hex) {\n  if (typeof hex === 'number') {\n    hex = hex.toString()\n  }\n\n  if (typeof hex !== 'string') {\n    throw new Error('Color should be defined as hex string')\n  }\n\n  let hexCode = hex.slice().replace('#', '').split('')\n  if (hexCode.length < 3 || hexCode.length === 5 || hexCode.length > 8) {\n    throw new Error('Invalid hex color: ' + hex)\n  }\n\n  // Convert from short to long form (fff -> ffffff)\n  if (hexCode.length === 3 || hexCode.length === 4) {\n    hexCode = Array.prototype.concat.apply([], hexCode.map(function (c) {\n      return [c, c]\n    }))\n  }\n\n  // Add default alpha value\n  if (hexCode.length === 6) hexCode.push('F', 'F')\n\n  const hexValue = parseInt(hexCode.join(''), 16)\n\n  return {\n    r: (hexValue >> 24) & 255,\n    g: (hexValue >> 16) & 255,\n    b: (hexValue >> 8) & 255,\n    a: hexValue & 255,\n    hex: '#' + hexCode.slice(0, 6).join('')\n  }\n}\n\nexports.getOptions = function getOptions (options) {\n  if (!options) options = {}\n  if (!options.color) options.color = {}\n\n  const margin = typeof options.margin === 'undefined' ||\n    options.margin === null ||\n    options.margin < 0\n    ? 4\n    : options.margin\n\n  const width = options.width && options.width >= 21 ? options.width : undefined\n  const scale = options.scale || 4\n\n  return {\n    width: width,\n    scale: width ? 4 : scale,\n    margin: margin,\n    color: {\n      dark: hex2rgba(options.color.dark || '#000000ff'),\n      light: hex2rgba(options.color.light || '#ffffffff')\n    },\n    type: options.type,\n    rendererOpts: options.rendererOpts || {}\n  }\n}\n\nexports.getScale = function getScale (qrSize, opts) {\n  return opts.width && opts.width >= qrSize + opts.margin * 2\n    ? opts.width / (qrSize + opts.margin * 2)\n    : opts.scale\n}\n\nexports.getImageWidth = function getImageWidth (qrSize, opts) {\n  const scale = exports.getScale(qrSize, opts)\n  return Math.floor((qrSize + opts.margin * 2) * scale)\n}\n\nexports.qrToImageData = function qrToImageData (imgData, qr, opts) {\n  const size = qr.modules.size\n  const data = qr.modules.data\n  const scale = exports.getScale(size, opts)\n  const symbolSize = Math.floor((size + opts.margin * 2) * scale)\n  const scaledMargin = opts.margin * scale\n  const palette = [opts.color.light, opts.color.dark]\n\n  for (let i = 0; i < symbolSize; i++) {\n    for (let j = 0; j < symbolSize; j++) {\n      let posDst = (i * symbolSize + j) * 4\n      let pxColor = opts.color.light\n\n      if (i >= scaledMargin && j >= scaledMargin &&\n        i < symbolSize - scaledMargin && j < symbolSize - scaledMargin) {\n        const iSrc = Math.floor((i - scaledMargin) / scale)\n        const jSrc = Math.floor((j - scaledMargin) / scale)\n        pxColor = palette[data[iSrc * size + jSrc] ? 1 : 0]\n      }\n\n      imgData[posDst++] = pxColor.r\n      imgData[posDst++] = pxColor.g\n      imgData[posDst++] = pxColor.b\n      imgData[posDst] = pxColor.a\n    }\n  }\n}\n"],"names":["hex2rgba","hex","hexCode","c","hexValue","exports","options","margin","width","scale","qrSize","opts","imgData","qr","size","data","symbolSize","scaledMargin","palette","j","posDst","pxColor","iSrc","jSrc"],"mappings":";;;;AAAA,aAASA,EAAUC,GAAK;AAKtB,UAJI,OAAOA,KAAQ,aACjBA,IAAMA,EAAI,SAAQ,IAGhB,OAAOA,KAAQ;AACjB,cAAM,IAAI,MAAM,uCAAuC;AAGzD,UAAIC,IAAUD,EAAI,MAAK,EAAG,QAAQ,KAAK,EAAE,EAAE,MAAM,EAAE;AACnD,UAAIC,EAAQ,SAAS,KAAKA,EAAQ,WAAW,KAAKA,EAAQ,SAAS;AACjE,cAAM,IAAI,MAAM,wBAAwBD,CAAG;AAI7C,OAAIC,EAAQ,WAAW,KAAKA,EAAQ,WAAW,OAC7CA,IAAU,MAAM,UAAU,OAAO,MAAM,CAAA,GAAIA,EAAQ,IAAI,SAAUC,GAAG;AAClE,eAAO,CAACA,GAAGA,CAAC;AAAA,MAClB,CAAK,CAAC,IAIAD,EAAQ,WAAW,KAAGA,EAAQ,KAAK,KAAK,GAAG;AAE/C,YAAME,IAAW,SAASF,EAAQ,KAAK,EAAE,GAAG,EAAE;AAE9C,aAAO;AAAA,QACL,GAAIE,KAAY,KAAM;AAAA,QACtB,GAAIA,KAAY,KAAM;AAAA,QACtB,GAAIA,KAAY,IAAK;AAAA,QACrB,GAAGA,IAAW;AAAA,QACd,KAAK,MAAMF,EAAQ,MAAM,GAAG,CAAC,EAAE,KAAK,EAAE;AAAA,MAC1C;AAAA,IACA;AAEAG,IAAAA,EAAA,aAAqB,SAAqBC,GAAS;AACjD,MAAKA,MAASA,IAAU,CAAA,IACnBA,EAAQ,UAAOA,EAAQ,QAAQ,CAAA;AAEpC,YAAMC,IAAS,OAAOD,EAAQ,SAAW,OACvCA,EAAQ,WAAW,QACnBA,EAAQ,SAAS,IACf,IACAA,EAAQ,QAENE,IAAQF,EAAQ,SAASA,EAAQ,SAAS,KAAKA,EAAQ,QAAQ,QAC/DG,IAAQH,EAAQ,SAAS;AAE/B,aAAO;AAAA,QACL,OAAOE;AAAA,QACP,OAAOA,IAAQ,IAAIC;AAAA,QACnB,QAAQF;AAAA,QACR,OAAO;AAAA,UACL,MAAMP,EAASM,EAAQ,MAAM,QAAQ,WAAW;AAAA,UAChD,OAAON,EAASM,EAAQ,MAAM,SAAS,WAAW;AAAA;QAEpD,MAAMA,EAAQ;AAAA,QACd,cAAcA,EAAQ,gBAAgB,CAAA;AAAA,MAC1C;AAAA,IACA,GAEAD,EAAA,WAAmB,SAAmBK,GAAQC,GAAM;AAClD,aAAOA,EAAK,SAASA,EAAK,SAASD,IAASC,EAAK,SAAS,IACtDA,EAAK,SAASD,IAASC,EAAK,SAAS,KACrCA,EAAK;AAAA,IACX,GAEAN,EAAA,gBAAwB,SAAwBK,GAAQC,GAAM;AAC5D,YAAMF,IAAQJ,EAAQ,SAASK,GAAQC,CAAI;AAC3C,aAAO,KAAK,OAAOD,IAASC,EAAK,SAAS,KAAKF,CAAK;AAAA,IACtD,GAEAJ,EAAA,gBAAwB,SAAwBO,GAASC,GAAIF,GAAM;AACjE,YAAMG,IAAOD,EAAG,QAAQ,MAClBE,IAAOF,EAAG,QAAQ,MAClBJ,IAAQJ,EAAQ,SAASS,GAAMH,CAAI,GACnCK,IAAa,KAAK,OAAOF,IAAOH,EAAK,SAAS,KAAKF,CAAK,GACxDQ,IAAeN,EAAK,SAASF,GAC7BS,IAAU,CAACP,EAAK,MAAM,OAAOA,EAAK,MAAM,IAAI;AAElD,eAAS,IAAI,GAAG,IAAIK,GAAY;AAC9B,iBAASG,IAAI,GAAGA,IAAIH,GAAYG,KAAK;AACnC,cAAIC,KAAU,IAAIJ,IAAaG,KAAK,GAChCE,IAAUV,EAAK,MAAM;AAEzB,cAAI,KAAKM,KAAgBE,KAAKF,KAC5B,IAAID,IAAaC,KAAgBE,IAAIH,IAAaC,GAAc;AAChE,kBAAMK,IAAO,KAAK,OAAO,IAAIL,KAAgBR,CAAK,GAC5Cc,IAAO,KAAK,OAAOJ,IAAIF,KAAgBR,CAAK;AAClD,YAAAY,IAAUH,EAAQH,EAAKO,IAAOR,IAAOS,CAAI,IAAI,IAAI,CAAC;AAAA,UAC1D;AAEM,UAAAX,EAAQQ,GAAQ,IAAIC,EAAQ,GAC5BT,EAAQQ,GAAQ,IAAIC,EAAQ,GAC5BT,EAAQQ,GAAQ,IAAIC,EAAQ,GAC5BT,EAAQQ,CAAM,IAAIC,EAAQ;AAAA,QAChC;AAAA,IAEA;AAAA;;","x_google_ignoreList":[0]}

package/dist/index128.js

@@ -1,5 +0,0 @@
-var a = {};
-export {
-  a as __exports
-};
-//# sourceMappingURL=index128.js.map

package/dist/index128.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index128.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/index129.js

@@ -1,5 +0,0 @@
-var r = {};
-export {
-  r as __exports
-};
-//# sourceMappingURL=index129.js.map

package/dist/index129.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index129.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/index130.js

@@ -1,5 +0,0 @@
-var r = {};
-export {
-  r as __exports
-};
-//# sourceMappingURL=index130.js.map

package/dist/index130.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index130.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/index131.js

@@ -1,5 +0,0 @@
-var r = {};
-export {
-  r as __exports
-};
-//# sourceMappingURL=index131.js.map

package/dist/index131.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index131.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/index132.js

@@ -1,5 +0,0 @@
-var t = {};
-export {
-  t as __exports
-};
-//# sourceMappingURL=index132.js.map

package/dist/index132.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index132.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/index133.js

@@ -1,5 +0,0 @@
-var r = {};
-export {
-  r as __exports
-};
-//# sourceMappingURL=index133.js.map

package/dist/index133.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index133.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/index134.js

@@ -1,5 +0,0 @@
-var a = {};
-export {
-  a as __exports
-};
-//# sourceMappingURL=index134.js.map

package/dist/index134.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index134.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/index135.js

@@ -1,5 +0,0 @@
-var r = {};
-export {
-  r as __exports
-};
-//# sourceMappingURL=index135.js.map

package/dist/index135.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index135.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/index136.js

@@ -1,35 +0,0 @@
-import { __exports as f } from "./index148.js";
-import { __require as c } from "./index149.js";
-var m;
-function y() {
-  return m ? f : (m = 1, (function(o) {
-    const u = c();
-    o.mul = function(t, n) {
-      const e = new Uint8Array(t.length + n.length - 1);
-      for (let r = 0; r < t.length; r++)
-        for (let l = 0; l < n.length; l++)
-          e[r + l] ^= u.mul(t[r], n[l]);
-      return e;
-    }, o.mod = function(t, n) {
-      let e = new Uint8Array(t);
-      for (; e.length - n.length >= 0; ) {
-        const r = e[0];
-        for (let i = 0; i < n.length; i++)
-          e[i] ^= u.mul(n[i], r);
-        let l = 0;
-        for (; l < e.length && e[l] === 0; ) l++;
-        e = e.slice(l);
-      }
-      return e;
-    }, o.generateECPolynomial = function(t) {
-      let n = new Uint8Array([1]);
-      for (let e = 0; e < t; e++)
-        n = o.mul(n, new Uint8Array([1, u.exp(e)]));
-      return n;
-    };
-  })(f), f);
-}
-export {
-  y as __require
-};
-//# sourceMappingURL=index136.js.map

package/dist/index136.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index136.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/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"],"names":["GF","require$$0","exports","p1","p2","coeff","i","j","divident","divisor","result","offset","degree","poly"],"mappings":";;;;;AAAA,UAAMA,IAAKC,EAAA;AASXC,IAAAA,EAAA,MAAc,SAAcC,GAAIC,GAAI;AAClC,YAAMC,IAAQ,IAAI,WAAWF,EAAG,SAASC,EAAG,SAAS,CAAC;AAEtD,eAASE,IAAI,GAAGA,IAAIH,EAAG,QAAQG;AAC7B,iBAASC,IAAI,GAAGA,IAAIH,EAAG,QAAQG;AAC7B,UAAAF,EAAMC,IAAIC,CAAC,KAAKP,EAAG,IAAIG,EAAGG,CAAC,GAAGF,EAAGG,CAAC,CAAC;AAIvC,aAAOF;AAAA,IACT,GASAH,EAAA,MAAc,SAAcM,GAAUC,GAAS;AAC7C,UAAIC,IAAS,IAAI,WAAWF,CAAQ;AAEpC,aAAQE,EAAO,SAASD,EAAQ,UAAW,KAAG;AAC5C,cAAMJ,IAAQK,EAAO,CAAC;AAEtB,iBAAS,IAAI,GAAG,IAAID,EAAQ,QAAQ;AAClC,UAAAC,EAAO,CAAC,KAAKV,EAAG,IAAIS,EAAQ,CAAC,GAAGJ,CAAK;AAIvC,YAAIM,IAAS;AACb,eAAOA,IAASD,EAAO,UAAUA,EAAOC,CAAM,MAAM,IAAG,CAAAA;AACvD,QAAAD,IAASA,EAAO,MAAMC,CAAM;AAAA,MAChC;AAEE,aAAOD;AAAA,IACT,GASAR,EAAA,uBAA+B,SAA+BU,GAAQ;AACpE,UAAIC,IAAO,IAAI,WAAW,CAAC,CAAC,CAAC;AAC7B,eAASP,IAAI,GAAGA,IAAIM,GAAQN;AAC1B,QAAAO,IAAOX,EAAQ,IAAIW,GAAM,IAAI,WAAW,CAAC,GAAGb,EAAG,IAAIM,CAAC,CAAC,CAAC,CAAC;AAGzD,aAAOO;AAAA,IACT;AAAA;;","x_google_ignoreList":[0]}

package/dist/index137.js

@@ -1,5 +0,0 @@
-var r = {};
-export {
-  r as __exports
-};
-//# sourceMappingURL=index137.js.map

package/dist/index137.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index137.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/index138.js

@@ -1,11 +0,0 @@
-import { __exports as e } from "./index150.js";
-var i;
-function t() {
-  return i ? e : (i = 1, e.isValid = function(r) {
-    return !isNaN(r) && r >= 1 && r <= 40;
-  }, e);
-}
-export {
-  t as __require
-};
-//# sourceMappingURL=index138.js.map

package/dist/index138.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index138.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/version-check.js"],"sourcesContent":["/**\n * Check if QR Code version is valid\n *\n * @param  {Number}  version QR Code version\n * @return {Boolean}         true if valid version, false otherwise\n */\nexports.isValid = function isValid (version) {\n  return !isNaN(version) && version >= 1 && version <= 40\n}\n"],"names":["versionCheck","version"],"mappings":";;;yBAMAA,EAAA,UAAkB,SAAkBC,GAAS;AAC3C,WAAO,CAAC,MAAMA,CAAO,KAAKA,KAAW,KAAKA,KAAW;AAAA,EACvD;;","x_google_ignoreList":[0]}

package/dist/index139.js

@@ -1,5 +0,0 @@
-var o = {};
-export {
-  o as __exports
-};
-//# sourceMappingURL=index139.js.map

package/dist/index139.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index139.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/index140.js

@@ -1,5 +0,0 @@
-var e = {};
-export {
-  e as __exports
-};
-//# sourceMappingURL=index140.js.map

package/dist/index140.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index140.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/index141.js

@@ -1,24 +0,0 @@
-import { __exports as e } from "./index151.js";
-var s;
-function R() {
-  if (s) return e;
-  s = 1;
-  const n = "[0-9]+", E = "[A-Z $%*+\\-./:]+";
-  let u = "(?:[u3000-u303F]|[u3040-u309F]|[u30A0-u30FF]|[uFF00-uFFEF]|[u4E00-u9FAF]|[u2605-u2606]|[u2190-u2195]|u203B|[u2010u2015u2018u2019u2025u2026u201Cu201Du2225u2260]|[u0391-u0451]|[u00A7u00A8u00B1u00B4u00D7u00F7])+";
-  u = u.replace(/u/g, "\\u");
-  const i = "(?:(?![A-Z0-9 $%*+\\-./:]|" + u + `)(?:.|[\r
-]))+`;
-  e.KANJI = new RegExp(u, "g"), e.BYTE_KANJI = new RegExp("[^A-Z0-9 $%*+\\-./:]+", "g"), e.BYTE = new RegExp(i, "g"), e.NUMERIC = new RegExp(n, "g"), e.ALPHANUMERIC = new RegExp(E, "g");
-  const c = new RegExp("^" + u + "$"), g = new RegExp("^" + n + "$"), A = new RegExp("^[A-Z0-9 $%*+\\-./:]+$");
-  return e.testKanji = function(t) {
-    return c.test(t);
-  }, e.testNumeric = function(t) {
-    return g.test(t);
-  }, e.testAlphanumeric = function(t) {
-    return A.test(t);
-  }, e;
-}
-export {
-  R as __require
-};
-//# sourceMappingURL=index141.js.map

package/dist/index141.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index141.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/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"],"names":["numeric","alphanumeric","kanji","byte","regex","TEST_KANJI","TEST_NUMERIC","TEST_ALPHANUMERIC","str"],"mappings":";;;;;AAAA,QAAMA,IAAU,UACVC,IAAe;AACrB,MAAIC,IAAQ;AAIZ,EAAAA,IAAQA,EAAM,QAAQ,MAAM,KAAK;AAEjC,QAAMC,IAAO,+BAA+BD,IAAQ;AAAA;AAEpD,EAAAE,EAAA,QAAgB,IAAI,OAAOF,GAAO,GAAG,GACrCE,EAAA,aAAqB,IAAI,OAAO,yBAAyB,GAAG,GAC5DA,EAAA,OAAe,IAAI,OAAOD,GAAM,GAAG,GACnCC,EAAA,UAAkB,IAAI,OAAOJ,GAAS,GAAG,GACzCI,EAAA,eAAuB,IAAI,OAAOH,GAAc,GAAG;AAEnD,QAAMI,IAAa,IAAI,OAAO,MAAMH,IAAQ,GAAG,GACzCI,IAAe,IAAI,OAAO,MAAMN,IAAU,GAAG,GAC7CO,IAAoB,IAAI,OAAO,wBAAwB;AAE7D,SAAAH,EAAA,YAAoB,SAAoBI,GAAK;AAC3C,WAAOH,EAAW,KAAKG,CAAG;AAAA,EAC5B,GAEAJ,EAAA,cAAsB,SAAsBI,GAAK;AAC/C,WAAOF,EAAa,KAAKE,CAAG;AAAA,EAC9B,GAEAJ,EAAA,mBAA2B,SAA2BI,GAAK;AACzD,WAAOD,EAAkB,KAAKC,CAAG;AAAA,EACnC;;","x_google_ignoreList":[0]}

package/dist/index142.js

@@ -1,5 +0,0 @@
-var e = {};
-export {
-  e as __exports
-};
-//# sourceMappingURL=index142.js.map

package/dist/index142.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index142.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/index143.js

@@ -1,27 +0,0 @@
-import { __require as h } from "./index124.js";
-var u, s;
-function c() {
-  if (s) return u;
-  s = 1;
-  const g = h();
-  function t(i) {
-    this.mode = g.NUMERIC, this.data = i.toString();
-  }
-  return t.getBitsLength = function(e) {
-    return 10 * Math.floor(e / 3) + (e % 3 ? e % 3 * 3 + 1 : 0);
-  }, t.prototype.getLength = function() {
-    return this.data.length;
-  }, t.prototype.getBitsLength = function() {
-    return t.getBitsLength(this.data.length);
-  }, t.prototype.write = function(e) {
-    let r, n, a;
-    for (r = 0; r + 3 <= this.data.length; r += 3)
-      n = this.data.substr(r, 3), a = parseInt(n, 10), e.put(a, 10);
-    const o = this.data.length - r;
-    o > 0 && (n = this.data.substr(r), a = parseInt(n, 10), e.put(a, o * 3 + 1));
-  }, u = t, u;
-}
-export {
-  c as __require
-};
-//# sourceMappingURL=index143.js.map

package/dist/index143.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index143.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/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"],"names":["Mode","require$$0","NumericData","data","length","bitBuffer","i","group","value","remainingNum","numericData"],"mappings":";;;;;AAAA,QAAMA,IAAOC,EAAA;AAEb,WAASC,EAAaC,GAAM;AAC1B,SAAK,OAAOH,EAAK,SACjB,KAAK,OAAOG,EAAK,SAAQ;AAAA,EAC3B;AAEA,SAAAD,EAAY,gBAAgB,SAAwBE,GAAQ;AAC1D,WAAO,KAAK,KAAK,MAAMA,IAAS,CAAC,KAAMA,IAAS,IAAOA,IAAS,IAAK,IAAI,IAAK;AAAA,EAChF,GAEAF,EAAY,UAAU,YAAY,WAAsB;AACtD,WAAO,KAAK,KAAK;AAAA,EACnB,GAEAA,EAAY,UAAU,gBAAgB,WAA0B;AAC9D,WAAOA,EAAY,cAAc,KAAK,KAAK,MAAM;AAAA,EACnD,GAEAA,EAAY,UAAU,QAAQ,SAAgBG,GAAW;AACvD,QAAIC,GAAGC,GAAOC;AAId,SAAKF,IAAI,GAAGA,IAAI,KAAK,KAAK,KAAK,QAAQA,KAAK;AAC1C,MAAAC,IAAQ,KAAK,KAAK,OAAOD,GAAG,CAAC,GAC7BE,IAAQ,SAASD,GAAO,EAAE,GAE1BF,EAAU,IAAIG,GAAO,EAAE;AAKzB,UAAMC,IAAe,KAAK,KAAK,SAASH;AACxC,IAAIG,IAAe,MACjBF,IAAQ,KAAK,KAAK,OAAOD,CAAC,GAC1BE,IAAQ,SAASD,GAAO,EAAE,GAE1BF,EAAU,IAAIG,GAAOC,IAAe,IAAI,CAAC;AAAA,EAE7C,GAEAC,IAAiBR;;","x_google_ignoreList":[0]}

package/dist/index144.js

@@ -1,74 +0,0 @@
-import { __require as s } from "./index124.js";
-var r, o;
-function d() {
-  if (o) return r;
-  o = 1;
-  const u = s(), n = [
-    "0",
-    "1",
-    "2",
-    "3",
-    "4",
-    "5",
-    "6",
-    "7",
-    "8",
-    "9",
-    "A",
-    "B",
-    "C",
-    "D",
-    "E",
-    "F",
-    "G",
-    "H",
-    "I",
-    "J",
-    "K",
-    "L",
-    "M",
-    "N",
-    "O",
-    "P",
-    "Q",
-    "R",
-    "S",
-    "T",
-    "U",
-    "V",
-    "W",
-    "X",
-    "Y",
-    "Z",
-    " ",
-    "$",
-    "%",
-    "*",
-    "+",
-    "-",
-    ".",
-    "/",
-    ":"
-  ];
-  function t(i) {
-    this.mode = u.ALPHANUMERIC, this.data = i;
-  }
-  return t.getBitsLength = function(a) {
-    return 11 * Math.floor(a / 2) + 6 * (a % 2);
-  }, t.prototype.getLength = function() {
-    return this.data.length;
-  }, t.prototype.getBitsLength = function() {
-    return t.getBitsLength(this.data.length);
-  }, t.prototype.write = function(a) {
-    let e;
-    for (e = 0; e + 2 <= this.data.length; e += 2) {
-      let h = n.indexOf(this.data[e]) * 45;
-      h += n.indexOf(this.data[e + 1]), a.put(h, 11);
-    }
-    this.data.length % 2 && a.put(n.indexOf(this.data[e]), 6);
-  }, r = t, r;
-}
-export {
-  d as __require
-};
-//# sourceMappingURL=index144.js.map

package/dist/index144.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index144.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/alphanumeric-data.js"],"sourcesContent":["const Mode = require('./mode')\n\n/**\n * Array of characters available in alphanumeric mode\n *\n * As per QR Code specification, to each character\n * is assigned a value from 0 to 44 which in this case coincides\n * with the array index\n *\n * @type {Array}\n */\nconst ALPHA_NUM_CHARS = [\n  '0', '1', '2', '3', '4', '5', '6', '7', '8', '9',\n  'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M',\n  'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z',\n  ' ', '$', '%', '*', '+', '-', '.', '/', ':'\n]\n\nfunction AlphanumericData (data) {\n  this.mode = Mode.ALPHANUMERIC\n  this.data = data\n}\n\nAlphanumericData.getBitsLength = function getBitsLength (length) {\n  return 11 * Math.floor(length / 2) + 6 * (length % 2)\n}\n\nAlphanumericData.prototype.getLength = function getLength () {\n  return this.data.length\n}\n\nAlphanumericData.prototype.getBitsLength = function getBitsLength () {\n  return AlphanumericData.getBitsLength(this.data.length)\n}\n\nAlphanumericData.prototype.write = function write (bitBuffer) {\n  let i\n\n  // Input data characters are divided into groups of two characters\n  // and encoded as 11-bit binary codes.\n  for (i = 0; i + 2 <= this.data.length; i += 2) {\n    // The character value of the first character is multiplied by 45\n    let value = ALPHA_NUM_CHARS.indexOf(this.data[i]) * 45\n\n    // The character value of the second digit is added to the product\n    value += ALPHA_NUM_CHARS.indexOf(this.data[i + 1])\n\n    // The sum is then stored as 11-bit binary number\n    bitBuffer.put(value, 11)\n  }\n\n  // If the number of input data characters is not a multiple of two,\n  // the character value of the final character is encoded as a 6-bit binary number.\n  if (this.data.length % 2) {\n    bitBuffer.put(ALPHA_NUM_CHARS.indexOf(this.data[i]), 6)\n  }\n}\n\nmodule.exports = AlphanumericData\n"],"names":["Mode","require$$0","ALPHA_NUM_CHARS","AlphanumericData","data","length","bitBuffer","i","value","alphanumericData"],"mappings":";;;;;AAAA,QAAMA,IAAOC,EAAA,GAWPC,IAAkB;AAAA,IACtB;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAC7C;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAC5D;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAC5D;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,EAC1C;AAEA,WAASC,EAAkBC,GAAM;AAC/B,SAAK,OAAOJ,EAAK,cACjB,KAAK,OAAOI;AAAA,EACd;AAEA,SAAAD,EAAiB,gBAAgB,SAAwBE,GAAQ;AAC/D,WAAO,KAAK,KAAK,MAAMA,IAAS,CAAC,IAAI,KAAKA,IAAS;AAAA,EACrD,GAEAF,EAAiB,UAAU,YAAY,WAAsB;AAC3D,WAAO,KAAK,KAAK;AAAA,EACnB,GAEAA,EAAiB,UAAU,gBAAgB,WAA0B;AACnE,WAAOA,EAAiB,cAAc,KAAK,KAAK,MAAM;AAAA,EACxD,GAEAA,EAAiB,UAAU,QAAQ,SAAgBG,GAAW;AAC5D,QAAIC;AAIJ,SAAKA,IAAI,GAAGA,IAAI,KAAK,KAAK,KAAK,QAAQA,KAAK,GAAG;AAE7C,UAAIC,IAAQN,EAAgB,QAAQ,KAAK,KAAKK,CAAC,CAAC,IAAI;AAGpD,MAAAC,KAASN,EAAgB,QAAQ,KAAK,KAAKK,IAAI,CAAC,CAAC,GAGjDD,EAAU,IAAIE,GAAO,EAAE;AAAA,IAC3B;AAIE,IAAI,KAAK,KAAK,SAAS,KACrBF,EAAU,IAAIJ,EAAgB,QAAQ,KAAK,KAAKK,CAAC,CAAC,GAAG,CAAC;AAAA,EAE1D,GAEAE,IAAiBN;;","x_google_ignoreList":[0]}

package/dist/index145.js

@@ -1,24 +0,0 @@
-import { __require as g } from "./index124.js";
-var r, i;
-function s() {
-  if (i) return r;
-  i = 1;
-  const o = g();
-  function e(t) {
-    this.mode = o.BYTE, typeof t == "string" ? this.data = new TextEncoder().encode(t) : this.data = new Uint8Array(t);
-  }
-  return e.getBitsLength = function(n) {
-    return n * 8;
-  }, e.prototype.getLength = function() {
-    return this.data.length;
-  }, e.prototype.getBitsLength = function() {
-    return e.getBitsLength(this.data.length);
-  }, e.prototype.write = function(t) {
-    for (let n = 0, a = this.data.length; n < a; n++)
-      t.put(this.data[n], 8);
-  }, r = e, r;
-}
-export {
-  s as __require
-};
-//# sourceMappingURL=index145.js.map

package/dist/index145.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index145.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/byte-data.js"],"sourcesContent":["const Mode = require('./mode')\n\nfunction ByteData (data) {\n  this.mode = Mode.BYTE\n  if (typeof (data) === 'string') {\n    this.data = new TextEncoder().encode(data)\n  } else {\n    this.data = new Uint8Array(data)\n  }\n}\n\nByteData.getBitsLength = function getBitsLength (length) {\n  return length * 8\n}\n\nByteData.prototype.getLength = function getLength () {\n  return this.data.length\n}\n\nByteData.prototype.getBitsLength = function getBitsLength () {\n  return ByteData.getBitsLength(this.data.length)\n}\n\nByteData.prototype.write = function (bitBuffer) {\n  for (let i = 0, l = this.data.length; i < l; i++) {\n    bitBuffer.put(this.data[i], 8)\n  }\n}\n\nmodule.exports = ByteData\n"],"names":["Mode","require$$0","ByteData","data","length","bitBuffer","i","l","byteData"],"mappings":";;;;;AAAA,QAAMA,IAAOC,EAAA;AAEb,WAASC,EAAUC,GAAM;AACvB,SAAK,OAAOH,EAAK,MACb,OAAQG,KAAU,WACpB,KAAK,OAAO,IAAI,YAAW,EAAG,OAAOA,CAAI,IAEzC,KAAK,OAAO,IAAI,WAAWA,CAAI;AAAA,EAEnC;AAEA,SAAAD,EAAS,gBAAgB,SAAwBE,GAAQ;AACvD,WAAOA,IAAS;AAAA,EAClB,GAEAF,EAAS,UAAU,YAAY,WAAsB;AACnD,WAAO,KAAK,KAAK;AAAA,EACnB,GAEAA,EAAS,UAAU,gBAAgB,WAA0B;AAC3D,WAAOA,EAAS,cAAc,KAAK,KAAK,MAAM;AAAA,EAChD,GAEAA,EAAS,UAAU,QAAQ,SAAUG,GAAW;AAC9C,aAASC,IAAI,GAAGC,IAAI,KAAK,KAAK,QAAQD,IAAIC,GAAGD;AAC3C,MAAAD,EAAU,IAAI,KAAK,KAAKC,CAAC,GAAG,CAAC;AAAA,EAEjC,GAEAE,IAAiBN;;","x_google_ignoreList":[0]}