71 for (
i = sl;
i>0;
i--)
78 for (
i =
ql;
i>0;
i--)
89 for (
i = sl;
i>0;
i--)
99 for (
i =
ql;
i>0;
i--)
162 if (((**
ex) == 0) || ((**
ex) == ak))
179 for (
i = 1;
i <=
nv;
i++)
256 for(
j = 0;
j <
jj;
j++)
279 for (
l =
i;
l >
j;
l--)
347 else if (o[
k1] < n[
k1])
413 int nc = *
Nrad, z = 0,
i,
j,
k;
424 if ((o[
k]!=0) && (n[
k]==0))
437 if ((o[
k]==0) && (n[
k]!=0))
443 else if (!o[
k] && n[
k])
539 else if (o[
k1] > n[
k1])
567 int j = 1,
i = 0,
k,
k1;
599 else if (o[
k1] && !n[
k1])
601 for (
k =
j;
k >
i;
k--)
626 for (
j = a;
j < nc;
j++)
674 int nc = *
e1, z = 0,
i,
j,
k,
k1;
676 if (!nc || (a2 ==
e2))
744 int nc = *
e1, z = 0,
i,
j,
k,
k1;
746 if (!nc || (a2 ==
e2))
815 int j0 = 0,
j = 0,
i = a2,
k,
k1;
853 else if (o[
k1] > n[
k1])
883 int j0 = 0,
j = 0,
i = a2,
k,
k1;
922 else if (o[
k1] && !n[
k1])
const CanonicalForm int const CFList const Variable & y
void hComp(scfmon exist, int Nexist, int ak, scfmon stc, int *Nstc)
void hLex2S(scfmon rad, int e1, int a2, int e2, varset var, int Nvar, scfmon w)
void hKill(monf xmem, int Nvar)
STATIC_VAR scfmon hsecure
void hElimS(scfmon stc, int *e1, int a2, int e2, varset var, int Nvar)
void hLexS(scfmon stc, int Nstc, varset var, int Nvar)
void hDelete(scfmon ev, int ev_length)
static void hShrink(scfmon co, int a, int Nco)
scfmon hGetmem(int lm, scfmon old, monp monmem)
void hPure(scfmon stc, int a, int *Nstc, varset var, int Nvar, scmon pure, int *Npure)
void hSupp(scfmon stc, int Nstc, varset var, int *Nvar)
void hLexR(scfmon rad, int Nrad, varset var, int Nvar)
void hStepR(scfmon rad, int Nrad, varset var, int Nvar, int *a)
void hLex2R(scfmon rad, int e1, int a2, int e2, varset var, int Nvar, scfmon w)
void hStepS(scfmon stc, int Nstc, varset var, int Nvar, int *a, int *x)
void hStaircase(scfmon stc, int *Nstc, varset var, int Nvar)
void hElimR(scfmon rad, int *e1, int a2, int e2, varset var, int Nvar)
void hOrdSupp(scfmon stc, int Nstc, varset var, int Nvar)
scfmon hInit(ideal S, ideal Q, int *Nexist)
void hRadical(scfmon rad, int *Nrad, int Nvar)
#define omFreeSize(addr, size)
static void p_GetExpV(poly p, int *ev, const ring r)
VAR ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
Compatibility layer for legacy polynomial operations (over currRing)
int status int void size_t count
long id_RankFreeModule(ideal s, ring lmRing, ring tailRing)
return the maximal component number found in any polynomial in s