- <init>
Creates a TimSort instance to maintain the state of an ongoing sort.
- binarySort
Sorts the specified portion of the specified array using a binary insertion
sort. This is the best m
- countRunAndMakeAscending
Returns the length of the run beginning at the specified position in the
specified array and reverse
- doSort
- ensureCapacity
Ensures that the external array tmp has at least the specified number of
elements, increasing its si
- gallopLeft
Locates the position at which to insert the specified key into the specified
sorted range; if the ra
- gallopRight
Like gallopLeft, except that if the range contains an element equal to key,
gallopRight returns the
- mergeCollapse
Examines the stack of runs waiting to be merged and merges adjacent runs until
the stack invariants
- mergeForceCollapse
Merges all runs on the stack until only one remains. This method is called once,
to complete the sor
- mergeHi
Like mergeLo, except that this method should be called only if len1 >= len2;
mergeLo should be calle
- mergeLo
Merges two adjacent runs in place, in a stable fashion. The first element of the
first run must be g
- minRunLength
Returns the minimum acceptable run length for an array of the specified length.
Natural runs shorter