UNPKG

luhn-generator

Version:

A generator of numbers that passes the validation of Luhn algorithm or Luhn formula, also known as the 'modulus 10' or 'mod 10' algorithm

53 lines (42 loc) 1.39 kB
"use strict"; function createRegExpLiteral(args, prettify, t) { const evaluatedArgs = args.map(a => a.evaluate()); if (!evaluatedArgs.every(a => a.confident && typeof a.value === "string")) { return; } let pattern = evaluatedArgs.length >= 1 && evaluatedArgs[0].value !== "" ? evaluatedArgs[0].value : "(?:)"; const flags = evaluatedArgs.length >= 2 ? evaluatedArgs[1].value : ""; pattern = new RegExp(pattern).source; if (prettify) { pattern = pattern.replace(/\n/g, "\\n").replace(/\u2028/g, "\\u2028").replace(/\u2029/g, "\\u2029").replace(/[\b]/g, "[\\b]").replace(/\v/g, "\\v").replace(/\f/g, "\\f").replace(/\r/g, "\\r"); } pattern = pattern.replace(/\0/g, "\\0"); return t.regExpLiteral(pattern, flags); } function maybeReplaceWithRegExpLiteral(path, t) { if (!t.isIdentifier(path.node.callee, { name: "RegExp" })) { return; } const regExpLiteral = createRegExpLiteral(path.get("arguments"), true, t); if (regExpLiteral) { path.replaceWith(regExpLiteral); } } module.exports = function ({ types: t }) { return { name: "transform-regexp-constructors", visitor: { NewExpression(path) { maybeReplaceWithRegExpLiteral(path, t); }, CallExpression(path) { // equivalent to `new RegExp()` according to §21.2.3 maybeReplaceWithRegExpLiteral(path, t); } } }; };