carl
24.04
Computer ARithmetic Library
Complexity.h
Go to the documentation of this file.
1
#pragma once
2
3
#include <
carl-arith/poly/umvpoly/functions/Complexity.h
>
4
5
namespace
carl
{
6
7
/**
8
* @return An approximation of the complexity of this constraint.
9
*/
10
template
<
typename
Poly>
11
std::size_t
complexity
(
const
BasicConstraint<Poly>
& c) {
12
return
1 +
complexity
(c.
lhs
());
13
}
14
15
}
carl
carl is the main namespace for the library.
carl::complexity
std::size_t complexity(const BasicConstraint< Poly > &c)
Definition:
Complexity.h:11
carl::BasicConstraint
Represent a polynomial (in)equality against zero.
Definition:
BasicConstraint.h:15
carl::BasicConstraint::lhs
const Pol & lhs() const
Definition:
BasicConstraint.h:33
Complexity.h
carl-arith
constraint
Complexity.h
Generated by
1.9.1