vsop-479 commented on PR #13072: URL: https://github.com/apache/lucene/pull/13072#issuecomment-1980188859
> I think the optimization may be similar to the one done in AutomatonTermsEnum? It seems the optimization of `AutomatonTermsEnum` is to improve iterating term mode, from seeking bytes from DFA and seek termsEnum(`seekCeil`), to simply sequential reads the termsEnum, after finding a loop(`setLinear`). In both mode, `AutomatonTermsEnum` needs to check if the term is accepted by running automaton. If I am not mistaken, this optimization is different from `AutomatonTermsEnum`'s. It directly matches all reminding suffixes and sub blocks, after detecting an accept state with a `.*` transition back onto itself. Or maybe you mean we can improve `AutomatonTermsEnum`'s optimization, to implement this optimization's effect? @rmuir -- 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-unsubscr...@lucene.apache.org 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
