28 if (p_LmCmp(
p,
m,r)==0)
35 return n_Init(0,r->cf);
47 if (p_LmCmp(
v,
m,r)==0)
97 for(
int j=0;
j<ncols_m;
j++)
103 p_SetComp(uu,(
i-1)*ncols_m+
j+1,r);
129 to_shift+=p_MaxComp(
m->m[
i-1],r);
Coefficient rings, fields and other domains suitable for Singular polynomials.
const Variable & v
< [in] a sqrfree bivariate poly
void p_TakeOutComp(poly *p, long comp, poly *q, int *lq, const ring r)
#define p_SetCoeff0(p, n, r)
poly p_CoeffTermId(poly v, ideal m, int n, const ring r)
find coeffs of a vector of a list of given monomials, n>=max_comp(v)
number p_CoeffTerm(poly p, poly m, const ring r)
find coeff of (polynomial) m in polynomial p find coeff of (vector) m in vector p
ideal id_CoeffTermV(ideal M, poly m, const ring r)
find coeffs of (polynomial) m in all vectors from I
ideal id_CoeffTerm(ideal I, poly m, const ring r)
find coeffs of (polynomial) m in all polynomials from I find coeffs of (vector) m in all vectors from...
poly p_CoeffTermV(poly v, poly m, const ring r)
find vector of coeffs of (polynomial) m in vector v
poly p_CoeffTermMo(poly v, ideal m, const ring r)
find coeffs of a vector of a matrix(module) of given monomials
void p_Shift(poly *p, int i, const ring r)
shifts components of the vector p by i
poly p_NSet(number n, const ring r)
returns the poly representing the number n, destroys n
ideal id_Vec2Ideal(poly vec, const ring R)
ideal idInit(int idsize, int rank)
initialise an ideal / module