Remove deprecated StringBuffer.add, addAll and addCharCode.

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 191 matching lines @@
  * 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).
  */
 Collection populateRandomCollection(int size, bool exact,
     StringBuffer stringRep, List beingMade, Collection coll) {
   beingMade.add(coll);
-  stringRep.add(coll is List ? '[' : '{');
+  stringRep.write(coll is List ? '[' : '{');
 
   for (int i = 0; i < size; i++) {
-    if (i != 0) stringRep.add(', ');
+    if (i != 0) stringRep.write(', ');
     coll.add(randomElement(random(size), exact, stringRep, beingMade));
   }
 
-  stringRep.add(coll is List ? ']' : '}');
+  stringRep.write(coll is List ? ']' : '}');
   beingMade.removeLast();
   return coll;
 }
 
 /** Like populateRandomCollection, but for sets (elements must be hashable) */
 Set populateRandomSet(int size, bool exact, StringBuffer stringRep,
     List beingMade, Set set) {
-  stringRep.add('{');
+  stringRep.write('{');
 
   for (int i = 0; i < size; i++) {
-    if (i != 0) stringRep.add(', ');
+    if (i != 0) stringRep.write(', ');
     set.add(i);
-    stringRep.add(i);
+    stringRep.write(i);
   }
 
-  stringRep.add('}');
+  stringRep.write('}');
   return set;
 }
 
 
 /** Like populateRandomCollection, but for maps. */
 Map populateRandomMap(int size, bool exact, StringBuffer stringRep,
     List beingMade, Map map) {
   beingMade.add(map);
-  stringRep.add('{');
+  stringRep.write('{');
 
   for (int i = 0; i < size; i++) {
-    if (i != 0) stringRep.add(', ');
+    if (i != 0) stringRep.write(', ');
 
     int key = i; // Ensures no duplicates
-    stringRep.add(key);
-    stringRep.add(': ');
+    stringRep.write(key);
+    stringRep.write(': ');
     Object val = randomElement(random(size), exact, stringRep, beingMade);
     map[key] = val;
   }
 
-  stringRep.add('}');
+  stringRep.write('}');
   beingMade.removeLast();
   return map;
 }
 
 /**
  * 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 = rand.nextDouble();
   if (elementTypeFrac < 1/3) {
     result = random(1000);
-    stringRep.add(result);
+    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.add('[...]');
+      stringRep.write('[...]');
     else
-      stringRep.add('{...}');
+      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);
 }