Github user s1monw commented on the issue:
https://github.com/apache/lucene-solr/pull/521
> t's interesting that you found out that most of the time is spent with
packed ints when sorting, likely because of swaps: the sorting impl that is
being used (InPlaceMergeSorter) is the impl that performs the higher number of
swaps due to the constraint to run in-place. Maybe we should look into spending
a bit more memory on sorting to avoid having so many swaps, eg. with TimSorter
(see ArrayTimSorter for an example).
regarding TimSorter, it looks pretty complex and I wonder how well it would
work with the subclasses and what needs to be implemented. Maybe we can explore
this in a separate change?
---
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
