dartfmt pkg/compiler

pkg/compiler/lib/src/util/util.dart

 // Copyright (c) 2011, 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.
 
 library dart2js.util;
 
 import 'util_implementation.dart';
 import 'characters.dart';
 
 export 'setlet.dart';
@@ skipping 98 matching lines @@
         buffer.write(r'\t');
       } else if (code == $LF) {
         buffer.write(r'\n');
       } else if (code == $CR) {
         buffer.write(r'\r');
       } else if (code == $DEL) {
         addCodeUnitEscaped(buffer, $DEL);
       } else if (code == $LS) {
         // This Unicode line terminator and $PS are invalid in JS string
         // literals.
-        addCodeUnitEscaped(buffer, $LS);  // 0x2028.
+        addCodeUnitEscaped(buffer, $LS); // 0x2028.
       } else if (code == $PS) {
-        addCodeUnitEscaped(buffer, $PS);  // 0x2029.
+        addCodeUnitEscaped(buffer, $PS); // 0x2029.
       } else if (code == $BACKSLASH) {
         buffer.write(r'\\');
       } else {
         if (code < 0x20) {
           addCodeUnitEscaped(buffer, code);
           // We emit DEL (ASCII 0x7f) as an escape because it would be confusing
           // to have it unescaped in a string literal.  We also escape
           // everything above 0x7f because that means we don't have to worry
           // about whether the web server serves it up as Latin1 or UTF-8.
         } else if (code < 0x7f) {
           buffer.writeCharCode(code);
         } else {
           // This will output surrogate pairs in the form \udxxx\udyyy, rather
           // than the more logical \u{zzzzzz}.  This should work in JavaScript
           // (especially old UCS-2 based implementations) and is the only
           // format that is allowed in JSON.
           addCodeUnitEscaped(buffer, code);
         }
       }
     }
   }
 
   for (int i = 0; i < string.length; i++) {
     int code = string.codeUnitAt(i);
-    if (code < 0x20 || code == $DEL || code == $DQ || code == $LS ||
-        code == $PS || code == $BACKSLASH || code >= 0x80) {
+    if (code < 0x20 ||
+        code == $DEL ||
+        code == $DQ ||
+        code == $LS ||
+        code == $PS ||
+        code == $BACKSLASH ||
+        code >= 0x80) {
       writeEscapedOn(string, buffer);
       return;
     }
   }
   buffer.write(string);
 }
 
 int computeHashCode(part1, [part2, part3, part4, part5]) {
-  return (part1.hashCode
-          ^ part2.hashCode
-          ^ part3.hashCode
-          ^ part4.hashCode
-          ^ part5.hashCode) & 0x3fffffff;
+  return (part1.hashCode ^
+          part2.hashCode ^
+          part3.hashCode ^
+          part4.hashCode ^
+          part5.hashCode) &
+      0x3fffffff;
 }
 
-String modifiersToString({bool isStatic: false,
-                          bool isAbstract: false,
-                          bool isFinal: false,
-                          bool isVar: false,
-                          bool isConst: false,
-                          bool isFactory: false,
-                          bool isExternal: false}) {
+String modifiersToString(
+    {bool isStatic: false,
+    bool isAbstract: false,
+    bool isFinal: false,
+    bool isVar: false,
+    bool isConst: false,
+    bool isFactory: false,
+    bool isExternal: false}) {
   LinkBuilder<String> builder = new LinkBuilder<String>();
   if (isStatic) builder.addLast('static');
   if (isAbstract) builder.addLast('abstract');
   if (isFinal) builder.addLast('final');
   if (isVar) builder.addLast('var');
   if (isConst) builder.addLast('const');
   if (isFactory) builder.addLast('factory');
   if (isExternal) builder.addLast('external');
   StringBuffer buffer = new StringBuffer();
   builder.toLink().printOn(buffer, ', ');
@@ skipping 10 matching lines @@
 
   bool operator ==(var other) {
     if (identical(this, other)) return true;
     if (other is! Pair) return false;
     return a == other.a && b == other.b;
   }
 
   String toString() => '($a,$b)';
 }
 
-
 int longestCommonPrefixLength(List a, List b) {
   int index = 0;
-  for ( ; index < a.length && index < b.length; index++) {
+  for (; index < a.length && index < b.length; index++) {
     if (a[index] != b[index]) {
       break;
     }
   }
   return index;
 }
 
 /// Returns [suggestedName] if it is not in [usedNames]. Otherwise concatenates
 /// the smallest number that makes it not appear in [usedNames].
 ///
 /// Adds the result to [usedNames].
 String makeUnique(String suggestedName, Set<String> usedNames) {
   String result = suggestedName;
   if (usedNames.contains(suggestedName)) {
     int counter = 0;
     while (usedNames.contains(result)) {
       counter++;
       result = "$suggestedName$counter";
     }
   }
   usedNames.add(result);
   return result;
 }