abstract static class LevenshteinAutomata.ParametricDescription
extends java.lang.Object
There are four components of a parametric description, all parameterized on the length
of the word w
:
size()
isAccept(int)
transition(int, int, int)
getPosition(int)
Modifier and Type | Field and Description |
---|---|
private static long[] |
MASKS |
private int[] |
minErrors |
protected int |
n |
protected int |
w |
Constructor and Description |
---|
ParametricDescription(int w,
int n,
int[] minErrors) |
Modifier and Type | Method and Description |
---|---|
(package private) int |
getPosition(int absState)
Returns the position in the input word for a given
state . |
(package private) boolean |
isAccept(int absState)
Returns true if the
state in any Levenshtein DFA is an accept state (final state). |
(package private) int |
size()
Return the number of states needed to compute a Levenshtein DFA
|
(package private) abstract int |
transition(int state,
int position,
int vector)
Returns the state number for a transition from the given
state ,
assuming position and characteristic vector vector |
protected int |
unpack(long[] data,
int index,
int bitsPerValue) |
protected final int w
protected final int n
private final int[] minErrors
private static final long[] MASKS
int size()
boolean isAccept(int absState)
state
in any Levenshtein DFA is an accept state (final state).int getPosition(int absState)
state
.
This is the minimal boundary for the state.abstract int transition(int state, int position, int vector)
state
,
assuming position
and characteristic vector vector
protected int unpack(long[] data, int index, int bitsPerValue)