Format all dart dev compiler files

pkg/dev_compiler/tool/input_sdk/private/js_string.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 dart._interceptors;
 
 /**
  * The interceptor class for [String]. The compiler recognizes this
  * class as an interceptor, and changes references to [:this:] to
  * actually use the receiver of the method, which is generated as an extra
  * argument added to each member.
  */
 @JsPeerInterface(name: 'String')
 class JSString extends Interceptor implements String, JSIndexable<String> {
   const JSString();
 
   int codeUnitAt(int index) {
-    if (index is !int) throw diagnoseIndexError(this, index);
+    if (index is! int) throw diagnoseIndexError(this, index);
     if (index < 0) throw diagnoseIndexError(this, index);
     if (index >= length) throw diagnoseIndexError(this, index);
     return JS('int', r'#.charCodeAt(#)', this, index);
   }
 
   Iterable<Match> allMatches(String string, [int start = 0]) {
     checkString(string);
     checkInt(start);
     if (0 > start || start > string.length) {
       throw new RangeError.range(start, 0, string.length);
     }
     return allMatchesInStringUnchecked(this, string, start);
   }
 
   Match matchAsPrefix(String string, [int start = 0]) {
     if (start < 0 || start > string.length) {
       throw new RangeError.range(start, 0, string.length);
     }
     if (start + this.length > string.length) return null;
     // TODO(lrn): See if this can be optimized.
     for (int i = 0; i < this.length; i++) {
       if (string.codeUnitAt(start + i) != this.codeUnitAt(i)) {
         return null;
       }
     }
     return new StringMatch(start, string, this);
   }
 
   String operator +(String other) {
-    if (other is !String) throw new ArgumentError.value(other);
+    if (other is! String) throw new ArgumentError.value(other);
     return JS('String', r'# + #', this, other);
   }
 
   bool endsWith(String other) {
     checkString(other);
     int otherLength = other.length;
     if (otherLength > length) return false;
     return other == substring(length - otherLength);
   }
 
   String replaceAll(Pattern from, String to) {
     checkString(to);
     return stringReplaceAllUnchecked(this, from, to);
   }
 
   String replaceAllMapped(Pattern from, String convert(Match match)) {
     return this.splitMapJoin(from, onMatch: convert);
   }
 
   String splitMapJoin(Pattern from,
-                      {String onMatch(Match match),
-                       String onNonMatch(String nonMatch)}) {
+      {String onMatch(Match match), String onNonMatch(String nonMatch)}) {
     return stringReplaceAllFuncUnchecked(this, from, onMatch, onNonMatch);
   }
 
   String replaceFirst(Pattern from, String to, [int startIndex = 0]) {
     checkString(to);
     checkInt(startIndex);
     RangeError.checkValueInInterval(startIndex, 0, this.length, "startIndex");
     return stringReplaceFirstUnchecked(this, from, to, startIndex);
   }
 
   String replaceFirstMapped(Pattern from, String replace(Match match),
-                            [int startIndex = 0]) {
+      [int startIndex = 0]) {
     checkNull(replace);
     checkInt(startIndex);
     RangeError.checkValueInInterval(startIndex, 0, this.length, "startIndex");
     return stringReplaceFirstMappedUnchecked(this, from, replace, startIndex);
   }
 
   List<String> split(Pattern pattern) {
     checkNull(pattern);
     if (pattern is String) {
       return JS('JSExtendableArray', r'#.split(#)', this, pattern);
@@ skipping 53 matching lines @@
       if (endIndex > length) return false;
       return other == JS('String', r'#.substring(#, #)', this, index, endIndex);
     }
     return pattern.matchAsPrefix(this, index) != null;
   }
 
   String substring(int startIndex, [int endIndex]) {
     checkInt(startIndex);
     if (endIndex == null) endIndex = length;
     checkInt(endIndex);
-    if (startIndex < 0 ) throw new RangeError.value(startIndex);
+    if (startIndex < 0) throw new RangeError.value(startIndex);
     if (startIndex > endIndex) throw new RangeError.value(startIndex);
     if (endIndex > length) throw new RangeError.value(endIndex);
     return JS('String', r'#.substring(#, #)', this, startIndex, endIndex);
   }
 
   String toLowerCase() {
     return JS('String', r'#.toLowerCase()', this);
   }
 
   String toUpperCase() {
@@ skipping 170 matching lines @@
     } else {
       result = this;
       endIndex = _skipTrailingWhitespace(this, this.length);
     }
 
     if (endIndex == result.length) return result;
     if (endIndex == 0) return "";
     return JS('String', r'#.substring(#, #)', result, 0, endIndex);
   }
 
-  String operator*(int times) {
-    if (0 >= times) return '';  // Unnecessary but hoists argument type check.
+  String operator *(int times) {
+    if (0 >= times) return ''; // Unnecessary but hoists argument type check.
     if (times == 1 || this.length == 0) return this;
     if (times != JS('int', '# >>> 0', times)) {
       // times >= 2^32. We can't create a string that big.
       throw const OutOfMemoryError();
     }
     var result = '';
     String s = this;
     while (true) {
       if (times & 1 == 1) result = s + result;
       times = JS('int', '# >>> 1', times);
@@ skipping 67 matching lines @@
       throw new RangeError.range(startIndex, 0, this.length);
     }
     return stringContainsUnchecked(this, other, startIndex);
   }
 
   bool get isEmpty => length == 0;
 
   bool get isNotEmpty => !isEmpty;
 
   int compareTo(String other) {
-    if (other is !String) throw argumentErrorValue(other);
-    return this == other ? 0
-        : JS('bool', r'# < #', this, other) ? -1 : 1;
+    if (other is! String) throw argumentErrorValue(other);
+    return this == other ? 0 : JS('bool', r'# < #', this, other) ? -1 : 1;
   }
 
   // Note: if you change this, also change the function [S].
   String toString() => this;
 
   /**
    * This is the [Jenkins hash function][1] but using masking to keep
    * values in SMI range.
    *
    * [1]: http://en.wikipedia.org/wiki/Jenkins_hash_function
    */
   int get hashCode {
     // TODO(ahe): This method shouldn't have to use JS. Update when our
     // optimizations are smarter.
     int hash = 0;
     for (int i = 0; i < length; i++) {
       hash = 0x1fffffff & (hash + JS('int', r'#.charCodeAt(#)', this, i));
       hash = 0x1fffffff & (hash + ((0x0007ffff & hash) << 10));
       hash = JS('int', '# ^ (# >> 6)', hash, hash);
     }
-    hash = 0x1fffffff & (hash + ((0x03ffffff & hash) <<  3));
+    hash = 0x1fffffff & (hash + ((0x03ffffff & hash) << 3));
     hash = JS('int', '# ^ (# >> 11)', hash, hash);
     return 0x1fffffff & (hash + ((0x00003fff & hash) << 15));
   }
 
   Type get runtimeType => String;
 
   int get length => JS('int', r'#.length', this);
 
   String operator [](int index) {
-    if (index is !int) throw diagnoseIndexError(this, index);
+    if (index is! int) throw diagnoseIndexError(this, index);
     if (index >= length || index < 0) throw diagnoseIndexError(this, index);
     return JS('String', '#[#]', this, index);
   }
 }