Big merge from experimental to bleeding edge.

tests/language/local_function_test.dart

 // Copyright (c) 2011, 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.
 // Dart test program testing closures.
 
 class LocalFunctionTest {
   LocalFunctionTest() : field1 = 100, field2_ = 200  { }
   static int f(int n) {
     int a = 0;
     g(int m) {
       a = 3*n + m + 1;  // Capture parameter n and local a.
       return a;
     }
     var b = g(n);
     return a + b;
   }
   static int h(int n) {
     k(int n) {
-      var a = new List(n);
-      var b = new List(n);
+      var a = new List.fixedLength(n);
+      var b = new List.fixedLength(n);
       int i;
       for (i = 0; i < n; i++) {
         var j = i;
         a[i] = () => i;  // Captured i is always n.
         b[i] = () => j;  // Captured j varies from 0 to n-1.
       }
       var a_sum = 0;
       var b_sum = 0;
       for (int i = 0; i < n; i++) {
         a_sum += a[i]();
         b_sum += b[i]();
       }
       return a_sum + b_sum;
     }
     return k(n);
   }
   static int h2(int n) {
     k(int n) {
-      var a = new List(n);
-      var b = new List(n);
+      var a = new List.fixedLength(n);
+      var b = new List.fixedLength(n);
       for (int i = 0; i < n; i++) {
         var j = i;
         a[i] = () => i;  // Captured i varies from 0 to n-1.
         b[i] = () => j;  // Captured j varies from 0 to n-1.
       }
       var a_sum = 0;
       var b_sum = 0;
       for (int i = 0; i < n; i++) {
         a_sum += a[i]();
         b_sum += b[i]();
@@ skipping 36 matching lines @@
       } else {
         return 1 + foo(n - 1);  // Local foo, not static foo.
       }
     };
     return foo(n);  // Local foo, not static foo.
   }
   static void hep(Function f) {
     f();
   }
   static testNesting(int n) {
-    var a = new List(n*n);
+    var a = new List.fixedLength(n*n);
     f0() {
       for (int i = 0; i < n; i++) {
         int vi = i;
         f1() {
           for (int j = 0; j < n; j++) {
             int vj = j;
             a[i*n + j] = () => vi*n + vj;
           }
         }
         f1();
@@ skipping 75 matching lines @@
     Expect.equals(24*25/2, testNesting(5));
     Expect.equals(true, testClosureCallStatement(7));
     Expect.equals(99, doThis(10, (n) => n * n - 1));
     testExceptions();
   }
 }
 
 main() {
   LocalFunctionTest.testMain();
 }