Deprecate Math object in corelib in favor of dart:math library.

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 (including maps).
  */
 
+#library('collection_to_string');
+#import('dart:math', prefix: 'Math');
+
 // TODO(jjb): seed random number generator when API allows it
 
 final int NUM_TESTS = 300;
 final int MAX_COLLECTION_SIZE = 7;
 
+Math.Random rand;
+
 main() {
+  rand = new Math.Random();
   smokeTest();
   exactTest();
   inexactTest();
 }
 
 
 /**
  * Test a few simple examples.
  */
 void smokeTest() {
@@ skipping 92 matching lines @@
  * Return a random collection (or map) 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).
  */
 Object randomCollectionHelper(int size, bool exact, StringBuffer stringRep,
     List beingMade) {
-  double interfaceFrac = Math.random();
+  double interfaceFrac = rand.nextDouble();
 
   if (exact) {
     if (interfaceFrac < 1/3) {
       return randomList(size, exact, stringRep, beingMade);
     } else if (interfaceFrac < 2/3) {
       return randomQueue(size, exact, stringRep, beingMade);
     } else {
       return randomMap(size, exact, stringRep, beingMade);
     }
   } else {
@@ skipping 116 matching lines @@
  * Generates a random element which can be an int, a collection, or a map,
  * and emits it to StringRep. The beingMade parameter is a list of collections
  * currently under construction, i.e., candidates for recursive references.
  *
  * If exact is true, the returned element will not be, and will not contain
  * a collection with ill-defined iteration order (i.e., a HashSet or HashMap).
  */
 Object randomElement(int size, bool exact, StringBuffer stringRep,
     List beingMade) {
   Object result;
-  double elementTypeFrac = Math.random();
+  double elementTypeFrac = rand.nextDouble();
   if (elementTypeFrac < 1/3) {
     result = random(1000);
     stringRep.add(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.add('[...]');
     else
       stringRep.add('{...}');
   }
   return result;
 }
 
 /** Returns a random int on [0, max) */
 int random(int max) {
-  return (Math.random() * max).toInt();
+  return rand.nextInt(max);
 }
 
 /** Returns a random boolean value. */
 bool randomBool() {
-  return Math.random() < .5;
+  return rand.nextBool();
 }
 
 /** Returns the alphabetized characters in a string. */
 String alphagram(String s) {
   List<int> chars = s.charCodes();
   chars.sort((int a, int b) => a - b);
   return new String.fromCharCodes(chars);
 }