Result of a solving step. More...
#include <clasp_facade.h>
Public Types | |
enum | Base { UNKNOWN = 0, SAT = 1, UNSAT = 2 } |
Possible solving results. More... | |
enum | Ext { EXT_EXHAUST = 4, EXT_INTERRUPT = 8, EXT_ERROR = 16 } |
Public Member Functions | |
bool | error () const |
bool | exhausted () const |
bool | interrupted () const |
operator Base () const | |
operator double () const | |
bool | sat () const |
bool | unknown () const |
bool | unsat () const |
Public Attributes | |
uint8 | flags |
uint8 | signal |
Result of a solving step.
Definition at line 112 of file clasp_facade.h.
Possible solving results.
UNKNOWN |
Satisfiability unknown - a given solve limit was hit. |
SAT |
Problem is satisfiable (a model was found). |
UNSAT |
Problem is unsatisfiable. |
Definition at line 114 of file clasp_facade.h.
EXT_EXHAUST |
Search space is exhausted. |
EXT_INTERRUPT |
The run was interrupted from outside. |
EXT_ERROR |
The run was terminated because of an internal error. |
Definition at line 119 of file clasp_facade.h.
bool Clasp::ClaspFacade::Result::error | ( | ) | const [inline] |
Definition at line 129 of file clasp_facade.h.
bool Clasp::ClaspFacade::Result::exhausted | ( | ) | const [inline] |
Definition at line 127 of file clasp_facade.h.
bool Clasp::ClaspFacade::Result::interrupted | ( | ) | const [inline] |
Definition at line 128 of file clasp_facade.h.
Clasp::ClaspFacade::Result::operator Base | ( | ) | const [inline] |
Definition at line 130 of file clasp_facade.h.
Clasp::ClaspFacade::Result::operator double | ( | ) | const [inline] |
Definition at line 131 of file clasp_facade.h.
bool Clasp::ClaspFacade::Result::sat | ( | ) | const [inline] |
Definition at line 124 of file clasp_facade.h.
bool Clasp::ClaspFacade::Result::unknown | ( | ) | const [inline] |
Definition at line 126 of file clasp_facade.h.
bool Clasp::ClaspFacade::Result::unsat | ( | ) | const [inline] |
Definition at line 125 of file clasp_facade.h.
Definition at line 132 of file clasp_facade.h.
Definition at line 133 of file clasp_facade.h.