public class NAryTreeReplayerWithFullILP extends AbstractNAryTreeReplayer<NAryTreeHead,NAryTreeFullILPTail,NAryTreeFullILPDelegate>
NAryTreeReplayer.PerformanceType, NAryTreeReplayer.VerboseLevel
algorithm, aStarLogAbstraction, canceller, delegate, head2int, maxNumOfStates, statecount, stateList, threads, tree
Constructor and Description |
---|
NAryTreeReplayerWithFullILP(AStarAlgorithm aStarLogAbstraction,
nl.tue.astar.AStarThread.Canceller canceller,
NAryTree tree,
int configurationNumber,
int[] node2cost,
java.util.Map<TreeMarkingVisit<ModelPrefix>,gnu.trove.set.TIntSet> marking2modelmove,
gnu.trove.map.TObjectIntMap<TreeMarkingVisit<ModelPrefix>> marking2visitCount,
int[] syncMoveCount,
int[] aSyncMoveCount,
int[] moveCount,
java.util.Map<nl.tue.astar.Trace,TreeRecord> alignments,
boolean useOrRows,
nl.tue.astar.AStarObserver... observers) |
Modifier and Type | Method and Description |
---|---|
protected int |
calculateCostAndPostProcess(NAryTreeReplayer.VerboseLevel verbose,
nl.tue.astar.Trace trace,
TreeRecord r,
int frequency)
do post-processing on the given alignment for the given trace.
|
protected NAryTreeFullILPDelegate |
constructDelegate(AStarAlgorithm algorithm,
NAryTree tree,
int configurationNumber,
int[] node2cost,
int threads,
boolean useOrRows)
construct the delegate of the right type for the version of the replayer
to be used.
|
protected NAryTreeHead |
createInitialHead(nl.tue.astar.Trace trace)
create the initial head for this replayer.
|
int |
run(NAryTreeReplayer.VerboseLevel verbose,
int stopAt,
int minModelCost,
double timeLimit) |
getDelegate, getHistory, getNumStoredStates, getQueuedStateCount, getRawCost, getState, getTraversedArcCount, isStubborn, setMaxNumberOfBlocksToUse, setStubborn, setType, setType, wasReliable
public NAryTreeReplayerWithFullILP(AStarAlgorithm aStarLogAbstraction, nl.tue.astar.AStarThread.Canceller canceller, NAryTree tree, int configurationNumber, int[] node2cost, java.util.Map<TreeMarkingVisit<ModelPrefix>,gnu.trove.set.TIntSet> marking2modelmove, gnu.trove.map.TObjectIntMap<TreeMarkingVisit<ModelPrefix>> marking2visitCount, int[] syncMoveCount, int[] aSyncMoveCount, int[] moveCount, java.util.Map<nl.tue.astar.Trace,TreeRecord> alignments, boolean useOrRows, nl.tue.astar.AStarObserver... observers)
protected int calculateCostAndPostProcess(NAryTreeReplayer.VerboseLevel verbose, nl.tue.astar.Trace trace, TreeRecord r, int frequency)
AbstractNAryTreeReplayer
calculateCostAndPostProcess
in class AbstractNAryTreeReplayer<NAryTreeHead,NAryTreeFullILPTail,NAryTreeFullILPDelegate>
protected NAryTreeHead createInitialHead(nl.tue.astar.Trace trace)
AbstractNAryTreeReplayer
createInitialHead
in class AbstractNAryTreeReplayer<NAryTreeHead,NAryTreeFullILPTail,NAryTreeFullILPDelegate>
public int run(NAryTreeReplayer.VerboseLevel verbose, int stopAt, int minModelCost, double timeLimit) throws nl.tue.astar.AStarException
run
in interface NAryTreeReplayer<NAryTreeHead,NAryTreeFullILPTail,NAryTreeFullILPDelegate>
run
in class AbstractNAryTreeReplayer<NAryTreeHead,NAryTreeFullILPTail,NAryTreeFullILPDelegate>
nl.tue.astar.AStarException
protected NAryTreeFullILPDelegate constructDelegate(AStarAlgorithm algorithm, NAryTree tree, int configurationNumber, int[] node2cost, int threads, boolean useOrRows)
AbstractNAryTreeReplayer
constructDelegate
in class AbstractNAryTreeReplayer<NAryTreeHead,NAryTreeFullILPTail,NAryTreeFullILPDelegate>