You are viewing a plain text version of this content. The canonical link for it is here.
Posted to issues@lucene.apache.org by "jpountz (via GitHub)" <gi...@apache.org> on 2023/02/16 14:27:20 UTC

[GitHub] [lucene] jpountz commented on issue #11915: Make Lucene smarter about long runs of matches

jpountz commented on issue #11915:
URL: https://github.com/apache/lucene/issues/11915#issuecomment-1433171306

   Thanks for looking!
   
   > peekNextNonMatchingDocID() - 1 is guaranteed to not be a match.
   
   `peekNextNonMatchingDocID() - 1` would either be the current doc ID, or a match. (did you make a typo when writing that it's guaranteed *not* to be a match?)
   
   > But I'm wondering if it will be better for the API to just return the next, furthest out doc ID that we know is not going to be a match?
   
   Ideally our queries that can compute this information cheaply would do this. I wanted to make it an optional API so that all queries like doc-values-based queries wouldn't have to linearly scan until they find a non-match, which could often be more costly than asking other clauses to advance.


-- 
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.

To unsubscribe, e-mail: issues-unsubscribe@lucene.apache.org

For queries about this service, please contact Infrastructure at:
users@infra.apache.org


---------------------------------------------------------------------
To unsubscribe, e-mail: issues-unsubscribe@lucene.apache.org
For additional commands, e-mail: issues-help@lucene.apache.org