SMT-RAT
24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
|
Go to the source code of this file.
Namespaces | |
smtrat | |
Class to create the formulas for axioms. | |
smtrat::cadcells | |
A framework for sample-based CAD algorithms. | |
smtrat::cadcells::representation | |
Heuristics for computing representations. | |
smtrat::cadcells::representation::util | |
Typedefs | |
template<typename T > | |
using | smtrat::cadcells::representation::util::DerivationSet = boost::container::flat_set< datastructures::SampledDerivationRef< T >, IntervalCompare< T > > |
Functions | |
template<typename T > | |
std::vector< datastructures::SampledDerivationRef< T > > | smtrat::cadcells::representation::compute_min_derivs (const std::vector< datastructures::SampledDerivationRef< T >> &derivs) |
template<typename T > | |
datastructures::IndexedRootOrdering | smtrat::cadcells::representation::compute_default_ordering (const std::vector< datastructures::CellRepresentation< T >> &cells, bool enable_weak=false) |
template<typename T > | |
bool | smtrat::cadcells::representation::util::is_covering (const DerivationSet< T > &set) |