Refactor List.setRange function.

sdk/lib/collection/list.dart

 // Copyright (c) 2013, 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 dart.collection;
 
 /**
  * Abstract implementation of a list.
  *
  * All operations are defined in terms of `length`, `operator[]`,
@@ skipping 259 matching lines @@
 
   void addAll(Iterable<E> iterable) {
     for (E element in iterable) {
       this[this.length++] = element;
     }
   }
 
   void remove(Object element) {
     for (int i = 0; i < this.length; i++) {
       if (this[i] == element) {
-        this.setRange(i, this.length - i - 1, this, i + 1);
+        this.setRange(i, i + this.length - 1, this, i + 1);
         this.length -= 1;
         return;
       }
     }
   }
 
   void removeAll(Iterable<Object> elements) {
     if (elements is! Set) {
       elements = elements.toSet();
     }
@@ skipping 84 matching lines @@
   }
 
   void insertRange(int start, int length, [E initialValue]) {
     if (start < 0 || start > this.length) {
       throw new RangeError.range(start, 0, this.length);
     }
     int oldLength = this.length;
     int moveLength = oldLength - start;
     this.length += length;
     if (moveLength > 0) {
-      this.setRange(start + length, moveLength, this, start);
+      this.setRange(start + length, oldLength, this, start);
     }
     for (int i = 0; i < length; i++) {
       this[start + i] = initialValue;
     }
   }
 
   void removeRange(int start, int length) {
     if (start < 0 || start > this.length) {
       throw new RangeError.range(start, 0, this.length);
     }
     if (length < 0 || start + length > this.length) {
       throw new RangeError.range(length, 0, this.length - start);
     }
     int end = start + length;
-    setRange(start, this.length - end, this, end);
+    setRange(start, this.length - length, this, end);
     this.length -= length;
   }
 
   void clearRange(int start, int length, [E fill]) {
     for (int i = 0; i < length; i++) {
       this[start + i] = fill;
     }
   }
 
-  void setRange(int start, int length, List<E> from, [int startFrom]) {
+  void setRange(int start, int end, List<E> from, [int startFrom]) {
     if (start < 0 || start > this.length) {
       throw new RangeError.range(start, 0, this.length);
     }
-    if (length < 0 || start + length > this.length) {
-      throw new RangeError.range(length, 0, this.length - start);
+    if (end < 0 || end > this.length) {
+      throw new RangeError.range(end, start, this.length);
     }
     if (startFrom == null) {
       startFrom = 0;
     }
+    int length = end - start;
     if (startFrom < 0 || startFrom + length > from.length) {
       throw new RangeError.range(startFrom, 0, from.length - length);
     }
     if (startFrom < start) {
       // Copy backwards to ensure correct copy if [from] is this.
       for (int i = length - 1; i >= 0; i--) {
         this[start + i] = from[startFrom + i];
       }
     } else {
       for (int i = 0; i < length; i++) {
@@ skipping 36 matching lines @@
     for (int i = startIndex; i >= 0; i--) {
       if (this[i] == element) {
         return i;
       }
     }
     return -1;
   }
 
   Iterable<E> get reversed => new ReversedListIterable(this);
 }