SMT-RAT  24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
Helper.h
Go to the documentation of this file.
1 /**
2  * @file Helper.h
3  * @author Philip Kroll <Philip.Kroll@rwth-aachen.de>
4  * Created on 2022-03-16.
5  */
6 #pragma once
7 
9 
10 namespace smtrat {
11 
12 // We want to store the SampledDerivationRefs in a sorted datastructure (std::set), so we need to introduce a < operator for this.
13 // The derivations are sorted based on lower bounds of the respective cells, according to https://arxiv.org/pdf/2003.05633.pdf 4.4.1
15  template<typename T>
17  auto cell_a = a->cell();
18  auto cell_b = b->cell();
20  }
21 };
22 
23 
24 
25 
26 
27 } // namespace smtrat
bool upper_lt_upper(const DelineationInterval &del1, const DelineationInterval &del2)
Compares the upper bounds of two DelineationIntervals.
Definition: delineation.h:286
bool lower_lt_lower(const DelineationInterval &del1, const DelineationInterval &del2)
Compares the lower bounds of two DelineationIntervals.
Definition: delineation.h:266
bool lower_eq_lower(const DelineationInterval &del1, const DelineationInterval &del2)
Compares the lower bounds of two DelineationIntervals.
Definition: delineation.h:276
std::shared_ptr< SampledDerivation< Properties > > SampledDerivationRef
Definition: derivation.h:25
Class to create the formulas for axioms.
constexpr bool operator()(const cadcells::datastructures::SampledDerivationRef< T > &a, const cadcells::datastructures::SampledDerivationRef< T > &b) const
Definition: Helper.h:16