You are viewing a plain text version of this content. The canonical link for it is here.
Posted to dev@lucene.apache.org by "ASF subversion and git services (JIRA)" <ji...@apache.org> on 2013/07/31 09:51:50 UTC

[jira] [Commented] (LUCENE-4946) Refactor SorterTemplate

    [ https://issues.apache.org/jira/browse/LUCENE-4946?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13724987#comment-13724987 ] 

ASF subversion and git services commented on LUCENE-4946:
---------------------------------------------------------

Commit 1508757 from [~jpountz] in branch 'dev/trunk'
[ https://svn.apache.org/r1508757 ]

LUCENE-5140: Fixed performance regression of span queries caused by LUCENE-4946.
                
> Refactor SorterTemplate
> -----------------------
>
>                 Key: LUCENE-4946
>                 URL: https://issues.apache.org/jira/browse/LUCENE-4946
>             Project: Lucene - Core
>          Issue Type: Improvement
>            Reporter: Adrien Grand
>            Assignee: Adrien Grand
>            Priority: Trivial
>             Fix For: 4.4
>
>         Attachments: LUCENE-4946.patch, LUCENE-4946.patch, LUCENE-4946.patch
>
>
> When working on TimSort (LUCENE-4839), I was a little frustrated of not being able to add galloping support because it would have required to add new primitive operations in addition to compare and swap.
> I started working on a prototype that uses inheritance to allow some sorting algorithms to rely on additional primitive operations. You can have a look at https://github.com/jpountz/sorts/tree/master/src/java/net/jpountz/sorts (but beware it is a prototype and still misses proper documentation and good tests).
> I think it would offer several advantages:
>  - no more need to implement setPivot and comparePivot when using in-place merge sort or insertion sort,
>  - the ability to use faster stable sorting algorithms at the cost of some memory overhead (our in-place merge sort is very slow),
>  - the ability to implement properly algorithms that are useful on specific datasets but require different primitive operations (such as TimSort for partially-sorted data).
> If you are interested in comparing these implementations with Arrays.sort, there is a Benchmark class in src/examples.
> What do you think?

--
This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators
For more information on JIRA, see: http://www.atlassian.com/software/jira

---------------------------------------------------------------------
To unsubscribe, e-mail: dev-unsubscribe@lucene.apache.org
For additional commands, e-mail: dev-help@lucene.apache.org