src/share/classes/java/util/AbstractList.java

*** 561,585 ****
       * {@code fromIndex}, inclusive, and {@code toIndex}, exclusive.
       * Shifts any succeeding elements to the left (reduces their index).
       * This call shortens the list by {@code (toIndex - fromIndex)} elements.
       * (If {@code toIndex==fromIndex}, this operation has no effect.)
       *
!      * <p>This method is called by the {@code clear} operation on this list
       * and its subLists.  Overriding this method to take advantage of
       * the internals of the list implementation can <i>substantially</i>
       * improve the performance of the {@code clear} operation on this list
       * and its subLists.
       *
!      * @implSpec
!      * This implementation gets a list iterator positioned before
       * {@code fromIndex}, and repeatedly calls {@code ListIterator.next}
       * followed by {@code ListIterator.remove} until the entire range has
       * been removed.  <b>Note: if {@code ListIterator.remove} requires linear
       * time, this implementation requires quadratic time.</b>
       *
       * @param fromIndex index of first element to be removed
       * @param toIndex index after last element to be removed
       */
      protected void removeRange(int fromIndex, int toIndex) {
          ListIterator<E> it = listIterator(fromIndex);
          for (int i=0, n=toIndex-fromIndex; i<n; i++) {
              it.next();
--- 561,589 ----
       * {@code fromIndex}, inclusive, and {@code toIndex}, exclusive.
       * Shifts any succeeding elements to the left (reduces their index).
       * This call shortens the list by {@code (toIndex - fromIndex)} elements.
       * (If {@code toIndex==fromIndex}, this operation has no effect.)
       *
!      * @implSpec
!      * This method is called by the {@code clear} operation on this list
       * and its subLists.  Overriding this method to take advantage of
       * the internals of the list implementation can <i>substantially</i>
       * improve the performance of the {@code clear} operation on this list
       * and its subLists.
       *
!      * <p>This implementation gets a list iterator positioned before
       * {@code fromIndex}, and repeatedly calls {@code ListIterator.next}
       * followed by {@code ListIterator.remove} until the entire range has
       * been removed.  <b>Note: if {@code ListIterator.remove} requires linear
       * time, this implementation requires quadratic time.</b>
       *
       * @param fromIndex index of first element to be removed
       * @param toIndex index after last element to be removed
+      *
+      * @throws IndexOutOfBoundsException if {@code (fromIndex < 0 ||
+      *         fromIndex > size())}
+      * @throws NoSuchElementException if {@code (toIndex > size())}
       */
      protected void removeRange(int fromIndex, int toIndex) {
          ListIterator<E> it = listIterator(fromIndex);
          for (int i=0, n=toIndex-fromIndex; i<n; i++) {
              it.next();