Run dartfmt on js_ast

pkg/js_ast/lib/src/printer.dart

 // Copyright (c) 2012, the Dart project authors.  Please see the AUTHORS file
 // for details. All rights reserved. Use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE file.
 
 part of js_ast;
 
-
 typedef String Renamer(Name);
 
 class JavaScriptPrintingOptions {
   final bool shouldCompressOutput;
   final bool minifyLocalVariables;
   final bool preferSemicolonToNewlineInMinifiedOutput;
   final Renamer renamerForNames;
 
   JavaScriptPrintingOptions(
       {this.shouldCompressOutput: false,
-       this.minifyLocalVariables: false,
-       this.preferSemicolonToNewlineInMinifiedOutput: false,
-       this.renamerForNames: identityRenamer});
+      this.minifyLocalVariables: false,
+      this.preferSemicolonToNewlineInMinifiedOutput: false,
+      this.renamerForNames: identityRenamer});
 
   static String identityRenamer(Name name) => name.name;
 }
 
-
 /// An environment in which JavaScript printing is done.  Provides emitting of
 /// text and pre- and post-visit callbacks.
 abstract class JavaScriptPrintingContext {
   /// Signals an error.  This should happen only for serious internal errors.
-  void error(String message) { throw message; }
+  void error(String message) {
+    throw message;
+  }
 
   /// Adds [string] to the output.
   void emit(String string);
 
   /// Callback for the start of printing of [node]. [startPosition] is the
   /// position of the first non-whitespace character of [node].
   ///
   /// [enterNode] is called in pre-traversal order.
   void enterNode(Node node, int startPosition) {}
 
   /// Callback for the end of printing of [node]. [startPosition] is the
   /// position of the first non-whitespace character of [node] (also provided
   /// in the [enterNode] callback), [endPosition] is the position immediately
   /// following the last character of [node]. [closingPosition] is the
   /// position of the ending delimiter of [node]. This is only provided for
   /// [Fun] nodes and is `null` otherwise.
   ///
   /// [enterNode] is called in post-traversal order.
-  void exitNode(Node node,
-                int startPosition,
-                int endPosition,
-                int closingPosition) {}
+  void exitNode(
+      Node node, int startPosition, int endPosition, int closingPosition) {}
 }
 
 /// A simple implementation of [JavaScriptPrintingContext] suitable for tests.
 class SimpleJavaScriptPrintingContext extends JavaScriptPrintingContext {
   final StringBuffer buffer = new StringBuffer();
 
   void emit(String string) {
     buffer.write(string);
   }
 
   String getText() => buffer.toString();
 }
 
