Change List/Set/Map/Queue.from constructrs to accept any iterable.

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 51 matching lines @@
    *
    * Effectively a shorthand for:
    *
    *     new LinkedHashMap(equals: identical, hashCode: identityHashCodeOf)
    */
   external factory LinkedHashMap.identity();
 
   /**
    * Creates a [LinkedHashMap] that contains all key value pairs of [other].
    */
-  factory LinkedHashMap.from(Map<K, V> other) {
-    return new LinkedHashMap<K, V>()..addAll(other);
+  factory LinkedHashMap.from(Map other) {
+    LinkedHashMap<K, V> result = new LinkedHashMap<K, V>();
+    other.forEach((k, v) { result[k] = 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.
    *
    * The keys of the key/value pairs do not need to be unique. The last
@@ skipping 19 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;
   }
 }