@ekyc_qoobiss/qbs-ect-cmp 3.6.27 → 3.6.28

package/dist/qbs-ect-cmp/mobile-redirect.entry.js

@@ -1,2984 +0,0 @@
-import { r as registerInstance, e as createEvent, h } from './index-78a05b9e.js';
-import { c as createCommonjsModule } from './_commonjsHelpers-321aa363.js';
-import { s as state, F as FlowStatus } from './textValues-6bcc85dd.js';
-import { B as BaseComponent, F as FlowSteps, E as Events, O as OrderStatuses } from './base-component-2e490fd9.js';
-import { d as delay } from './utils-8225f0b7.js';
-import './IDevice-15ecfdeb.js';
-
-// can-promise has a crash in some versions of react native that dont have
-// standard global objects
-// https://github.com/soldair/node-qrcode/issues/157
-
-var canPromise = function () {
-  return typeof Promise === 'function' && Promise.prototype && Promise.prototype.then
-};
-
-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
- */
-var getSymbolSize$1 = 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
- */
-var getSymbolTotalCodewords = function getSymbolTotalCodewords (version) {
-  return CODEWORDS_COUNT[version]
-};
-
-/**
- * Encode data with Bose-Chaudhuri-Hocquenghem
- *
- * @param  {Number} data Value to encode
- * @return {Number}      Encoded value
- */
-var getBCHDigit = function (data) {
-  let digit = 0;
-
-  while (data !== 0) {
-    digit++;
-    data >>>= 1;
-  }
-
-  return digit
-};
-
-var setToSJISFunction = function setToSJISFunction (f) {
-  if (typeof f !== 'function') {
-    throw new Error('"toSJISFunc" is not a valid function.')
-  }
-
-  toSJISFunction = f;
-};
-
-var isKanjiModeEnabled = function () {
-  return typeof toSJISFunction !== 'undefined'
-};
-
-var toSJIS = function toSJIS (kanji) {
-  return toSJISFunction(kanji)
-};
-
-var utils$1 = {
-	getSymbolSize: getSymbolSize$1,
-	getSymbolTotalCodewords: getSymbolTotalCodewords,
-	getBCHDigit: getBCHDigit,
-	setToSJISFunction: setToSJISFunction,
-	isKanjiModeEnabled: isKanjiModeEnabled,
-	toSJIS: toSJIS
-};
-
-var errorCorrectionLevel = createCommonjsModule(function (module, exports) {
-exports.L = { bit: 1 };
-exports.M = { bit: 0 };
-exports.Q = { bit: 3 };
-exports.H = { bit: 2 };
-
-function fromString (string) {
-  if (typeof string !== 'string') {
-    throw new Error('Param is not a string')
-  }
-
-  const lcStr = string.toLowerCase();
-
-  switch (lcStr) {
-    case 'l':
-    case 'low':
-      return exports.L
-
-    case 'm':
-    case 'medium':
-      return exports.M
-
-    case 'q':
-    case 'quartile':
-      return exports.Q
-
-    case 'h':
-    case 'high':
-      return exports.H
-
-    default:
-      throw new Error('Unknown EC Level: ' + string)
-  }
-}
-
-exports.isValid = function isValid (level) {
-  return level && typeof level.bit !== 'undefined' &&
-    level.bit >= 0 && level.bit < 4
-};
-
-exports.from = function from (value, defaultValue) {
-  if (exports.isValid(value)) {
-    return value
-  }
-
-  try {
-    return fromString(value)
-  } catch (e) {
-    return defaultValue
-  }
-};
-});
-
-function BitBuffer () {
-  this.buffer = [];
-  this.length = 0;
-}
-
-BitBuffer.prototype = {
-
-  get: function (index) {
-    const bufIndex = Math.floor(index / 8);
-    return ((this.buffer[bufIndex] >>> (7 - index % 8)) & 1) === 1
-  },
-
-  put: function (num, length) {
-    for (let i = 0; i < length; i++) {
-      this.putBit(((num >>> (length - i - 1)) & 1) === 1);
-    }
-  },
-
-  getLengthInBits: function () {
-    return this.length
-  },
-
-  putBit: function (bit) {
-    const bufIndex = Math.floor(this.length / 8);
-    if (this.buffer.length <= bufIndex) {
-      this.buffer.push(0);
-    }
-
-    if (bit) {
-      this.buffer[bufIndex] |= (0x80 >>> (this.length % 8));
-    }
-
-    this.length++;
-  }
-};
-
-var bitBuffer = BitBuffer;
-
-/**
- * Helper class to handle QR Code symbol modules
- *
- * @param {Number} size Symbol size
- */
-function BitMatrix (size) {
-  if (!size || size < 1) {
-    throw new Error('BitMatrix size must be defined and greater than 0')
-  }
-
-  this.size = size;
-  this.data = new Uint8Array(size * size);
-  this.reservedBit = new Uint8Array(size * size);
-}
-
-/**
- * Set bit value at specified location
- * If reserved flag is set, this bit will be ignored during masking process
- *
- * @param {Number}  row
- * @param {Number}  col
- * @param {Boolean} value
- * @param {Boolean} reserved
- */
-BitMatrix.prototype.set = function (row, col, value, reserved) {
-  const index = row * this.size + col;
-  this.data[index] = value;
-  if (reserved) this.reservedBit[index] = true;
-};
-
-/**
- * Returns bit value at specified location
- *
- * @param  {Number}  row
- * @param  {Number}  col
- * @return {Boolean}
- */
-BitMatrix.prototype.get = function (row, col) {
-  return this.data[row * this.size + col]
-};
-
-/**
- * Applies xor operator at specified location
- * (used during masking process)
- *
- * @param {Number}  row
- * @param {Number}  col
- * @param {Boolean} value
- */
-BitMatrix.prototype.xor = function (row, col, value) {
-  this.data[row * this.size + col] ^= value;
-};
-
-/**
- * Check if bit at specified location is reserved
- *
- * @param {Number}   row
- * @param {Number}   col
- * @return {Boolean}
- */
-BitMatrix.prototype.isReserved = function (row, col) {
-  return this.reservedBit[row * this.size + col]
-};
-
-var bitMatrix = BitMatrix;
-
-var alignmentPattern = createCommonjsModule(function (module, exports) {
-/**
- * Alignment pattern are fixed reference pattern in defined positions
- * in a matrix symbology, which enables the decode software to re-synchronise
- * the coordinate mapping of the image modules in the event of moderate amounts
- * of distortion of the image.
- *
- * Alignment patterns are present only in QR Code symbols of version 2 or larger
- * and their number depends on the symbol version.
- */
-
-const getSymbolSize = utils$1.getSymbolSize;
-
-/**
- * Calculate the row/column coordinates of the center module of each alignment pattern
- * for the specified QR Code version.
- *
- * The alignment patterns are positioned symmetrically on either side of the diagonal
- * running from the top left corner of the symbol to the bottom right corner.
- *
- * Since positions are simmetrical only half of the coordinates are returned.
- * Each item of the array will represent in turn the x and y coordinate.
- * @see {@link getPositions}
- *
- * @param  {Number} version QR Code version
- * @return {Array}          Array of coordinate
- */
-exports.getRowColCoords = function getRowColCoords (version) {
-  if (version === 1) return []
-
-  const posCount = Math.floor(version / 7) + 2;
-  const size = getSymbolSize(version);
-  const intervals = size === 145 ? 26 : Math.ceil((size - 13) / (2 * posCount - 2)) * 2;
-  const positions = [size - 7]; // Last coord is always (size - 7)
-
-  for (let i = 1; i < posCount - 1; i++) {
-    positions[i] = positions[i - 1] - intervals;
-  }
-
-  positions.push(6); // First coord is always 6
-
-  return positions.reverse()
-};
-
-/**
- * Returns an array containing the positions of each alignment pattern.
- * Each array's element represent the center point of the pattern as (x, y) coordinates
- *
- * Coordinates are calculated expanding the row/column coordinates returned by {@link getRowColCoords}
- * and filtering out the items that overlaps with finder pattern
- *
- * @example
- * For a Version 7 symbol {@link getRowColCoords} returns values 6, 22 and 38.
- * The alignment patterns, therefore, are to be centered on (row, column)
- * positions (6,22), (22,6), (22,22), (22,38), (38,22), (38,38).
- * Note that the coordinates (6,6), (6,38), (38,6) are occupied by finder patterns
- * and are not therefore used for alignment patterns.
- *
- * let pos = getPositions(7)
- * // [[6,22], [22,6], [22,22], [22,38], [38,22], [38,38]]
- *
- * @param  {Number} version QR Code version
- * @return {Array}          Array of coordinates
- */
-exports.getPositions = function getPositions (version) {
-  const coords = [];
-  const pos = exports.getRowColCoords(version);
-  const posLength = pos.length;
-
-  for (let i = 0; i < posLength; i++) {
-    for (let j = 0; j < posLength; j++) {
-      // Skip if position is occupied by finder patterns
-      if ((i === 0 && j === 0) || // top-left
-          (i === 0 && j === posLength - 1) || // bottom-left
-          (i === posLength - 1 && j === 0)) { // top-right
-        continue
-      }
-
-      coords.push([pos[i], pos[j]]);
-    }
-  }
-
-  return coords
-};
-});
-
-const getSymbolSize = utils$1.getSymbolSize;
-const FINDER_PATTERN_SIZE = 7;
-
-/**
- * Returns an array containing the positions of each finder pattern.
- * Each array's element represent the top-left point of the pattern as (x, y) coordinates
- *
- * @param  {Number} version QR Code version
- * @return {Array}          Array of coordinates
- */
-var getPositions = function getPositions (version) {
-  const size = getSymbolSize(version);
-
-  return [
-    // top-left
-    [0, 0],
-    // top-right
-    [size - FINDER_PATTERN_SIZE, 0],
-    // bottom-left
-    [0, size - FINDER_PATTERN_SIZE]
-  ]
-};
-
-var finderPattern = {
-	getPositions: getPositions
-};
-
-var maskPattern = createCommonjsModule(function (module, exports) {
-/**
- * Data mask pattern reference
- * @type {Object}
- */
-exports.Patterns = {
-  PATTERN000: 0,
-  PATTERN001: 1,
-  PATTERN010: 2,
-  PATTERN011: 3,
-  PATTERN100: 4,
-  PATTERN101: 5,
-  PATTERN110: 6,
-  PATTERN111: 7
-};
-
-/**
- * Weighted penalty scores for the undesirable features
- * @type {Object}
- */
-const PenaltyScores = {
-  N1: 3,
-  N2: 3,
-  N3: 40,
-  N4: 10
-};
-
-/**
- * Check if mask pattern value is valid
- *
- * @param  {Number}  mask    Mask pattern
- * @return {Boolean}         true if valid, false otherwise
- */
-exports.isValid = function isValid (mask) {
-  return mask != null && mask !== '' && !isNaN(mask) && mask >= 0 && mask <= 7
-};
-
-/**
- * Returns mask pattern from a value.
- * If value is not valid, returns undefined
- *
- * @param  {Number|String} value        Mask pattern value
- * @return {Number}                     Valid mask pattern or undefined
- */
-exports.from = function from (value) {
-  return exports.isValid(value) ? parseInt(value, 10) : undefined
-};
-
-/**
-* Find adjacent modules in row/column with the same color
-* and assign a penalty value.
-*
-* Points: N1 + i
-* i is the amount by which the number of adjacent modules of the same color exceeds 5
-*/
-exports.getPenaltyN1 = function getPenaltyN1 (data) {
-  const size = data.size;
-  let points = 0;
-  let sameCountCol = 0;
-  let sameCountRow = 0;
-  let lastCol = null;
-  let lastRow = null;
-
-  for (let row = 0; row < size; row++) {
-    sameCountCol = sameCountRow = 0;
-    lastCol = lastRow = null;
-
-    for (let col = 0; col < size; col++) {
-      let module = data.get(row, col);
-      if (module === lastCol) {
-        sameCountCol++;
-      } else {
-        if (sameCountCol >= 5) points += PenaltyScores.N1 + (sameCountCol - 5);
-        lastCol = module;
-        sameCountCol = 1;
-      }
-
-      module = data.get(col, row);
-      if (module === lastRow) {
-        sameCountRow++;
-      } else {
-        if (sameCountRow >= 5) points += PenaltyScores.N1 + (sameCountRow - 5);
-        lastRow = module;
-        sameCountRow = 1;
-      }
-    }
-
-    if (sameCountCol >= 5) points += PenaltyScores.N1 + (sameCountCol - 5);
-    if (sameCountRow >= 5) points += PenaltyScores.N1 + (sameCountRow - 5);
-  }
-
-  return points
-};
-
-/**
- * Find 2x2 blocks with the same color and assign a penalty value
- *
- * Points: N2 * (m - 1) * (n - 1)
- */
-exports.getPenaltyN2 = function getPenaltyN2 (data) {
-  const size = data.size;
-  let points = 0;
-
-  for (let row = 0; row < size - 1; row++) {
-    for (let col = 0; col < size - 1; col++) {
-      const last = data.get(row, col) +
-        data.get(row, col + 1) +
-        data.get(row + 1, col) +
-        data.get(row + 1, col + 1);
-
-      if (last === 4 || last === 0) points++;
-    }
-  }
-
-  return points * PenaltyScores.N2
-};
-
-/**
- * Find 1:1:3:1:1 ratio (dark:light:dark:light:dark) pattern in row/column,
- * preceded or followed by light area 4 modules wide
- *
- * Points: N3 * number of pattern found
- */
-exports.getPenaltyN3 = function getPenaltyN3 (data) {
-  const size = data.size;
-  let points = 0;
-  let bitsCol = 0;
-  let bitsRow = 0;
-
-  for (let row = 0; row < size; row++) {
-    bitsCol = bitsRow = 0;
-    for (let col = 0; col < size; col++) {
-      bitsCol = ((bitsCol << 1) & 0x7FF) | data.get(row, col);
-      if (col >= 10 && (bitsCol === 0x5D0 || bitsCol === 0x05D)) points++;
-
-      bitsRow = ((bitsRow << 1) & 0x7FF) | data.get(col, row);
-      if (col >= 10 && (bitsRow === 0x5D0 || bitsRow === 0x05D)) points++;
-    }
-  }
-
-  return points * PenaltyScores.N3
-};
-
-/**
- * Calculate proportion of dark modules in entire symbol
- *
- * Points: N4 * k
- *
- * k is the rating of the deviation of the proportion of dark modules
- * in the symbol from 50% in steps of 5%
- */
-exports.getPenaltyN4 = function getPenaltyN4 (data) {
-  let darkCount = 0;
-  const modulesCount = data.data.length;
-
-  for (let i = 0; i < modulesCount; i++) darkCount += data.data[i];
-
-  const k = Math.abs(Math.ceil((darkCount * 100 / modulesCount) / 5) - 10);
-
-  return k * PenaltyScores.N4
-};
-
-/**
- * Return mask value at given position
- *
- * @param  {Number} maskPattern Pattern reference value
- * @param  {Number} i           Row
- * @param  {Number} j           Column
- * @return {Boolean}            Mask value
- */
-function getMaskAt (maskPattern, i, j) {
-  switch (maskPattern) {
-    case exports.Patterns.PATTERN000: return (i + j) % 2 === 0
-    case exports.Patterns.PATTERN001: return i % 2 === 0
-    case exports.Patterns.PATTERN010: return j % 3 === 0
-    case exports.Patterns.PATTERN011: return (i + j) % 3 === 0
-    case exports.Patterns.PATTERN100: return (Math.floor(i / 2) + Math.floor(j / 3)) % 2 === 0
-    case exports.Patterns.PATTERN101: return (i * j) % 2 + (i * j) % 3 === 0
-    case exports.Patterns.PATTERN110: return ((i * j) % 2 + (i * j) % 3) % 2 === 0
-    case exports.Patterns.PATTERN111: return ((i * j) % 3 + (i + j) % 2) % 2 === 0
-
-    default: throw new Error('bad maskPattern:' + maskPattern)
-  }
-}
-
-/**
- * Apply a mask pattern to a BitMatrix
- *
- * @param  {Number}    pattern Pattern reference number
- * @param  {BitMatrix} data    BitMatrix data
- */
-exports.applyMask = function applyMask (pattern, data) {
-  const size = data.size;
-
-  for (let col = 0; col < size; col++) {
-    for (let row = 0; row < size; row++) {
-      if (data.isReserved(row, col)) continue
-      data.xor(row, col, getMaskAt(pattern, row, col));
-    }
-  }
-};
-
-/**
- * Returns the best mask pattern for data
- *
- * @param  {BitMatrix} data
- * @return {Number} Mask pattern reference number
- */
-exports.getBestMask = function getBestMask (data, setupFormatFunc) {
-  const numPatterns = Object.keys(exports.Patterns).length;
-  let bestPattern = 0;
-  let lowerPenalty = Infinity;
-
-  for (let p = 0; p < numPatterns; p++) {
-    setupFormatFunc(p);
-    exports.applyMask(p, data);
-
-    // Calculate penalty
-    const penalty =
-      exports.getPenaltyN1(data) +
-      exports.getPenaltyN2(data) +
-      exports.getPenaltyN3(data) +
-      exports.getPenaltyN4(data);
-
-    // Undo previously applied mask
-    exports.applyMask(p, data);
-
-    if (penalty < lowerPenalty) {
-      lowerPenalty = penalty;
-      bestPattern = p;
-    }
-  }
-
-  return bestPattern
-};
-});
-
-const EC_BLOCKS_TABLE = [
-// L  M  Q  H
-  1, 1, 1, 1,
-  1, 1, 1, 1,
-  1, 1, 2, 2,
-  1, 2, 2, 4,
-  1, 2, 4, 4,
-  2, 4, 4, 4,
-  2, 4, 6, 5,
-  2, 4, 6, 6,
-  2, 5, 8, 8,
-  4, 5, 8, 8,
-  4, 5, 8, 11,
-  4, 8, 10, 11,
-  4, 9, 12, 16,
-  4, 9, 16, 16,
-  6, 10, 12, 18,
-  6, 10, 17, 16,
-  6, 11, 16, 19,
-  6, 13, 18, 21,
-  7, 14, 21, 25,
-  8, 16, 20, 25,
-  8, 17, 23, 25,
-  9, 17, 23, 34,
-  9, 18, 25, 30,
-  10, 20, 27, 32,
-  12, 21, 29, 35,
-  12, 23, 34, 37,
-  12, 25, 34, 40,
-  13, 26, 35, 42,
-  14, 28, 38, 45,
-  15, 29, 40, 48,
-  16, 31, 43, 51,
-  17, 33, 45, 54,
-  18, 35, 48, 57,
-  19, 37, 51, 60,
-  19, 38, 53, 63,
-  20, 40, 56, 66,
-  21, 43, 59, 70,
-  22, 45, 62, 74,
-  24, 47, 65, 77,
-  25, 49, 68, 81
-];
-
-const EC_CODEWORDS_TABLE = [
-// L  M  Q  H
-  7, 10, 13, 17,
-  10, 16, 22, 28,
-  15, 26, 36, 44,
-  20, 36, 52, 64,
-  26, 48, 72, 88,
-  36, 64, 96, 112,
-  40, 72, 108, 130,
-  48, 88, 132, 156,
-  60, 110, 160, 192,
-  72, 130, 192, 224,
-  80, 150, 224, 264,
-  96, 176, 260, 308,
-  104, 198, 288, 352,
-  120, 216, 320, 384,
-  132, 240, 360, 432,
-  144, 280, 408, 480,
-  168, 308, 448, 532,
-  180, 338, 504, 588,
-  196, 364, 546, 650,
-  224, 416, 600, 700,
-  224, 442, 644, 750,
-  252, 476, 690, 816,
-  270, 504, 750, 900,
-  300, 560, 810, 960,
-  312, 588, 870, 1050,
-  336, 644, 952, 1110,
-  360, 700, 1020, 1200,
-  390, 728, 1050, 1260,
-  420, 784, 1140, 1350,
-  450, 812, 1200, 1440,
-  480, 868, 1290, 1530,
-  510, 924, 1350, 1620,
-  540, 980, 1440, 1710,
-  570, 1036, 1530, 1800,
-  570, 1064, 1590, 1890,
-  600, 1120, 1680, 1980,
-  630, 1204, 1770, 2100,
-  660, 1260, 1860, 2220,
-  720, 1316, 1950, 2310,
-  750, 1372, 2040, 2430
-];
-
-/**
- * Returns the number of error correction block that the QR Code should contain
- * for the specified version and error correction level.
- *
- * @param  {Number} version              QR Code version
- * @param  {Number} errorCorrectionLevel Error correction level
- * @return {Number}                      Number of error correction blocks
- */
-var getBlocksCount = function getBlocksCount (version, errorCorrectionLevel$1) {
-  switch (errorCorrectionLevel$1) {
-    case errorCorrectionLevel.L:
-      return EC_BLOCKS_TABLE[(version - 1) * 4 + 0]
-    case errorCorrectionLevel.M:
-      return EC_BLOCKS_TABLE[(version - 1) * 4 + 1]
-    case errorCorrectionLevel.Q:
-      return EC_BLOCKS_TABLE[(version - 1) * 4 + 2]
-    case errorCorrectionLevel.H:
-      return EC_BLOCKS_TABLE[(version - 1) * 4 + 3]
-    default:
-      return undefined
-  }
-};
-
-/**
- * Returns the number of error correction codewords to use for the specified
- * version and error correction level.
- *
- * @param  {Number} version              QR Code version
- * @param  {Number} errorCorrectionLevel Error correction level
- * @return {Number}                      Number of error correction codewords
- */
-var getTotalCodewordsCount = function getTotalCodewordsCount (version, errorCorrectionLevel$1) {
-  switch (errorCorrectionLevel$1) {
-    case errorCorrectionLevel.L:
-      return EC_CODEWORDS_TABLE[(version - 1) * 4 + 0]
-    case errorCorrectionLevel.M:
-      return EC_CODEWORDS_TABLE[(version - 1) * 4 + 1]
-    case errorCorrectionLevel.Q:
-      return EC_CODEWORDS_TABLE[(version - 1) * 4 + 2]
-    case errorCorrectionLevel.H:
-      return EC_CODEWORDS_TABLE[(version - 1) * 4 + 3]
-    default:
-      return undefined
-  }
-};
-
-var errorCorrectionCode = {
-	getBlocksCount: getBlocksCount,
-	getTotalCodewordsCount: getTotalCodewordsCount
-};
-
-const EXP_TABLE = new Uint8Array(512);
-const LOG_TABLE = new Uint8Array(256)
-/**
- * Precompute the log and anti-log tables for faster computation later
- *
- * For each possible value in the galois field 2^8, we will pre-compute
- * the logarithm and anti-logarithm (exponential) of this value
- *
- * ref {@link https://en.wikiversity.org/wiki/Reed%E2%80%93Solomon_codes_for_coders#Introduction_to_mathematical_fields}
- */
-;(function initTables () {
-  let x = 1;
-  for (let i = 0; i < 255; i++) {
-    EXP_TABLE[i] = x;
-    LOG_TABLE[x] = i;
-
-    x <<= 1; // multiply by 2
-
-    // The QR code specification says to use byte-wise modulo 100011101 arithmetic.
-    // This means that when a number is 256 or larger, it should be XORed with 0x11D.
-    if (x & 0x100) { // similar to x >= 256, but a lot faster (because 0x100 == 256)
-      x ^= 0x11D;
-    }
-  }
-
-  // Optimization: double the size of the anti-log table so that we don't need to mod 255 to
-  // stay inside the bounds (because we will mainly use this table for the multiplication of
-  // two GF numbers, no more).
-  // @see {@link mul}
-  for (let i = 255; i < 512; i++) {
-    EXP_TABLE[i] = EXP_TABLE[i - 255];
-  }
-}());
-
-/**
- * Returns log value of n inside Galois Field
- *
- * @param  {Number} n
- * @return {Number}
- */
-var log = function log (n) {
-  if (n < 1) throw new Error('log(' + n + ')')
-  return LOG_TABLE[n]
-};
-
-/**
- * Returns anti-log value of n inside Galois Field
- *
- * @param  {Number} n
- * @return {Number}
- */
-var exp = function exp (n) {
-  return EXP_TABLE[n]
-};
-
-/**
- * Multiplies two number inside Galois Field
- *
- * @param  {Number} x
- * @param  {Number} y
- * @return {Number}
- */
-var mul = function mul (x, y) {
-  if (x === 0 || y === 0) return 0
-
-  // should be EXP_TABLE[(LOG_TABLE[x] + LOG_TABLE[y]) % 255] if EXP_TABLE wasn't oversized
-  // @see {@link initTables}
-  return EXP_TABLE[LOG_TABLE[x] + LOG_TABLE[y]]
-};
-
-var galoisField = {
-	log: log,
-	exp: exp,
-	mul: mul
-};
-
-var polynomial = createCommonjsModule(function (module, exports) {
-/**
- * Multiplies two polynomials inside Galois Field
- *
- * @param  {Uint8Array} p1 Polynomial
- * @param  {Uint8Array} p2 Polynomial
- * @return {Uint8Array}    Product of p1 and p2
- */
-exports.mul = function mul (p1, p2) {
-  const coeff = new Uint8Array(p1.length + p2.length - 1);
-
-  for (let i = 0; i < p1.length; i++) {
-    for (let j = 0; j < p2.length; j++) {
-      coeff[i + j] ^= galoisField.mul(p1[i], p2[j]);
-    }
-  }
-
-  return coeff
-};
-
-/**
- * Calculate the remainder of polynomials division
- *
- * @param  {Uint8Array} divident Polynomial
- * @param  {Uint8Array} divisor  Polynomial
- * @return {Uint8Array}          Remainder
- */
-exports.mod = function mod (divident, divisor) {
-  let result = new Uint8Array(divident);
-
-  while ((result.length - divisor.length) >= 0) {
-    const coeff = result[0];
-
-    for (let i = 0; i < divisor.length; i++) {
-      result[i] ^= galoisField.mul(divisor[i], coeff);
-    }
-
-    // remove all zeros from buffer head
-    let offset = 0;
-    while (offset < result.length && result[offset] === 0) offset++;
-    result = result.slice(offset);
-  }
-
-  return result
-};
-
-/**
- * Generate an irreducible generator polynomial of specified degree
- * (used by Reed-Solomon encoder)
- *
- * @param  {Number} degree Degree of the generator polynomial
- * @return {Uint8Array}    Buffer containing polynomial coefficients
- */
-exports.generateECPolynomial = function generateECPolynomial (degree) {
-  let poly = new Uint8Array([1]);
-  for (let i = 0; i < degree; i++) {
-    poly = exports.mul(poly, new Uint8Array([1, galoisField.exp(i)]));
-  }
-
-  return poly
-};
-});
-
-function ReedSolomonEncoder (degree) {
-  this.genPoly = undefined;
-  this.degree = degree;
-
-  if (this.degree) this.initialize(this.degree);
-}
-
-/**
- * Initialize the encoder.
- * The input param should correspond to the number of error correction codewords.
- *
- * @param  {Number} degree
- */
-ReedSolomonEncoder.prototype.initialize = function initialize (degree) {
-  // create an irreducible generator polynomial
-  this.degree = degree;
-  this.genPoly = polynomial.generateECPolynomial(this.degree);
-};
-
-/**
- * Encodes a chunk of data
- *
- * @param  {Uint8Array} data Buffer containing input data
- * @return {Uint8Array}      Buffer containing encoded data
- */
-ReedSolomonEncoder.prototype.encode = function encode (data) {
-  if (!this.genPoly) {
-    throw new Error('Encoder not initialized')
-  }
-
-  // Calculate EC for this data block
-  // extends data size to data+genPoly size
-  const paddedData = new Uint8Array(data.length + this.degree);
-  paddedData.set(data);
-
-  // The error correction codewords are the remainder after dividing the data codewords
-  // by a generator polynomial
-  const remainder = polynomial.mod(paddedData, this.genPoly);
-
-  // return EC data blocks (last n byte, where n is the degree of genPoly)
-  // If coefficients number in remainder are less than genPoly degree,
-  // pad with 0s to the left to reach the needed number of coefficients
-  const start = this.degree - remainder.length;
-  if (start > 0) {
-    const buff = new Uint8Array(this.degree);
-    buff.set(remainder, start);
-
-    return buff
-  }
-
-  return remainder
-};
-
-var reedSolomonEncoder = ReedSolomonEncoder;
-
-/**
- * Check if QR Code version is valid
- *
- * @param  {Number}  version QR Code version
- * @return {Boolean}         true if valid version, false otherwise
- */
-var isValid = function isValid (version) {
-  return !isNaN(version) && version >= 1 && version <= 40
-};
-
-var versionCheck = {
-	isValid: isValid
-};
-
-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]))+';
-
-var KANJI = new RegExp(kanji, 'g');
-var BYTE_KANJI = new RegExp('[^A-Z0-9 $%*+\\-./:]+', 'g');
-var BYTE = new RegExp(byte, 'g');
-var NUMERIC = new RegExp(numeric, 'g');
-var 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 $%*+\\-./:]+$');
-
-var testKanji = function testKanji (str) {
-  return TEST_KANJI.test(str)
-};
-
-var testNumeric = function testNumeric (str) {
-  return TEST_NUMERIC.test(str)
-};
-
-var testAlphanumeric = function testAlphanumeric (str) {
-  return TEST_ALPHANUMERIC.test(str)
-};
-
-var regex = {
-	KANJI: KANJI,
-	BYTE_KANJI: BYTE_KANJI,
-	BYTE: BYTE,
-	NUMERIC: NUMERIC,
-	ALPHANUMERIC: ALPHANUMERIC,
-	testKanji: testKanji,
-	testNumeric: testNumeric,
-	testAlphanumeric: testAlphanumeric
-};
-
-var mode = createCommonjsModule(function (module, exports) {
-/**
- * Numeric mode encodes data from the decimal digit set (0 - 9)
- * (byte values 30HEX to 39HEX).
- * Normally, 3 data characters are represented by 10 bits.
- *
- * @type {Object}
- */
-exports.NUMERIC = {
-  id: 'Numeric',
-  bit: 1 << 0,
-  ccBits: [10, 12, 14]
-};
-
-/**
- * Alphanumeric mode encodes data from a set of 45 characters,
- * i.e. 10 numeric digits (0 - 9),
- *      26 alphabetic characters (A - Z),
- *   and 9 symbols (SP, $, %, *, +, -, ., /, :).
- * Normally, two input characters are represented by 11 bits.
- *
- * @type {Object}
- */
-exports.ALPHANUMERIC = {
-  id: 'Alphanumeric',
-  bit: 1 << 1,
-  ccBits: [9, 11, 13]
-};
-
-/**
- * In byte mode, data is encoded at 8 bits per character.
- *
- * @type {Object}
- */
-exports.BYTE = {
-  id: 'Byte',
-  bit: 1 << 2,
-  ccBits: [8, 16, 16]
-};
-
-/**
- * The Kanji mode efficiently encodes Kanji characters in accordance with
- * the Shift JIS system based on JIS X 0208.
- * The Shift JIS values are shifted from the JIS X 0208 values.
- * JIS X 0208 gives details of the shift coded representation.
- * Each two-byte character value is compacted to a 13-bit binary codeword.
- *
- * @type {Object}
- */
-exports.KANJI = {
-  id: 'Kanji',
-  bit: 1 << 3,
-  ccBits: [8, 10, 12]
-};
-
-/**
- * Mixed mode will contain a sequences of data in a combination of any of
- * the modes described above
- *
- * @type {Object}
- */
-exports.MIXED = {
-  bit: -1
-};
-
-/**
- * Returns the number of bits needed to store the data length
- * according to QR Code specifications.
- *
- * @param  {Mode}   mode    Data mode
- * @param  {Number} version QR Code version
- * @return {Number}         Number of bits
- */
-exports.getCharCountIndicator = function getCharCountIndicator (mode, version) {
-  if (!mode.ccBits) throw new Error('Invalid mode: ' + mode)
-
-  if (!versionCheck.isValid(version)) {
-    throw new Error('Invalid version: ' + version)
-  }
-
-  if (version >= 1 && version < 10) return mode.ccBits[0]
-  else if (version < 27) return mode.ccBits[1]
-  return mode.ccBits[2]
-};
-
-/**
- * Returns the most efficient mode to store the specified data
- *
- * @param  {String} dataStr Input data string
- * @return {Mode}           Best mode
- */
-exports.getBestModeForData = function getBestModeForData (dataStr) {
-  if (regex.testNumeric(dataStr)) return exports.NUMERIC
-  else if (regex.testAlphanumeric(dataStr)) return exports.ALPHANUMERIC
-  else if (regex.testKanji(dataStr)) return exports.KANJI
-  else return exports.BYTE
-};
-
-/**
- * Return mode name as string
- *
- * @param {Mode} mode Mode object
- * @returns {String}  Mode name
- */
-exports.toString = function toString (mode) {
-  if (mode && mode.id) return mode.id
-  throw new Error('Invalid mode')
-};
-
-/**
- * Check if input param is a valid mode object
- *
- * @param   {Mode}    mode Mode object
- * @returns {Boolean} True if valid mode, false otherwise
- */
-exports.isValid = function isValid (mode) {
-  return mode && mode.bit && mode.ccBits
-};
-
-/**
- * Get mode object from its name
- *
- * @param   {String} string Mode name
- * @returns {Mode}          Mode object
- */
-function fromString (string) {
-  if (typeof string !== 'string') {
-    throw new Error('Param is not a string')
-  }
-
-  const lcStr = string.toLowerCase();
-
-  switch (lcStr) {
-    case 'numeric':
-      return exports.NUMERIC
-    case 'alphanumeric':
-      return exports.ALPHANUMERIC
-    case 'kanji':
-      return exports.KANJI
-    case 'byte':
-      return exports.BYTE
-    default:
-      throw new Error('Unknown mode: ' + string)
-  }
-}
-
-/**
- * Returns mode from a value.
- * If value is not a valid mode, returns defaultValue
- *
- * @param  {Mode|String} value        Encoding mode
- * @param  {Mode}        defaultValue Fallback value
- * @return {Mode}                     Encoding mode
- */
-exports.from = function from (value, defaultValue) {
-  if (exports.isValid(value)) {
-    return value
-  }
-
-  try {
-    return fromString(value)
-  } catch (e) {
-    return defaultValue
-  }
-};
-});
-
-var version = createCommonjsModule(function (module, exports) {
-// Generator polynomial used to encode version information
-const G18 = (1 << 12) | (1 << 11) | (1 << 10) | (1 << 9) | (1 << 8) | (1 << 5) | (1 << 2) | (1 << 0);
-const G18_BCH = utils$1.getBCHDigit(G18);
-
-function getBestVersionForDataLength (mode, length, errorCorrectionLevel) {
-  for (let currentVersion = 1; currentVersion <= 40; currentVersion++) {
-    if (length <= exports.getCapacity(currentVersion, errorCorrectionLevel, mode)) {
-      return currentVersion
-    }
-  }
-
-  return undefined
-}
-
-function getReservedBitsCount (mode$1, version) {
-  // Character count indicator + mode indicator bits
-  return mode.getCharCountIndicator(mode$1, version) + 4
-}
-
-function getTotalBitsFromDataArray (segments, version) {
-  let totalBits = 0;
-
-  segments.forEach(function (data) {
-    const reservedBits = getReservedBitsCount(data.mode, version);
-    totalBits += reservedBits + data.getBitsLength();
-  });
-
-  return totalBits
-}
-
-function getBestVersionForMixedData (segments, errorCorrectionLevel) {
-  for (let currentVersion = 1; currentVersion <= 40; currentVersion++) {
-    const length = getTotalBitsFromDataArray(segments, currentVersion);
-    if (length <= exports.getCapacity(currentVersion, errorCorrectionLevel, mode.MIXED)) {
-      return currentVersion
-    }
-  }
-
-  return undefined
-}
-
-/**
- * Returns version number from a value.
- * If value is not a valid version, returns defaultValue
- *
- * @param  {Number|String} value        QR Code version
- * @param  {Number}        defaultValue Fallback value
- * @return {Number}                     QR Code version number
- */
-exports.from = function from (value, defaultValue) {
-  if (versionCheck.isValid(value)) {
-    return parseInt(value, 10)
-  }
-
-  return defaultValue
-};
-
-/**
- * Returns how much data can be stored with the specified QR code version
- * and error correction level
- *
- * @param  {Number} version              QR Code version (1-40)
- * @param  {Number} errorCorrectionLevel Error correction level
- * @param  {Mode}   mode                 Data mode
- * @return {Number}                      Quantity of storable data
- */
-exports.getCapacity = function getCapacity (version, errorCorrectionLevel, mode$1) {
-  if (!versionCheck.isValid(version)) {
-    throw new Error('Invalid QR Code version')
-  }
-
-  // Use Byte mode as default
-  if (typeof mode$1 === 'undefined') mode$1 = mode.BYTE;
-
-  // Total codewords for this QR code version (Data + Error correction)
-  const totalCodewords = utils$1.getSymbolTotalCodewords(version);
-
-  // Total number of error correction codewords
-  const ecTotalCodewords = errorCorrectionCode.getTotalCodewordsCount(version, errorCorrectionLevel);
-
-  // Total number of data codewords
-  const dataTotalCodewordsBits = (totalCodewords - ecTotalCodewords) * 8;
-
-  if (mode$1 === mode.MIXED) return dataTotalCodewordsBits
-
-  const usableBits = dataTotalCodewordsBits - getReservedBitsCount(mode$1, version);
-
-  // Return max number of storable codewords
-  switch (mode$1) {
-    case mode.NUMERIC:
-      return Math.floor((usableBits / 10) * 3)
-
-    case mode.ALPHANUMERIC:
-      return Math.floor((usableBits / 11) * 2)
-
-    case mode.KANJI:
-      return Math.floor(usableBits / 13)
-
-    case mode.BYTE:
-    default:
-      return Math.floor(usableBits / 8)
-  }
-};
-
-/**
- * Returns the minimum version needed to contain the amount of data
- *
- * @param  {Segment} data                    Segment of data
- * @param  {Number} [errorCorrectionLevel=H] Error correction level
- * @param  {Mode} mode                       Data mode
- * @return {Number}                          QR Code version
- */
-exports.getBestVersionForData = function getBestVersionForData (data, errorCorrectionLevel$1) {
-  let seg;
-
-  const ecl = errorCorrectionLevel.from(errorCorrectionLevel$1, errorCorrectionLevel.M);
-
-  if (Array.isArray(data)) {
-    if (data.length > 1) {
-      return getBestVersionForMixedData(data, ecl)
-    }
-
-    if (data.length === 0) {
-      return 1
-    }
-
-    seg = data[0];
-  } else {
-    seg = data;
-  }
-
-  return getBestVersionForDataLength(seg.mode, seg.getLength(), ecl)
-};
-
-/**
- * Returns version information with relative error correction bits
- *
- * The version information is included in QR Code symbols of version 7 or larger.
- * It consists of an 18-bit sequence containing 6 data bits,
- * with 12 error correction bits calculated using the (18, 6) Golay code.
- *
- * @param  {Number} version QR Code version
- * @return {Number}         Encoded version info bits
- */
-exports.getEncodedBits = function getEncodedBits (version) {
-  if (!versionCheck.isValid(version) || version < 7) {
-    throw new Error('Invalid QR Code version')
-  }
-
-  let d = version << 12;
-
-  while (utils$1.getBCHDigit(d) - G18_BCH >= 0) {
-    d ^= (G18 << (utils$1.getBCHDigit(d) - G18_BCH));
-  }
-
-  return (version << 12) | d
-};
-});
-
-const G15 = (1 << 10) | (1 << 8) | (1 << 5) | (1 << 4) | (1 << 2) | (1 << 1) | (1 << 0);
-const G15_MASK = (1 << 14) | (1 << 12) | (1 << 10) | (1 << 4) | (1 << 1);
-const G15_BCH = utils$1.getBCHDigit(G15);
-
-/**
- * Returns format information with relative error correction bits
- *
- * The format information is a 15-bit sequence containing 5 data bits,
- * with 10 error correction bits calculated using the (15, 5) BCH code.
- *
- * @param  {Number} errorCorrectionLevel Error correction level
- * @param  {Number} mask                 Mask pattern
- * @return {Number}                      Encoded format information bits
- */
-var getEncodedBits = function getEncodedBits (errorCorrectionLevel, mask) {
-  const data = ((errorCorrectionLevel.bit << 3) | mask);
-  let d = data << 10;
-
-  while (utils$1.getBCHDigit(d) - G15_BCH >= 0) {
-    d ^= (G15 << (utils$1.getBCHDigit(d) - G15_BCH));
-  }
-
-  // xor final data with mask pattern in order to ensure that
-  // no combination of Error Correction Level and data mask pattern
-  // will result in an all-zero data string
-  return ((data << 10) | d) ^ G15_MASK
-};
-
-var formatInfo = {
-	getEncodedBits: getEncodedBits
-};
-
-function NumericData (data) {
-  this.mode = mode.NUMERIC;
-  this.data = data.toString();
-}
-
-NumericData.getBitsLength = function getBitsLength (length) {
-  return 10 * Math.floor(length / 3) + ((length % 3) ? ((length % 3) * 3 + 1) : 0)
-};
-
-NumericData.prototype.getLength = function getLength () {
-  return this.data.length
-};
-
-NumericData.prototype.getBitsLength = function getBitsLength () {
-  return NumericData.getBitsLength(this.data.length)
-};
-
-NumericData.prototype.write = function write (bitBuffer) {
-  let i, group, value;
-
-  // The input data string is divided into groups of three digits,
-  // and each group is converted to its 10-bit binary equivalent.
-  for (i = 0; i + 3 <= this.data.length; i += 3) {
-    group = this.data.substr(i, 3);
-    value = parseInt(group, 10);
-
-    bitBuffer.put(value, 10);
-  }
-
-  // If the number of input digits is not an exact multiple of three,
-  // the final one or two digits are converted to 4 or 7 bits respectively.
-  const remainingNum = this.data.length - i;
-  if (remainingNum > 0) {
-    group = this.data.substr(i);
-    value = parseInt(group, 10);
-
-    bitBuffer.put(value, remainingNum * 3 + 1);
-  }
-};
-
-var numericData = NumericData;
-
-/**
- * Array of characters available in alphanumeric mode
- *
- * As per QR Code specification, to each character
- * is assigned a value from 0 to 44 which in this case coincides
- * with the array index
- *
- * @type {Array}
- */
-const ALPHA_NUM_CHARS = [
-  '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 AlphanumericData (data) {
-  this.mode = mode.ALPHANUMERIC;
-  this.data = data;
-}
-
-AlphanumericData.getBitsLength = function getBitsLength (length) {
-  return 11 * Math.floor(length / 2) + 6 * (length % 2)
-};
-
-AlphanumericData.prototype.getLength = function getLength () {
-  return this.data.length
-};
-
-AlphanumericData.prototype.getBitsLength = function getBitsLength () {
-  return AlphanumericData.getBitsLength(this.data.length)
-};
-
-AlphanumericData.prototype.write = function write (bitBuffer) {
-  let i;
-
-  // Input data characters are divided into groups of two characters
-  // and encoded as 11-bit binary codes.
-  for (i = 0; i + 2 <= this.data.length; i += 2) {
-    // The character value of the first character is multiplied by 45
-    let value = ALPHA_NUM_CHARS.indexOf(this.data[i]) * 45;
-
-    // The character value of the second digit is added to the product
-    value += ALPHA_NUM_CHARS.indexOf(this.data[i + 1]);
-
-    // The sum is then stored as 11-bit binary number
-    bitBuffer.put(value, 11);
-  }
-
-  // If the number of input data characters is not a multiple of two,
-  // the character value of the final character is encoded as a 6-bit binary number.
-  if (this.data.length % 2) {
-    bitBuffer.put(ALPHA_NUM_CHARS.indexOf(this.data[i]), 6);
-  }
-};
-
-var alphanumericData = AlphanumericData;
-
-'use strict';
-
-var encodeUtf8 = function encodeUtf8 (input) {
-  var result = [];
-  var size = input.length;
-
-  for (var index = 0; index < size; index++) {
-    var point = input.charCodeAt(index);
-
-    if (point >= 0xD800 && point <= 0xDBFF && size > index + 1) {
-      var second = input.charCodeAt(index + 1);
-
-      if (second >= 0xDC00 && second <= 0xDFFF) {
-        // https://mathiasbynens.be/notes/javascript-encoding#surrogate-formulae
-        point = (point - 0xD800) * 0x400 + second - 0xDC00 + 0x10000;
-        index += 1;
-      }
-    }
-
-    // US-ASCII
-    if (point < 0x80) {
-      result.push(point);
-      continue
-    }
-
-    // 2-byte UTF-8
-    if (point < 0x800) {
-      result.push((point >> 6) | 192);
-      result.push((point & 63) | 128);
-      continue
-    }
-
-    // 3-byte UTF-8
-    if (point < 0xD800 || (point >= 0xE000 && point < 0x10000)) {
-      result.push((point >> 12) | 224);
-      result.push(((point >> 6) & 63) | 128);
-      result.push((point & 63) | 128);
-      continue
-    }
-
-    // 4-byte UTF-8
-    if (point >= 0x10000 && point <= 0x10FFFF) {
-      result.push((point >> 18) | 240);
-      result.push(((point >> 12) & 63) | 128);
-      result.push(((point >> 6) & 63) | 128);
-      result.push((point & 63) | 128);
-      continue
-    }
-
-    // Invalid character
-    result.push(0xEF, 0xBF, 0xBD);
-  }
-
-  return new Uint8Array(result).buffer
-};
-
-function ByteData (data) {
-  this.mode = mode.BYTE;
-  if (typeof (data) === 'string') {
-    data = encodeUtf8(data);
-  }
-  this.data = new Uint8Array(data);
-}
-
-ByteData.getBitsLength = function getBitsLength (length) {
-  return length * 8
-};
-
-ByteData.prototype.getLength = function getLength () {
-  return this.data.length
-};
-
-ByteData.prototype.getBitsLength = function getBitsLength () {
-  return ByteData.getBitsLength(this.data.length)
-};
-
-ByteData.prototype.write = function (bitBuffer) {
-  for (let i = 0, l = this.data.length; i < l; i++) {
-    bitBuffer.put(this.data[i], 8);
-  }
-};
-
-var byteData = ByteData;
-
-function KanjiData (data) {
-  this.mode = mode.KANJI;
-  this.data = data;
-}
-
-KanjiData.getBitsLength = function getBitsLength (length) {
-  return length * 13
-};
-
-KanjiData.prototype.getLength = function getLength () {
-  return this.data.length
-};
-
-KanjiData.prototype.getBitsLength = function getBitsLength () {
-  return KanjiData.getBitsLength(this.data.length)
-};
-
-KanjiData.prototype.write = function (bitBuffer) {
-  let i;
-
-  // In the Shift JIS system, Kanji characters are represented by a two byte combination.
-  // These byte values are shifted from the JIS X 0208 values.
-  // JIS X 0208 gives details of the shift coded representation.
-  for (i = 0; i < this.data.length; i++) {
-    let value = utils$1.toSJIS(this.data[i]);
-
-    // For characters with Shift JIS values from 0x8140 to 0x9FFC:
-    if (value >= 0x8140 && value <= 0x9FFC) {
-      // Subtract 0x8140 from Shift JIS value
-      value -= 0x8140;
-
-    // For characters with Shift JIS values from 0xE040 to 0xEBBF
-    } else if (value >= 0xE040 && value <= 0xEBBF) {
-      // Subtract 0xC140 from Shift JIS value
-      value -= 0xC140;
-    } else {
-      throw new Error(
-        'Invalid SJIS character: ' + this.data[i] + '\n' +
-        'Make sure your charset is UTF-8')
-    }
-
-    // Multiply most significant byte of result by 0xC0
-    // and add least significant byte to product
-    value = (((value >>> 8) & 0xff) * 0xC0) + (value & 0xff);
-
-    // Convert result to a 13-bit binary string
-    bitBuffer.put(value, 13);
-  }
-};
-
-var kanjiData = KanjiData;
-
-var dijkstra_1 = createCommonjsModule(function (module) {
-'use strict';
-
-/******************************************************************************
- * Created 2008-08-19.
- *
- * Dijkstra path-finding functions. Adapted from the Dijkstar Python project.
- *
- * Copyright (C) 2008
- *   Wyatt Baldwin <self@wyattbaldwin.com>
- *   All rights reserved
- *
- * Licensed under the MIT license.
- *
- *   http://www.opensource.org/licenses/mit-license.php
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
- * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
- * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
- * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
- * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
- * THE SOFTWARE.
- *****************************************************************************/
-var dijkstra = {
-  single_source_shortest_paths: function(graph, s, d) {
-    // Predecessor map for each node that has been encountered.
-    // node ID => predecessor node ID
-    var predecessors = {};
-
-    // Costs of shortest paths from s to all nodes encountered.
-    // node ID => cost
-    var costs = {};
-    costs[s] = 0;
-
-    // Costs of shortest paths from s to all nodes encountered; differs from
-    // `costs` in that it provides easy access to the node that currently has
-    // the known shortest path from s.
-    // XXX: Do we actually need both `costs` and `open`?
-    var open = dijkstra.PriorityQueue.make();
-    open.push(s, 0);
-
-    var closest,
-        u, v,
-        cost_of_s_to_u,
-        adjacent_nodes,
-        cost_of_e,
-        cost_of_s_to_u_plus_cost_of_e,
-        cost_of_s_to_v,
-        first_visit;
-    while (!open.empty()) {
-      // In the nodes remaining in graph that have a known cost from s,
-      // find the node, u, that currently has the shortest path from s.
-      closest = open.pop();
-      u = closest.value;
-      cost_of_s_to_u = closest.cost;
-
-      // Get nodes adjacent to u...
-      adjacent_nodes = graph[u] || {};
-
-      // ...and explore the edges that connect u to those nodes, updating
-      // the cost of the shortest paths to any or all of those nodes as
-      // necessary. v is the node across the current edge from u.
-      for (v in adjacent_nodes) {
-        if (adjacent_nodes.hasOwnProperty(v)) {
-          // Get the cost of the edge running from u to v.
-          cost_of_e = adjacent_nodes[v];
-
-          // Cost of s to u plus the cost of u to v across e--this is *a*
-          // cost from s to v that may or may not be less than the current
-          // known cost to v.
-          cost_of_s_to_u_plus_cost_of_e = cost_of_s_to_u + cost_of_e;
-
-          // If we haven't visited v yet OR if the current known cost from s to
-          // v is greater than the new cost we just found (cost of s to u plus
-          // cost of u to v across e), update v's cost in the cost list and
-          // update v's predecessor in the predecessor list (it's now u).
-          cost_of_s_to_v = costs[v];
-          first_visit = (typeof costs[v] === 'undefined');
-          if (first_visit || cost_of_s_to_v > cost_of_s_to_u_plus_cost_of_e) {
-            costs[v] = cost_of_s_to_u_plus_cost_of_e;
-            open.push(v, cost_of_s_to_u_plus_cost_of_e);
-            predecessors[v] = u;
-          }
-        }
-      }
-    }
-
-    if (typeof d !== 'undefined' && typeof costs[d] === 'undefined') {
-      var msg = ['Could not find a path from ', s, ' to ', d, '.'].join('');
-      throw new Error(msg);
-    }
-
-    return predecessors;
-  },
-
-  extract_shortest_path_from_predecessor_list: function(predecessors, d) {
-    var nodes = [];
-    var u = d;
-    var predecessor;
-    while (u) {
-      nodes.push(u);
-      predecessor = predecessors[u];
-      u = predecessors[u];
-    }
-    nodes.reverse();
-    return nodes;
-  },
-
-  find_path: function(graph, s, d) {
-    var predecessors = dijkstra.single_source_shortest_paths(graph, s, d);
-    return dijkstra.extract_shortest_path_from_predecessor_list(
-      predecessors, d);
-  },
-
-  /**
-   * A very naive priority queue implementation.
-   */
-  PriorityQueue: {
-    make: function (opts) {
-      var T = dijkstra.PriorityQueue,
-          t = {},
-          key;
-      opts = opts || {};
-      for (key in T) {
-        if (T.hasOwnProperty(key)) {
-          t[key] = T[key];
-        }
-      }
-      t.queue = [];
-      t.sorter = opts.sorter || T.default_sorter;
-      return t;
-    },
-
-    default_sorter: function (a, b) {
-      return a.cost - b.cost;
-    },
-
-    /**
-     * Add a new item to the queue and ensure the highest priority element
-     * is at the front of the queue.
-     */
-    push: function (value, cost) {
-      var item = {value: value, cost: cost};
-      this.queue.push(item);
-      this.queue.sort(this.sorter);
-    },
-
-    /**
-     * Return the highest priority element in the queue.
-     */
-    pop: function () {
-      return this.queue.shift();
-    },
-
-    empty: function () {
-      return this.queue.length === 0;
-    }
-  }
-};
-
-
-// node.js module exports
-if ('object' !== 'undefined') {
-  module.exports = dijkstra;
-}
-});
-
-var segments = createCommonjsModule(function (module, exports) {
-/**
- * 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$1.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$1) {
-  switch (mode$1) {
-    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$1;
-  const bestMode = mode.getBestModeForData(data);
-
-  mode$1 = mode.from(modesHint, bestMode);
-
-  // Make sure data can be encoded
-  if (mode$1 !== mode.BYTE && mode$1.bit < bestMode.bit) {
-    throw new Error('"' + data + '"' +
-      ' cannot be encoded with mode ' + mode.toString(mode$1) +
-      '.\n Suggested mode is: ' + mode.toString(bestMode))
-  }
-
-  // Use Mode.BYTE if Kanji support is disabled
-  if (mode$1 === mode.KANJI && !utils$1.isKanjiModeEnabled()) {
-    mode$1 = mode.BYTE;
-  }
-
-  switch (mode$1) {
-    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.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.fromString = function fromString (data, version) {
-  const segs = getSegmentsFromString(data, utils$1.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.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.rawSplit = function rawSplit (data) {
-  return exports.fromArray(
-    getSegmentsFromString(data, utils$1.isKanjiModeEnabled())
-  )
-};
-});
-
-/**
- * QRCode for JavaScript
- *
- * modified by Ryan Day for nodejs support
- * Copyright (c) 2011 Ryan Day
- *
- * Licensed under the MIT license:
- *   http://www.opensource.org/licenses/mit-license.php
- *
-//---------------------------------------------------------------------
-// QRCode for JavaScript
-//
-// Copyright (c) 2009 Kazuhiko Arase
-//
-// URL: http://www.d-project.com/
-//
-// Licensed under the MIT license:
-//   http://www.opensource.org/licenses/mit-license.php
-//
-// The word "QR Code" is registered trademark of
-// DENSO WAVE INCORPORATED
-//   http://www.denso-wave.com/qrcode/faqpatent-e.html
-//
-//---------------------------------------------------------------------
-*/
-
-/**
- * Add finder patterns bits to matrix
- *
- * @param  {BitMatrix} matrix  Modules matrix
- * @param  {Number}    version QR Code version
- */
-function setupFinderPattern (matrix, version) {
-  const size = matrix.size;
-  const pos = finderPattern.getPositions(version);
-
-  for (let i = 0; i < pos.length; i++) {
-    const row = pos[i][0];
-    const col = pos[i][1];
-
-    for (let r = -1; r <= 7; r++) {
-      if (row + r <= -1 || size <= row + r) continue
-
-      for (let c = -1; c <= 7; c++) {
-        if (col + c <= -1 || size <= col + c) continue
-
-        if ((r >= 0 && r <= 6 && (c === 0 || c === 6)) ||
-          (c >= 0 && c <= 6 && (r === 0 || r === 6)) ||
-          (r >= 2 && r <= 4 && c >= 2 && c <= 4)) {
-          matrix.set(row + r, col + c, true, true);
-        } else {
-          matrix.set(row + r, col + c, false, true);
-        }
-      }
-    }
-  }
-}
-
-/**
- * Add timing pattern bits to matrix
- *
- * Note: this function must be called before {@link setupAlignmentPattern}
- *
- * @param  {BitMatrix} matrix Modules matrix
- */
-function setupTimingPattern (matrix) {
-  const size = matrix.size;
-
-  for (let r = 8; r < size - 8; r++) {
-    const value = r % 2 === 0;
-    matrix.set(r, 6, value, true);
-    matrix.set(6, r, value, true);
-  }
-}
-
-/**
- * Add alignment patterns bits to matrix
- *
- * Note: this function must be called after {@link setupTimingPattern}
- *
- * @param  {BitMatrix} matrix  Modules matrix
- * @param  {Number}    version QR Code version
- */
-function setupAlignmentPattern (matrix, version) {
-  const pos = alignmentPattern.getPositions(version);
-
-  for (let i = 0; i < pos.length; i++) {
-    const row = pos[i][0];
-    const col = pos[i][1];
-
-    for (let r = -2; r <= 2; r++) {
-      for (let c = -2; c <= 2; c++) {
-        if (r === -2 || r === 2 || c === -2 || c === 2 ||
-          (r === 0 && c === 0)) {
-          matrix.set(row + r, col + c, true, true);
-        } else {
-          matrix.set(row + r, col + c, false, true);
-        }
-      }
-    }
-  }
-}
-
-/**
- * Add version info bits to matrix
- *
- * @param  {BitMatrix} matrix  Modules matrix
- * @param  {Number}    version QR Code version
- */
-function setupVersionInfo (matrix, version$1) {
-  const size = matrix.size;
-  const bits = version.getEncodedBits(version$1);
-  let row, col, mod;
-
-  for (let i = 0; i < 18; i++) {
-    row = Math.floor(i / 3);
-    col = i % 3 + size - 8 - 3;
-    mod = ((bits >> i) & 1) === 1;
-
-    matrix.set(row, col, mod, true);
-    matrix.set(col, row, mod, true);
-  }
-}
-
-/**
- * Add format info bits to matrix
- *
- * @param  {BitMatrix} matrix               Modules matrix
- * @param  {ErrorCorrectionLevel}    errorCorrectionLevel Error correction level
- * @param  {Number}    maskPattern          Mask pattern reference value
- */
-function setupFormatInfo (matrix, errorCorrectionLevel, maskPattern) {
-  const size = matrix.size;
-  const bits = formatInfo.getEncodedBits(errorCorrectionLevel, maskPattern);
-  let i, mod;
-
-  for (i = 0; i < 15; i++) {
-    mod = ((bits >> i) & 1) === 1;
-
-    // vertical
-    if (i < 6) {
-      matrix.set(i, 8, mod, true);
-    } else if (i < 8) {
-      matrix.set(i + 1, 8, mod, true);
-    } else {
-      matrix.set(size - 15 + i, 8, mod, true);
-    }
-
-    // horizontal
-    if (i < 8) {
-      matrix.set(8, size - i - 1, mod, true);
-    } else if (i < 9) {
-      matrix.set(8, 15 - i - 1 + 1, mod, true);
-    } else {
-      matrix.set(8, 15 - i - 1, mod, true);
-    }
-  }
-
-  // fixed module
-  matrix.set(size - 8, 8, 1, true);
-}
-
-/**
- * Add encoded data bits to matrix
- *
- * @param  {BitMatrix}  matrix Modules matrix
- * @param  {Uint8Array} data   Data codewords
- */
-function setupData (matrix, data) {
-  const size = matrix.size;
-  let inc = -1;
-  let row = size - 1;
-  let bitIndex = 7;
-  let byteIndex = 0;
-
-  for (let col = size - 1; col > 0; col -= 2) {
-    if (col === 6) col--;
-
-    while (true) {
-      for (let c = 0; c < 2; c++) {
-        if (!matrix.isReserved(row, col - c)) {
-          let dark = false;
-
-          if (byteIndex < data.length) {
-            dark = (((data[byteIndex] >>> bitIndex) & 1) === 1);
-          }
-
-          matrix.set(row, col - c, dark);
-          bitIndex--;
-
-          if (bitIndex === -1) {
-            byteIndex++;
-            bitIndex = 7;
-          }
-        }
-      }
-
-      row += inc;
-
-      if (row < 0 || size <= row) {
-        row -= inc;
-        inc = -inc;
-        break
-      }
-    }
-  }
-}
-
-/**
- * Create encoded codewords from data input
- *
- * @param  {Number}   version              QR Code version
- * @param  {ErrorCorrectionLevel}   errorCorrectionLevel Error correction level
- * @param  {ByteData} data                 Data input
- * @return {Uint8Array}                    Buffer containing encoded codewords
- */
-function createData (version, errorCorrectionLevel, segments) {
-  // Prepare data buffer
-  const buffer = new bitBuffer();
-
-  segments.forEach(function (data) {
-    // prefix data with mode indicator (4 bits)
-    buffer.put(data.mode.bit, 4);
-
-    // Prefix data with character count indicator.
-    // The character count indicator is a string of bits that represents the
-    // number of characters that are being encoded.
-    // The character count indicator must be placed after the mode indicator
-    // and must be a certain number of bits long, depending on the QR version
-    // and data mode
-    // @see {@link Mode.getCharCountIndicator}.
-    buffer.put(data.getLength(), mode.getCharCountIndicator(data.mode, version));
-
-    // add binary data sequence to buffer
-    data.write(buffer);
-  });
-
-  // Calculate required number of bits
-  const totalCodewords = utils$1.getSymbolTotalCodewords(version);
-  const ecTotalCodewords = errorCorrectionCode.getTotalCodewordsCount(version, errorCorrectionLevel);
-  const dataTotalCodewordsBits = (totalCodewords - ecTotalCodewords) * 8;
-
-  // Add a terminator.
-  // If the bit string is shorter than the total number of required bits,
-  // a terminator of up to four 0s must be added to the right side of the string.
-  // If the bit string is more than four bits shorter than the required number of bits,
-  // add four 0s to the end.
-  if (buffer.getLengthInBits() + 4 <= dataTotalCodewordsBits) {
-    buffer.put(0, 4);
-  }
-
-  // If the bit string is fewer than four bits shorter, add only the number of 0s that
-  // are needed to reach the required number of bits.
-
-  // After adding the terminator, if the number of bits in the string is not a multiple of 8,
-  // pad the string on the right with 0s to make the string's length a multiple of 8.
-  while (buffer.getLengthInBits() % 8 !== 0) {
-    buffer.putBit(0);
-  }
-
-  // Add pad bytes if the string is still shorter than the total number of required bits.
-  // Extend the buffer to fill the data capacity of the symbol corresponding to
-  // the Version and Error Correction Level by adding the Pad Codewords 11101100 (0xEC)
-  // and 00010001 (0x11) alternately.
-  const remainingByte = (dataTotalCodewordsBits - buffer.getLengthInBits()) / 8;
-  for (let i = 0; i < remainingByte; i++) {
-    buffer.put(i % 2 ? 0x11 : 0xEC, 8);
-  }
-
-  return createCodewords(buffer, version, errorCorrectionLevel)
-}
-
-/**
- * Encode input data with Reed-Solomon and return codewords with
- * relative error correction bits
- *
- * @param  {BitBuffer} bitBuffer            Data to encode
- * @param  {Number}    version              QR Code version
- * @param  {ErrorCorrectionLevel} errorCorrectionLevel Error correction level
- * @return {Uint8Array}                     Buffer containing encoded codewords
- */
-function createCodewords (bitBuffer, version, errorCorrectionLevel) {
-  // Total codewords for this QR code version (Data + Error correction)
-  const totalCodewords = utils$1.getSymbolTotalCodewords(version);
-
-  // Total number of error correction codewords
-  const ecTotalCodewords = errorCorrectionCode.getTotalCodewordsCount(version, errorCorrectionLevel);
-
-  // Total number of data codewords
-  const dataTotalCodewords = totalCodewords - ecTotalCodewords;
-
-  // Total number of blocks
-  const ecTotalBlocks = errorCorrectionCode.getBlocksCount(version, errorCorrectionLevel);
-
-  // Calculate how many blocks each group should contain
-  const blocksInGroup2 = totalCodewords % ecTotalBlocks;
-  const blocksInGroup1 = ecTotalBlocks - blocksInGroup2;
-
-  const totalCodewordsInGroup1 = Math.floor(totalCodewords / ecTotalBlocks);
-
-  const dataCodewordsInGroup1 = Math.floor(dataTotalCodewords / ecTotalBlocks);
-  const dataCodewordsInGroup2 = dataCodewordsInGroup1 + 1;
-
-  // Number of EC codewords is the same for both groups
-  const ecCount = totalCodewordsInGroup1 - dataCodewordsInGroup1;
-
-  // Initialize a Reed-Solomon encoder with a generator polynomial of degree ecCount
-  const rs = new reedSolomonEncoder(ecCount);
-
-  let offset = 0;
-  const dcData = new Array(ecTotalBlocks);
-  const ecData = new Array(ecTotalBlocks);
-  let maxDataSize = 0;
-  const buffer = new Uint8Array(bitBuffer.buffer);
-
-  // Divide the buffer into the required number of blocks
-  for (let b = 0; b < ecTotalBlocks; b++) {
-    const dataSize = b < blocksInGroup1 ? dataCodewordsInGroup1 : dataCodewordsInGroup2;
-
-    // extract a block of data from buffer
-    dcData[b] = buffer.slice(offset, offset + dataSize);
-
-    // Calculate EC codewords for this data block
-    ecData[b] = rs.encode(dcData[b]);
-
-    offset += dataSize;
-    maxDataSize = Math.max(maxDataSize, dataSize);
-  }
-
-  // Create final data
-  // Interleave the data and error correction codewords from each block
-  const data = new Uint8Array(totalCodewords);
-  let index = 0;
-  let i, r;
-
-  // Add data codewords
-  for (i = 0; i < maxDataSize; i++) {
-    for (r = 0; r < ecTotalBlocks; r++) {
-      if (i < dcData[r].length) {
-        data[index++] = dcData[r][i];
-      }
-    }
-  }
-
-  // Apped EC codewords
-  for (i = 0; i < ecCount; i++) {
-    for (r = 0; r < ecTotalBlocks; r++) {
-      data[index++] = ecData[r][i];
-    }
-  }
-
-  return data
-}
-
-/**
- * Build QR Code symbol
- *
- * @param  {String} data                 Input string
- * @param  {Number} version              QR Code version
- * @param  {ErrorCorretionLevel} errorCorrectionLevel Error level
- * @param  {MaskPattern} maskPattern     Mask pattern
- * @return {Object}                      Object containing symbol data
- */
-function createSymbol (data, version$1, errorCorrectionLevel, maskPattern$1) {
-  let segments$1;
-
-  if (Array.isArray(data)) {
-    segments$1 = segments.fromArray(data);
-  } else if (typeof data === 'string') {
-    let estimatedVersion = version$1;
-
-    if (!estimatedVersion) {
-      const rawSegments = segments.rawSplit(data);
-
-      // Estimate best version that can contain raw splitted segments
-      estimatedVersion = version.getBestVersionForData(rawSegments, errorCorrectionLevel);
-    }
-
-    // Build optimized segments
-    // If estimated version is undefined, try with the highest version
-    segments$1 = segments.fromString(data, estimatedVersion || 40);
-  } else {
-    throw new Error('Invalid data')
-  }
-
-  // Get the min version that can contain data
-  const bestVersion = version.getBestVersionForData(segments$1, errorCorrectionLevel);
-
-  // If no version is found, data cannot be stored
-  if (!bestVersion) {
-    throw new Error('The amount of data is too big to be stored in a QR Code')
-  }
-
-  // If not specified, use min version as default
-  if (!version$1) {
-    version$1 = bestVersion;
-
-  // Check if the specified version can contain the data
-  } else if (version$1 < bestVersion) {
-    throw new Error('\n' +
-      'The chosen QR Code version cannot contain this amount of data.\n' +
-      'Minimum version required to store current data is: ' + bestVersion + '.\n'
-    )
-  }
-
-  const dataBits = createData(version$1, errorCorrectionLevel, segments$1);
-
-  // Allocate matrix buffer
-  const moduleCount = utils$1.getSymbolSize(version$1);
-  const modules = new bitMatrix(moduleCount);
-
-  // Add function modules
-  setupFinderPattern(modules, version$1);
-  setupTimingPattern(modules);
-  setupAlignmentPattern(modules, version$1);
-
-  // Add temporary dummy bits for format info just to set them as reserved.
-  // This is needed to prevent these bits from being masked by {@link MaskPattern.applyMask}
-  // since the masking operation must be performed only on the encoding region.
-  // These blocks will be replaced with correct values later in code.
-  setupFormatInfo(modules, errorCorrectionLevel, 0);
-
-  if (version$1 >= 7) {
-    setupVersionInfo(modules, version$1);
-  }
-
-  // Add data codewords
-  setupData(modules, dataBits);
-
-  if (isNaN(maskPattern$1)) {
-    // Find best mask pattern
-    maskPattern$1 = maskPattern.getBestMask(modules,
-      setupFormatInfo.bind(null, modules, errorCorrectionLevel));
-  }
-
-  // Apply mask pattern
-  maskPattern.applyMask(maskPattern$1, modules);
-
-  // Replace format info bits with correct values
-  setupFormatInfo(modules, errorCorrectionLevel, maskPattern$1);
-
-  return {
-    modules: modules,
-    version: version$1,
-    errorCorrectionLevel: errorCorrectionLevel,
-    maskPattern: maskPattern$1,
-    segments: segments$1
-  }
-}
-
-/**
- * QR Code
- *
- * @param {String | Array} data                 Input data
- * @param {Object} options                      Optional configurations
- * @param {Number} options.version              QR Code version
- * @param {String} options.errorCorrectionLevel Error correction level
- * @param {Function} options.toSJISFunc         Helper func to convert utf8 to sjis
- */
-var create$1 = function create (data, options) {
-  if (typeof data === 'undefined' || data === '') {
-    throw new Error('No input text')
-  }
-
-  let errorCorrectionLevel$1 = errorCorrectionLevel.M;
-  let version$1;
-  let mask;
-
-  if (typeof options !== 'undefined') {
-    // Use higher error correction level as default
-    errorCorrectionLevel$1 = errorCorrectionLevel.from(options.errorCorrectionLevel, errorCorrectionLevel.M);
-    version$1 = version.from(options.version);
-    mask = maskPattern.from(options.maskPattern);
-
-    if (options.toSJISFunc) {
-      utils$1.setToSJISFunction(options.toSJISFunc);
-    }
-  }
-
-  return createSymbol(data, version$1, errorCorrectionLevel$1, mask)
-};
-
-var qrcode = {
-	create: create$1
-};
-
-var utils = createCommonjsModule(function (module, exports) {
-function hex2rgba (hex) {
-  if (typeof hex === 'number') {
-    hex = hex.toString();
-  }
-
-  if (typeof hex !== 'string') {
-    throw new Error('Color should be defined as hex string')
-  }
-
-  let hexCode = hex.slice().replace('#', '').split('');
-  if (hexCode.length < 3 || hexCode.length === 5 || hexCode.length > 8) {
-    throw new Error('Invalid hex color: ' + hex)
-  }
-
-  // Convert from short to long form (fff -> ffffff)
-  if (hexCode.length === 3 || hexCode.length === 4) {
-    hexCode = Array.prototype.concat.apply([], hexCode.map(function (c) {
-      return [c, c]
-    }));
-  }
-
-  // Add default alpha value
-  if (hexCode.length === 6) hexCode.push('F', 'F');
-
-  const hexValue = parseInt(hexCode.join(''), 16);
-
-  return {
-    r: (hexValue >> 24) & 255,
-    g: (hexValue >> 16) & 255,
-    b: (hexValue >> 8) & 255,
-    a: hexValue & 255,
-    hex: '#' + hexCode.slice(0, 6).join('')
-  }
-}
-
-exports.getOptions = function getOptions (options) {
-  if (!options) options = {};
-  if (!options.color) options.color = {};
-
-  const margin = typeof options.margin === 'undefined' ||
-    options.margin === null ||
-    options.margin < 0
-    ? 4
-    : options.margin;
-
-  const width = options.width && options.width >= 21 ? options.width : undefined;
-  const scale = options.scale || 4;
-
-  return {
-    width: width,
-    scale: width ? 4 : scale,
-    margin: margin,
-    color: {
-      dark: hex2rgba(options.color.dark || '#000000ff'),
-      light: hex2rgba(options.color.light || '#ffffffff')
-    },
-    type: options.type,
-    rendererOpts: options.rendererOpts || {}
-  }
-};
-
-exports.getScale = function getScale (qrSize, opts) {
-  return opts.width && opts.width >= qrSize + opts.margin * 2
-    ? opts.width / (qrSize + opts.margin * 2)
-    : opts.scale
-};
-
-exports.getImageWidth = function getImageWidth (qrSize, opts) {
-  const scale = exports.getScale(qrSize, opts);
-  return Math.floor((qrSize + opts.margin * 2) * scale)
-};
-
-exports.qrToImageData = function qrToImageData (imgData, qr, opts) {
-  const size = qr.modules.size;
-  const data = qr.modules.data;
-  const scale = exports.getScale(size, opts);
-  const symbolSize = Math.floor((size + opts.margin * 2) * scale);
-  const scaledMargin = opts.margin * scale;
-  const palette = [opts.color.light, opts.color.dark];
-
-  for (let i = 0; i < symbolSize; i++) {
-    for (let j = 0; j < symbolSize; j++) {
-      let posDst = (i * symbolSize + j) * 4;
-      let pxColor = opts.color.light;
-
-      if (i >= scaledMargin && j >= scaledMargin &&
-        i < symbolSize - scaledMargin && j < symbolSize - scaledMargin) {
-        const iSrc = Math.floor((i - scaledMargin) / scale);
-        const jSrc = Math.floor((j - scaledMargin) / scale);
-        pxColor = palette[data[iSrc * size + jSrc] ? 1 : 0];
-      }
-
-      imgData[posDst++] = pxColor.r;
-      imgData[posDst++] = pxColor.g;
-      imgData[posDst++] = pxColor.b;
-      imgData[posDst] = pxColor.a;
-    }
-  }
-};
-});
-
-var canvas = createCommonjsModule(function (module, exports) {
-function clearCanvas (ctx, canvas, size) {
-  ctx.clearRect(0, 0, canvas.width, canvas.height);
-
-  if (!canvas.style) canvas.style = {};
-  canvas.height = size;
-  canvas.width = size;
-  canvas.style.height = size + 'px';
-  canvas.style.width = size + 'px';
-}
-
-function getCanvasElement () {
-  try {
-    return document.createElement('canvas')
-  } catch (e) {
-    throw new Error('You need to specify a canvas element')
-  }
-}
-
-exports.render = function render (qrData, canvas, options) {
-  let opts = options;
-  let canvasEl = canvas;
-
-  if (typeof opts === 'undefined' && (!canvas || !canvas.getContext)) {
-    opts = canvas;
-    canvas = undefined;
-  }
-
-  if (!canvas) {
-    canvasEl = getCanvasElement();
-  }
-
-  opts = utils.getOptions(opts);
-  const size = utils.getImageWidth(qrData.modules.size, opts);
-
-  const ctx = canvasEl.getContext('2d');
-  const image = ctx.createImageData(size, size);
-  utils.qrToImageData(image.data, qrData, opts);
-
-  clearCanvas(ctx, canvasEl, size);
-  ctx.putImageData(image, 0, 0);
-
-  return canvasEl
-};
-
-exports.renderToDataURL = function renderToDataURL (qrData, canvas, options) {
-  let opts = options;
-
-  if (typeof opts === 'undefined' && (!canvas || !canvas.getContext)) {
-    opts = canvas;
-    canvas = undefined;
-  }
-
-  if (!opts) opts = {};
-
-  const canvasEl = exports.render(qrData, canvas, opts);
-
-  const type = opts.type || 'image/png';
-  const rendererOpts = opts.rendererOpts || {};
-
-  return canvasEl.toDataURL(type, rendererOpts.quality)
-};
-});
-
-function getColorAttrib (color, attrib) {
-  const alpha = color.a / 255;
-  const str = attrib + '="' + color.hex + '"';
-
-  return alpha < 1
-    ? str + ' ' + attrib + '-opacity="' + alpha.toFixed(2).slice(1) + '"'
-    : str
-}
-
-function svgCmd (cmd, x, y) {
-  let str = cmd + x;
-  if (typeof y !== 'undefined') str += ' ' + y;
-
-  return str
-}
-
-function qrToPath (data, size, margin) {
-  let path = '';
-  let moveBy = 0;
-  let newRow = false;
-  let lineLength = 0;
-
-  for (let i = 0; i < data.length; i++) {
-    const col = Math.floor(i % size);
-    const row = Math.floor(i / size);
-
-    if (!col && !newRow) newRow = true;
-
-    if (data[i]) {
-      lineLength++;
-
-      if (!(i > 0 && col > 0 && data[i - 1])) {
-        path += newRow
-          ? svgCmd('M', col + margin, 0.5 + row + margin)
-          : svgCmd('m', moveBy, 0);
-
-        moveBy = 0;
-        newRow = false;
-      }
-
-      if (!(col + 1 < size && data[i + 1])) {
-        path += svgCmd('h', lineLength);
-        lineLength = 0;
-      }
-    } else {
-      moveBy++;
-    }
-  }
-
-  return path
-}
-
-var render = function render (qrData, options, cb) {
-  const opts = utils.getOptions(options);
-  const size = qrData.modules.size;
-  const data = qrData.modules.data;
-  const qrcodesize = size + opts.margin * 2;
-
-  const bg = !opts.color.light.a
-    ? ''
-    : '<path ' + getColorAttrib(opts.color.light, 'fill') +
-      ' d="M0 0h' + qrcodesize + 'v' + qrcodesize + 'H0z"/>';
-
-  const path =
-    '<path ' + getColorAttrib(opts.color.dark, 'stroke') +
-    ' d="' + qrToPath(data, size, opts.margin) + '"/>';
-
-  const viewBox = 'viewBox="' + '0 0 ' + qrcodesize + ' ' + qrcodesize + '"';
-
-  const width = !opts.width ? '' : 'width="' + opts.width + '" height="' + opts.width + '" ';
-
-  const svgTag = '<svg xmlns="http://www.w3.org/2000/svg" ' + width + viewBox + ' shape-rendering="crispEdges">' + bg + path + '</svg>\n';
-
-  if (typeof cb === 'function') {
-    cb(null, svgTag);
-  }
-
-  return svgTag
-};
-
-var svgTag = {
-	render: render
-};
-
-function renderCanvas (renderFunc, canvas, text, opts, cb) {
-  const args = [].slice.call(arguments, 1);
-  const argsNum = args.length;
-  const isLastArgCb = typeof args[argsNum - 1] === 'function';
-
-  if (!isLastArgCb && !canPromise()) {
-    throw new Error('Callback required as last argument')
-  }
-
-  if (isLastArgCb) {
-    if (argsNum < 2) {
-      throw new Error('Too few arguments provided')
-    }
-
-    if (argsNum === 2) {
-      cb = text;
-      text = canvas;
-      canvas = opts = undefined;
-    } else if (argsNum === 3) {
-      if (canvas.getContext && typeof cb === 'undefined') {
-        cb = opts;
-        opts = undefined;
-      } else {
-        cb = opts;
-        opts = text;
-        text = canvas;
-        canvas = undefined;
-      }
-    }
-  } else {
-    if (argsNum < 1) {
-      throw new Error('Too few arguments provided')
-    }
-
-    if (argsNum === 1) {
-      text = canvas;
-      canvas = opts = undefined;
-    } else if (argsNum === 2 && !canvas.getContext) {
-      opts = text;
-      text = canvas;
-      canvas = undefined;
-    }
-
-    return new Promise(function (resolve, reject) {
-      try {
-        const data = qrcode.create(text, opts);
-        resolve(renderFunc(data, canvas, opts));
-      } catch (e) {
-        reject(e);
-      }
-    })
-  }
-
-  try {
-    const data = qrcode.create(text, opts);
-    cb(null, renderFunc(data, canvas, opts));
-  } catch (e) {
-    cb(e);
-  }
-}
-
-var create = qrcode.create;
-var toCanvas = renderCanvas.bind(null, canvas.render);
-var toDataURL = renderCanvas.bind(null, canvas.renderToDataURL);
-
-// only svg for now.
-var toString_1 = renderCanvas.bind(null, function (data, _, opts) {
-  return svgTag.render(data, opts)
-});
-
-var browser = {
-	create: create,
-	toCanvas: toCanvas,
-	toDataURL: toDataURL,
-	toString: toString_1
-};
-
-const mobileRedirectCss = ".qr-canvas{max-height:60vh;max-width:80vw;text-align:center}.qr-canvas>canvas{width:100%;height:100%}";
-
-const MobileRedirect = class {
-  constructor(hostRef) {
-    registerInstance(this, hostRef);
-    this.apiErrorEvent = createEvent(this, "apiError", 7);
-    this.infoTextTop = undefined;
-    this.infoTextBottom = undefined;
-    this.contact = undefined;
-    this.invalidValue = undefined;
-    this.waitingMobile = undefined;
-    this.orderStatus = undefined;
-    this.redirectLink = undefined;
-    this.qrCode = undefined;
-    this.prefilledPhone = false;
-    this.baseComponent = new BaseComponent(FlowSteps.MobileRedirect);
-    this.baseComponent.setEventEmitter(this.apiErrorEvent);
-    this.invalidValue = false;
-    this.waitingMobile = false;
-  }
-  async componentWillLoad() {
-    Events.flowStarted();
-    this.infoTextTop = this.baseComponent.translations.MobileRedirectValues.InfoTop;
-    this.infoTextBottom = this.baseComponent.translations.MobileRedirectValues.InfoBottom;
-    let envUri = state.environment == 'QA' ? 'test' : 'ect';
-    let baseUri = state.hasIdBack ? 'https://onmd.id-kyc.com/' : 'https://onro.id-kyc.com/';
-    this.redirectLink = baseUri + envUri + '/mobileredirect?redirectId=' + state.redirectId;
-    if (state.phoneNumber && state.phoneNumber != '') {
-      this.contact = state.phoneNumber;
-      this.prefilledPhone = true;
-    }
-    var self = this;
-    browser.toDataURL(this.redirectLink, { type: 'image/png', errorCorrectionLevel: 'M', scale: 6 }, function (error, url) {
-      if (error)
-        console.error(error);
-      self.qrCode = url;
-    });
-  }
-  async componentDidLoad() {
-    await this.baseComponent.initialize();
-    await delay(5000);
-    await this.checkStatus();
-    while (this.orderStatus == OrderStatuses.Capturing || this.orderStatus == OrderStatuses.Waiting) {
-      await this.checkStatus();
-      await delay(5000);
-    }
-  }
-  async checkStatus() {
-    this.orderStatus = await this.baseComponent.apiCall.GetStatus(state.requestId);
-    if (this.orderStatus == OrderStatuses.FinishedCapturing) {
-      this.waitingMobile = false;
-      state.flowStatus = FlowStatus.COMPLETE;
-    }
-    if (this.orderStatus == OrderStatuses.NotFound) {
-      this.apiErrorEvent.emit({ message: 'No order was started for this process.' });
-    }
-    if (this.orderStatus == OrderStatuses.Capturing) {
-      this.infoTextTop = this.baseComponent.translations.MobileRedirectValues.InfoWaiting;
-      this.waitingMobile = true;
-    }
-    if (this.orderStatus == OrderStatuses.Aborted) {
-      this.waitingMobile = false;
-      this.infoTextTop = this.baseComponent.translations.MobileRedirectValues.InfoAborted;
-      Events.flowAborted();
-    }
-  }
-  async disconnectedCallback() {
-    await this.baseComponent.finalize();
-  }
-  async buttonClick() {
-    if (this.contact == '' || this.contact.length != 10) {
-      this.invalidValue == true;
-      return;
-    }
-    this.waitingMobile = true;
-    this.infoTextTop = this.baseComponent.translations.MobileRedirectValues.InfoWaiting;
-    try {
-      await this.baseComponent.apiCall.SendLink(this.redirectLink, this.contact);
-    }
-    catch (e) {
-      this.apiErrorEvent.emit(e);
-    }
-  }
-  handleChangeContact(ev) {
-    let value = ev.target ? ev.target.value : '';
-    this.contact = value.replace(/\D/g, '');
-    if (this.contact.length > 10) {
-      this.contact = this.contact.substring(0, 10);
-    }
-    this.invalidValue = this.contact.length != 10;
-    ev.target.value = this.contact;
-  }
-  render() {
-    return (h("div", { class: "container" }, h("div", { class: "row" }, h("div", { hidden: this.waitingMobile }, h("div", { class: "text-center" }, h("p", { class: "font-size-2" }, this.infoTextTop)), h("div", { class: "qr-canvas align-center" }, h("img", { src: this.qrCode })), h("div", { class: "text-center" }, h("p", { class: "font-size-2" }, this.infoTextBottom)), h("div", { class: "input-container mb-15" }, h("label", { class: "font-size-18 mb-1 color-red", hidden: this.invalidValue == false }, h("b", null, this.baseComponent.translations.MobileRedirectValues.Validation)), h("input", { type: "text", id: "codeInput", class: "main-input", disabled: this.prefilledPhone, value: this.contact, onInput: ev => this.handleChangeContact(ev) })), h("div", { class: "pos-relative" }, h("div", { class: "btn-buletin" }, h("button", { class: "main-button", onClick: () => this.buttonClick() }, "Trimite"), h("p", { class: "main-text font-size-18 text-right mb-0" }, this.baseComponent.translations.GlobalValues.FooterText)))), h("div", { hidden: this.waitingMobile == false }, h("div", { class: "text-center" }, h("p", { class: "font-size-2" }, this.infoTextTop))))));
-  }
-};
-MobileRedirect.style = mobileRedirectCss;
-
-export { MobileRedirect as mobile_redirect };