Rename mappedBy to map.

tools/dom/templates/html/impl/impl_Node.darttemplate

 // 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 html;
 
 /**
  * Lazy implementation of the child nodes of an element that does not request
  * the actual child nodes of an element until strictly necessary greatly
  * improving performance for the typical cases where it is not required.
@@ skipping 120 matching lines @@
 
   dynamic reduce(dynamic initialValue,
       dynamic combine(dynamic previousValue, Node element)) {
     return IterableMixinWorkaround.reduce(this, initialValue, combine);
   }
 
   String join([String separator]) {
     return IterableMixinWorkaround.joinList(this, separator);
   }
 
-  List mappedBy(f(Node element)) {
+  Iterable map(f(Node element)) {

[floitsch, 2013/01/30 14:48:44]

should return an iterable.

[Lasse Reichstein Nielsen, 2013/01/31 11:33:49]

Done.

     return IterableMixinWorkaround.mappedByList(this, f);
   }
 
+  Iterable mappedBy(f(Node element)) => map(f);
+
   Iterable<Node> where(bool f(Node element)) {
     return IterableMixinWorkaround.where(this, f);
   }
 
   bool every(bool f(Node element)) => IterableMixinWorkaround.every(this, f);
 
   bool any(bool f(Node element)) => IterableMixinWorkaround.any(this, f);
 
   List<Node> toList() => new List<Node>.from(this);
   Set<Node> toSet() => new Set<Node>.from(this);
 
   bool get isEmpty => this.length == 0;
 
   // From List<Node>:
 
-  List<Node> take(int n) {
+  Iterable<Node> take(int n) {
     return IterableMixinWorkaround.takeList(this, n);
   }
 
   Iterable<Node> takeWhile(bool test(Node value)) {
     return IterableMixinWorkaround.takeWhile(this, test);
   }
 
-  List<Node> skip(int n) {
+  Iterable<Node> skip(int n) {
     return IterableMixinWorkaround.skipList(this, n);
   }
 
   Iterable<Node> skipWhile(bool test(Node value)) {
     return IterableMixinWorkaround.skipWhile(this, test);
   }
 
   Node firstMatching(bool test(Node value), {Node orElse()}) {
     return IterableMixinWorkaround.firstMatching(this, test, orElse);
   }
@@ skipping 93 matching lines @@
       final Node parent = this.parentNode;
       parent.$dom_replaceChild(otherNode, this);
     } catch (e) {
 
     };
     return this;
   }
 
 $!MEMBERS
 }