-
 class Printer implements NodeVisitor {
   final JavaScriptPrintingOptions options;
   final JavaScriptPrintingContext context;
   final bool shouldCompressOutput;
   final DanglingElseVisitor danglingElseVisitor;
   final LocalNamer localNamer;
 
   int _charCount = 0;
   bool inForInit = false;
   bool atStatementBegin = false;
   bool pendingSemicolon = false;
   bool pendingSpace = false;
 
   // The current indentation level.
   int _indentLevel = 0;
   // A cache of all indentation strings used so far.
   List<String> _indentList = <String>[""];
 
   static final identifierCharacterRegExp = new RegExp(r'^[a-zA-Z_0-9$]');
   static final expressionContinuationRegExp = new RegExp(r'^[-+([]');
 
-  Printer(JavaScriptPrintingOptions options,
-          JavaScriptPrintingContext context)
+  Printer(JavaScriptPrintingOptions options, JavaScriptPrintingContext context)
       : options = options,
         context = context,
         shouldCompressOutput = options.shouldCompressOutput,
         danglingElseVisitor = new DanglingElseVisitor(context),
-        localNamer = determineRenamer(options.shouldCompressOutput,
-                                      options.minifyLocalVariables);
+        localNamer = determineRenamer(
+            options.shouldCompressOutput, options.minifyLocalVariables);
 
-  static LocalNamer determineRenamer(bool shouldCompressOutput,
-                                     bool allowVariableMinification) {
+  static LocalNamer determineRenamer(
+      bool shouldCompressOutput, bool allowVariableMinification) {
     return (shouldCompressOutput && allowVariableMinification)
-        ? new MinifyRenamer() : new IdentityNamer();
+        ? new MinifyRenamer()
+        : new IdentityNamer();
   }
 
-
   // The current indentation string.
   String get indentation {
     // Lazily add new indentation strings as required.
     while (_indentList.length <= _indentLevel) {
       _indentList.add(_indentList.last + "  ");
     }
     return _indentList[_indentLevel];
   }
 
   void indentMore() {
@@ skipping 115 matching lines @@
     currentNode = currentNode.exitNode(context, _charCount);
   }
 
   void visit(Node node) {
     startNode(node);
     node.accept(this);
     endNode(node);
   }
 
   void visitCommaSeparated(List<Node> nodes, int hasRequiredType,
-                           {bool newInForInit, bool newAtStatementBegin}) {
+      {bool newInForInit, bool newAtStatementBegin}) {
     for (int i = 0; i < nodes.length; i++) {
       if (i != 0) {
         atStatementBegin = false;
         out(",");
         spaceOut();
       }
       visitNestedExpression(nodes[i], hasRequiredType,
-                            newInForInit: newInForInit,
-                            newAtStatementBegin: newAtStatementBegin);
+          newInForInit: newInForInit, newAtStatementBegin: newAtStatementBegin);
     }
   }
 
   void visitAll(List<Node> nodes) {
     nodes.forEach(visit);
   }
 
   @override
   void visitProgram(Program program) {
     if (program.body.isNotEmpty) {
@@ skipping 59 matching lines @@
 
   @override
   void visitBlock(Block block) {
     blockOut(block, shouldIndent: true, needsNewline: true);
   }
 
   @override
   void visitExpressionStatement(ExpressionStatement node) {
     indent();
     visitNestedExpression(node.expression, EXPRESSION,
-                          newInForInit: false, newAtStatementBegin: true);
+        newInForInit: false, newAtStatementBegin: true);
     outSemicolonLn();
   }
 
   @override
   void visitEmptyStatement(EmptyStatement node) {
     outIndentLn(";");
   }
 
   void ifOut(If node, bool shouldIndent) {
     Statement then = unwrapBlockIfSingleStatement(node.then);
     Statement elsePart = node.otherwise;
     bool hasElse = node.hasElse;
 
     // Handle dangling elses and a work-around for Android 4.0 stock browser.
     // Android 4.0 requires braces for a single do-while in the `then` branch.
     // See issue 10923.
     if (hasElse) {
       bool needsBraces = then.accept(danglingElseVisitor) || then is Do;
       if (needsBraces) {
         then = new Block(<Statement>[then]);
       }
     }
     if (shouldIndent) indent();
     out("if");
     spaceOut();
     out("(");
     visitNestedExpression(node.condition, EXPRESSION,
-                          newInForInit: false, newAtStatementBegin: false);
+        newInForInit: false, newAtStatementBegin: false);
     out(")");
     bool thenWasBlock =
         blockBody(then, needsSeparation: false, needsNewline: !hasElse);
     if (hasElse) {
       if (thenWasBlock) {
         spaceOut();
       } else {
         indent();
       }
       out("else");
       if (elsePart is If) {
         pendingSpace = true;
         startNode(elsePart);
         ifOut(elsePart, false);
         endNode(elsePart);
       } else {
         blockBody(unwrapBlockIfSingleStatement(elsePart),
-                  needsSeparation: true, needsNewline: true);
+            needsSeparation: true, needsNewline: true);
       }
     }
   }
 
   @override
   void visitIf(If node) {
     ifOut(node, true);
   }
 
   @override
   void visitFor(For loop) {
     outIndent("for");
     spaceOut();
     out("(");
     if (loop.init != null) {
       visitNestedExpression(loop.init, EXPRESSION,
-                            newInForInit: true, newAtStatementBegin: false);
+          newInForInit: true, newAtStatementBegin: false);
     }
     out(";");
     if (loop.condition != null) {
       spaceOut();
       visitNestedExpression(loop.condition, EXPRESSION,
-                            newInForInit: false, newAtStatementBegin: false);
+          newInForInit: false, newAtStatementBegin: false);
     }
     out(";");
     if (loop.update != null) {
       spaceOut();
       visitNestedExpression(loop.update, EXPRESSION,
-                            newInForInit: false, newAtStatementBegin: false);
+          newInForInit: false, newAtStatementBegin: false);
     }
     out(")");
     blockBody(unwrapBlockIfSingleStatement(loop.body),
-              needsSeparation: false, needsNewline: true);
+        needsSeparation: false, needsNewline: true);
   }
 
   @override
   void visitForIn(ForIn loop) {
     outIndent("for");
     spaceOut();
     out("(");
     visitNestedExpression(loop.leftHandSide, EXPRESSION,
-                          newInForInit: true, newAtStatementBegin: false);
+        newInForInit: true, newAtStatementBegin: false);
     out(" in");
     pendingSpace = true;
     visitNestedExpression(loop.object, EXPRESSION,
-                          newInForInit: false, newAtStatementBegin: false);
+        newInForInit: false, newAtStatementBegin: false);
     out(")");
     blockBody(unwrapBlockIfSingleStatement(loop.body),
-              needsSeparation: false, needsNewline: true);
+        needsSeparation: false, needsNewline: true);
   }
 
   @override
   void visitWhile(While loop) {
     outIndent("while");
     spaceOut();
     out("(");
     visitNestedExpression(loop.condition, EXPRESSION,
-                          newInForInit: false, newAtStatementBegin: false);
+        newInForInit: false, newAtStatementBegin: false);
     out(")");
     blockBody(unwrapBlockIfSingleStatement(loop.body),
-              needsSeparation: false, needsNewline: true);
+        needsSeparation: false, needsNewline: true);
   }
 
   @override
   void visitDo(Do loop) {
     outIndent("do");
     if (blockBody(unwrapBlockIfSingleStatement(loop.body),
-                  needsSeparation: true, needsNewline: false)) {
+        needsSeparation: true, needsNewline: false)) {
       spaceOut();
     } else {
       indent();
     }
     out("while");
     spaceOut();
     out("(");
     visitNestedExpression(loop.condition, EXPRESSION,
-                          newInForInit: false, newAtStatementBegin: false);
+        newInForInit: false, newAtStatementBegin: false);
     out(")");
     outSemicolonLn();
   }
 
   @override
   void visitContinue(Continue node) {
     if (node.targetLabel == null) {
       outIndent("continue");
     } else {
       outIndent("continue ${node.targetLabel}");
@@ skipping 12 matching lines @@
   }
 
   @override
   void visitReturn(Return node) {
     if (node.value == null) {
       outIndent("return");
     } else {
       outIndent("return");
       pendingSpace = true;
       visitNestedExpression(node.value, EXPRESSION,
-                            newInForInit: false, newAtStatementBegin: false);
+          newInForInit: false, newAtStatementBegin: false);
     }
     outSemicolonLn();
   }
 
   @override
   void visitDartYield(DartYield node) {
     if (node.hasStar) {
       outIndent("yield*");
     } else {
       outIndent("yield");
     }
     pendingSpace = true;
     visitNestedExpression(node.expression, EXPRESSION,
-                          newInForInit: false, newAtStatementBegin: false);
+        newInForInit: false, newAtStatementBegin: false);
     outSemicolonLn();
   }
 
   @override
   void visitThrow(Throw node) {
     outIndent("throw");
     pendingSpace = true;
     visitNestedExpression(node.expression, EXPRESSION,
-                          newInForInit: false, newAtStatementBegin: false);
+        newInForInit: false, newAtStatementBegin: false);
     outSemicolonLn();
   }
 
   @override
   void visitTry(Try node) {
     outIndent("try");
     blockBody(node.body, needsSeparation: true, needsNewline: false);
     if (node.catchPart != null) {
       visit(node.catchPart);
     }
     if (node.finallyPart != null) {
       spaceOut();
       out("finally");
       blockBody(node.finallyPart, needsSeparation: true, needsNewline: true);
     } else {
       lineOut();
     }
   }
 
   @override
   void visitCatch(Catch node) {
     spaceOut();
     out("catch");
     spaceOut();
     out("(");
     visitNestedExpression(node.declaration, EXPRESSION,
-                          newInForInit: false, newAtStatementBegin: false);
+        newInForInit: false, newAtStatementBegin: false);
     out(")");
     blockBody(node.body, needsSeparation: false, needsNewline: false);
   }
 
   @override
   void visitSwitch(Switch node) {
     outIndent("switch");
     spaceOut();
     out("(");
     visitNestedExpression(node.key, EXPRESSION,
-                          newInForInit: false, newAtStatementBegin: false);
+        newInForInit: false, newAtStatementBegin: false);
     out(")");
     spaceOut();
     outLn("{");
     indentMore();
     visitAll(node.cases);
     indentLess();
     outIndentLn("}");
   }
 
   @override
   void visitCase(Case node) {
     outIndent("case");
     pendingSpace = true;
     visitNestedExpression(node.expression, EXPRESSION,
-                          newInForInit: false, newAtStatementBegin: false);
+        newInForInit: false, newAtStatementBegin: false);
     outLn(":");
     if (!node.body.statements.isEmpty) {
       indentMore();
       blockOutWithoutBraces(node.body);
       indentLess();
     }
   }
 
   @override
   void visitDefault(Default node) {
@@ skipping 20 matching lines @@
     outIndent("${node.label}:");
     blockBody(body, needsSeparation: false, needsNewline: true);
   }
 
   int functionOut(Fun fun, Node name, VarCollector vars) {
     out("function");
     if (name != null) {
       out(" ");
       // Name must be a [Decl]. Therefore only test for primary expressions.
       visitNestedExpression(name, PRIMARY,
-                            newInForInit: false, newAtStatementBegin: false);
+          newInForInit: false, newAtStatementBegin: false);
     }
     localNamer.enterScope(vars);
     out("(");
     if (fun.params != null) {
       visitCommaSeparated(fun.params, PRIMARY,
-                          newInForInit: false, newAtStatementBegin: false);
+          newInForInit: false, newAtStatementBegin: false);
     }
     out(")");
     switch (fun.asyncModifier) {
       case const AsyncModifier.sync():
         break;
       case const AsyncModifier.async():
         out(' ', isWhitespace: true);
         out('async');
         break;
       case const AsyncModifier.syncStar():
         out(' ', isWhitespace: true);
         out('sync*');
         break;
       case const AsyncModifier.asyncStar():
         out(' ', isWhitespace: true);
         out('async*');
         break;
     }
     spaceOut();
     int closingPosition =
         blockOut(fun.body, shouldIndent: false, needsNewline: false);
     localNamer.leaveScope();
     return closingPosition;
