Julien Nioche wrote:
These computations are performed only once per search. I would be very surprised if they significantly improved performance. Optimizations that do not significantly improve performance are usually a bad idea, since they tend to make the code larger, harder to understand, harder to maintain, buggier, etc. In general, a significant overall speedup in a real task must be shown to warrant a performance optimization.This kind of modification could be done in almost all the methods of the classes BooleanQuery and PhraseQuery, providing a small optimization (I did not mesure it - but even small optimizations can be useful).
Doug
--
To unsubscribe, e-mail: <mailto:[EMAIL PROTECTED]>
For additional commands, e-mail: <mailto:[EMAIL PROTECTED]>
