Code coverage report for 6to5/generation/node/parentheses.js

Statements: 91.53% (54 / 59)      Branches: 86.15% (56 / 65)      Functions: 100% (10 / 10)      Lines: 91.53% (54 / 59)      Ignored: none     

All files » 6to5/generation/node/ » parentheses.js
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 1441 1   1   1                       10 23       1 408       408 20     388       388 97 97   97 97   97 21     76 1         1 309   7 4       3 3         1 20         1     19 5         14     1 9                 1 12     1 157     1   585 3       582         582 70       1   998 1     997 6     991       991       991 36     955    
var t = require("../../types");
var _ = require("lodash");
 
var PRECEDENCE = {};
 
_.each([
  ["||"],
  ["&&"],
  ["|"],
  ["^"],
  ["&"],
  ["==", "===", "!=", "!=="],
  ["<", ">", "<=", ">=", "in", "instanceof"],
  [">>", "<<", ">>>"],
  ["+", "-"],
  ["*", "/", "%"]
], function (tier, i) {
  _.each(tier, function (op) {
    PRECEDENCE[op] = i;
  });
});
 
exports.Binary = function (node, parent) {
  Iif (t.isCallExpression(parent) && parent.callee === node) {
    return true;
  }
 
  if (t.isUnaryLike(parent)) {
    return true;
  }
 
  Iif (t.isMemberExpression(parent) && parent.object === node) {
    return true;
  }
 
  if (t.isBinary(parent)) {
    var parentOp  = parent.operator;
    var parentPos = PRECEDENCE[parentOp];
 
    var nodeOp = node.operator;
    var nodePos = PRECEDENCE[nodeOp];
 
    if (parentPos > nodePos) {
      return true;
    }
 
    if (parentPos === nodePos && parent.right === node) {
      return true;
    }
  }
};
 
exports.BinaryExpression = function (node, parent) {
  if (node.operator === "in") {
    // var i = (1 in []);
    if (t.isVariableDeclarator(parent)) {
      return true;
    }
 
    // for ((1 in []);;);
    Eif (t.isFor(parent)) {
      return true;
    }
  }
};
 
exports.SequenceExpression = function (node, parent) {
  if (t.isForStatement(parent)) {
    // Although parentheses wouldn't hurt around sequence
    // expressions in the head of for loops, traditional style
    // dictates that e.g. i++, j++ should not be wrapped with
    // parentheses.
    return false;
  }
 
  if (t.isExpressionStatement(parent) && parent.expression === node) {
    return false;
  }
 
  // Otherwise err on the side of overparenthesization, adding
  // explicit exceptions above if this proves overzealous.
  return true;
};
 
exports.YieldExpression = function (node, parent) {
  return t.isBinary(parent) ||
         t.isUnaryLike(parent) ||
         t.isCallExpression(parent) ||
         t.isMemberExpression(parent) ||
         t.isNewExpression(parent) ||
         t.isConditionalExpression(parent) ||
         t.isYieldExpression(parent);
};
 
exports.ClassExpression = function (node, parent) {
  return t.isExpressionStatement(parent);
};
 
exports.UnaryLike = function (node, parent) {
  return t.isMemberExpression(parent) && parent.object === node;
};
 
exports.FunctionExpression = function (node, parent) {
  // function () {};
  if (t.isExpressionStatement(parent)) {
    return true;
  }
 
  // (function test() {}).name;
  Iif (t.isMemberExpression(parent) && parent.object === node) {
    return true;
  }
 
  // (function () {})();
  if (t.isCallExpression(parent) && parent.callee === node) {
    return true;
  }
};
 
exports.AssignmentExpression =
exports.ConditionalExpression = function (node, parent) {
  if (t.isUnaryLike(parent)) {
    return true;
  }
 
  if (t.isBinary(parent)) {
    return true;
  }
 
  Iif (t.isCallExpression(parent) && parent.callee === node) {
    return true;
  }
 
  Iif (t.isConditionalExpression(parent) && parent.test === node) {
    return true;
  }
 
  if (t.isMemberExpression(parent) && parent.object === node) {
    return true;
  }
 
  return false;
};