Revert "With the collections deriving from ListBase, we no longer need to implement a number of boi…

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 $LIBRARYNAME;
 
 /**
  * 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 65 matching lines @@
       throw new RangeError.range(index, 0, length);
     }
     if (index == length) {
       _this.append(node);
     } else {
       _this.insertBefore(node, this[index]);
     }
   }
 
   void insertAll(int index, Iterable<Node> iterable) {
-    var item = this[index];
-    _this.insertAllBefore(iterable, item);
+    throw new UnimplementedError();
   }
 
   void setAll(int index, Iterable<Node> iterable) {
-    throw new UnsupportedError("Cannot setAll on Node list");
+    throw new UnimplementedError();
   }
 
   Node removeLast() {
     final result = last;
     if (result != null) {
       _this.$dom_removeChild(result);
     }
     return result;
   }
 
@@ skipping 37 matching lines @@
   void clear() {
     _this.text = '';
   }
 
   void operator []=(int index, Node value) {
     _this.$dom_replaceChild(value, this[index]);
   }
 
   Iterator<Node> get iterator => _this.$dom_childNodes.iterator;
 
+  List<Node> toList({ bool growable: true }) =>
+      new List<Node>.from(this, growable: growable);
+  Set<Node> toSet() => new Set<Node>.from(this);
+
+  bool get isEmpty => this.length == 0;
+
   // From List<Node>:
 
   // TODO(jacobr): this could be implemented for child node lists.
   // The exception we throw here is misleading.
-  void sort([Comparator<Node> compare]) {
-    throw new UnsupportedError("Cannot sort Node list");
+  void sort([int compare(Node a, Node b)]) {
+    throw new UnsupportedError("Cannot sort immutable List.");
   }
 
   // FIXME: implement these.
   void setRange(int start, int end, Iterable<Node> iterable,
                 [int skipCount = 0]) {
-    throw new UnsupportedError("Cannot setRange on Node list");
+    throw new UnsupportedError(
+        "Cannot setRange on immutable List.");
+  }
+  void removeRange(int start, int end) {
+    throw new UnsupportedError(
+        "Cannot removeRange on immutable List.");
   }
 
-  void fillRange(int start, int end, [Node fill]) {
-    throw new UnsupportedError("Cannot fillRange on Node list");
+  Iterable<Node> getRange(int start, int end) {
+    throw new UnimplementedError("NodeList.getRange");
+  }
+
+  void replaceRange(int start, int end, Iterable<Node> iterable) {
+    throw new UnimplementedError("NodeList.replaceRange");
+  }
+
+  void fillRange(int start, int end, [Node fillValue]) {
+    throw new UnimplementedError("NodeList.fillRange");
+  }
+
+  List<Node> sublist(int start, [int end]) {
+    if (end == null) end == length;
+    return Lists.getRange(this, start, end, <Node>[]);
+  }
+
+  String toString() {
+    StringBuffer buffer = new StringBuffer('[');
+    buffer.writeAll(this, ', ');
+    buffer.write(']');
+    return buffer.toString();
   }
   // -- end List<Node> mixins.
 
   // TODO(jacobr): benchmark whether this is more efficient or whether caching
   // a local copy of $dom_childNodes is more efficient.
   int get length => _this.$dom_childNodes.length;
 
   void set length(int value) {
     throw new UnsupportedError(
         "Cannot set length on immutable List.");
@@ skipping 155 matching lines @@
   }
 
   /**
    * Print out a String representation of this Node.
    */
   String toString() => localName == null ?
       (nodeValue == null ? super.toString() : nodeValue) : localName;
 
 $!MEMBERS
 }