Format all dart: library files

sdk/lib/collection/linked_hash_map.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 hash-table based implementation of [Map].
  *
  * The insertion order of keys is remembered,
@@ skipping 52 matching lines @@
    * Such a map can be created directly using [LinkedHashMap.identity].
    *
    * The used `equals` and `hashCode` method should always be consistent,
    * so that if `equals(a, b)` then `hashCode(a) == hashCode(b)`. The hash
    * of an object, or what it compares equal to, should not change while the
    * object is in the table. If it does change, the result is unpredictable.
    *
    * If you supply one of [equals] and [hashCode],
    * you should generally also to supply the other.
    */
-  external factory LinkedHashMap({bool equals(K key1, K key2),
-                                  int hashCode(K key),
-                                  bool isValidKey(potentialKey)});
+  external factory LinkedHashMap(
+      {bool equals(K key1, K key2),
+      int hashCode(K key),
+      bool isValidKey(potentialKey)});
 
   /**
    * Creates an insertion-ordered identity-based map.
    *
    * Effectively a shorthand for:
    *
    *     new LinkedHashMap<K, V>(equals: identical,
    *                             hashCode: identityHashCode)
    */
   external factory LinkedHashMap.identity();
 
   /**
    * Creates a [LinkedHashMap] that contains all key value pairs of [other].
    */
   factory LinkedHashMap.from(Map other) {
     LinkedHashMap<K, V> result = new LinkedHashMap<K, V>();
-    other.forEach((k, v) { result[k as Object/*=K*/] = v as Object/*=V*/; });
+    other.forEach((k, v) {
+      result[k as Object/*=K*/] = v as Object/*=V*/;
+    });
     return result;
   }
 
   /**
    * Creates a [LinkedHashMap] where the keys and values are computed from the
    * [iterable].
    *
    * For each element of the [iterable] this constructor computes a key/value
    * pair, by applying [key] and [value] respectively.
    *
@@ skipping 20 matching lines @@
    * overwrites the previous value.
    *
    * It is an error if the two [Iterable]s don't have the same length.
    */
   factory LinkedHashMap.fromIterables(Iterable<K> keys, Iterable<V> values) {
     LinkedHashMap<K, V> map = new LinkedHashMap<K, V>();
     Maps._fillMapWithIterables(map, keys, values);
     return map;
   }
 }