@wecom/wecom-openclaw-cli 1.0.15 → 1.0.16

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

@@ -0,0 +1,45 @@
+'use strict';
+
+var regex = require('../../../../_virtual/regex.js');
+
+var hasRequiredRegex;
+
+function requireRegex () {
+	if (hasRequiredRegex) return regex.__exports;
+	hasRequiredRegex = 1;
+	const numeric = '[0-9]+';
+	const alphanumeric = '[A-Z $%*+\\-./:]+';
+	let kanji = '(?:[u3000-u303F]|[u3040-u309F]|[u30A0-u30FF]|' +
+	  '[uFF00-uFFEF]|[u4E00-u9FAF]|[u2605-u2606]|[u2190-u2195]|u203B|' +
+	  '[u2010u2015u2018u2019u2025u2026u201Cu201Du2225u2260]|' +
+	  '[u0391-u0451]|[u00A7u00A8u00B1u00B4u00D7u00F7])+';
+	kanji = kanji.replace(/u/g, '\\u');
+
+	const byte = '(?:(?![A-Z0-9 $%*+\\-./:]|' + kanji + ')(?:.|[\r\n]))+';
+
+	regex.__exports.KANJI = new RegExp(kanji, 'g');
+	regex.__exports.BYTE_KANJI = new RegExp('[^A-Z0-9 $%*+\\-./:]+', 'g');
+	regex.__exports.BYTE = new RegExp(byte, 'g');
+	regex.__exports.NUMERIC = new RegExp(numeric, 'g');
+	regex.__exports.ALPHANUMERIC = new RegExp(alphanumeric, 'g');
+
+	const TEST_KANJI = new RegExp('^' + kanji + '$');
+	const TEST_NUMERIC = new RegExp('^' + numeric + '$');
+	const TEST_ALPHANUMERIC = new RegExp('^[A-Z0-9 $%*+\\-./:]+$');
+
+	regex.__exports.testKanji = function testKanji (str) {
+	  return TEST_KANJI.test(str)
+	};
+
+	regex.__exports.testNumeric = function testNumeric (str) {
+	  return TEST_NUMERIC.test(str)
+	};
+
+	regex.__exports.testAlphanumeric = function testAlphanumeric (str) {
+	  return TEST_ALPHANUMERIC.test(str)
+	};
+	return regex.__exports;
+}
+
+exports.__require = requireRegex;
+//# sourceMappingURL=regex.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"regex.js","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"],"names":["regex"],"mappings":";;;;;;;;;AAAA,CAAA,MAAM,OAAO,GAAG;AAChB,CAAA,MAAM,YAAY,GAAG;CACrB,IAAI,KAAK,GAAG,+CAA+C;AAC3D,GAAE,gEAAgE;AAClE,GAAE,uDAAuD;GACvD;AACF,CAAA,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK;;AAEjC,CAAA,MAAM,IAAI,GAAG,4BAA4B,GAAG,KAAK,GAAG;;AAEpD,CAAAA,eAAA,CAAA,KAAa,GAAG,IAAI,MAAM,CAAC,KAAK,EAAE,GAAG;AACrC,CAAAA,eAAA,CAAA,UAAkB,GAAG,IAAI,MAAM,CAAC,uBAAuB,EAAE,GAAG;AAC5D,CAAAA,eAAA,CAAA,IAAY,GAAG,IAAI,MAAM,CAAC,IAAI,EAAE,GAAG;AACnC,CAAAA,eAAA,CAAA,OAAe,GAAG,IAAI,MAAM,CAAC,OAAO,EAAE,GAAG;AACzC,CAAAA,eAAA,CAAA,YAAoB,GAAG,IAAI,MAAM,CAAC,YAAY,EAAE,GAAG;;CAEnD,MAAM,UAAU,GAAG,IAAI,MAAM,CAAC,GAAG,GAAG,KAAK,GAAG,GAAG;CAC/C,MAAM,YAAY,GAAG,IAAI,MAAM,CAAC,GAAG,GAAG,OAAO,GAAG,GAAG;AACnD,CAAA,MAAM,iBAAiB,GAAG,IAAI,MAAM,CAAC,wBAAwB;;AAE7D,CAAAA,eAAA,CAAA,SAAiB,GAAG,SAAS,SAAS,EAAE,GAAG,EAAE;AAC7C,GAAE,OAAO,UAAU,CAAC,IAAI,CAAC,GAAG;AAC5B,CAAA;;AAEA,CAAAA,eAAA,CAAA,WAAmB,GAAG,SAAS,WAAW,EAAE,GAAG,EAAE;AACjD,GAAE,OAAO,YAAY,CAAC,IAAI,CAAC,GAAG;AAC9B,CAAA;;AAEA,CAAAA,eAAA,CAAA,gBAAwB,GAAG,SAAS,gBAAgB,EAAE,GAAG,EAAE;AAC3D,GAAE,OAAO,iBAAiB,CAAC,IAAI,CAAC,GAAG;AACnC,CAAA;;;;;;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,354 @@
+'use strict';
+
+var segments = require('../../../../_virtual/segments.js');
+var mode = require('./mode.js');
+var numericData = require('./numeric-data.js');
+var alphanumericData = require('./alphanumeric-data.js');
+var byteData = require('./byte-data.js');
+var kanjiData = require('./kanji-data.js');
+var regex = require('./regex.js');
+var utils = require('./utils.js');
+var dijkstra = require('../../../dijkstrajs/dijkstra.js');
+
+var hasRequiredSegments;
+
+function requireSegments () {
+	if (hasRequiredSegments) return segments.__exports;
+	hasRequiredSegments = 1;
+	(function (exports$1) {
+		const Mode = mode.__require();
+		const NumericData = numericData.__require();
+		const AlphanumericData = alphanumericData.__require();
+		const ByteData = byteData.__require();
+		const KanjiData = kanjiData.__require();
+		const Regex = regex.__require();
+		const Utils = utils.__require();
+		const dijkstra$1 = dijkstra.__require();
+
+		/**
+		 * Returns UTF8 byte length
+		 *
+		 * @param  {String} str Input string
+		 * @return {Number}     Number of byte
+		 */
+		function getStringByteLength (str) {
+		  return unescape(encodeURIComponent(str)).length
+		}
+
+		/**
+		 * Get a list of segments of the specified mode
+		 * from a string
+		 *
+		 * @param  {Mode}   mode Segment mode
+		 * @param  {String} str  String to process
+		 * @return {Array}       Array of object with segments data
+		 */
+		function getSegments (regex, mode, str) {
+		  const segments = [];
+		  let result;
+
+		  while ((result = regex.exec(str)) !== null) {
+		    segments.push({
+		      data: result[0],
+		      index: result.index,
+		      mode: mode,
+		      length: result[0].length
+		    });
+		  }
+
+		  return segments
+		}
+
+		/**
+		 * Extracts a series of segments with the appropriate
+		 * modes from a string
+		 *
+		 * @param  {String} dataStr Input string
+		 * @return {Array}          Array of object with segments data
+		 */
+		function getSegmentsFromString (dataStr) {
+		  const numSegs = getSegments(Regex.NUMERIC, Mode.NUMERIC, dataStr);
+		  const alphaNumSegs = getSegments(Regex.ALPHANUMERIC, Mode.ALPHANUMERIC, dataStr);
+		  let byteSegs;
+		  let kanjiSegs;
+
+		  if (Utils.isKanjiModeEnabled()) {
+		    byteSegs = getSegments(Regex.BYTE, Mode.BYTE, dataStr);
+		    kanjiSegs = getSegments(Regex.KANJI, Mode.KANJI, dataStr);
+		  } else {
+		    byteSegs = getSegments(Regex.BYTE_KANJI, Mode.BYTE, dataStr);
+		    kanjiSegs = [];
+		  }
+
+		  const segs = numSegs.concat(alphaNumSegs, byteSegs, kanjiSegs);
+
+		  return segs
+		    .sort(function (s1, s2) {
+		      return s1.index - s2.index
+		    })
+		    .map(function (obj) {
+		      return {
+		        data: obj.data,
+		        mode: obj.mode,
+		        length: obj.length
+		      }
+		    })
+		}
+
+		/**
+		 * Returns how many bits are needed to encode a string of
+		 * specified length with the specified mode
+		 *
+		 * @param  {Number} length String length
+		 * @param  {Mode} mode     Segment mode
+		 * @return {Number}        Bit length
+		 */
+		function getSegmentBitsLength (length, mode) {
+		  switch (mode) {
+		    case Mode.NUMERIC:
+		      return NumericData.getBitsLength(length)
+		    case Mode.ALPHANUMERIC:
+		      return AlphanumericData.getBitsLength(length)
+		    case Mode.KANJI:
+		      return KanjiData.getBitsLength(length)
+		    case Mode.BYTE:
+		      return ByteData.getBitsLength(length)
+		  }
+		}
+
+		/**
+		 * Merges adjacent segments which have the same mode
+		 *
+		 * @param  {Array} segs Array of object with segments data
+		 * @return {Array}      Array of object with segments data
+		 */
+		function mergeSegments (segs) {
+		  return segs.reduce(function (acc, curr) {
+		    const prevSeg = acc.length - 1 >= 0 ? acc[acc.length - 1] : null;
+		    if (prevSeg && prevSeg.mode === curr.mode) {
+		      acc[acc.length - 1].data += curr.data;
+		      return acc
+		    }
+
+		    acc.push(curr);
+		    return acc
+		  }, [])
+		}
+
+		/**
+		 * Generates a list of all possible nodes combination which
+		 * will be used to build a segments graph.
+		 *
+		 * Nodes are divided by groups. Each group will contain a list of all the modes
+		 * in which is possible to encode the given text.
+		 *
+		 * For example the text '12345' can be encoded as Numeric, Alphanumeric or Byte.
+		 * The group for '12345' will contain then 3 objects, one for each
+		 * possible encoding mode.
+		 *
+		 * Each node represents a possible segment.
+		 *
+		 * @param  {Array} segs Array of object with segments data
+		 * @return {Array}      Array of object with segments data
+		 */
+		function buildNodes (segs) {
+		  const nodes = [];
+		  for (let i = 0; i < segs.length; i++) {
+		    const seg = segs[i];
+
+		    switch (seg.mode) {
+		      case Mode.NUMERIC:
+		        nodes.push([seg,
+		          { data: seg.data, mode: Mode.ALPHANUMERIC, length: seg.length },
+		          { data: seg.data, mode: Mode.BYTE, length: seg.length }
+		        ]);
+		        break
+		      case Mode.ALPHANUMERIC:
+		        nodes.push([seg,
+		          { data: seg.data, mode: Mode.BYTE, length: seg.length }
+		        ]);
+		        break
+		      case Mode.KANJI:
+		        nodes.push([seg,
+		          { data: seg.data, mode: Mode.BYTE, length: getStringByteLength(seg.data) }
+		        ]);
+		        break
+		      case Mode.BYTE:
+		        nodes.push([
+		          { data: seg.data, mode: Mode.BYTE, length: getStringByteLength(seg.data) }
+		        ]);
+		    }
+		  }
+
+		  return nodes
+		}
+
+		/**
+		 * Builds a graph from a list of nodes.
+		 * All segments in each node group will be connected with all the segments of
+		 * the next group and so on.
+		 *
+		 * At each connection will be assigned a weight depending on the
+		 * segment's byte length.
+		 *
+		 * @param  {Array} nodes    Array of object with segments data
+		 * @param  {Number} version QR Code version
+		 * @return {Object}         Graph of all possible segments
+		 */
+		function buildGraph (nodes, version) {
+		  const table = {};
+		  const graph = { start: {} };
+		  let prevNodeIds = ['start'];
+
+		  for (let i = 0; i < nodes.length; i++) {
+		    const nodeGroup = nodes[i];
+		    const currentNodeIds = [];
+
+		    for (let j = 0; j < nodeGroup.length; j++) {
+		      const node = nodeGroup[j];
+		      const key = '' + i + j;
+
+		      currentNodeIds.push(key);
+		      table[key] = { node: node, lastCount: 0 };
+		      graph[key] = {};
+
+		      for (let n = 0; n < prevNodeIds.length; n++) {
+		        const prevNodeId = prevNodeIds[n];
+
+		        if (table[prevNodeId] && table[prevNodeId].node.mode === node.mode) {
+		          graph[prevNodeId][key] =
+		            getSegmentBitsLength(table[prevNodeId].lastCount + node.length, node.mode) -
+		            getSegmentBitsLength(table[prevNodeId].lastCount, node.mode);
+
+		          table[prevNodeId].lastCount += node.length;
+		        } else {
+		          if (table[prevNodeId]) table[prevNodeId].lastCount = node.length;
+
+		          graph[prevNodeId][key] = getSegmentBitsLength(node.length, node.mode) +
+		            4 + Mode.getCharCountIndicator(node.mode, version); // switch cost
+		        }
+		      }
+		    }
+
+		    prevNodeIds = currentNodeIds;
+		  }
+
+		  for (let n = 0; n < prevNodeIds.length; n++) {
+		    graph[prevNodeIds[n]].end = 0;
+		  }
+
+		  return { map: graph, table: table }
+		}
+
+		/**
+		 * Builds a segment from a specified data and mode.
+		 * If a mode is not specified, the more suitable will be used.
+		 *
+		 * @param  {String} data             Input data
+		 * @param  {Mode | String} modesHint Data mode
+		 * @return {Segment}                 Segment
+		 */
+		function buildSingleSegment (data, modesHint) {
+		  let mode;
+		  const bestMode = Mode.getBestModeForData(data);
+
+		  mode = Mode.from(modesHint, bestMode);
+
+		  // Make sure data can be encoded
+		  if (mode !== Mode.BYTE && mode.bit < bestMode.bit) {
+		    throw new Error('"' + data + '"' +
+		      ' cannot be encoded with mode ' + Mode.toString(mode) +
+		      '.\n Suggested mode is: ' + Mode.toString(bestMode))
+		  }
+
+		  // Use Mode.BYTE if Kanji support is disabled
+		  if (mode === Mode.KANJI && !Utils.isKanjiModeEnabled()) {
+		    mode = Mode.BYTE;
+		  }
+
+		  switch (mode) {
+		    case Mode.NUMERIC:
+		      return new NumericData(data)
+
+		    case Mode.ALPHANUMERIC:
+		      return new AlphanumericData(data)
+
+		    case Mode.KANJI:
+		      return new KanjiData(data)
+
+		    case Mode.BYTE:
+		      return new ByteData(data)
+		  }
+		}
+
+		/**
+		 * Builds a list of segments from an array.
+		 * Array can contain Strings or Objects with segment's info.
+		 *
+		 * For each item which is a string, will be generated a segment with the given
+		 * string and the more appropriate encoding mode.
+		 *
+		 * For each item which is an object, will be generated a segment with the given
+		 * data and mode.
+		 * Objects must contain at least the property "data".
+		 * If property "mode" is not present, the more suitable mode will be used.
+		 *
+		 * @param  {Array} array Array of objects with segments data
+		 * @return {Array}       Array of Segments
+		 */
+		exports$1.fromArray = function fromArray (array) {
+		  return array.reduce(function (acc, seg) {
+		    if (typeof seg === 'string') {
+		      acc.push(buildSingleSegment(seg, null));
+		    } else if (seg.data) {
+		      acc.push(buildSingleSegment(seg.data, seg.mode));
+		    }
+
+		    return acc
+		  }, [])
+		};
+
+		/**
+		 * Builds an optimized sequence of segments from a string,
+		 * which will produce the shortest possible bitstream.
+		 *
+		 * @param  {String} data    Input string
+		 * @param  {Number} version QR Code version
+		 * @return {Array}          Array of segments
+		 */
+		exports$1.fromString = function fromString (data, version) {
+		  const segs = getSegmentsFromString(data, Utils.isKanjiModeEnabled());
+
+		  const nodes = buildNodes(segs);
+		  const graph = buildGraph(nodes, version);
+		  const path = dijkstra$1.find_path(graph.map, 'start', 'end');
+
+		  const optimizedSegs = [];
+		  for (let i = 1; i < path.length - 1; i++) {
+		    optimizedSegs.push(graph.table[path[i]].node);
+		  }
+
+		  return exports$1.fromArray(mergeSegments(optimizedSegs))
+		};
+
+		/**
+		 * Splits a string in various segments with the modes which
+		 * best represent their content.
+		 * The produced segments are far from being optimized.
+		 * The output of this function is only used to estimate a QR Code version
+		 * which may contain the data.
+		 *
+		 * @param  {string} data Input string
+		 * @return {Array}       Array of segments
+		 */
+		exports$1.rawSplit = function rawSplit (data) {
+		  return exports$1.fromArray(
+		    getSegmentsFromString(data, Utils.isKanjiModeEnabled())
+		  )
+		}; 
+	} (segments.__exports));
+	return segments.__exports;
+}
+
+exports.__require = requireSegments;
+//# sourceMappingURL=segments.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"segments.js","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"],"names":["require$$0","require$$1","require$$2","require$$3","require$$4","require$$5","require$$6","dijkstra","require$$7","exports"],"mappings":";;;;;;;;;;;;;;;;;;AAAA,EAAA,MAAM,IAAI,GAAGA,cAAA;AACb,EAAA,MAAM,WAAW,GAAGC,qBAAA;AACpB,EAAA,MAAM,gBAAgB,GAAGC,0BAAA;AACzB,EAAA,MAAM,QAAQ,GAAGC,kBAAA;AACjB,EAAA,MAAM,SAAS,GAAGC,mBAAA;AAClB,EAAA,MAAM,KAAK,GAAGC,eAAA;AACd,EAAA,MAAM,KAAK,GAAGC,eAAA;AACd,EAAA,MAAMC,UAAQ,GAAGC,kBAAA;;AAEjB;AACA;AACA;AACA;AACA;AACA;EACA,SAAS,mBAAmB,EAAE,GAAG,EAAE;IACjC,OAAO,QAAQ,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC,CAAC;AAC3C,EAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAA,SAAS,WAAW,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE;IACtC,MAAM,QAAQ,GAAG;AACnB,IAAE,IAAI;;AAEN,IAAE,OAAO,CAAC,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,IAAI,EAAE;MAC1C,QAAQ,CAAC,IAAI,CAAC;AAClB,QAAM,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;AACrB,QAAM,KAAK,EAAE,MAAM,CAAC,KAAK;QACnB,IAAI,EAAE,IAAI;AAChB,QAAM,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;OACnB;AACL,IAAA;;AAEA,IAAE,OAAO;AACT,EAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;EACA,SAAS,qBAAqB,EAAE,OAAO,EAAE;AACzC,IAAE,MAAM,OAAO,GAAG,WAAW,CAAC,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,OAAO;AAClE,IAAE,MAAM,YAAY,GAAG,WAAW,CAAC,KAAK,CAAC,YAAY,EAAE,IAAI,CAAC,YAAY,EAAE,OAAO;AACjF,IAAE,IAAI;AACN,IAAE,IAAI;;AAEN,IAAE,IAAI,KAAK,CAAC,kBAAkB,EAAE,EAAE;AAClC,MAAI,QAAQ,GAAG,WAAW,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,OAAO;AACzD,MAAI,SAAS,GAAG,WAAW,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,OAAO;AAC5D,IAAA,CAAG,MAAM;AACT,MAAI,QAAQ,GAAG,WAAW,CAAC,KAAK,CAAC,UAAU,EAAE,IAAI,CAAC,IAAI,EAAE,OAAO;AAC/D,MAAI,SAAS,GAAG;AAChB,IAAA;;IAEE,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,CAAC,YAAY,EAAE,QAAQ,EAAE,SAAS;;AAE/D,IAAE,OAAO;AACT,OAAK,IAAI,CAAC,UAAU,EAAE,EAAE,EAAE,EAAE;AAC5B,QAAM,OAAO,EAAE,CAAC,KAAK,GAAG,EAAE,CAAC;MAC3B,CAAK;AACL,OAAK,GAAG,CAAC,UAAU,GAAG,EAAE;AACxB,QAAM,OAAO;AACb,UAAQ,IAAI,EAAE,GAAG,CAAC,IAAI;AACtB,UAAQ,IAAI,EAAE,GAAG,CAAC,IAAI;UACd,MAAM,EAAE,GAAG,CAAC;AACpB;MACA,CAAK;AACL,EAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAA,SAAS,oBAAoB,EAAE,MAAM,EAAE,IAAI,EAAE;AAC7C,IAAE,QAAQ,IAAI;MACV,KAAK,IAAI,CAAC,OAAO;AACrB,QAAM,OAAO,WAAW,CAAC,aAAa,CAAC,MAAM;MACzC,KAAK,IAAI,CAAC,YAAY;AAC1B,QAAM,OAAO,gBAAgB,CAAC,aAAa,CAAC,MAAM;MAC9C,KAAK,IAAI,CAAC,KAAK;AACnB,QAAM,OAAO,SAAS,CAAC,aAAa,CAAC,MAAM;MACvC,KAAK,IAAI,CAAC,IAAI;AAClB,QAAM,OAAO,QAAQ,CAAC,aAAa,CAAC,MAAM;AAC1C;AACA,EAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;EACA,SAAS,aAAa,EAAE,IAAI,EAAE;IAC5B,OAAO,IAAI,CAAC,MAAM,CAAC,UAAU,GAAG,EAAE,IAAI,EAAE;AAC1C,MAAI,MAAM,OAAO,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG;MAC5D,IAAI,OAAO,IAAI,OAAO,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,EAAE;AAC/C,QAAM,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,IAAI,CAAC;AACvC,QAAM,OAAO;AACb,MAAA;;AAEA,MAAI,GAAG,CAAC,IAAI,CAAC,IAAI;AACjB,MAAI,OAAO;AACX,IAAA,CAAG,EAAE,EAAE;AACP,EAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACA,SAAS,UAAU,EAAE,IAAI,EAAE;IACzB,MAAM,KAAK,GAAG;AAChB,IAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACxC,MAAI,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC;;MAElB,QAAQ,GAAG,CAAC,IAAI;QACd,KAAK,IAAI,CAAC,OAAO;AACvB,UAAQ,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG;AACvB,YAAU,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,YAAY,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE;AACzE,YAAU,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM;WACtD;UACD;QACF,KAAK,IAAI,CAAC,YAAY;AAC5B,UAAQ,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG;AACvB,YAAU,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM;WACtD;UACD;QACF,KAAK,IAAI,CAAC,KAAK;AACrB,UAAQ,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG;YACb,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC;WACzE;UACD;QACF,KAAK,IAAI,CAAC,IAAI;UACZ,KAAK,CAAC,IAAI,CAAC;YACT,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC;WACzE;AACT;AACA,IAAA;;AAEA,IAAE,OAAO;AACT,EAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAA,SAAS,UAAU,EAAE,KAAK,EAAE,OAAO,EAAE;IACnC,MAAM,KAAK,GAAG;AAChB,IAAE,MAAM,KAAK,GAAG,EAAE,KAAK,EAAE,EAAE;AAC3B,IAAE,IAAI,WAAW,GAAG,CAAC,OAAO;;AAE5B,IAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACzC,MAAI,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC;MACzB,MAAM,cAAc,GAAG;;AAE3B,MAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AAC/C,QAAM,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC;AAC9B,QAAM,MAAM,GAAG,GAAG,EAAE,GAAG,CAAC,GAAG;;AAE3B,QAAM,cAAc,CAAC,IAAI,CAAC,GAAG;AAC7B,QAAM,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;AAC7C,QAAM,KAAK,CAAC,GAAG,CAAC,GAAG;;AAEnB,QAAM,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACnD,UAAQ,MAAM,UAAU,GAAG,WAAW,CAAC,CAAC;;AAExC,UAAQ,IAAI,KAAK,CAAC,UAAU,CAAC,IAAI,KAAK,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,EAAE;AAC5E,YAAU,KAAK,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC;AAChC,cAAY,oBAAoB,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,SAAS,GAAG,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC;cAC1E,oBAAoB,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,SAAS,EAAE,IAAI,CAAC,IAAI;;YAE7D,KAAK,CAAC,UAAU,CAAC,CAAC,SAAS,IAAI,IAAI,CAAC;AAC9C,UAAA,CAAS,MAAM;AACf,YAAU,IAAI,KAAK,CAAC,UAAU,CAAC,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC,SAAS,GAAG,IAAI,CAAC;;AAEpE,YAAU,KAAK,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,GAAG,oBAAoB,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC;cACnE,CAAC,GAAG,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,EAAC;AAC9D,UAAA;AACA,QAAA;AACA,MAAA;;AAEA,MAAI,WAAW,GAAG;AAClB,IAAA;;AAEA,IAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;MAC3C,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG;AAChC,IAAA;;IAEE,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK;AACnC,EAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAA,SAAS,kBAAkB,EAAE,IAAI,EAAE,SAAS,EAAE;AAC9C,IAAE,IAAI;AACN,IAAE,MAAM,QAAQ,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI;;IAE7C,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,QAAQ;;AAEtC;AACA,IAAE,IAAI,IAAI,KAAK,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,GAAG,GAAG,QAAQ,CAAC,GAAG,EAAE;MACjD,MAAM,IAAI,KAAK,CAAC,GAAG,GAAG,IAAI,GAAG,GAAG;AACpC,QAAM,+BAA+B,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;AAC3D,QAAM,yBAAyB,GAAG,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC;AACzD,IAAA;;AAEA;AACA,IAAE,IAAI,IAAI,KAAK,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,kBAAkB,EAAE,EAAE;MACtD,IAAI,GAAG,IAAI,CAAC;AAChB,IAAA;;AAEA,IAAE,QAAQ,IAAI;MACV,KAAK,IAAI,CAAC,OAAO;AACrB,QAAM,OAAO,IAAI,WAAW,CAAC,IAAI;;MAE7B,KAAK,IAAI,CAAC,YAAY;AAC1B,QAAM,OAAO,IAAI,gBAAgB,CAAC,IAAI;;MAElC,KAAK,IAAI,CAAC,KAAK;AACnB,QAAM,OAAO,IAAI,SAAS,CAAC,IAAI;;MAE3B,KAAK,IAAI,CAAC,IAAI;AAClB,QAAM,OAAO,IAAI,QAAQ,CAAC,IAAI;AAC9B;AACA,EAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAAC,SAAA,CAAA,SAAA,GAAoB,SAAS,SAAS,EAAE,KAAK,EAAE;IAC7C,OAAO,KAAK,CAAC,MAAM,CAAC,UAAU,GAAG,EAAE,GAAG,EAAE;AAC1C,MAAI,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE;QAC3B,GAAG,CAAC,IAAI,CAAC,kBAAkB,CAAC,GAAG,EAAE,IAAI,CAAC;AAC5C,MAAA,CAAK,MAAM,IAAI,GAAG,CAAC,IAAI,EAAE;AACzB,QAAM,GAAG,CAAC,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC;AACrD,MAAA;;AAEA,MAAI,OAAO;AACX,IAAA,CAAG,EAAE,EAAE;AACP,EAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAAA,SAAA,CAAA,UAAA,GAAqB,SAAS,UAAU,EAAE,IAAI,EAAE,OAAO,EAAE;IACvD,MAAM,IAAI,GAAG,qBAAqB,CAAC,IAAI,EAAE,KAAK,CAAC,kBAAkB,EAAE;;AAErE,IAAE,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI;AAC/B,IAAE,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,EAAE,OAAO;AACzC,IAAE,MAAM,IAAI,GAAGF,UAAQ,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,EAAE,OAAO,EAAE,KAAK;;IAEzD,MAAM,aAAa,GAAG;AACxB,IAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;AAC5C,MAAI,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI;AAChD,IAAA;;IAEE,OAAOE,SAAO,CAAC,SAAS,CAAC,aAAa,CAAC,aAAa,CAAC;AACvD,EAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAAA,SAAA,CAAA,QAAA,GAAmB,SAAS,QAAQ,EAAE,IAAI,EAAE;IAC1C,OAAOA,SAAO,CAAC,SAAS;AAC1B,MAAI,qBAAqB,CAAC,IAAI,EAAE,KAAK,CAAC,kBAAkB,EAAE;AAC1D;AACA,EAAA,EAAA;;;;;;;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,77 @@
+'use strict';
+
+var utils = require('../../../../_virtual/utils2.js');
+
+var hasRequiredUtils;
+
+function requireUtils () {
+	if (hasRequiredUtils) return utils.__exports;
+	hasRequiredUtils = 1;
+	let toSJISFunction;
+	const CODEWORDS_COUNT = [
+	  0, // Not used
+	  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
+	];
+
+	/**
+	 * Returns the QR Code size for the specified version
+	 *
+	 * @param  {Number} version QR Code version
+	 * @return {Number}         size of QR code
+	 */
+	utils.__exports.getSymbolSize = function getSymbolSize (version) {
+	  if (!version) throw new Error('"version" cannot be null or undefined')
+	  if (version < 1 || version > 40) throw new Error('"version" should be in range from 1 to 40')
+	  return version * 4 + 17
+	};
+
+	/**
+	 * Returns the total number of codewords used to store data and EC information.
+	 *
+	 * @param  {Number} version QR Code version
+	 * @return {Number}         Data length in bits
+	 */
+	utils.__exports.getSymbolTotalCodewords = function getSymbolTotalCodewords (version) {
+	  return CODEWORDS_COUNT[version]
+	};
+
+	/**
+	 * Encode data with Bose-Chaudhuri-Hocquenghem
+	 *
+	 * @param  {Number} data Value to encode
+	 * @return {Number}      Encoded value
+	 */
+	utils.__exports.getBCHDigit = function (data) {
+	  let digit = 0;
+
+	  while (data !== 0) {
+	    digit++;
+	    data >>>= 1;
+	  }
+
+	  return digit
+	};
+
+	utils.__exports.setToSJISFunction = function setToSJISFunction (f) {
+	  if (typeof f !== 'function') {
+	    throw new Error('"toSJISFunc" is not a valid function.')
+	  }
+
+	  toSJISFunction = f;
+	};
+
+	utils.__exports.isKanjiModeEnabled = function () {
+	  return typeof toSJISFunction !== 'undefined'
+	};
+
+	utils.__exports.toSJIS = function toSJIS (kanji) {
+	  return toSJISFunction(kanji)
+	};
+	return utils.__exports;
+}
+
+exports.__require = requireUtils;
+//# sourceMappingURL=utils.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"utils.js","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"],"names":["utils"],"mappings":";;;;;;;;;CAAA,IAAI;AACJ,CAAA,MAAM,eAAe,GAAG;AACxB,GAAE,CAAC;AACH,GAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG;AAC/C,GAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI;AACnD,GAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI;AAC5D,GAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE;AACxD;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,CAAAA,eAAA,CAAA,aAAqB,GAAG,SAAS,aAAa,EAAE,OAAO,EAAE;GACvD,IAAI,CAAC,OAAO,EAAE,MAAM,IAAI,KAAK,CAAC,uCAAuC;AACvE,GAAE,IAAI,OAAO,GAAG,CAAC,IAAI,OAAO,GAAG,EAAE,EAAE,MAAM,IAAI,KAAK,CAAC,2CAA2C;AAC9F,GAAE,OAAO,OAAO,GAAG,CAAC,GAAG;AACvB,CAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,CAAAA,eAAA,CAAA,uBAA+B,GAAG,SAAS,uBAAuB,EAAE,OAAO,EAAE;GAC3E,OAAO,eAAe,CAAC,OAAO;AAChC,CAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,CAAAA,eAAA,CAAA,WAAmB,GAAG,UAAU,IAAI,EAAE;GACpC,IAAI,KAAK,GAAG;;AAEd,GAAE,OAAO,IAAI,KAAK,CAAC,EAAE;AACrB,KAAI,KAAK;AACT,KAAI,IAAI,MAAM;AACd,GAAA;;AAEA,GAAE,OAAO;AACT,CAAA;;AAEA,CAAAA,eAAA,CAAA,iBAAyB,GAAG,SAAS,iBAAiB,EAAE,CAAC,EAAE;AAC3D,GAAE,IAAI,OAAO,CAAC,KAAK,UAAU,EAAE;AAC/B,KAAI,MAAM,IAAI,KAAK,CAAC,uCAAuC;AAC3D,GAAA;;AAEA,GAAE,cAAc,GAAG;AACnB,CAAA;;AAEA,CAAAA,eAAA,CAAA,kBAA0B,GAAG,YAAY;GACvC,OAAO,OAAO,cAAc,KAAK;AACnC,CAAA;;AAEA,CAAAA,eAAA,CAAA,MAAc,GAAG,SAAS,MAAM,EAAE,KAAK,EAAE;GACvC,OAAO,cAAc,CAAC,KAAK;AAC7B,CAAA;;;;;;","x_google_ignoreList":[0]}

