SMT-RAT
24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
|
#include <smtrat-cadcells/common.h>
#include <smtrat-cadcells/datastructures/delineation.h>
#include <smtrat-cadcells/datastructures/derivation.h>
#include "Helper.h"
#include "NewCoveringStatistics.h"
#include <smtrat-common/smtrat-common.h>
Go to the source code of this file.
Data Structures | |
struct | smtrat::sampling< S > |
struct | smtrat::is_sample_outside< S > |
struct | smtrat::sampling< SamplingAlgorithm::LOWER_UPPER_BETWEEN_SAMPLING > |
struct | smtrat::is_sample_outside< IsSampleOutsideAlgorithm::DEFAULT > |
Namespaces | |
smtrat | |
Class to create the formulas for axioms. | |
Enumerations | |
enum | smtrat::SamplingAlgorithm { smtrat::LOWER_UPPER_BETWEEN_SAMPLING } |
enum | smtrat::IsSampleOutsideAlgorithm { smtrat::DEFAULT } |
Functions | |
std::string | smtrat::get_name (SamplingAlgorithm samplingAlgorithm) |
std::string | smtrat::get_name (IsSampleOutsideAlgorithm samplingAlgorithm) |
Definition in file Sampling.h.