-
   }
 
   @override
   visitFunctionDeclaration(FunctionDeclaration declaration) {
     VarCollector vars = new VarCollector();
     vars.visitFunctionDeclaration(declaration);
     indent();
     startNode(declaration.function);
     currentNode.closingPosition =
         functionOut(declaration.function, declaration.name, vars);
     endNode(declaration.function);
     lineOut();
   }
 
   visitNestedExpression(Expression node, int requiredPrecedence,
-                        {bool newInForInit, bool newAtStatementBegin}) {
+      {bool newInForInit, bool newAtStatementBegin}) {
     bool needsParentheses =
         // a - (b + c).
         (requiredPrecedence != EXPRESSION &&
-         node.precedenceLevel < requiredPrecedence) ||
-        // for (a = (x in o); ... ; ... ) { ... }
-        (newInForInit && node is Binary && node.op == "in") ||
-        // (function() { ... })().
-        // ({a: 2, b: 3}.toString()).
-        (newAtStatementBegin && (node is NamedFunction ||
-                                 node is Fun ||
-                                 node is ObjectInitializer));
+                node.precedenceLevel < requiredPrecedence) ||
+            // for (a = (x in o); ... ; ... ) { ... }
+            (newInForInit && node is Binary && node.op == "in") ||
+            // (function() { ... })().
+            // ({a: 2, b: 3}.toString()).
+            (newAtStatementBegin &&
+                (node is NamedFunction ||
+                    node is Fun ||
+                    node is ObjectInitializer));
     if (needsParentheses) {
       inForInit = false;
       atStatementBegin = false;
       out("(");
       visit(node);
       out(")");
     } else {
       inForInit = newInForInit;
       atStatementBegin = newAtStatementBegin;
       visit(node);
     }
   }
 
   @override
   visitVariableDeclarationList(VariableDeclarationList list) {
     out("var ");
     visitCommaSeparated(list.declarations, ASSIGNMENT,
-                        newInForInit: inForInit, newAtStatementBegin: false);
+        newInForInit: inForInit, newAtStatementBegin: false);
   }
 
   @override
   visitAssignment(Assignment assignment) {
     visitNestedExpression(assignment.leftHandSide, CALL,
-                          newInForInit: inForInit,
-                          newAtStatementBegin: atStatementBegin);
+        newInForInit: inForInit, newAtStatementBegin: atStatementBegin);
     if (assignment.value != null) {
       spaceOut();
       String op = assignment.op;
       if (op != null) out(op);
       out("=");
       spaceOut();
       visitNestedExpression(assignment.value, ASSIGNMENT,
-                            newInForInit: inForInit,
-                            newAtStatementBegin: false);
+          newInForInit: inForInit, newAtStatementBegin: false);
     }
   }
 
   @override
   visitVariableInitialization(VariableInitialization initialization) {
     visitAssignment(initialization);
   }
 
   @override
   visitConditional(Conditional cond) {
     visitNestedExpression(cond.condition, LOGICAL_OR,
-                          newInForInit: inForInit,
-                          newAtStatementBegin: atStatementBegin);
+        newInForInit: inForInit, newAtStatementBegin: atStatementBegin);
     spaceOut();
     out("?");
     spaceOut();
     // The then part is allowed to have an 'in'.
     visitNestedExpression(cond.then, ASSIGNMENT,
-                          newInForInit: false, newAtStatementBegin: false);
+        newInForInit: false, newAtStatementBegin: false);
     spaceOut();
     out(":");
     spaceOut();
     visitNestedExpression(cond.otherwise, ASSIGNMENT,
-                          newInForInit: inForInit, newAtStatementBegin: false);
+        newInForInit: inForInit, newAtStatementBegin: false);
   }
 
   @override
   visitNew(New node) {
     out("new ");
     visitNestedExpression(node.target, LEFT_HAND_SIDE,
-                          newInForInit: inForInit, newAtStatementBegin: false);
+        newInForInit: inForInit, newAtStatementBegin: false);
     out("(");
     visitCommaSeparated(node.arguments, ASSIGNMENT,
-                        newInForInit: false, newAtStatementBegin: false);
+        newInForInit: false, newAtStatementBegin: false);
     out(")");
   }
 
   @override
   visitCall(Call call) {
     visitNestedExpression(call.target, CALL,
-                          newInForInit: inForInit,
-                          newAtStatementBegin: atStatementBegin);
+        newInForInit: inForInit, newAtStatementBegin: atStatementBegin);
     out("(");
     visitCommaSeparated(call.arguments, ASSIGNMENT,
-                        newInForInit: false, newAtStatementBegin: false);
+        newInForInit: false, newAtStatementBegin: false);
     out(")");
   }
 
   @override
   void visitBinary(Binary binary) {
     Expression left = binary.left;
     Expression right = binary.right;
     String op = binary.op;
     int leftPrecedenceRequirement;
     int rightPrecedenceRequirement;
-    bool leftSpace = true;   // left<HERE>op right
+    bool leftSpace = true; // left<HERE>op right
     switch (op) {
       case ',':
         //  x, (y, z) <=> (x, y), z.
         leftPrecedenceRequirement = EXPRESSION;
         rightPrecedenceRequirement = EXPRESSION;
         leftSpace = false;
         break;
       case "||":
         leftPrecedenceRequirement = LOGICAL_OR;
         // x || (y || z) <=> (x || y) || z.
@@ skipping 56 matching lines @@
       case "%":
         leftPrecedenceRequirement = MULTIPLICATIVE;
         // We cannot remove parenthesis for "*" because of precision issues.
         rightPrecedenceRequirement = UNARY;
         break;
       default:
         context.error("Forgot operator: $op");
     }
 
     visitNestedExpression(left, leftPrecedenceRequirement,
-                          newInForInit: inForInit,
-                          newAtStatementBegin: atStatementBegin);
+        newInForInit: inForInit, newAtStatementBegin: atStatementBegin);
 
     if (op == "in" || op == "instanceof") {
       // There are cases where the space is not required but without further
       // analysis we cannot know.
       out(" ", isWhitespace: true);
       out(op);
       out(" ", isWhitespace: true);
     } else {
       if (leftSpace) spaceOut();
       out(op);
       spaceOut();
     }
     visitNestedExpression(right, rightPrecedenceRequirement,
-                          newInForInit: inForInit,
-                          newAtStatementBegin: false);
+        newInForInit: inForInit, newAtStatementBegin: false);
   }
 
   @override
   void visitPrefix(Prefix unary) {
     String op = unary.op;
     switch (op) {
       case "delete":
       case "void":
       case "typeof":
         // There are cases where the space is not required but without further
         // analysis we cannot know.
         out(op);
         out(" ", isWhitespace: true);
         break;
       case "+":
       case "++":
         if (lastCharCode == charCodes.$PLUS) out(" ", isWhitespace: true);
         out(op);
         break;
       case "-":
       case "--":
         if (lastCharCode == charCodes.$MINUS) out(" ", isWhitespace: true);
         out(op);
         break;
       default:
         out(op);
     }
     visitNestedExpression(unary.argument, UNARY,
-                          newInForInit: inForInit, newAtStatementBegin: false);
+        newInForInit: inForInit, newAtStatementBegin: false);
   }
 
   @override
   void visitPostfix(Postfix postfix) {
     visitNestedExpression(postfix.argument, CALL,
-                          newInForInit: inForInit,
-                          newAtStatementBegin: atStatementBegin);
+        newInForInit: inForInit, newAtStatementBegin: atStatementBegin);
     out(postfix.op);
   }
 
   @override
   void visitVariableUse(VariableUse ref) {
     out(localNamer.getName(ref.name));
   }
 
   @override
   void visitThis(This node) {
@@ skipping 14 matching lines @@
     return charCodes.$0 <= charCode && charCode <= charCodes.$9;
   }
 
   bool isValidJavaScriptId(String field) {
     if (field.length < 3) return false;
     // Ignore the leading and trailing string-delimiter.
     for (int i = 1; i < field.length - 1; i++) {
       // TODO(floitsch): allow more characters.
       int charCode = field.codeUnitAt(i);
       if (!(charCodes.$a <= charCode && charCode <= charCodes.$z ||
-            charCodes.$A <= charCode && charCode <= charCodes.$Z ||
-            charCode == charCodes.$$ ||
-            charCode == charCodes.$_ ||
-            i != 1 && isDigit(charCode))) {
+          charCodes.$A <= charCode && charCode <= charCodes.$Z ||
+          charCode == charCodes.$$ ||
+          charCode == charCodes.$_ ||
+          i != 1 && isDigit(charCode))) {
         return false;
       }
     }
     // TODO(floitsch): normally we should also check that the field is not a
     // reserved word.  We don't generate fields with reserved word names except
     // for 'super'.
     if (field == '"super"') return false;
     if (field == '"catch"') return false;
     return true;
   }
 
   @override
   void visitAccess(PropertyAccess access) {
     visitNestedExpression(access.receiver, CALL,
-                          newInForInit: inForInit,
-                          newAtStatementBegin: atStatementBegin);
+        newInForInit: inForInit, newAtStatementBegin: atStatementBegin);
     Node selector = access.selector;
     if (selector is LiteralString) {
       LiteralString selectorString = selector;
       String fieldWithQuotes = selectorString.value;
       if (isValidJavaScriptId(fieldWithQuotes)) {
         if (access.receiver is LiteralNumber &&
             lastCharCode != charCodes.$CLOSE_PAREN) {
           out(" ", isWhitespace: true);
         }
         out(".");
         startNode(selector);
         out(fieldWithQuotes.substring(1, fieldWithQuotes.length - 1));
         endNode(selector);
         return;
       }
     } else if (selector is Name) {
       if (access.receiver is LiteralNumber &&
           lastCharCode != charCodes.$CLOSE_PAREN) {
         out(" ", isWhitespace: true);
       }
       out(".");
       startNode(selector);
       selector.accept(this);
       endNode(selector);
       return;
     }
     out("[");
     visitNestedExpression(selector, EXPRESSION,
-                          newInForInit: false, newAtStatementBegin: false);
+        newInForInit: false, newAtStatementBegin: false);
     out("]");
   }
 
   @override
   void visitNamedFunction(NamedFunction namedFunction) {
     VarCollector vars = new VarCollector();
     vars.visitNamedFunction(namedFunction);
     startNode(namedFunction.function);
     currentNode.closingPosition =
         functionOut(namedFunction.function, namedFunction.name, vars);
@@ skipping 73 matching lines @@
         // in last position. Otherwise `[,]` (having length 1) would become
         // equal to `[]` (the empty array)
         // and [1,,] (array with 1 and a hole) would become [1,] = [1].
         startNode(element);
         out(",");
         endNode(element);
         continue;
       }
       if (i != 0) spaceOut();
       visitNestedExpression(element, ASSIGNMENT,
-                            newInForInit: false, newAtStatementBegin: false);
+          newInForInit: false, newAtStatementBegin: false);
       // We can skip the trailing "," for the last element (since it's not
       // an array hole).
       if (i != elements.length - 1) out(",");
     }
     out("]");
   }
 
   @override
   void visitArrayHole(ArrayHole node) {
     context.error("Unreachable");
   }
 
   @override
   void visitObjectInitializer(ObjectInitializer node) {
     // Print all the properties on one line until we see a function-valued
     // property.  Ideally, we would use a proper pretty-printer to make the
     // decision based on layout.
     bool exitOneLinerMode(Expression value) {
-      return
-          value is Fun ||
+      return value is Fun ||
           value is ArrayInitializer && value.elements.any((e) => e is Fun);
     }
 
     bool isOneLiner = node.isOneLiner || shouldCompressOutput;
     List<Property> properties = node.properties;
     out("{");
     indentMore();
     for (int i = 0; i < properties.length; i++) {
       Node value = properties[i].value;
       if (isOneLiner && exitOneLinerMode(value)) isOneLiner = false;
@@ skipping 30 matching lines @@
       node.name.accept(this);
     } else {
       assert(node.name is LiteralNumber);
       LiteralNumber nameNumber = node.name;
       out(nameNumber.value);
     }
     endNode(node.name);
     out(":");
     spaceOut();
     visitNestedExpression(node.value, ASSIGNMENT,
-                          newInForInit: false, newAtStatementBegin: false);
+        newInForInit: false, newAtStatementBegin: false);
   }
 
   @override
   void visitRegExpLiteral(RegExpLiteral node) {
     out(node.pattern);
   }
 
   @override
   void visitLiteralExpression(LiteralExpression node) {
     String template = node.template;
@@ skipping 62 matching lines @@
     }
   }
 
   @override
   void visitAwait(Await node) {
     out("await ");
     visit(node.expression);
   }
 }
 
