rmuir commented on pull request #127:
URL: https://github.com/apache/lucene/pull/127#issuecomment-833971467
@gsmiller do you think we are taking advantage of the sortedness of
`SORTED_NUMERIC` here? e.g. do we really need a bitset or could we record hits
high-level like this:
```
int lastRangeID = -1; // prevents double counting a range within multivalued
doc
for (value : values) {
rangeID = segmentTree.lookup(value);
if (rangeID != lastRangeID) {
hits[rangeID]++;
lastRangeID = rangeID;
}
}
```
I'm trying to see if we can accelerate (e.g. avoid bitsets) and maybe reduce
overhead between single and multi-valued algorithms, it may simplify code. Of
course such an optimization is harder if range can be overlapping.
--
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
