HomeSort by relevance Sort by last modified time
    Searched defs:TimSort (Results 1 - 3 of 3) sorted by null

  /libcore/ojluni/src/main/java/java/util/
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> {
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) {
218 // If array is small, do a "mini-TimSort" with no merges
230 TimSort<T> ts = new TimSort<>(a, c, work, workBase, workLen);
    [all...]
ArraysParallelSortHelpers.java 55 * TimSort), then so is the full sort. If big enough, they split the
69 * The base sequential sorts rely on non-public versions of TimSort,
145 TimSort.sort(a, b, b + n, c, w, wb, n);
    [all...]
Arrays.java 96 * TimSort used with this comparator. If not, you are better off
    [all...]

Completed in 102 milliseconds