Hi Robert,
Thanks for quick reply.
>Do you have a real use case for such a query or is it just an early
>April Fools? :)
Yes, this is a real use case...
What I was trying to do is search the file containing a bit-sequence and
specific bit is on/off. For example, search files containing a
bit-sequence such as "0110101011..." and third-bit is on.
>"For every n, there exist n-state NFAs such that every subset of
>states is reachable from the initial subset, so that the converted DFA
>has exactly 2n states. A simple example requiring nearly this many
>states is the language of strings over the alphabet {0,1} in which
>there are at least n characters, the nth from last of which is 1. It
>can be represented by an (n + 1)-state NFA, but it requires 2n DFA
>states, one for each n-character suffix of the input."
So use several "?" or "*", heap size increase exponentially?
OK, I will look for another way...
Thanks,
Kou Mizutani
--
View this message in context:
http://lucene.472066.n3.nabble.com/OutOfMemoryError-occured-by-WildcardQuery-tp4051924p4051943.html
Sent from the Lucene - Java Developer mailing list archive at Nabble.com.
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
