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

44 lines (35 loc) 1.05 kB
"use strict"; module.exports = function ({ types: t }) { const INFINITY = t.binaryExpression("/", t.numericLiteral(1), t.numericLiteral(0)); return { name: "minify-infinity", visitor: { // Infinity -> 1 / 0 Identifier(path) { if (path.node.name !== "Infinity") { return; } // It's a referenced identifier if (path.scope.getBinding("Infinity")) { return; } if (path.parentPath.isObjectProperty({ key: path.node })) { return; } if (path.parentPath.isMemberExpression()) { return; } const bindingIds = path.parentPath.getBindingIdentifierPaths(); if (bindingIds["Infinity"] === path && // ObjectProperty is common for ObjectExpression and ObjectPattern and only // one of them is a Binding, the other is simply a reference !path.parentPath.parentPath.isObjectExpression()) { return; } path.replaceWith(INFINITY); } } }; };