Package | Description |
---|---|
org.apache.lucene.util.automaton |
Finite-state automaton for regular expressions.
|
Modifier and Type | Method and Description |
---|---|
State |
Transition.getDest()
Returns destination of this transition.
|
State |
StatePair.getFirstState()
Returns first component of this pair.
|
State |
Automaton.getInitialState()
Gets initial state.
|
State[] |
Automaton.getNumberedStates() |
State |
StatePair.getSecondState()
Returns second component of this pair.
|
State |
State.step(int c)
Performs lookup in transitions, assuming determinism.
|
Modifier and Type | Method and Description |
---|---|
Set<State> |
Automaton.getAcceptStates()
Returns the set of reachable accept states.
|
static Set<State> |
SpecialOperations.reverse(Automaton a)
Reverses the language of the given (non-singleton) automaton while returning
the set of new initial states.
|
Modifier and Type | Method and Description |
---|---|
int |
State.compareTo(State s)
Compares this object with the specified object for order.
|
void |
Automaton.setNumberedStates(State[] states) |
void |
Automaton.setNumberedStates(State[] states,
int count) |
Modifier and Type | Method and Description |
---|---|
void |
State.step(int c,
Collection<State> dest)
Performs lookup in transitions, allowing nondeterminism.
|
Constructor and Description |
---|
Automaton(State initial)
Constructs a new automaton that accepts the empty language.
|
StatePair(State s1,
State s2)
Constructs a new state pair.
|
Transition(int min,
int max,
State to)
Constructs a new transition.
|
Transition(int c,
State to)
Constructs a new singleton interval transition.
|
Copyright © 2000-2014 Apache Software Foundation. All Rights Reserved.