Searched defs:TimSort (Results 1 - 1 of 1) sorted by relevance
/libcore/ojluni/src/main/java/java/util/ |
H A D | TimSort.java | 56 * (privately) instantiable; a TimSort instance holds the state of an ongoing 58 * TimSort. Small arrays are sorted in place, using a binary insertion sort. 62 class TimSort<T> { class 75 * computation in the TimSort constructor, or you risk an 138 * Creates a TimSort instance to maintain the state of an ongoing sort. 146 private TimSort(T[] a, Comparator<? super T> c, T[] work, int workBase, int workLen) { method in class:TimSort 218 // If array is small, do a "mini-TimSort" with no merges 230 TimSort<T> ts = new TimSort<>(a, c, work, workBase, workLen);
|
Completed in 105 milliseconds