Remove js.ArrayElement.

pkg/compiler/lib/src/js_backend/codegen/codegen.dart

 // Copyright (c) 2014, 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 code_generator;
 
 import 'glue.dart';
 
 import '../../tree_ir/tree_ir_nodes.dart' as tree_ir;
 import '../../js/js.dart' as js;
@@ skipping 208 matching lines @@
   @override
   js.Expression visitInvokeSuperMethod(tree_ir.InvokeSuperMethod node) {
     return giveup(node);
     // TODO: implement visitInvokeSuperMethod
   }
 
   @override
   js.Expression visitLiteralList(tree_ir.LiteralList node) {
     registry.registerInstantiatedClass(glue.listClass);
     int length = node.values.length;
-    List<js.ArrayElement> entries = new List<js.ArrayElement>.generate(length,
-        (int i) => new js.ArrayElement(i, visitExpression(node.values[i])));
-    return new js.ArrayInitializer(length, entries);
+    List<js.Expression> entries = node.values.map(visitExpression).toList();
+    return new js.ArrayInitializer(entries);
   }
 
   @override
   js.Expression visitLiteralMap(tree_ir.LiteralMap node) {
     ConstructorElement constructor;
     if (node.entries.isEmpty) {
       constructor = glue.mapLiteralConstructorEmpty;
     } else {
       constructor = glue.mapLiteralConstructor;
     }
-    List<js.ArrayElement> entries =
-        new List<js.ArrayElement>(2 * node.entries.length);
+    List<js.Expression> entries =
+        new List<js.Expression>(2 * node.entries.length);
     for (int i = 0; i < node.entries.length; i++) {
-      js.Expression key = visitExpression(node.entries[i].key);
-      js.Expression value = visitExpression(node.entries[i].value);
-      entries[2 * i] = new js.ArrayElement(2 * i, key);
-      entries[2 * i + 1] = new js.ArrayElement(2 * i + 1, value);
+      entries[2 * i] = visitExpression(node.entries[i].key);
+      entries[2 * i + 1] = visitExpression(node.entries[i].value);
     }
     List<js.Expression> args =
-        <js.Expression>[new js.ArrayInitializer(node.entries.length * 2,
-                                                entries)];
+        <js.Expression>[new js.ArrayInitializer(entries)];
     return buildStaticInvoke(
         new Selector.call(constructor.name, constructor.library, 2),
         constructor,
         args);
   }
 
   @override
   js.Expression visitLogicalOperator(tree_ir.LogicalOperator node) {
     return new js.Binary(node.operator, visit(node.left), visit(node.right));
   }
@@ skipping 151 matching lines @@
     accumulator.add(
         buildWhile(new js.LiteralBool(true), node.body, node.label, node));
   }
 
   @override
   void visitReturn(tree_ir.Return node) {
     accumulator.add(new js.Return(visitExpression(node.value)));
   }
 
 }