The default policy for polynomials.
More...
#include <MultivariatePolynomialPolicy.h>
|
static const bool | searchLinear = true |
| Linear searching means that we search linearly for a term instead of applying e.g. More...
|
|
static const bool | has_reasons = ReasonsAdaptor::has_reasons |
|
template<typename ReasonsAdaptor = NoReasons, typename Allocator = NoAllocator>
struct carl::StdMultivariatePolynomialPolicies< ReasonsAdaptor, Allocator >
The default policy for polynomials.
Definition at line 20 of file MultivariatePolynomialPolicy.h.
◆ getReasons()
BitVector carl::NoReasons::getReasons |
( |
| ) |
const |
|
inlineinherited |
◆ setReason()
void carl::NoReasons::setReason |
( |
unsigned |
index | ) |
|
|
inherited |
◆ setReasons()
void carl::NoReasons::setReasons |
( |
const BitVector & |
| ) |
const |
|
inlineinherited |
◆ has_reasons
template<typename ReasonsAdaptor = NoReasons, typename Allocator = NoAllocator>
◆ searchLinear
template<typename ReasonsAdaptor = NoReasons, typename Allocator = NoAllocator>
Linear searching means that we search linearly for a term instead of applying e.g.
binary search. Although the worst-case complexity is worse, for polynomials with a small nr of terms, this should be better.
Definition at line 28 of file MultivariatePolynomialPolicy.h.
The documentation for this struct was generated from the following file: