|
| enum class | Decision : uint16_t { NONE
, MUST
, MUSTNOT
} |
| |
|
|
void | Push (Work work) |
| |
| bool | Pop () |
| |
| void | UndoOne () |
| |
|
bool | AddWork (Work &&work) |
| |
| | Solver (pkgCache &Cache, pkgDepCache::Policy &Policy, EDSP::Request::Flags requestFlags) |
| |
|
bool | Assume (Var var, bool decision, const Clause *reason=nullptr) |
| |
|
bool | Enqueue (Var var, bool decision, const Clause *reason=nullptr) |
| |
|
bool | FromDepCache (pkgDepCache &depcache) |
| |
|
bool | ToDepCache (pkgDepCache &depcache) const |
| |
|
bool | Solve () |
| |
|
std::string | WhyStr (Var reason) const |
| |
| std::string | LongWhyStr (Var var, bool decision, const Clause *rclause, std::string prefix, std::unordered_set< Var > &seen) const |
| | Print a long reason string.
|
| |
|
|
struct | std::hash< APT::Solver::Var > |
| |
◆ Solver()
◆ LongWhyStr()
| std::string LongWhyStr |
( |
Var |
var, |
|
|
bool |
decision, |
|
|
const Clause * |
rclause, |
|
|
std::string |
prefix, |
|
|
std::unordered_set< Var > & |
seen |
|
) |
| const |
Print a long reason string.
Print a reason as to why rclause implies decision for the variable var.
- Parameters
-
| var | The variable to print the reason for |
| decision | The assumed decision to print the reason for (may be different from actual decision if rclause is specified) |
| rclause | The clause that caused this variable to be marked (or would be marked) |
| prefix | A prefix, for indentation purposes, as this is recursive |
| seen | A set of seen objects such that the output does not repeat itself (not for safety, it is acyclic) |
◆ Pop()
- Todo:
- We should just mark the entries as erased and only do a compaction
- Todo:
- There should be a reason!
◆ UndoOne()
- Todo:
- Add the undo handling here once we have watchers.
The documentation for this class was generated from the following files: