dartfmt pkg/compiler

pkg/compiler/lib/src/util/link_implementation.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.
 
 part of util_implementation;
 
 class LinkIterator<T> implements Iterator<T> {
   T _current;
   Link<T> _link;
 
@@ skipping 34 matching lines @@
   }
 }
 
 class MappedLinkIterable<S, T> extends IterableBase<T> {
   Transformation<S, T> _transformation;
   Link<S> _link;
 
   MappedLinkIterable(this._link, this._transformation);
 
   Iterator<T> get iterator {
-    return new MappedLinkIterator<S,T>(_link, _transformation);
+    return new MappedLinkIterator<S, T>(_link, _transformation);
   }
 }
 
 class LinkEntry<T> extends Link<T> {
   final T head;
   Link<T> tail;
 
   LinkEntry(T this.head, [Link<T> tail])
-    : this.tail = ((tail == null) ? new Link<T>() : tail);
+      : this.tail = ((tail == null) ? new Link<T>() : tail);
 
   Link<T> prepend(T element) {
     // TODO(ahe): Use new Link<T>, but this cost 8% performance on VM.
     return new LinkEntry<T>(element, this);
   }
 
   void printOn(StringBuffer buffer, [separatedBy]) {
     buffer.write(head);
     if (separatedBy == null) separatedBy = '';
     for (Link link = tail; link.isNotEmpty; link = link.tail) {
@@ skipping 21 matching lines @@
   Link<T> reversePrependAll(Link<T> from) {
     Link<T> result;
     for (result = this; from.isNotEmpty; from = from.tail) {
       result = result.prepend(from.head);
     }
     return result;
   }
 
   Link<T> skip(int n) {
     Link<T> link = this;
-    for (int i = 0 ; i < n ; i++) {
+    for (int i = 0; i < n; i++) {
       if (link.isEmpty) {
         throw new RangeError('Index $n out of range');
       }
       link = link.tail;
     }
     return link;
   }
 
   bool get isEmpty => false;
   bool get isNotEmpty => true;
 
   void forEach(void f(T element)) {
     for (Link<T> link = this; link.isNotEmpty; link = link.tail) {
       f(link.head);
     }
   }
 
   bool operator ==(other) {
-    if (other is !Link<T>) return false;
+    if (other is! Link<T>) return false;
     Link<T> myElements = this;
     while (myElements.isNotEmpty && other.isNotEmpty) {
       if (myElements.head != other.head) {
         return false;
       }
       myElements = myElements.tail;
       other = other.tail;
     }
     return myElements.isEmpty && other.isEmpty;
   }
@@ skipping 73 matching lines @@
     }
     throw new StateError("no elements");
   }
 
   void clear() {
     head = null;
     lastLink = null;
     length = 0;
   }
 }