[
https://issues.apache.org/jira/browse/LUCENE-2265?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=12853010#action_12853010
]
Earwin Burrfoot commented on LUCENE-2265:
-----------------------------------------
Hmmmmm.
I'd say that your highlevel operations like intersection and union remain
exactly the same regardless of the alphabet you're operating on.
The primitive automata, like AnyChar will have to cease being so primitive and
generate a pair of states instead of one, but that's essentially it - after
primitive automatas are fixed to recognize utf-8 bytes, you don't even have to
change parsing code that much.
The only true problem I see is that you lose the ability to operate on char[].
But then, I ask that again, do you write a generic library, or you borrowed
automata code from one with a single aim of having fast lucene queries?
> improve automaton performance by running on byte[]
> --------------------------------------------------
>
> Key: LUCENE-2265
> URL: https://issues.apache.org/jira/browse/LUCENE-2265
> Project: Lucene - Java
> Issue Type: Improvement
> Components: Search
> Affects Versions: Flex Branch
> Reporter: Robert Muir
> Priority: Minor
> Fix For: Flex Branch
>
> Attachments: LUCENE-2265.patch
>
>
> Currently, when enumerating terms, automaton must convert entire terms from
> flex's native utf-8 byte[] to char[] first, then step each char thru the
> state machine.
> we can make this more efficient, by allowing the state machine to run on
> byte[], so it can return true/false faster.
--
This message is automatically generated by JIRA.
-
You can reply to this email to add a comment to the issue online.
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
