dsmiley opened a new pull request #426: URL: https://github.com/apache/lucene/pull/426
* clarify which sorts are stable/not * link from utility methods to the primary Sorter implementations for further information * describe when InPlaceMergeSorter is useful. Fix incorrect statement that is uses insertion sort. As an aside, I'm dubious on the value of InPlaceMergeSorter. If my statement in the docs I added is correct, that it's for small arrays to avoid allocating memory, then such use-cases could call TimSorter and we could enhance TimSorter to up-front recognize it's a "small" array and go directly into binarySort without allocating anything. WDYT? We could just do that any way. -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: [email protected] For queries about this service, please contact Infrastructure at: [email protected] --------------------------------------------------------------------- To unsubscribe, e-mail: [email protected] For additional commands, e-mail: [email protected]
