rmuir commented on pull request #127: URL: https://github.com/apache/lucene/pull/127#issuecomment-834312458
in an overlapping case, we can't do the optimization. my suggestion was for a (i think typical?) case where ranges are non-overlapping (facets i see such as price ranges). in that case, it seems like we can avoid the overhead and just don't count a range if it was the same one we visited last time. And I think adding that "if" wouldn't slow down single-valued case either, so we could still just have "two cases" but only do the bitset stuff when ranges overlap, which we can detect up front? -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. For queries about this service, please contact Infrastructure at: us...@infra.apache.org --------------------------------------------------------------------- To unsubscribe, e-mail: issues-unsubscr...@lucene.apache.org For additional commands, e-mail: issues-h...@lucene.apache.org
