luhn-generator/update/node_modules/babel-plugin-minify-guarded-expressions/lib/index.js

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

"use strict";

const evaluate = require("babel-helper-evaluate-path");

function evaluateTruthy(path) {
  const res = evaluate(path);
  if (res.confident) return !!res.value;
}

module.exports = function ({
  types: t
}) {
  const flipExpressions = require("babel-helper-flip-expressions")(t);

  return {
    name: "minify-guarded-expressions",
    visitor: {
      // Convert guarded expressions
      // !a && b() --> a || b();
      // This could change the return result of the expression so we only do it
      // on things where the result is ignored.
      LogicalExpression: {
        enter: [function (path) {
          const node = path.node;
          const left = path.get("left");
          const right = path.get("right"); // issues - 171, 174, 176
          // we assume that it is returned/assigned/part of a bigger expression
          // or utilized somehow
          // we check if we shouldBail only when evaluating
          // the rightside of the expression;
          // if the left side is evaluated to be deterministic,
          // we can safely replace the entire expression

          const shouldBail = !path.parentPath.isExpressionStatement();

          if (node.operator === "&&") {
            const leftTruthy = evaluateTruthy(left);

            if (leftTruthy === false) {
              // Short-circuit
              path.replaceWith(node.left);
            } else if (leftTruthy === true && left.isPure()) {
              path.replaceWith(node.right);
            } else if (evaluateTruthy(right) === false && right.isPure() && !shouldBail) {
              path.replaceWith(node.left);
            }
          } else if (node.operator === "||") {
            const leftTruthy = evaluateTruthy(left);

            if (leftTruthy === false && left.isPure()) {
              path.replaceWith(node.right);
            } else if (leftTruthy === true) {
              // Short-circuit
              path.replaceWith(node.left);
            } else if (evaluateTruthy(right) === false && right.isPure() && !shouldBail) {
              path.replaceWith(node.left);
            }
          }
        }, function (path) {
          const node = path.node;

          if (flipExpressions.hasSeen(node)) {
            return;
          }

          if (!path.parentPath.isExpressionStatement() && !(path.parentPath.isSequenceExpression() && path.parentPath.parentPath.isExpressionStatement())) {
            return;
          } // Start counting savings from one since we can ignore the last
          // expression.


          if (flipExpressions.shouldFlip(node, 1)) {
            const newNode = flipExpressions.flip(node, true);
            path.replaceWith(newNode);
          }
        }]
      }
    }
  };
};