--- old/src/share/classes/java/util/AbstractList.java	2014-03-13 23:34:01.165432827 +0400
+++ new/src/share/classes/java/util/AbstractList.java	2014-03-13 23:34:00.689438810 +0400
@@ -563,14 +563,14 @@
      * 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
+     * @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.
      *
-     * @implSpec
-     * This implementation gets a list iterator positioned before
+     * <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
@@ -578,6 +578,10 @@
      *
      * @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);