Format all dart: library files

sdk/lib/collection/linked_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;
 
 /**
  * A [LinkedHashSet] is a hash-table based [Set] implementation.
  *
  * The `LinkedHashSet` also keep track of the order that elements were inserted
@@ skipping 56 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 [LinkedHashSet.identity].
    */
-  external factory LinkedHashSet({bool equals(E e1, E e2),
-                                  int hashCode(E e),
-                                  bool isValidKey(potentialKey)});
+  external factory LinkedHashSet(
+      {bool equals(E e1, E e2),
+      int hashCode(E e),
+      bool isValidKey(potentialKey)});
 
   /**
    * Creates an insertion-ordered identity-based set.
    *
    * Effectively a shorthand for:
    *
    *     new LinkedHashSet<E>(equals: identical,
    *                          hashCode: identityHashCode)
    */
   external factory LinkedHashSet.identity();
@@ skipping 26 matching lines @@
    *
    * The elements are iterated in insertion order.
    */
   void forEach(void action(E element));
 
   /**
    * Provides an iterator that iterates over the elements in insertion order.
    */
   Iterator<E> get iterator;
 }