: CH> you might be able to shave a little bit of speed off by accessing the bits : CH> from the Filter directly and iterating over them yourself to check the : CH> FieldCache ad build up your sorted list of the first "N" -- i think that : CH> would save you one method call per match (the score method of : CH> ConstantScoreQuery) : : What is the "sorted list of the first "N""?
Whatever you want it to be ... my point is merely that the existing Lucene code for sorted searching involves a "Query" -- if you know you want to start with a Filter, then you might be able to come up with a faster mechanism for getting sorted results using the BitSet directly, collecting however many of the sorted resutls you care about in a data structure of your choosing. but this is all just speculation. -Hoss --------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
