Add tests for Element#elements.

client/html/src/NodeWrappingImplementation.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.
 
 class _ChildrenNodeList implements NodeList {
   // Raw node.
   final _node;
   final _childNodes;
 
   _ChildrenNodeList._wrap(var node)
     : _childNodes = node.childNodes,
       _node = node;
 
   List<Node> _toList() {
     final output = new List(_childNodes.length);
     for (int i = 0, len = _childNodes.length; i < len; i++) {
       output[i] = LevelDom.wrapNode(_childNodes[i]);
     }
     return output;
   }
 
   Node get first() {
     return LevelDom.wrapNode(_node.firstChild);
   }
 
   void forEach(void f(Node element)) => _toList().forEach(f);
 
-  Collection map(f(Node element)) {
-    List output = new List();
-    forEach((Node element) {
-        output.add(f(element));
-    });
-    return output;
-  }
+  Collection map(f(Node element)) => _toList().map(f);
 
-  Collection<Node> filter(bool f(Node element)) {
-    List<Node> output = new List<Node>();
-    forEach((Node element) {
-      if (f(element)) {
-        output.add(element);
-      }
-    });
-    return output;
-  }
+  Collection<Node> filter(bool f(Node element)) => _toList().filter(f);
 
   bool every(bool f(Node element)) {
     for(Node element in this) {
       if (!f(element)) {
         return false;
       }
     };
     return true;
   }
 
@@ skipping 49 matching lines @@
   }
 
   void sort(int compare(Node a, Node b)) {
     throw const UnsupportedOperationException('TODO(jacobr): should we impl?');
   }
 
   void copyFrom(List<Object> src, int srcStart, int dstStart, int count) {
     throw 'Not impl yet. todo(jacobr)';
   }
 
-  void setRange(int start, int length, List from, [int startFrom = 0]) {
-    // TODO(nweiz): remove these IndexOutOfRange checks once Frog has bounds
-    // checking for List indexing
-    if (start < 0) {
-      throw new IndexOutOfRangeException(start);
-    } else if (startFrom < 0) {
-      throw new IndexOutOfRangeException(startFrom);
-    } else if (length < 0) {
-      throw new IllegalArgumentException("negative length $length");
-    } else if (start + length > this.length) {
-      throw new IndexOutOfRangeException(Math.min(this.length, start));
-    } else if (startFrom + length > from.length) {
-      throw new IndexOutOfRangeException(Math.min(from.length, startFrom));
-    }
+  void setRange(int start, int length, List from, [int startFrom = 0]) =>
+    Lists.setRange(this, start, length, from, startFrom);
 
-    for (var i = 0; i < length; i++) {
-      this[start + i] = from[startFrom + i];
-    }
-  }
-
-  void removeRange(int start, int length) {
-    // TODO(nweiz): remove these IndexOutOfRange checks once Frog has bounds
-    // checking for List indexing
-    if (start < 0) {
-      throw new IndexOutOfRangeException(start);
-    } else if (length < 0) {
-      throw new IllegalArgumentException("negative length $length");
-    } else if (start + length > this.length) {
-      throw new IndexOutOfRangeException(Math.min(this.length, start));
-    }
-
-    for (var i = 0; i < length; i++) {
-      this[start].remove();
-    }
-  }
+  void removeRange(int start, int length) =>
+    Lists.removeRange(this, start, length, (i) => this[i].remove());
 
   void insertRange(int start, int length, [initialValue = null]) {
     throw const NotImplementedException();
   }
 
-  List getRange(int start, int length) {
-    // TODO(nweiz): remove these IndexOutOfRange checks once Frog has bounds
-    // checking for List indexing
-    if (start < 0) {
-      throw new IndexOutOfRangeException(start);
-    } else if (length < 0) {
-      throw new IllegalArgumentException("negative length $length");
-    } else if (start + length > this.length) {
-      throw new IndexOutOfRangeException(Math.min(this.length, start));
-    }
-
-    var nodes = <Node>[];
-    for (var i = 0; i < length; i++) {
-      nodes.add(this[start + i]);
-    }
-    return nodes;
-  }
+  List getRange(int start, int length) => Lists.getRange(this, start, length);
 
   int indexOf(Node element, [int start = 0]) {
-    return _Lists.indexOf(this, element, start, this.length);
+    return Lists.indexOf(this, element, start, this.length);
   }
 
   int lastIndexOf(Node element, [int start = null]) {
     if (start === null) start = length - 1;
-    return _Lists.lastIndexOf(this, element, start);
+    return Lists.lastIndexOf(this, element, start);
   }
 
   void clear() {
     _node.textContent = '';
   }
 
   Node removeLast() {
     final last = this.last();
     if (last != null) {
       _node.removeChild(LevelDom.unwrap(last));
@@ skipping 69 matching lines @@
   // array.
   Node insertBefore(Node newChild, Node refChild) {
     return LevelDom.wrapNode(_ptr.insertBefore(
         LevelDom.unwrap(newChild), LevelDom.unwrap(refChild)));
   }
 
   Node clone(bool deep) {
     return LevelDom.wrapNode(_ptr.cloneNode(deep));
   }
 }