You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@pdfbox.apache.org by ti...@apache.org on 2021/11/14 13:22:17 UTC

svn commit: r1895035 - /pdfbox/branches/2.0/pdfbox/src/main/java/org/apache/pdfbox/util/IterativeMergeSort.java

Author: tilman
Date: Sun Nov 14 13:22:16 2021
New Revision: 1895035

URL: http://svn.apache.org/viewvc?rev=1895035&view=rev
Log:
PDFBOX-5308: remove javadoc problems

Modified:
    pdfbox/branches/2.0/pdfbox/src/main/java/org/apache/pdfbox/util/IterativeMergeSort.java

Modified: pdfbox/branches/2.0/pdfbox/src/main/java/org/apache/pdfbox/util/IterativeMergeSort.java
URL: http://svn.apache.org/viewvc/pdfbox/branches/2.0/pdfbox/src/main/java/org/apache/pdfbox/util/IterativeMergeSort.java?rev=1895035&r1=1895034&r2=1895035&view=diff
==============================================================================
--- pdfbox/branches/2.0/pdfbox/src/main/java/org/apache/pdfbox/util/IterativeMergeSort.java (original)
+++ pdfbox/branches/2.0/pdfbox/src/main/java/org/apache/pdfbox/util/IterativeMergeSort.java Sun Nov 14 13:22:16 2021
@@ -21,9 +21,10 @@ import java.util.List;
 import java.util.ListIterator;
 
 /**
- * This class provides an iterative (bottom-up) implementation of the MergeSort algorithm 
- * for any generic Java object which implements a {@link Comparator}.
- * 
+ * This class provides an iterative (bottom-up) implementation of the
+ * <a href="https://en.wikipedia.org/wiki/Merge_sort">MergeSort</a> algorithm for any generic Java
+ * object which implements a {@link Comparator}.
+ *
  * <p>
  * This implementation uses an iterative implementation approach over the more 
  * classical recursive approach in order to save the auxiliary space required 
@@ -39,8 +40,6 @@ import java.util.ListIterator;
  * </ul>
  * 
  * @author Alistair Oldfield
- * 
- * @see https://en.wikipedia.org/wiki/Merge_sort
  *
  */
 public final class IterativeMergeSort
@@ -58,8 +57,6 @@ public final class IterativeMergeSort
      * @param  list the list to be sorted.
      * @param  cmp the comparator to determine the order of the list.
      * 
-     * @see java.util.Collections.sort(List<T>, Comparator<? super T>)
-     * 
      */
     @SuppressWarnings({ "unchecked", "rawtypes"})
     public static <T> void sort(List<T> list, Comparator<? super T> cmp)