Description
The way that BooleanScorer works looks like this:
for each (window of 2048 docs) { for each (optional scorer) { scorer.score(window) } }
This is not efficient for very sparse clauses (doc freq much lower than maxDoc/2048) since we keep on scoring windows of documents that do not match anything. BooleanScorer2 currently performs better in those cases.