Big merge from experimental to bleeding edge.

sdk/lib/_internal/compiler/implementation/js/nodes.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.
 
 part of js;
 
 abstract class NodeVisitor<T> {
   T visitProgram(Program node);
 
   T visitBlock(Block node);
@@ skipping 773 matching lines @@
   accept(NodeVisitor visitor) => visitor.visitArrayInitializer(this);
 
   void visitChildren(NodeVisitor visitor) {
     for (ArrayElement element in elements) element.accept(visitor);
   }
 
   int get precedenceLevel => PRIMARY;
 
   static List<ArrayElement> _convert(List<Expression> expressions) {
     int index = 0;
-    return expressions.map(
-        (expression) => new ArrayElement(index++, expression));
+    return expressions.mappedBy(
+        (expression) => new ArrayElement(index++, expression))
+        .toList();
   }
 }
 
 /**
  * An expression inside an [ArrayInitialization]. An [ArrayElement] knows
  * its position in the containing [ArrayInitialization].
  */
 class ArrayElement extends Node {
   int index;
   Expression value;
@@ skipping 78 matching lines @@
 
 Block block1(Statement statement) => new Block(<Statement>[statement]);
 
 Block block2(Statement s1, Statement s2) => new Block(<Statement>[s1, s2]);
 
 Call call(Expression target, List<Expression> arguments) {
   return new Call(target, arguments);
 }
 
 Fun fun(List<String> parameterNames, Block body) {
-  return new Fun(parameterNames.map((n) => new Parameter(n)), body);
+  return new Fun(parameterNames.mappedBy((n) => new Parameter(n)).toList(),
+                 body);
 }
 
 Assignment assign(Expression leftHandSide, Expression value) {
   return new Assignment(leftHandSide, value);
 }
 
 Expression undefined() => new Prefix('void', new LiteralNumber('0'));