35 if(l1->
nr<l2->
nr) i=l2->
nr;
60 for(
int i=l1->
nr;
i>=0;
i--)
91 poly
p=(poly)h->
Data();
131 if((d>=0&&md>d)||md==-1) md=d;
288 for(
int i=pl->
nr;
i>=0;
i--)
305 for(
int i=cvl->
nr;
i>=0;
i--)
326 int d0=(int)(
long)h->
Data();
328 int d1=(int)(
long)h->
Data();
348 int d0=(int)(
long)h->
Data();
350 int d1=(int)(
long)h->
Data();
378 int d0=(int)(
long)h->
Data();
380 int d1=(int)(
long)h->
Data();
395 for(
int k=0,
l=d;
k<=
l;
k++,d--)
418 for(
int d=d0,
i=0;d<d1;d++)
431 int d0=(int)(
long)h->
Data();
433 int d1=(int)(
long)h->
Data();
Class used for (list of) interpreter objects.
static unsigned * pcvTable
Compatiblity layer for legacy polynomial operations (over currRing)
lists pcvPMulL(poly p, lists l1)
#define omFreeSize(addr, size)
#define pLmDelete(p)
assume p != NULL, deletes Lm(p)->coef and Lm(p)
void WerrorS(const char *s)
static unsigned ** pcvIndex
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy ...
#define pGetComp(p)
Component.
#define pGetExp(p, i)
Exponent.
const CanonicalForm CFMap CFMap & N
int pcvDim(int d0, int d1)
poly pcvCV2P(poly cv, int d0, int d1)
lists pcvLAddL(lists l1, lists l2)
int pcvBasis(lists b, int i, poly m, int d, int n)
INLINE_THIS void Init(int l=0)
BOOLEAN iiCheckTypes(leftv args, const short *type_list, int report)
check a list of arguemys against a given field of types return TRUE if the types match return FALSE (...
ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
poly pcvP2CV(poly p, int d0, int d1)
#define pSetCoeff(p, n)
deletes old coeff before setting the new one
#define pCopy(p)
return a copy of the poly
#define MATELEM(mat, i, j)