Wrote functions to convert collections and maps to strings and invoked

frog/lib/corelib_impl.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.
 
 #library("dart:coreimpl");
 
 #source("../../corelib/src/implementation/dual_pivot_quicksort.dart");
 #source("../../corelib/src/implementation/duration_implementation.dart");
 #source("../../corelib/src/implementation/exceptions.dart");
+#source("../../corelib/src/implementation/collections.dart");
 #source("../../corelib/src/implementation/future_implementation.dart");
 #source("../../corelib/src/implementation/hash_map_set.dart");
 // TODO(jimhug): Re-explore tradeoffs with using builtin JS maps.
 #source("../../corelib/src/implementation/linked_hash_map.dart");
 #source("../../corelib/src/implementation/maps.dart");
 #source("../../corelib/src/implementation/options.dart");
 #source("../../corelib/src/implementation/queue.dart");
 #source("../../corelib/src/implementation/stopwatch_implementation.dart");
 #source("../../corelib/src/implementation/splay_tree.dart");
 
 #source("string_buffer.dart");
 #source("string_base.dart");
 #source("string_implementation.dart");
 #source("arrays.dart");
-#source("collections.dart");
 #source("date_implementation.dart");
 
 #source("isolate.dart");
 #source("isolate_serialization.dart");
 
 #source("function_implementation.dart");
 
 /**
  * The default implementation of the [List<E>] interface. Essentially a growable
  * array that will expand automatically as more elements are added.
@@ skipping 91 matching lines @@
   // Collection<E> members:
   void forEach(void f(E element)) native;
   Collection<E> filter(bool f(E element)) native;
   Collection map(f(E element)) native;
   bool every(bool f(E element)) native;
   bool some(bool f(E element)) native;
   bool isEmpty() => length == 0;
 
   // Iterable<E> members:
   Iterator<E> iterator() => new ListIterator(this);
+
+  String toString() => Collections.collectionToString(this);
 }
 
 // Iterator for lists.
 class ListIterator<T> implements Iterator<T> {
   ListIterator(List<T> array)
       : _array = array,
         _pos = 0 {
   }
 
   bool hasNext() {
@@ skipping 73 matching lines @@
   }
 
   void clear() {
     throw const IllegalAccessException();
   }
 
   E removeLast() {
     throw const IllegalAccessException();
   }
 
-
-  // The base Array.prototype.toString does not like getting derived arrays,
-  // so copy the array if needed.
-  // TODO(jmesserly): this is not the right long term fix because it only works
-  // for ImmutableList, but all derived types of ListFactory have this problem.
-  // We need to implment ListFactory.toString in Dart. However, the
-  // mplmentation needs correct handling of cycles (isolate tests depend on
-  // this), so it's not trivial.
-  String toString() => new List.from(this).toString();
+  String toString() => Collections.collectionToString(this);
 }
 
 
 LinkedHashMapImplementation _map(List itemsAndKeys) {
   LinkedHashMapImplementation ret = new LinkedHashMapImplementation();
   for (int i=0; i < itemsAndKeys.length;) {
     ret[itemsAndKeys[i++]] = itemsAndKeys[i++];
   }
   return ret;
 }
@@ skipping 34 matching lines @@
     throw const IllegalAccessException();
   }
 
   void clear() {
     throw const IllegalAccessException();
   }
 
   V remove(K key) {
     throw const IllegalAccessException();
   }
+
+  String toString() => Maps.mapToString(this);
 }
 
 
 // TODO(jmesserly): this should wrap real RegExp when we can
 // We can't do it yet because we'd need a way to redirect the const
 // default constructor.
 // TODO(jimhug): One way to resolve this is to make the const constructor
 // very special in order for it to generate JS regex literals into the code
 // and then treat the constructor as a factory.
 class JSSyntaxRegExp implements RegExp {
@@ skipping 221 matching lines @@
     } else if (isNaN()) {
       if (other.isNaN()) {
         return 0;
       }
       return 1;
     } else {
       return -1;
     }
   }
 }