97 for(
int j=0;
j<ncols_m;
j++)
Coefficient rings, fields and other domains suitable for Singular polynomials.
static FORCE_INLINE number n_Copy(number n, const coeffs r)
return a copy of 'n'
static FORCE_INLINE number n_Init(long i, const coeffs r)
a number representing i in the given coeff field/ring r
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_CoeffTermMo(poly v, ideal m, int n, const ring r)
find coeffs of a vector of a matrix(module) of given monomials, n>=max_comp(v)
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
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
static poly p_Add_q(poly p, poly q, const ring r)
static void p_SetCompP(poly p, int i, ring r)
static unsigned long p_SetComp(poly p, unsigned long c, ring r)
static int p_LmCmp(poly p, poly q, const ring r)
static long p_MaxComp(poly p, ring lmRing, ring tailRing)
static poly p_Init(const ring r, omBin bin)
static poly p_Copy(poly p, const ring r)
returns a copy of p
ideal id_Vec2Ideal(poly vec, const ring R)
ideal idInit(int idsize, int rank)
initialise an ideal / module