Can you provide more information about your automaton and why 'recompiling' it might be expensive?
E.g. #states/#transitions, is it finite or infinite, etc. On Wed, Aug 31, 2011 at 10:56 AM, eks dev <eks...@yahoo.co.uk> wrote: > Thanks Robert, this is what I expected after looking into CompiledAutomaton .. > > On Wed, Aug 31, 2011 at 2:00 PM, Robert Muir <rcm...@gmail.com> wrote: >> On Wed, Aug 31, 2011 at 3:51 AM, eks dev <eks...@yahoo.co.uk> wrote: >>> At the moment it is not possible (?) to construct AutomatonQuery with >>> RunAutomaton. >>> Would it make sense to add this possibility? Is it doable at all? >> >> Its not doable, we need more information than the runautomaton, its not >> enough. >> >> -- >> lucidimagination.com >> >> --------------------------------------------------------------------- >> To unsubscribe, e-mail: dev-unsubscr...@lucene.apache.org >> For additional commands, e-mail: dev-h...@lucene.apache.org >> >> > > --------------------------------------------------------------------- > To unsubscribe, e-mail: dev-unsubscr...@lucene.apache.org > For additional commands, e-mail: dev-h...@lucene.apache.org > > -- lucidimagination.com --------------------------------------------------------------------- To unsubscribe, e-mail: dev-unsubscr...@lucene.apache.org For additional commands, e-mail: dev-h...@lucene.apache.org
