gsmiller commented on pull request #127: URL: https://github.com/apache/lucene/pull/127#issuecomment-834346001
Oh yeah, good point @rmuir! I actually wonder if a separate implementation of the segment-tree counter (`LongRangeCounter`) would make sense for this typical case. The entire "rollup" step can be avoided if there are no overlapping ranges. Counting each value becomes a simple binary search for the elementary interval, then a check if that interval is a requested range or "in between" requested ranges. Multi-value cases can utilize the optimization you suggest to avoid double-counting. Hmm... let me try that out. -- 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
