70 int to_minimal = 0)
const;
Engine-side free module R^n over a Ring.
Engine-side commutative monomial monoid: variable names, ordering, multidegree machinery,...
Abstract base for the engine's polynomial-ring hierarchy.
res2_poly(PolynomialRing *R)
res2term * copy(const res2term *f) const
res2term * from_vector(const VECTOR(res2_pair *)&base, const vec v) const
const res2_pair * lead_component(const res2term *f) const
const res2term * component_occurs_in(const res2_pair *x, const res2term *f) const
res2term * mult_by_monomial(const res2term *f, const int *m) const
void sort(res2term *&f) const
res2term * strip(const res2term *f) const
void add_to(res2term *&f, res2term *&g) const
int n_terms(const res2term *f) const
const PolynomialRing * get_ring() const
res2term * ring_mult_by_term(const ring_elem f, ring_elem c, const int *m, res2_pair *x) const
void make_monic(res2term *&f) const
void ring_subtract_multiple_to(res2term *&f, ring_elem c, const int *m, res2_pair *x, const ring_elem g) const
void subtract_multiple_to(res2term *&f, ring_elem c, const int *m, const res2term *g) const
int compare(const res2term *a, const res2term *b) const
res2term * mult_by_coefficient(const res2term *f, const ring_elem c) const
void elem_text_out(buffer &o, const res2term *f) const
res2term * mult_by_term(const res2term *f, ring_elem c, const int *m) const
const int * lead_monomial(const res2term *f) const
vec to_vector(const res2term *f, const FreeModule *F, int to_minimal=0) const
res2term * new_term() const
void remove(res2term *&f) const
static CanonicalForm base
MonomialIdeal — exponent-vector-only representation of an ideal generated by monomials.