Change the toString method of IterableBase/IterableMixin to show some elements.

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 IterableBase<E> implements Set<E> {
 
   // Set.
@@ skipping 39 matching lines @@
     Set retainSet = _newSet();
     for (Object o in objectsToRetain) {
       if (isValidKey(o)) {
         retainSet.add(o);
       }
     }
     retainWhere(retainSet.contains);
   }
 
   List<E> toList({bool growable: true}) {
-    List<E> result = new List<E>()..length = this.length;
+    List<E> result = growable ? (new List<E>()..length = this.length)

[floitsch, 2013/10/11 09:29:43]

I would have preferred if this was in a separate CL, but ok.

[Lasse Reichstein Nielsen, 2013/10/11 20:25:37]

Kept.

+                              : new List<E>(this.length);
     int i = 0;
     for (E element in this) result[i++] = element;
     return result;
   }
 
   Set<E> toSet() => _newSet()..addAll(this);
 
-  // TODO(zarah) Remove this, and let it be inherited by IterableBase
   String toString() => IterableMixinWorkaround.toStringIterable(this, '{', '}');
 }
 
 /**
  * A [HashSet] is a hash-table based [Set] implementation.
  *
  * The elements of a `HashSet` must have consistent equality
  * and hashCode implementations. This means that the equals operation
  * must define a stable equivalence relation on the elements (reflexive,
  * anti-symmetric, transitive, and consistent over time), and that the hashCode
@@ skipping 43 matching lines @@
   /**
    * Create a hash set containing the elements of [iterable].
    *
    * Creates a hash set as by `new HashSet<E>()` and adds each element of
    * `iterable` to this set in the order they are iterated.
    */
   factory HashSet.from(Iterable<E> iterable) {
     return new HashSet<E>()..addAll(iterable);
   }
 }