[ https://issues.apache.org/jira/browse/LUCENE-3199?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13096108#comment-13096108 ]
Jason Rutherglen commented on LUCENE-3199: ------------------------------------------ Simon, In summary this is using the BytesRefHash sort, performing array copies and then merge [sorting] into a new copy / view. Array copies are fast and counter intuitively generate far less garbage than objects (in Java). Instead of creating term 'segments' that would be merged while iterating the terms enum, we'll be generating static point-in-time terms dict views. These will be useful for enabling DocTermsIndex field caches for RT, the only remaining design 'challenge' for RT / LUCENE-2312. Because there is a terms hash, we can seek exact to the term rather than perform an [optimized] seek to the term. > Add non-desctructive sort to BytesRefHash > ----------------------------------------- > > Key: LUCENE-3199 > URL: https://issues.apache.org/jira/browse/LUCENE-3199 > Project: Lucene - Java > Issue Type: Improvement > Components: core/index > Affects Versions: 4.0 > Reporter: Jason Rutherglen > Priority: Minor > Attachments: LUCENE-3199.patch, LUCENE-3199.patch, LUCENE-3199.patch, > LUCENE-3199.patch > > > Currently the BytesRefHash is destructive. We can add a method that returns > a non-destructively generated int[]. -- This message is automatically generated by JIRA. For more information on JIRA, see: http://www.atlassian.com/software/jira --------------------------------------------------------------------- To unsubscribe, e-mail: dev-unsubscr...@lucene.apache.org For additional commands, e-mail: dev-h...@lucene.apache.org