gf2121 opened a new pull request, #12623: URL: https://github.com/apache/lucene/pull/12623
### Description As `StableMSBRadixSorter` always requires a `O(n)` extra memory. We can use a `MergeSorter` taking advantage of the extra memory instead of `InPlaceMergeSorter`. ### Benchmark This reduces around 15% took of sorting 10,000,000 timestamp values (long) with `StableMSBRadisSorter`. <!--StartFragment--><byte-sheet-html-origin data-id="1696443928669" data-version="4" data-is-embed="false" data-grid-line-hidden="false" data-importRangeRawData-spreadSource="https://bytedance.feishu.cn/sheets/HSetsPqDrhicnet5lWrcOXMtnRc"; data-importRangeRawData-range="'Sheet1'!A1:D2"> | baseline | candidate | took diff -- | -- | -- | -- sort took | 5285 | 4464 | -15.53% </byte-sheet-html-origin><!--EndFragment--> -- 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: issues-unsubscr...@lucene.apache.org For queries about this service, please contact Infrastructure at: us...@infra.apache.org --------------------------------------------------------------------- To unsubscribe, e-mail: issues-unsubscr...@lucene.apache.org For additional commands, e-mail: issues-h...@lucene.apache.org
