gsmiller opened a new pull request, #12320: URL: https://github.com/apache/lucene/pull/12320
### Description Adds the ability to directly build a binary automaton for a string union using the Daciuk-Mihov algorithm, and uses it to make the `TermInSetQuery#visit` implementation a little more optimal. I'm hoping we end up moving to an automaton approach in general for `TermInSetQuery` (see #12312), but I think this is a good iterative step for now, as suggested by @rmuir / @mikemccand in #12310. -- 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
