Remove insertRange.

sdk/lib/html/html_common/filtered_element_list.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.
 
 part of html_common;
 
 /**
  * An indexable collection of a node's descendants in the document tree,
  * filtered so that only elements are in the collection.
  */
@@ skipping 28 matching lines @@
   }
 
   void set length(int newLength) {
     final len = this.length;
     if (newLength >= len) {
       return;
     } else if (newLength < 0) {
       throw new ArgumentError("Invalid list length");
     }
 
-    removeRange(newLength, len - newLength);
+    removeRange(newLength, len);
   }
 
   String join([String separator = ""]) => _filtered.join(separator);
 
   void add(Element value) {
     _childNodes.add(value);
   }
 
   void addAll(Iterable<Element> iterable) {
     for (Element element in iterable) {
       add(element);
     }
   }
 
   bool contains(Element element) {
     return element is Element && _childNodes.contains(element);
   }
 
   Iterable<Element> get reversed => _filtered.reversed;
 
   void sort([int compare(Element a, Element b)]) {
     throw new UnsupportedError('TODO(jacobr): should we impl?');
   }
 
   void setRange(int start, int end, Iterable<Element> iterable,
                 [int skipCount = 0]) {
     throw new UnimplementedError();
   }
 
-  void removeRange(int start, int rangeLength) {
-    _filtered.sublist(start, start + rangeLength).forEach((el) => el.remove());
-  }
-
-  void insertRange(int start, int rangeLength, [initialValue = null]) {
-    throw new UnimplementedError();
+  void removeRange(int start, int end) {
+    _filtered.sublist(start, end).forEach((el) => el.remove());
   }
 
   void clear() {
     // Currently, ElementList#clear clears even non-element nodes, so we follow
     // that behavior.
     _childNodes.clear();
   }
 
   Element removeLast() {
     final result = this.last;
@@ skipping 98 matching lines @@
   Element get single => _filtered.single;
 
   Element min([int compare(Element a, Element b)]) => _filtered.min(compare);
 
   Element max([int compare(Element a, Element b)]) => _filtered.max(compare);
 
   Map<int, Element> asMap() {
     return IterableMixinWorkaround.asMapList(this);
   }
 }