#include <roots.h>
|
IndexedRoot | first |
| Active linear bound from -oo to including the first intersection point (or oo if no such point exists) More...
|
|
std::vector< std::pair< Rational, IndexedRoot > > | bounds |
| List of intersection points and linear bounds which are active beginning from including the given intersection point to including the next intersection point (or oo if no such point exists); at intersection points, two bounds are active; the list needs to be sorted by intersection point. More...
|
|
Definition at line 37 of file roots.h.
◆ poly_bound_at()
bool smtrat::cadcells::datastructures::PiecewiseLinearInfo::poly_bound_at |
( |
const PolyRef & |
poly, |
|
|
const RAN & |
r |
|
) |
| const |
|
inline |
◆ bounds
std::vector<std::pair<Rational,IndexedRoot> > smtrat::cadcells::datastructures::PiecewiseLinearInfo::bounds |
List of intersection points and linear bounds which are active beginning from including the given intersection point to including the next intersection point (or oo if no such point exists); at intersection points, two bounds are active; the list needs to be sorted by intersection point.
Definition at line 41 of file roots.h.
◆ first
IndexedRoot smtrat::cadcells::datastructures::PiecewiseLinearInfo::first |
Active linear bound from -oo to including the first intersection point (or oo if no such point exists)
Definition at line 39 of file roots.h.
The documentation for this struct was generated from the following file:
- smtrat-cadcells/datastructures/roots.h