\r
import java.util.Comparator;\r
\r
-/**\r
- * Provides methods to sort arrays of objects. Sorting requires working memory and this class allows that memory to be reused to\r
+/** Provides methods to sort arrays of objects. Sorting requires working memory and this class allows that memory to be reused to\r
* avoid allocation. The sorting is otherwise identical to the Arrays.sort methods (uses timsort).<br>\r
* <br>\r
* Note that sorting primitive arrays with the Arrays.sort methods does not allocate memory (unless sorting large arrays of char,\r
* short, or byte).\r
- * @author Nathan Sweet\r
- */\r
+ * @author Nathan Sweet */\r
public class Sort {\r
static private Sort instance;\r
\r
timSort.doSort(a, c, fromIndex, toIndex);\r
}\r
\r
- /**\r
- * Returns a Sort instance for convenience. Multiple threads must not use this instance at the same time.\r
- */\r
+ /** Returns a Sort instance for convenience. Multiple threads must not use this instance at the same time. */\r
static public Sort instance () {\r
if (instance == null) instance = new Sort();\r
return instance;\r