-
 class OrderedSet<T> {
   final Set<T> set;
   final List<T> list;
 
-  OrderedSet() : set = new Set<T>(), list = <T>[];
+  OrderedSet()
+      : set = new Set<T>(),
+        list = <T>[];
 
   void add(T x) {
     if (set.add(x)) {
       // [Set.add] returns `true` if 'x' was added.
       list.add(x);
     }
   }
 
   void forEach(void fun(T x)) {
     list.forEach(fun);
   }
 }
 
 // Collects all the var declarations in the function.  We need to do this in a
 // separate pass because JS vars are lifted to the top of the function.
 class VarCollector extends BaseVisitor {
   bool nested;
   bool enableRenaming = true;
   final OrderedSet<String> vars;
   final OrderedSet<String> params;
 
   static final String disableVariableMinificationPattern = "::norenaming::";
   static final String enableVariableMinificationPattern = "::dorenaming::";
 
-  VarCollector() : nested = false,
-                   vars = new OrderedSet<String>(),
-                   params = new OrderedSet<String>();
+  VarCollector()
+      : nested = false,
+        vars = new OrderedSet<String>(),
+        params = new OrderedSet<String>();
 
   void forEachVar(void fn(String v)) => vars.forEach(fn);
   void forEachParam(void fn(String p)) => params.forEach(fn);
 
   void collectVarsInFunction(Fun fun) {
     if (!nested) {
       nested = true;
       if (fun.params != null) {
         for (int i = 0; i < fun.params.length; i++) {
           params.add(fun.params[i].name);
@@ skipping 26 matching lines @@
     } else if (node.comment.contains(enableVariableMinificationPattern)) {
       enableRenaming = true;
     }
   }
 
   void visitVariableDeclaration(VariableDeclaration decl) {
     if (enableRenaming && decl.allowRename) vars.add(decl.name);
   }
 }
 
-
 /**
  * Returns true, if the given node must be wrapped into braces when used
  * as then-statement in an [If] that has an else branch.
  */
 class DanglingElseVisitor extends BaseVisitor<bool> {
   JavaScriptPrintingContext context;
 
   DanglingElseVisitor(this.context);
 
   bool visitProgram(Program node) => false;
 
   bool visitNode(Statement node) {
     context.error("Forgot node: $node");
     return null;
   }
 
   bool visitBlock(Block node) => false;
   bool visitExpressionStatement(ExpressionStatement node) => false;
   bool visitEmptyStatement(EmptyStatement node) => false;
   bool visitIf(If node) {
     if (!node.hasElse) return true;
     return node.otherwise.accept(this);
   }
+
   bool visitFor(For node) => node.body.accept(this);
   bool visitForIn(ForIn node) => node.body.accept(this);
   bool visitWhile(While node) => node.body.accept(this);
   bool visitDo(Do node) => false;
   bool visitContinue(Continue node) => false;
   bool visitBreak(Break node) => false;
   bool visitReturn(Return node) => false;
   bool visitThrow(Throw node) => false;
   bool visitTry(Try node) {
     if (node.finallyPart != null) {
       return node.finallyPart.accept(this);
     } else {
       return node.catchPart.accept(this);
     }
   }
+
   bool visitCatch(Catch node) => node.body.accept(this);
   bool visitSwitch(Switch node) => false;
   bool visitCase(Case node) => false;
   bool visitDefault(Default node) => false;
   bool visitFunctionDeclaration(FunctionDeclaration node) => false;
-  bool visitLabeledStatement(LabeledStatement node)
-      => node.body.accept(this);
+  bool visitLabeledStatement(LabeledStatement node) => node.body.accept(this);
   bool visitLiteralStatement(LiteralStatement node) => true;
 
   bool visitExpression(Expression node) => false;
 }
 
-
 abstract class LocalNamer {
   String getName(String oldName);
   String declareVariable(String oldName);
   String declareParameter(String oldName);
   void enterScope(VarCollector vars);
   void leaveScope();
 }
 
-
 class IdentityNamer implements LocalNamer {
   String getName(String oldName) => oldName;
   String declareVariable(String oldName) => oldName;
   String declareParameter(String oldName) => oldName;
   void enterScope(VarCollector vars) {}
   void leaveScope() {}
 }
 
-
 class MinifyRenamer implements LocalNamer {
   final List<Map<String, String>> maps = [];
   final List<int> parameterNumberStack = [];
   final List<int> variableNumberStack = [];
   int parameterNumber = 0;
   int variableNumber = 0;
 
   MinifyRenamer();
 
   void enterScope(VarCollector vars) {
@@ skipping 18 matching lines @@
       if (replacement != null) return replacement;
     }
     return oldName;
   }
 
   static const LOWER_CASE_LETTERS = 26;
   static const LETTERS = LOWER_CASE_LETTERS;
   static const DIGITS = 10;
 
   static int nthLetter(int n) {
-    return (n < LOWER_CASE_LETTERS) ?
-           charCodes.$a + n :
-           charCodes.$A + n - LOWER_CASE_LETTERS;
+    return (n < LOWER_CASE_LETTERS)
+        ? charCodes.$a + n
+        : charCodes.$A + n - LOWER_CASE_LETTERS;
   }
 
   // Parameters go from a to z and variables go from z to a.  This makes each
   // argument list and each top-of-function var declaration look similar and
   // helps gzip compress the file.  If we have more than 26 arguments and
   // variables then we meet somewhere in the middle of the alphabet.  After
   // that we give up trying to be nice to the compression algorithm and just
   // use the same namespace for arguments and variables, starting with A, and
   // moving on to a0, a1, etc.
   String declareVariable(String oldName) {
@@ skipping 89 matching lines @@
     }
   }
 
   EnterExitNode exitNode(JavaScriptPrintingContext context, int position) {
     // Enter must happen before exit.
     addToNode(context, position);
     context.exitNode(node, startPosition, position, closingPosition);
     return parent;
   }
 }