dartfmt pkg/compiler

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

 // Copyright (c) 2013, 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.setlet;
 
 import 'dart:collection' show IterableBase;
 
 class Setlet<E> extends IterableBase<E> implements Set<E> {
   static const _MARKER = const _SetletMarker();
@@ skipping 68 matching lines @@
         _contents = element;
         return true;
       } else if (_contents == element) {
         // Do nothing.
         return false;
       } else {
         List list = new List(CAPACITY);
         list[0] = _contents;
         list[1] = element;
         _contents = list;
-        _extra = 2;  // Two elements.
+        _extra = 2; // Two elements.
         return true;
       }
     } else if (_MARKER == _extra) {
       return _contents.add(element);
     } else {
       int remaining = _extra;
       int index = 0;
       int copyTo, copyFrom;
       while (remaining > 0 && index < CAPACITY) {
         var candidate = _contents[index++];
@@ skipping 23 matching lines @@
         while (copyFrom < CAPACITY) {
           _contents[copyTo++] = _contents[copyFrom++];
         }
         // Insert the new element as the last element.
         _contents[copyTo++] = element;
         _extra++;
         // Clear all elements after the new last elements to
         // make sure we don't keep extra stuff alive.
         while (copyTo < CAPACITY) _contents[copyTo++] = null;
       } else {
-        _contents = new Set<E>()..addAll(_contents)..add(element);
+        _contents = new Set<E>()
+          ..addAll(_contents)
+          ..add(element);
         _extra = _MARKER;
       }
       return true;
     }
   }
 
   void addAll(Iterable<E> elements) {
     elements.forEach((each) => add(each));
   }
 
@@ skipping 82 matching lines @@
         if (_MARKER == element) continue;
         action(element);
         remaining--;
       }
     }
   }
 
   bool containsAll(Iterable<E> other) {
     for (E e in other) {
       if (!this.contains(e)) return false;
-    };
+    }
+    ;
     return true;
   }
 
   clear() {
     _contents = _MARKER;
     _extra = null;
   }
 
   Set<E> union(Set<E> other) => new Set<E>.from(this)..addAll(other);
 
@@ skipping 56 matching lines @@
       if (Setlet._MARKER != candidate) {
         _current = candidate;
         _remaining--;
         return true;
       }
     }
     _current = null;
     return false;
   }
 }