Monomials.
#include <monomial.h>
Public Types | |
typedef std::list< monomial > ::iterator | list_iterator |
Defines list-iterator for monomial. | |
typedef std::list< monomial > ::const_iterator | list_constiterator |
Defines const list-iterator for monomial. | |
Public Member Functions | |
monomial () | |
Creates a monomial with no entries. | |
monomial (var a) | |
Creates the monomial ![]() | |
monomial (double co, var a) | |
Creates the monomial ![]() | |
monomial (double co, std::vector< var > a) | |
Creates the monomial with coefficient co and variable list a . | |
monomial (double co, var a, var b) | |
double | value (solution &sol) |
monomial & | operator*= (const monomial &m) |
Multiplies the monomial by m . | |
monomial | operator* (const monomial &m) |
Creates the monomial ![]() | |
monomial | operator*= (const var &a) |
Multiplies the monomial by a . | |
monomial | operator* (const var &a) |
Creates the monomial ![]() | |
polynomial | operator+ (const var &a) |
Creates the polynomial ![]() | |
polynomial | operator- (const var &a) |
Creates the polynomial ![]() | |
polynomial | operator+ (const monomial &m) |
Creates the polynomial ![]() | |
polynomial | operator- (const monomial &m) |
Creates the polynomial ![]() | |
polynomial | operator+ (const row &r) |
Creates the polynomial ![]() | |
polynomial | operator- (const row &r) |
Creates the polynomial ![]() | |
monomial & | operator*= (double d) |
Multiplies the monomial by d . | |
monomial | operator* (double d) |
Creates the monomial ![]() | |
polynomial | operator* (const polynomial &p) |
Creates the polynomial ![]() | |
polynomial | operator+ (const polynomial &p) |
Creates the polynomial ![]() | |
polynomial | operator- (const polynomial &p) |
Creates the polynomial ![]() | |
pol_constraint | operator<= (double rhs) |
Creates the polynomial constraint ![]() | |
pol_constraint | operator>= (double rhs) |
Creates the polynomial constraint ![]() | |
pol_constraint | operator== (double rhs) |
Creates the polynomial constraint ![]() | |
std::vector< var > | get_A () const |
Returns the list of variables. | |
double | get_coeff () const |
Returns the coefficient of the monomial. | |
int | size () const |
Returns the size of the list of variables. | |
void | set_coeff (double d) |
Sets the coefficient of the monomial. | |
bool | is_maximal () const |
Returns true if the monomial is maximal. | |
void | set_not_maximal () |
Sets maximal to false. | |
monomial | unite (monomial &q) const |
monomial | unite2 (monomial &q) const |
var & | linearize (ILP_Problem &IP, bool set_c=true) |
Returns true if mon and q have equal variable lists. | |
Friends | |
class | polynomial |
class | monomial_inst |
class | qmonomial |
class | ILP_Problem |
Definition at line 34 of file monomial.h.
var& SCIL::monomial::linearize | ( | ILP_Problem & | IP, | |
bool | set_c = true | |||
) |
Linearizes the monomial and retruns the linearization variable.
polynomial SCIL::monomial::operator+ | ( | const row & | r | ) |
Caution: Constant term of r
is ignored!
polynomial SCIL::monomial::operator- | ( | const row & | r | ) |
Caution: Constant term of r
is ignored!