Format all dart: library files

sdk/lib/collection/hash_set.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.
 
 part of dart.collection;
 
 /** Common parts of [HashSet] and [LinkedHashSet] implementations. */
 abstract class _HashSetBase<E> extends SetBase<E> {
-
   // The following two methods override the ones in SetBase.
   // It's possible to be more efficient if we have a way to create an empty
   // set of the correct type.
 
   Set<E> difference(Set<Object> other) {
     Set<E> result = _newSet();
     for (var element in this) {
       if (!other.contains(element)) result.add(element);
     }
     return result;
@@ skipping 69 matching lines @@
    * If neither `equals`, `hashCode`, nor `isValidKey` is provided,
    * the default `isValidKey` instead accepts all values.
    * The default equality and hashcode operations are assumed to work on all
    * objects.
    *
    * Likewise, if `equals` is [identical], `hashCode` is [identityHashCode]
    * and `isValidKey` is omitted, the resulting set is identity based,
    * and the `isValidKey` defaults to accepting all keys.
    * Such a map can be created directly using [HashSet.identity].
    */
-  external factory HashSet({bool equals(E e1, E e2),
-                            int hashCode(E e),
-                            bool isValidKey(potentialKey)});
+  external factory HashSet(
+      {bool equals(E e1, E e2),
+      int hashCode(E e),
+      bool isValidKey(potentialKey)});
 
   /**
    * Creates an unordered identity-based set.
    *
    * Effectively a shorthand for:
    *
    *     new HashSet<E>(equals: identical,
    *                    hashCode: identityHashCode)
    */
   external factory HashSet.identity();
@@ skipping 24 matching lines @@
   }
 
   /**
    * Provides an iterator that iterates over the elements of this set.
    *
    * The order of iteration is unspecified,
    * but consistent between changes to the set.
    */
   Iterator<E> get iterator;
 }