On Wed, Mar 27, 2013 at 6:41 PM, ko-mizutani
<[email protected]> wrote:
> Hi all,
> I am planing to migrate from Lucene 3.5 to Lucene 4.0. But my query does not
> work in 4.0.
>
> For example, when I run the following code,
>
> public static void main(String[] args) {
> new WildcardQuery(new Term("id", "????????????????????1*"));
> }
>
> I encounted OutOfMemoryError: (even if raise Heap Size up to 1GB)
Do you have a real use case for such a query or is it just an early
April Fools? :)
"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."
http://en.wikipedia.org/wiki/Powerset_construction
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
