[
https://issues.apache.org/jira/browse/LUCENE-10378?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=17489193#comment-17489193
]
Gautam Worah commented on LUCENE-10378:
---------------------------------------
Another basic question for you folks, since we are solving for only 1
dimensional points, did you mean just a one level basic check like
{code:java}
if (relate(values.getPointTree().getMinPackedValue(),
values.getPointTree().getMaxPackedValue()) == Relation.CELL_INSIDE_QUERY) {
return ((int) values.getPointTree().size());
}
{code}
or did you intend to do a full BFS over the tree (and its children), then keep
checking if the {{getMinPackedValue}} of a PointTree is greater than the
{{upperPoint}} or the {{getMaxPackedValue}} of the PointTree is less than
{{lowerPoint}}, if yes then we exclude that node and move on. Is this what you
meant?
> Implement Weight#count on PointRangeQuery
> -----------------------------------------
>
> Key: LUCENE-10378
> URL: https://issues.apache.org/jira/browse/LUCENE-10378
> Project: Lucene - Core
> Issue Type: Task
> Reporter: Adrien Grand
> Priority: Minor
> Time Spent: 1h
> Remaining Estimate: 0h
>
> When there are no deletions and the field is single-valued (docCount == size)
> and has a single-dimension, PointRangeQuery could implement {{Weight#count}}
> by only counting matches on the two leaves that cross with the query.
--
This message was sent by Atlassian Jira
(v8.20.1#820001)
---------------------------------------------------------------------
To unsubscribe, e-mail: issues-unsubscr...@lucene.apache.org
For additional commands, e-mail: issues-h...@lucene.apache.org
