- <init>
Creates a ListSort
- allocateStack
Allocate temp variables for the given length This method should be called at
least once, but only if
- clean
reset the runs stack to 0
- gallopLeft
Locate the proper position of key in an array; if the array contains an element
equal to key, return
- gallopRight
Exactly like gallopLeft(), except that if key already exists in array[0:n],
finds the position immed
- getLength
return the useful length of the array being sorted
- getRunLength
Return the length of the run beginning at lastId, in the slice [lastId, lastId].
firstId < lastId is
- innerMergeHigh
Attempt to unroll "goto" style original implementation. this method uses and
change temp attributes
- innerMergeLow
Attempt to unroll "goto" style original implementation. this method uses and
change temp attributes
- mergeCollapse
Examine the stack of runs waiting to be merged, merging adjacent runs until the
stack invariants are
- mergeComputeMinRun
returns the minimum run length for merging see
http://svn.python.org/projects/python/trunk/Objects/l
- mergeForceCollapse
Merge all the remaining runs to merge