LookbackStrategy

Keep going deeper until we find a successful reduction. When found, go up a depth level. Keep going up while we find new reductions. Repeat topmost depth level as necessary. Once no new reductions are found at higher depths, jump to the next unvisited depth in this iteration. If we reach the bottom (depth with no nodes on it), start a new iteration. If we finish an iteration without finding any reductions, we're done.

Members

Functions

copy
void copy(Strategy target)
Undocumented in source. Be warned that the author may not have intended to support it.
next
void next(bool success)
Undocumented in source. Be warned that the author may not have intended to support it.
nextIteration
void nextIteration()
Undocumented in source. Be warned that the author may not have intended to support it.

Variables

maxLevel
size_t maxLevel;
Undocumented in source.

Inherited Members

From LevelStrategy

levelChanged
bool levelChanged;
Undocumented in source.
invalid
bool invalid;
Undocumented in source.
getDepth
int getDepth()
Undocumented in source. Be warned that the author may not have intended to support it.
copy
void copy(Strategy target)
Undocumented in source. Be warned that the author may not have intended to support it.
next
void next(bool success)
Undocumented in source. Be warned that the author may not have intended to support it.
nextIteration
void nextIteration()
Undocumented in source. Be warned that the author may not have intended to support it.
nextInLevel
bool nextInLevel()
Undocumented in source. Be warned that the author may not have intended to support it.
currentLevel
size_t currentLevel [@property getter]
Undocumented in source. Be warned that the author may not have intended to support it.
setLevel
bool setLevel(size_t level)
Undocumented in source. Be warned that the author may not have intended to support it.

Meta