@cardash/unambiguous-alphanumerics/out/index.js

Generates unambiguous alphanumeric strings from a provided number or base-10 string, and reverse. Also validates a given string as an unambiguous string.

'use strict';

var BigNumber = require('bignumber.js');
// Allowed characters
var unambiguousAlphanumerics = ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'C', 'D', 'E', 'F', 'G', 'H', 'J', 'K', 'L', 'M', 'N', 'P', 'R', 'U', 'V', 'W', 'X', 'Y'];

// Character mapping back to integer
var reverseUnambiguousAlphanumerics = {
  '0': 0,
  '1': 1,
  '2': 2,
  '3': 3,
  '4': 4,
  '5': 5,
  '6': 6,
  '7': 7,
  '8': 8,
  '9': 9,
  'C': 10,
  'D': 11,
  'E': 12,
  'F': 13,
  'G': 14,
  'H': 15,
  'J': 16,
  'K': 17,
  'L': 18,
  'M': 19,
  'N': 20,
  'P': 21,
  'R': 22,
  'U': 23,
  'V': 24,
  'W': 25,
  'X': 26,
  'Y': 27

  // Bignum-based base conversion from lower base to higher base
};var encode = function encode(numOrStr) {
  var bigNum = new BigNumber(numOrStr);
  var outStr = '';
  while (bigNum.isGreaterThan(0)) {
    var mod = bigNum.modulo(28).toNumber();
    outStr = unambiguousAlphanumerics[mod] + outStr;
    bigNum = bigNum.dividedToIntegerBy(28);
  }
  return outStr;
};

var decode = function decode(unambiguousStr) {
  var bigNum = new BigNumber(0);
  for (var i = 0; i < unambiguousStr.length; i++) {
    bigNum = bigNum.multipliedBy(28);
    bigNum = bigNum.plus(reverseUnambiguousAlphanumerics[unambiguousStr[i]]);
  }
  return bigNum.toNumber();
};

var verify = function verify(uStr) {
  return uStr.split('').every(function (chr) {
    return unambiguousAlphanumerics.includes(chr);
  });
};

module.exports = {
  unambiguousAlphanumerics: unambiguousAlphanumerics,
  encode: encode,
  decode: decode,
  verify: verify
};