public abstract class IntDaciukAlgoIndexed
extends java.lang.Object
| Modifier and Type | Field and Description |
|---|---|
protected int |
startState
Start state number
|
| Constructor and Description |
|---|
IntDaciukAlgoIndexed() |
| Modifier and Type | Method and Description |
|---|---|
void |
add(java.util.ArrayList<java.lang.Integer> seq)
Add sequence to trie
|
void |
addMinWord(java.util.ArrayList<java.lang.Integer> seq)
Add sequence to the DAFSA
|
abstract int |
addState()
Adds a new state to the automaton
|
protected java.util.ArrayList<java.lang.Integer> |
addSuffix(java.util.ArrayList<java.lang.Integer> states,
int s,
java.util.ArrayList<java.lang.Integer> seq,
int start,
int end)
Add suffix to given new state
|
abstract int |
cloneState(int state)
Clones given state.
|
abstract int |
getNext(int state,
int input)
Find matching outbound transition for given state
|
abstract boolean |
hasFinal(int state)
Checks if state is final for this final feature
|
abstract boolean |
isConfluence(int state)
Checks a state for confluence (if in has more that 1 inbound transitions)
|
abstract void |
regAdd(int state)
Add state to register
|
abstract int |
regGet(int state)
Get equivalent state from register
|
abstract void |
regRemove(int state)
Remove given state from register.
|
abstract void |
removeState(int state)
Removes given state from the automaton
|
protected void |
replaceOrRegister(java.util.ArrayList<java.lang.Integer> input,
java.util.ArrayList<java.lang.Integer> stateList,
int stop) |
abstract boolean |
setFinal(int state)
public set final feature for state
|
abstract boolean |
setNext(int src,
int label,
int dest)
Adds a transition from src to dest on given label, if
a transition from src with given label already exists, then change it
to new destination state.
|
public abstract int getNext(int state,
int input)
state - source stateinput - labelpublic abstract boolean isConfluence(int state)
state - state to checkpublic abstract int cloneState(int state)
state - public abstract int addState()
public abstract boolean setNext(int src,
int label,
int dest)
src - source statelabel - transition labeldest - destination statepublic abstract void removeState(int state)
state - state indexpublic abstract boolean setFinal(int state)
state - state numberpublic abstract boolean hasFinal(int state)
state - state numberpublic abstract void regAdd(int state)
state - state numberpublic abstract int regGet(int state)
state - reference statepublic abstract void regRemove(int state)
state - state to removeprotected java.util.ArrayList<java.lang.Integer> addSuffix(java.util.ArrayList<java.lang.Integer> states,
int s,
java.util.ArrayList<java.lang.Integer> seq,
int start,
int end)
states - state lists - base state numberseq - sequence to addfin - final statepublic void addMinWord(java.util.ArrayList<java.lang.Integer> seq)
seq - sequence to addprotected void replaceOrRegister(java.util.ArrayList<java.lang.Integer> input,
java.util.ArrayList<java.lang.Integer> stateList,
int stop)
public void add(java.util.ArrayList<java.lang.Integer> seq)
seq - sequence to add