MPSolve 3.2.1
|
Implementation in C++ of arithmetic between formal polynomials with rational coefficients. More...
#include <vector>
#include <stdexcept>
#include <iostream>
Go to the source code of this file.
Classes | |
class | mps::formal::Polynomial |
Typedefs | |
typedef struct mps_formal_polynomial | mps_formal_polynomial |
Functions | |
mps_formal_polynomial * | mps_formal_polynomial_new_with_monomial (mps_formal_monomial *) |
mps_formal_polynomial * | mps_formal_polynomial_sum_eq (mps_formal_polynomial *p, mps_formal_monomial *m) |
mps_formal_polynomial * | mps_formal_polynomial_sub_eq (mps_formal_polynomial *p, mps_formal_monomial *m) |
mps_formal_polynomial * | mps_formal_polynomial_sum_eq_p (mps_formal_polynomial *p, mps_formal_polynomial *m) |
mps_formal_polynomial * | mps_formal_polynomial_sub_eq_p (mps_formal_polynomial *p, mps_formal_polynomial *m) |
mps_monomial_poly * | mps_formal_polynomial_create_monomial_poly (mps_formal_polynomial *p, mps_context *ctx) |
mps_formal_polynomial * | mps_formal_polynomial_mul (mps_formal_polynomial *p, mps_formal_polynomial *q) |
mps_formal_polynomial * | mps_formal_polynomial_mul_eq (mps_formal_polynomial *p, mps_formal_polynomial *q) |
void | mps_formal_polynomial_print (mps_formal_polynomial *p) |
void | mps_formal_polynomial_free (mps_formal_polynomial *p) |
Polynomial | mps::formal::operator+ (Monomial a, Monomial b) |
std::ostream & | mps::formal::operator<< (std::ostream &os, const Polynomial &p) |
Implementation in C++ of arithmetic between formal polynomials with rational coefficients.
This implementation is used while parsing polynomials with the lexer to construct a polynomial incrementally.