On Tue, Nov 14, 2017 at 11:57 AM, Chris Hostetter

I think you are missing the forest for the trees: after LUCENE-4100
and LUCENE-7993 it would really be much slower, for example like 10x
slower for boolean OR queries, because it would have no choice but to
return POSITIVE_INFINITY for maxScore(). And it would be much slower
for phrase queries too because it would be forced to always enumerate
all positions, and we'd have to add crappy methods so that it could
publicly confess its brokenness and fallback algorithms to phrase
scoring for that case. This is not sustainable and completely the
wrong tradeoff. Please read the issues that i referenced and see those
benchmarks, it is extremely important to understanding the entire