package/dist/node_modules/qrcode/lib/core/version-check.js

@@ -0,0 +1,24 @@
+'use strict';
+
+var versionCheck = require('../../../../_virtual/version-check.js');
+
+/**
+ * Check if QR Code version is valid
+ *
+ * @param  {Number}  version QR Code version
+ * @return {Boolean}         true if valid version, false otherwise
+ */
+
+var hasRequiredVersionCheck;
+
+function requireVersionCheck () {
+	if (hasRequiredVersionCheck) return versionCheck.__exports;
+	hasRequiredVersionCheck = 1;
+	versionCheck.__exports.isValid = function isValid (version) {
+	  return !isNaN(version) && version >= 1 && version <= 40
+	};
+	return versionCheck.__exports;
+}
+
+exports.__require = requireVersionCheck;
+//# sourceMappingURL=version-check.js.map

package/dist/node_modules/qrcode/lib/core/version-check.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"version-check.js","sources":["../../../../../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"],"mappings":";;;;;;;;;;;;;;;;AAMA,CAAAA,sBAAA,CAAA,OAAe,GAAG,SAAS,OAAO,EAAE,OAAO,EAAE;AAC7C,GAAE,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,OAAO,IAAI,CAAC,IAAI,OAAO,IAAI;AACvD,CAAA;;;;;;","x_google_ignoreList":[0]}