Revert toString output changes of Queues, and LinkedLists.

tests/corelib/collection_to_string_test.dart

 // Copyright (c) 2012, 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.
 
 /**
  * Tests for the toString methods on collections and maps.
  */
 
 library collection_to_string;
 
@@ skipping 154 matching lines @@
 /**
  * Return a random List of the specified size, placing its string
  * representation into the given string buffer. The beingMade
  * parameter is a list of collections currently under construction, i.e.,
  * candidates for recursive references.
  *
  * If exact is true, the returned collections will not be, and will not contain
  * a collection with ill-defined iteration order (i.e., a HashSet or HashMap).
  */
 List randomList(int size, bool exact, StringBuffer stringRep, List beingMade) {
-  return populateRandomCollection(size, exact, stringRep, beingMade, []);
+  return populateRandomCollection(size, exact, stringRep, beingMade, [], "[]");
 }
 
 /**
  * Like randomList, but returns a queue.
  */
 Queue randomQueue(int size, bool exact, StringBuffer stringRep, List beingMade){
-  return populateRandomCollection(size, exact, stringRep, beingMade, new Queue());
+  return populateRandomCollection(
+      size, exact, stringRep, beingMade, new Queue(), "{}");
 }
 
 /**
  * Like randomList, but returns a Set.
  */
 Set randomSet(int size, bool exact, StringBuffer stringRep, List beingMade) {
   // Until we have LinkedHashSet, method will only be called with exact==true
   return populateRandomSet(size, exact, stringRep, beingMade, new Set());
 }
 
@@ skipping 14 matching lines @@
  * Populates the given empty collection with elements, emitting the string
  * representation of the collection to stringRep.  The beingMade parameter is
  * a list of collections currently under construction, i.e., candidates for
  * recursive references.
  *
  * If exact is true, the elements of the returned collections will not be,
  * and will not contain a collection with ill-defined iteration order
  * (i.e., a HashSet or HashMap).
  */
 populateRandomCollection(int size, bool exact,
-    StringBuffer stringRep, List beingMade, var coll) {
+    StringBuffer stringRep, List beingMade, var coll, String delimiters) {
   beingMade.add(coll);
-  String delimiters = "()";  // Default for iterables.
-  if (coll is List) {
-    delimiters = "[]";
-  } else if (coll is Set) {
-    delimiters = "{}";
-  }
   int start = stringRep.length;
 
   stringRep.write(delimiters[0]);
 
   List indices = [];
   for (int i = 0; i < size; i++) {
     indices.add(stringRep.length);
     if (i != 0) stringRep.write(', ');
     coll.add(randomElement(random(size), exact, stringRep, beingMade));
   }
@@ skipping 100 matching lines @@
     result = random(1000);
     stringRep.write(result);
   } else if (elementTypeFrac < 2/3) {
     // Element Is a random (new) collection
     result = randomCollectionHelper(size, exact, stringRep, beingMade);
   } else {
     // Element Is a random recursive ref
     result = beingMade[random(beingMade.length)];
     if (result is List) {
       stringRep.write('[...]');
-    } else if (result is Set || result is Map) {
+    } else if (result is Set || result is Map || result is Queue) {
       stringRep.write('{...}');
     } else {
       stringRep.write('(...)');
     }
   }
   return result;
 }
 
 /** Returns a random int on [0, max) */
 int random(int max) {
   return rand.nextInt(max);
 }
 
 /** Returns a random boolean value. */
 bool randomBool() {
   return rand.nextBool();
 }
 
 /** Returns the alphabetized characters in a string. */
 String alphagram(String s) {
   // Calling [toList] to convert unmodifiable list to normal list.
   List<int> chars = s.codeUnits.toList();
   chars.sort((int a, int b) => a - b);
   return new String.fromCharCodes(chars);
 }