SMT-RAT
24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
|
#include <LiftingTree.h>
Public Types | |
using | Tree = carl::tree< Sample > |
using | Iterator = Tree::iterator |
using | FSC = FullSampleComparator< Iterator, Settings::fullSampleComparator > |
using | SC = SampleComparator< Iterator, Settings::sampleComparator > |
using | Constraints = CADConstraints< Settings::backtracking > |
Public Member Functions | |
LiftingTree (const Constraints &c) | |
LiftingTree (const LiftingTree &)=delete | |
LiftingTree (LiftingTree &&)=delete | |
LiftingTree & | operator= (const LiftingTree &)=delete |
LiftingTree & | operator= (LiftingTree &&)=delete |
const auto & | getTree () const |
const auto & | getLiftingQueue () const |
void | reset (std::vector< carl::Variable > &&vars) |
bool | hasFullSamples () const |
Iterator | getNextFullSample () |
void | resetFullSamples () |
bool | hasNextSample () const |
Iterator | getNextSample () |
void | removeNextSample () |
void | restoreRemovedSamples () |
bool | liftSample (Iterator sample, const UPoly &p, std::size_t pid, bool ignore_nullifications) |
bool | addTrivialSample (Iterator sample) |
Assignment | extractSampleMap (Iterator it) const |
void | removedPolynomialsFromLevel (std::size_t level, const carl::Bitset &mask) |
void | removedConstraint (const carl::Bitset &mask) |
bool | is_consistent () const |
std::string | printSample (Iterator sample) const |
std::string | printFullSamples () const |
Private Member Functions | |
std::size_t | dim () const |
void | addToQueue (Iterator it) |
void | cleanQueuesFromExpired () |
bool | insertRootSamples (Iterator parent, std::vector< Sample > &samples) |
bool | mergeRootSamples (Iterator parent, std::vector< Sample > &samples) |
Private Attributes | |
const Constraints & | mConstraints |
std::vector< carl::Variable > | mVariables |
Tree | mTree |
SampleIteratorQueue< Iterator, FSC > | mCheckingQueue |
SampleIteratorQueue< Iterator, SC > | mLiftingQueue |
std::vector< Iterator > | mRemovedFromLiftingQueue |
Definition at line 16 of file LiftingTree.h.
using smtrat::cad::LiftingTree< Settings >::Constraints = CADConstraints<Settings::backtracking> |
Definition at line 22 of file LiftingTree.h.
using smtrat::cad::LiftingTree< Settings >::FSC = FullSampleComparator<Iterator,Settings::fullSampleComparator> |
Definition at line 20 of file LiftingTree.h.
using smtrat::cad::LiftingTree< Settings >::Iterator = Tree::iterator |
Definition at line 19 of file LiftingTree.h.
using smtrat::cad::LiftingTree< Settings >::SC = SampleComparator<Iterator,Settings::sampleComparator> |
Definition at line 21 of file LiftingTree.h.
using smtrat::cad::LiftingTree< Settings >::Tree = carl::tree<Sample> |
Definition at line 18 of file LiftingTree.h.
|
inline |
Definition at line 123 of file LiftingTree.h.
|
delete |
|
delete |
|
inlineprivate |
Definition at line 35 of file LiftingTree.h.
|
inline |
|
inlineprivate |
|
inlineprivate |
|
inline |
|
inline |
Definition at line 132 of file LiftingTree.h.
|
inline |
Definition at line 149 of file LiftingTree.h.
|
inline |
Definition at line 164 of file LiftingTree.h.
|
inline |
Definition at line 129 of file LiftingTree.h.
|
inline |
Definition at line 146 of file LiftingTree.h.
|
inline |
|
inlineprivate |
Definition at line 52 of file LiftingTree.h.
|
inline |
|
inline |
|
inlineprivate |
Definition at line 82 of file LiftingTree.h.
|
delete |
|
delete |
|
inline |
|
inline |
|
inline |
Definition at line 256 of file LiftingTree.h.
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
Definition at line 172 of file LiftingTree.h.
|
private |
Definition at line 27 of file LiftingTree.h.
|
private |
Definition at line 24 of file LiftingTree.h.
|
private |
Definition at line 28 of file LiftingTree.h.
|
private |
Definition at line 29 of file LiftingTree.h.
|
private |
Definition at line 26 of file LiftingTree.h.
|
private |
Definition at line 25 of file LiftingTree.h.