Use 'grandparent' instead of 'gramps'

Created with:

   replace_string ramps randparent

Dropped the leading 'g' so I don't have to deal with case.

See http://geekfeminism.wikia.com/wiki/Nonsexist_language

Same idea as cl/84045417 (a2c0068)
-------------
Created by MOE: http://code.google.com/p/moe-java
MOE_MIGRATED_REVID=99516865

src/com/google/javascript/jscomp/CallGraph.java

@@ -371,9 +371,9 @@ private void updateFunctionForUse(Function function, Node useNode) {
       // but we have to check for using them in .call and .apply.
 
       if (useParent.isGetProp()) {
-        Node gramps = useParent.getParent();
-        if (NodeUtil.isFunctionObjectApply(gramps) ||
-            NodeUtil.isFunctionObjectCall(gramps)) {
+        Node grandparent = useParent.getParent();
+        if (NodeUtil.isFunctionObjectApply(grandparent) ||
+            NodeUtil.isFunctionObjectCall(grandparent)) {
           function.isExposedToCallOrApply = true;
         }
       }

src/com/google/javascript/jscomp/CheckGlobalThis.java

@@ -117,9 +117,9 @@ public boolean shouldTraverse(NodeTraversal t, Node n, Node parent) {
       }
 
       // Don't traverse functions that are getting lent to a prototype.
-      Node gramps = parent.getParent();
+      Node grandparent = parent.getParent();
       if (NodeUtil.isObjectLitKey(parent)) {
-        JSDocInfo maybeLends = gramps.getJSDocInfo();
+        JSDocInfo maybeLends = grandparent.getJSDocInfo();
         if (maybeLends != null &&
             maybeLends.getLendsName() != null &&
             maybeLends.getLendsName().endsWith(".prototype")) {

src/com/google/javascript/jscomp/CollapseProperties.java

@@ -542,8 +542,8 @@ private void flattenSimpleStubDeclaration(Name name, String alias) {
 
     Preconditions.checkState(ref.node.getParent().isExprResult());
     Node parent = ref.node.getParent();
-    Node gramps = parent.getParent();
-    gramps.replaceChild(parent, varNode);
+    Node grandparent = parent.getParent();
+    grandparent.replaceChild(parent, varNode);
     compiler.reportCodeChange();
   }
 
@@ -737,19 +737,19 @@ private void collapseDeclarationOfNameAndDescendants(Name n, String alias) {
   private void updateSimpleDeclaration(String alias, Name refName, Ref ref) {
     Node rvalue = ref.node.getNext();
     Node parent = ref.node.getParent();
-    Node gramps = parent.getParent();
-    Node greatGramps = gramps.getParent();
+    Node grandparent = parent.getParent();
+    Node greatGrandparent = grandparent.getParent();
 
     if (rvalue != null && rvalue.isFunction()) {
       checkForHosedThisReferences(rvalue, refName.docInfo, refName);
     }
 
     // Create the new alias node.
-    Node nameNode = NodeUtil.newName(compiler, alias, gramps.getFirstChild(),
+    Node nameNode = NodeUtil.newName(compiler, alias, grandparent.getFirstChild(),
         refName.getFullName());
     NodeUtil.copyNameAnnotations(ref.node.getLastChild(), nameNode);
 
-    if (gramps.isExprResult()) {
+    if (grandparent.isExprResult()) {
       // BEFORE: a.b.c = ...;
       //   exprstmt
       //     assign
@@ -769,7 +769,7 @@ private void updateSimpleDeclaration(String alias, Name refName, Ref ref) {
       nameNode.addChildToFront(rvalue);
 
       Node varNode = IR.var(nameNode);
-      greatGramps.replaceChild(gramps, varNode);
+      greatGrandparent.replaceChild(grandparent, varNode);
     } else {
       // This must be a complex assignment.
       Preconditions.checkNotNull(ref.getTwin());
@@ -781,8 +781,8 @@ private void updateSimpleDeclaration(String alias, Name refName, Ref ref) {
       // var x$y;
       // ... (x$y = 3);
 
-      Node current = gramps;
-      Node currentParent = gramps.getParent();
+      Node current = grandparent;
+      Node currentParent = grandparent.getParent();
       for (; !currentParent.isScript() &&
              !currentParent.isBlock();
            current = currentParent,
@@ -866,13 +866,13 @@ private void updateObjLitOrFunctionDeclarationAtAssignNode(
     Node rvalue = ref.node.getNext();
     Node varNode = new Node(Token.VAR);
     Node varParent = ref.node.getAncestor(3);
-    Node gramps = ref.node.getAncestor(2);
+    Node grandparent = ref.node.getAncestor(2);
     boolean isObjLit = rvalue.isObjectLit();
     boolean insertedVarNode = false;
 
     if (isObjLit && n.canEliminate()) {
       // Eliminate the object literal altogether.
-      varParent.replaceChild(gramps, varNode);
+      varParent.replaceChild(grandparent, varNode);
       ref.node = null;
       insertedVarNode = true;
 
@@ -898,7 +898,7 @@ private void updateObjLitOrFunctionDeclarationAtAssignNode(
       }
       varNode.addChildToBack(nameNode);
       nameNode.addChildToFront(rvalue);
-      varParent.replaceChild(gramps, varNode);
+      varParent.replaceChild(grandparent, varNode);
 
       // Update the node ancestry stored in the reference.
       ref.node = nameNode;
@@ -963,23 +963,23 @@ private void updateObjLitOrFunctionDeclarationAtVarNode(
     String name = ref.node.getString();
     Node rvalue = ref.node.getFirstChild();
     Node varNode = ref.node.getParent();
-    Node gramps = varNode.getParent();
+    Node grandparent = varNode.getParent();
 
     boolean isObjLit = rvalue.isObjectLit();
     int numChanges = 0;
 
     if (isObjLit) {
       numChanges += declareVarsForObjLitValues(
-          n, name, rvalue, varNode, gramps.getChildBefore(varNode),
-          gramps);
+          n, name, rvalue, varNode, grandparent.getChildBefore(varNode),
+          grandparent);
     }
 
-    numChanges += addStubsForUndeclaredProperties(n, name, gramps, varNode);
+    numChanges += addStubsForUndeclaredProperties(n, name, grandparent, varNode);
 
     if (isObjLit && n.canEliminate()) {
       varNode.removeChild(ref.node);
       if (!varNode.hasChildren()) {
-        gramps.removeChild(varNode);
+        grandparent.removeChild(varNode);
       }
       numChanges++;
 

src/com/google/javascript/jscomp/CrossModuleCodeMotion.java

@@ -368,7 +368,7 @@ private boolean maybeProcessDeclaration(
       ReferenceCollectingCallback collector, Reference ref, NamedInfo info) {
     Node name = ref.getNode();
     Node parent = name.getParent();
-    Node gramps = parent.getParent();
+    Node grandparent = parent.getParent();
     switch (parent.getType()) {
       case Token.VAR:
         if (canMoveValue(collector, ref.getScope(), name.getFirstChild())) {
@@ -411,7 +411,7 @@ private boolean maybeProcessDeclaration(
         return false;
 
       case Token.CALL:
-        if (NodeUtil.isExprCall(gramps)) {
+        if (NodeUtil.isExprCall(grandparent)) {
           SubclassRelationship relationship =
               compiler.getCodingConvention().getClassesDefinedByCall(parent);
           if (relationship != null &&

src/com/google/javascript/jscomp/ExpressionDecomposer.java

@@ -401,8 +401,8 @@ private Node extractConditional(
       // Only conditionals that are the direct child of an expression statement
       // don't need results, for those simply replace the expression statement.
       Preconditions.checkArgument(parent.isExprResult());
-      Node gramps = parent.getParent();
-      gramps.replaceChild(parent, ifNode);
+      Node grandparent = parent.getParent();
+      grandparent.replaceChild(parent, ifNode);
     }
 
     return ifNode;

src/com/google/javascript/jscomp/GlobalNamespace.java

@@ -363,8 +363,8 @@ public void collect(JSModule module, Scope scope, Node n) {
               case Token.GETPROP:
                 return;
               case Token.FUNCTION:
-                Node gramps = parent.getParent();
-                if (gramps == null || NodeUtil.isFunctionExpression(parent)) {
+                Node grandparent = parent.getParent();
+                if (grandparent == null || NodeUtil.isFunctionExpression(parent)) {
                   return;
                 }
                 isSet = true;
@@ -461,40 +461,40 @@ String getNameForObjLitKey(Node n) {
       Node parent = n.getParent();
       Preconditions.checkState(parent.isObjectLit());
 
-      Node gramps = parent.getParent();
-      if (gramps == null) {
+      Node grandparent = parent.getParent();
+      if (grandparent == null) {
         return null;
       }
 
-      Node greatGramps = gramps.getParent();
+      Node greatGrandparent = grandparent.getParent();
       String name;
-      switch (gramps.getType()) {
+      switch (grandparent.getType()) {
         case Token.NAME:
           // VAR
-          //   NAME (gramps)
+          //   NAME (grandparent)
           //     OBJLIT (parent)
           //       STRING (n)
-          if (greatGramps == null || !NodeUtil.isNameDeclaration(greatGramps)) {
+          if (greatGrandparent == null || !NodeUtil.isNameDeclaration(greatGrandparent)) {
             return null;
           }
-          name = gramps.getString();
+          name = grandparent.getString();
           break;
         case Token.ASSIGN:
-          // ASSIGN (gramps)
+          // ASSIGN (grandparent)
           //   NAME|GETPROP
           //   OBJLIT (parent)
           //     STRING (n)
-          Node lvalue = gramps.getFirstChild();
+          Node lvalue = grandparent.getFirstChild();
           name = lvalue.getQualifiedName();
           break;
         case Token.STRING_KEY:
           // OBJLIT
-          //   STRING (gramps)
+          //   STRING (grandparent)
           //     OBJLIT (parent)
           //       STRING (n)
-          if (greatGramps != null &&
-              greatGramps.isObjectLit()) {
-            name = getNameForObjLitKey(gramps);
+          if (greatGrandparent != null &&
+              greatGrandparent.isObjectLit()) {
+            name = getNameForObjLitKey(grandparent);
           } else {
             return null;
           }

src/com/google/javascript/jscomp/InferJSDocInfo.java

@@ -109,7 +109,7 @@ public void visit(NodeTraversal t, Node n, Node parent) {
         // /** ... */ x = function () { ... }
         // 3) A NAME parent.
         // var x, /** ... */ y = function() { ... }
-        // 4) A VAR gramps.
+        // 4) A VAR grandparent.
         // /** ... */ var x = function() { ... }
         docInfo = n.getJSDocInfo();
         if (docInfo == null &&

src/com/google/javascript/jscomp/InlineFunctions.java

@@ -475,9 +475,9 @@ static boolean isCandidateUsage(Node name) {
          && name == parent.getFirstChild()
          && name.getNext().isString()
          && name.getNext().getString().equals("call")) {
-      Node gramps = name.getAncestor(2);
-      if (gramps.isCall()
-          && gramps.getFirstChild() == parent) {
+      Node grandparent = name.getAncestor(2);
+      if (grandparent.isCall()
+          && grandparent.getFirstChild() == parent) {
         // Yep, a ".call".
         return true;
       }

src/com/google/javascript/jscomp/InlineObjectLiterals.java

@@ -158,22 +158,22 @@ private boolean isInlinableObject(List<Reference> refs) {
       for (Reference ref : refs) {
         Node name = ref.getNode();
         Node parent = ref.getParent();
-        Node gramps = ref.getGrandparent();
+        Node grandparent = ref.getGrandparent();
 
         // Ignore most indirect references, like x.y (but not x.y(),
         // since the function referenced by y might reference 'this').
         //
         if (parent.isGetProp()) {
           Preconditions.checkState(parent.getFirstChild() == name);
           // A call target may be using the object as a 'this' value.
-          if (gramps.isCall()
-              && gramps.getFirstChild() == parent) {
+          if (grandparent.isCall()
+              && grandparent.getFirstChild() == parent) {
             return false;
           }
 
           // Deleting a property has different semantics from deleting
           // a variable, so deleted properties should not be inlined.
-          if (gramps.isDelProp()) {
+          if (grandparent.isDelProp()) {
             return false;
           }
 
@@ -187,7 +187,7 @@ private boolean isInlinableObject(List<Reference> refs) {
           // isn't a perfect algorithm, but it should catch most cases.
           String propName = parent.getLastChild().getString();
           if (!validProperties.contains(propName)) {
-            if (NodeUtil.isVarOrSimpleAssignLhs(parent, gramps)) {
+            if (NodeUtil.isVarOrSimpleAssignLhs(parent, grandparent)) {
               validProperties.add(propName);
             } else {
               return false;

src/com/google/javascript/jscomp/MoveFunctionDeclarations.java

@@ -69,8 +69,8 @@ public void process(Node externs, Node root) {
 
   @Override
   public boolean shouldTraverse(NodeTraversal t, Node n, Node parent) {
-    Node gramps = n.getAncestor(2);
-    return gramps == null || !gramps.isScript();
+    Node grandparent = n.getAncestor(2);
+    return grandparent == null || !grandparent.isScript();
   }
 
   @Override

src/com/google/javascript/jscomp/NameAnalyzer.java

@@ -336,13 +336,13 @@ private class PrototypeSetNode extends JsNameRefNode {
     }
 
     @Override public void remove() {
-      Node gramps = parent.getParent();
-      if (gramps.isExprResult()) {
+      Node grandparent = parent.getParent();
+      if (grandparent.isExprResult()) {
         // name.prototype.foo = function() { ... };
-        changeProxy.removeChild(gramps.getParent(), gramps);
+        changeProxy.removeChild(grandparent.getParent(), grandparent);
       } else {
         // ... name.prototype.foo = function() { ... } ...
-        changeProxy.replaceWith(gramps, parent,
+        changeProxy.replaceWith(grandparent, parent,
                                 parent.getLastChild().detachFromParent());
       }
     }
@@ -378,7 +378,7 @@ Node getParent() {
       return node.getParent();
     }
 
-    Node getGramps() {
+    Node getGrandparent() {
       return node.getParent() == null ? null : node.getParent().getParent();
     }
   }
@@ -406,7 +406,7 @@ public void remove() {
       Preconditions.checkState(node.isCall());
       Node parent = getParent();
       if (parent.isExprResult()) {
-        changeProxy.removeChild(getGramps(), parent);
+        changeProxy.removeChild(getGrandparent(), parent);
       } else {
         changeProxy.replaceWith(parent, node, IR.voidNode(IR.number(0)));
       }
@@ -433,7 +433,7 @@ private class InstanceOfCheckNode extends SpecialReferenceNode {
 
     @Override
     public void remove() {
-      changeProxy.replaceWith(getGramps(), getParent(), IR.falseNode());
+      changeProxy.replaceWith(getGrandparent(), getParent(), IR.falseNode());
     }
   }
 

src/com/google/javascript/jscomp/NodeUtil.java

@@ -3780,9 +3780,9 @@ static boolean isExpressionResultUsed(Node expr) {
       case Token.OR:
         return (expr == parent.getFirstChild()) || isExpressionResultUsed(parent);
       case Token.COMMA:
-        Node gramps = parent.getParent();
-        if (gramps.isCall() &&
-            parent == gramps.getFirstChild()) {
+        Node grandparent = parent.getParent();
+        if (grandparent.isCall() &&
+            parent == grandparent.getFirstChild()) {
           // Semantically, a direct call to eval is different from an indirect
           // call to an eval. See ECMA-262 S15.1.2.1. So it's OK for the first
           // expression to a comma to be a no-op if it's used to indirect

src/com/google/javascript/jscomp/Normalize.java

@@ -790,7 +790,7 @@ public void onRedeclaration(
      *      the scope creator, as the next node of interest is the parent's
      *      next sibling.
      */
-    private void replaceVarWithAssignment(Node n, Node parent, Node gramps) {
+    private void replaceVarWithAssignment(Node n, Node parent, Node grandparent) {
       if (n.hasChildren()) {
         // The  *  is being initialize, preserve the new value.
         parent.removeChild(n);
@@ -800,19 +800,19 @@ private void replaceVarWithAssignment(Node n, Node parent, Node gramps) {
         Node replacement = IR.assign(n, value);
         replacement.setJSDocInfo(parent.getJSDocInfo());
         replacement.copyInformationFrom(parent);
-        gramps.replaceChild(parent, NodeUtil.newExpr(replacement));
+        grandparent.replaceChild(parent, NodeUtil.newExpr(replacement));
       } else {
         // It is an empty reference remove it.
-        if (NodeUtil.isStatementBlock(gramps)) {
-          gramps.removeChild(parent);
-        } else if (gramps.isFor()) {
+        if (NodeUtil.isStatementBlock(grandparent)) {
+          grandparent.removeChild(parent);
+        } else if (grandparent.isFor()) {
           // This is the "for (var a in b)..." case.  We don't need to worry
           // about initializers in "for (var a;;)..." as those are moved out
           // as part of the other normalizations.
           parent.removeChild(n);
-          gramps.replaceChild(parent, n);
+          grandparent.replaceChild(parent, n);
         } else {
-          Preconditions.checkState(gramps.isLabel());
+          Preconditions.checkState(grandparent.isLabel());
           // We should never get here. LABELs with a single VAR statement should
           // already have been normalized to have a BLOCK.
           throw new IllegalStateException("Unexpected LABEL");