private static final class DaciukMihovAutomatonBuilder.State
extends java.lang.Object
char
labels on transitions.Modifier and Type | Field and Description |
---|---|
(package private) boolean |
is_final
true if this state corresponds to the end of at least one
input sequence. |
(package private) int[] |
labels
Labels of outgoing transitions.
|
private static int[] |
NO_LABELS
An empty set of labels.
|
private static DaciukMihovAutomatonBuilder.State[] |
NO_STATES
An empty set of states.
|
(package private) DaciukMihovAutomatonBuilder.State[] |
states
States reachable from outgoing transitions.
|
Modifier | Constructor and Description |
---|---|
private |
State() |
Modifier and Type | Method and Description |
---|---|
boolean |
equals(java.lang.Object obj)
Two states are equal if:
they have an identical number of outgoing transitions, labeled with
the same labels
corresponding outgoing transitions lead to the same states (to states
with an identical right-language).
|
(package private) DaciukMihovAutomatonBuilder.State |
getState(int label)
Returns the target state of a transition leaving this state and labeled
with
label . |
(package private) boolean |
hasChildren()
Return
true if this state has any children (outgoing
transitions). |
int |
hashCode()
Compute the hash code of the current status of this state.
|
(package private) DaciukMihovAutomatonBuilder.State |
lastChild()
Return the most recent transitions's target state.
|
(package private) DaciukMihovAutomatonBuilder.State |
lastChild(int label)
Return the associated state if the most recent transition is labeled with
label . |
(package private) DaciukMihovAutomatonBuilder.State |
newState(int label)
Create a new outgoing transition labeled
label and return
the newly created target state for this transition. |
private static boolean |
referenceEquals(java.lang.Object[] a1,
java.lang.Object[] a2)
Compare two lists of objects for reference-equality.
|
(package private) void |
replaceLastChild(DaciukMihovAutomatonBuilder.State state)
Replace the last added outgoing transition's target state with the given
state.
|
private static final int[] NO_LABELS
private static final DaciukMihovAutomatonBuilder.State[] NO_STATES
int[] labels
states
.
Labels must be sorted lexicographically.DaciukMihovAutomatonBuilder.State[] states
labels
.boolean is_final
true
if this state corresponds to the end of at least one
input sequence.DaciukMihovAutomatonBuilder.State getState(int label)
label
. If no such transition exists, returns
null
.public boolean equals(java.lang.Object obj)
equals
in class java.lang.Object
public int hashCode()
hashCode
in class java.lang.Object
boolean hasChildren()
true
if this state has any children (outgoing
transitions).DaciukMihovAutomatonBuilder.State newState(int label)
label
and return
the newly created target state for this transition.DaciukMihovAutomatonBuilder.State lastChild()
DaciukMihovAutomatonBuilder.State lastChild(int label)
label
.void replaceLastChild(DaciukMihovAutomatonBuilder.State state)
private static boolean referenceEquals(java.lang.Object[] a1, java.lang.Object[] a2)