|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object com.softsynth.jmsl.score.transcribe.SearchPathList
public class SearchPathList
Manage a list of competing SearchPaths. Supports the selection of the minimum cost search path and expansion of it.
Constructor Summary | |
---|---|
SearchPathList()
|
Method Summary | |
---|---|
void |
addSearchPath(SearchPath p)
|
void |
expand(SearchPath winner)
Select the lowest cost searchpath, and expand it with the BeatDivisions in the BeatDivisionLost for the next legal beat |
SearchPath |
getMinCostSearchPath()
|
SearchPath |
getMinCostSearchPath(boolean mustReachNextLegalBeat)
|
void |
initSearchPathList()
build a list of one-move search paths starting on beat 0 |
void |
setMeasureBeatDivisions(MeasureBeatDivisions measureBeatDivisions)
|
void |
setNextLegalBeat(int nextLegalBeat)
Set the next beat number that the heuristic search is expanding toward. |
java.lang.String |
toString()
|
Methods inherited from class java.lang.Object |
---|
equals, getClass, hashCode, notify, notifyAll, wait, wait, wait |
Constructor Detail |
---|
public SearchPathList()
Method Detail |
---|
public void addSearchPath(SearchPath p)
public void setMeasureBeatDivisions(MeasureBeatDivisions measureBeatDivisions)
public void setNextLegalBeat(int nextLegalBeat)
public void initSearchPathList()
public SearchPath getMinCostSearchPath() throws SearchPathListExpansionException
SearchPathListExpansionException
public SearchPath getMinCostSearchPath(boolean mustReachNextLegalBeat) throws SearchPathListExpansionException
SearchPathListExpansionException
public void expand(SearchPath winner) throws SearchPathListExpansionException
SearchPathListExpansionException
public java.lang.String toString()
toString
in class java.lang.Object
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |