| |
|
| java.lang.Object gov.nasa.jpf.search.AbstractSearch gov.nasa.jpf.search.heuristic.HeuristicSearch
All known Subclasses: gov.nasa.jpf.search.heuristic.BeamSearch,
HeuristicSearch | public class HeuristicSearch extends AbstractSearch (Code) | | a search strategy class that computes all immediate successors of a given
state, puts them into a priority queue (the priority is provided by a
Heuristic strategy object), and processes states in the sequence of
highest priorities. Note that the queue is search-global, i.e. we might hop
between search levels.
|
DEFAULT_HEURISTIC_PACKAGE | final static String DEFAULT_HEURISTIC_PACKAGE(Code) | | |
heuristicCount | int heuristicCount(Code) | | |
heuristicTotal | int heuristicTotal(Code) | | |
initHeuristicValue | protected int initHeuristicValue(Code) | | |
maxHeuristic | int maxHeuristic(Code) | | |
minHeuristic | int minHeuristic(Code) | | |
numberNewChildren | protected int numberNewChildren(Code) | | |
pathCoverage | protected boolean pathCoverage(Code) | | |
queueLimit | protected int queueLimit(Code) | | |
useAstar | protected boolean useAstar(Code) | | |
generateChildren | protected void generateChildren(int maxDepth)(Code) | | |
getQueueSize | public int getQueueSize()(Code) | | |
search | public void search()(Code) | | |
setCalcBranchCoverage | public void setCalcBranchCoverage(boolean b)(Code) | | |
setInstructionCoverage | public void setInstructionCoverage(boolean b)(Code) | | |
setPathCoverage | public void setPathCoverage(boolean b)(Code) | | |
|
|
|