SMT-RAT  24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
Sampling.h File Reference
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Data Structures

struct  smtrat::covering_ng::sampling< S >
 
struct  smtrat::covering_ng::sampling< SamplingAlgorithm::LOWER_UPPER_BETWEEN_SAMPLING >
 First checks lower bound and then upper bound, then checks between the cells if they are covered. More...
 
struct  smtrat::covering_ng::sampling< SamplingAlgorithm::LOWER_UPPER_BETWEEN_SAMPLING_AVOID_RAN >
 First checks lower bound and then upper bound, then checks between the cells if they are covered (defers choosing interval endpoints as much as possible). More...
 

Namespaces

 smtrat
 Class to create the formulas for axioms.
 
 smtrat::covering_ng
 

Enumerations

enum class  smtrat::covering_ng::SamplingAlgorithm { smtrat::covering_ng::LOWER_UPPER_BETWEEN_SAMPLING , smtrat::covering_ng::LOWER_UPPER_BETWEEN_SAMPLING_AVOID_RAN }