SMT-RAT  24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
common.h
Go to the documentation of this file.
1 #pragma once
2 
4 
5 #include <optional>
6 
7 namespace smtrat {
8 namespace cad {
9  using carl::operator<<;
10 
11  using RAN = smtrat::RAN;
12  using ConstraintSelection = carl::Bitset;
13  using OptionalID = std::optional<std::size_t>;
14  using Assignment = std::map<carl::Variable, RAN>;
15  using SampleLiftedWith = carl::Bitset;
16  using SampleRootOf = carl::Bitset;
17  using UPoly = carl::UnivariatePolynomial<Poly>;
18 }
19 }
smtrat::RAN RAN
Definition: common.h:11
std::optional< std::size_t > OptionalID
Definition: common.h:13
carl::UnivariatePolynomial< Poly > UPoly
Definition: common.h:17
std::map< carl::Variable, RAN > Assignment
Definition: common.h:14
carl::Bitset SampleLiftedWith
Definition: common.h:15
carl::Bitset SampleRootOf
Definition: common.h:16
carl::Bitset ConstraintSelection
Definition: common.h:12
Class to create the formulas for axioms.
carl::IntRepRealAlgebraicNumber< Rational > RAN
Definition: types.h:47