| BoolWarningProp | |
| BranchingHeuristic | Branching heurstic for a quantified space. Branching heuristic using a score attribuer to give the next variable. This branching heuristic keeps trace of the variables on which we have branched, and so requires a backtrack signal (send by the solver using its backtrack method). The next variable musi be (and is) chosen respect to the variables partial order in the prefix. Heaps are used to provide the next variable in logarithmic time. Variables declared as subsumed are ignored by the branching heuristic |
| ExtensiveComparator | A simple integer comparator. This class compares two integer between them, according to the score they are given. Scores are stored in an array and can be modified every time |
| FirstFailValue | |
| Heap< C > | |
| Implicative | |
| IntWarningProp | |
| LargestHalfFirst | |
| LargestValueFirst | |
| MedianValueFirst | |
| MySpace | A simple extension of Gecode::Space class. A simple extension of the Space class from Gecode, in order to have access to the variables it contains |
| QSolver | Depth-first search engine for quantified spaces. A quite naive depth-first search engine for quantified spaces. The answer of such an engine is true or false. The complete winning strategy, if existing, is not given |
| QSpace | Base class for a quantified space. Base class for a quantified space (with restricted quantifiers or not). The array v has to be kept up-to-date by the copy constructor of any descendant of this class |
| SmallestDomainFirst | |
| SmallestHalfFirst | |
| SmallestValueFirst | |
| valueHeuristic | |
| VariableHeuristic | Base class for variable heuristics. Variable heuristics are used by the branching heuristic to define the current score of each variable, and branch on the variable which have the biggest score |
| Warner | |
