SMT-RAT
24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
|
Data Structures | |
struct | AssignmentFinder |
class | AssignmentFinder_detail |
class | AssignmentFinder_ctx |
class | Covering |
Semantics: The space is divided into a number of intervals: (-oo,a)[a,a](a,b)[b,b](b,oo) A bit is set if the constraints refutes the corresponding interval. More... | |
class | RootIndexer |
Functions | |
std::ostream & | operator<< (std::ostream &os, const Covering &ri) |
template<typename RANT > | |
std::ostream & | operator<< (std::ostream &os, const RootIndexer< RANT > &ri) |
|
inline |
Definition at line 59 of file Covering.h.
|
inline |