SMT-RAT  24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
Util.h
Go to the documentation of this file.
1 #pragma once
2 
3 #include <carl-arith/poly/umvpoly/Monomial.h>
4 #include "unordered_map"
5 #include <smtrat-common/smtrat-common.h>
6 
7 
8 namespace smtrat
9 {
10  typedef std::unordered_map<carl::Variable, carl::Monomial::Arg>::iterator MonomialMapIterator;
11  typedef std::unordered_map<carl::Variable, carl::Monomial::Arg> MonomialMap;
12 }
smtrat
Class to create the formulas for axioms.
Definition: handle_options.h:10
smtrat::MonomialMap
std::unordered_map< carl::Variable, carl::Monomial::Arg > MonomialMap
Definition: Util.h:11
smtrat::MonomialMapIterator
std::unordered_map< carl::Variable, carl::Monomial::Arg >::iterator MonomialMapIterator
Definition: Util.h:10