 |
My Project
UNKNOWN_GIT_VERSION
|
Go to the documentation of this file.
77 for (
i = sl;
i>0;
i--)
84 for (
i = ql;
i>0;
i--)
95 for (
i = sl;
i>0;
i--)
105 for (
i = ql;
i>0;
i--)
152 for (
i=ev_length-1;
i>=0;
i--)
163 scfmon ex = exist, co = stc;
166 for (
i = Nexist;
i>0;
i--)
168 if (((**ex) == 0) || ((**ex) == ak))
182 int nv, i0, i1,
i,
j;
185 for (
i = 1;
i <= nv;
i++)
210 int i, i1,
j, jj,
k,
l;
215 v1 = (
float *)
omAlloc(Nvar *
sizeof(
float));
216 temp = (
int *)
omAlloc(Nstc *
sizeof(
int));
218 for (
i = 1;
i <= Nvar;
i++)
224 for (
j = 1;
j < Nstc;
j++)
241 else if (
x < temp[
k])
243 for (
l = jj;
l >
k;
l--)
261 o = (float)Nstc/(
float)jj;
262 for(
j = 0;
j < jj;
j++)
272 v1[
i-1] =
h * (float)jj;
276 for (
i = 1;
i < Nvar;
i++)
285 for (
l =
i;
l >
j;
l--)
305 while ((co[a]!=
NULL) && (a<Nco)) a++;
308 for (
j = a;
j < Nco;
j++)
353 else if (o[k1] < n[k1])
406 else if (stc[
i]!=
NULL)
419 int nc = *Nrad, z = 0,
i,
j,
k;
430 if ((o[
k]!=0) && (n[
k]==0))
443 if ((o[
k]==0) && (n[
k]!=0))
449 else if (!o[
k] && n[
k])
545 else if (o[k1] > n[k1])
548 for (tmp_k =
j; tmp_k >
i; tmp_k--)
549 stc[tmp_k] = stc[tmp_k - 1];
573 int j = 1,
i = 0,
k, k1;
605 else if (o[k1] && !n[k1])
607 for (
k =
j;
k >
i;
k--)
628 scmon pure,
int *Npure)
630 int nc = *Nstc, np = 0, nq = 0,
j,
i, i1, c,
l;
632 for (
j = a;
j < nc;
j++)
663 else if (
x[
l] < pure[
l])
680 int nc = *e1, z = 0,
i,
j,
k, k1;
682 if (!nc || (a2 == e2))
750 int nc = *e1, z = 0,
i,
j,
k, k1;
752 if (!nc || (a2 == e2))
821 int j0 = 0,
j = 0,
i = a2,
k, k1;
826 rad[
i - a2] = rad[
i];
855 memcpy(rad,
w, (e1 + e2 - a2) *
sizeof(
scmon));
859 else if (o[k1] > n[k1])
876 memcpy(rad,
w, (e1 + e2 - a2) *
sizeof(
scmon));
889 int j0 = 0,
j = 0,
i = a2,
k, k1;
894 rad[
i - a2] = rad[
i];
924 memcpy(rad,
w, (e1 + e2 - a2) *
sizeof(
scmon));
928 else if (o[k1] && !n[k1])
945 memcpy(rad,
w, (e1 + e2 - a2) *
sizeof(
scmon));
1007 for (
i = Nvar;
i>0;
i--)
1019 for (
i = Nvar;
i!=0;
i--)
1021 if (xmem[
i]->mo!=
NULL)
1033 if ((
x==
NULL) || (lm > lx))
1043 memcpy(
x, old, lm *
sizeof(
scmon));
1065 memcpy(pn, p1, (
currRing->N) *
sizeof(
int));
void hStaircase(scfmon stc, int *Nstc, varset var, int Nvar)
static void hShrink(scfmon co, int a, int Nco)
void hElimS(scfmon stc, int *e1, int a2, int e2, varset var, int Nvar)
const CanonicalForm int const CFList const Variable & y
void hRadical(scfmon rad, int *Nrad, int Nvar)
Compatiblity layer for legacy polynomial operations (over currRing)
scfmon hGetmem(int lm, scfmon old, monp monmem)
ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
long id_RankFreeModule(ideal s, ring lmRing, ring tailRing)
return the maximal component number found in any polynomial in s
#define omFreeSize(addr, size)
void hComp(scfmon exist, int Nexist, int ak, scfmon stc, int *Nstc)
void hKill(monf xmem, int Nvar)
void hStepR(scfmon rad, int Nrad, varset var, int Nvar, int *a)
void hDelete(scfmon ev, int ev_length)
static void p_GetExpV(poly p, int *ev, const ring r)
void hStepS(scfmon stc, int Nstc, varset var, int Nvar, int *a, int *x)
void hLex2R(scfmon rad, int e1, int a2, int e2, varset var, int Nvar, scfmon w)
void hPure(scfmon stc, int a, int *Nstc, varset var, int Nvar, scmon pure, int *Npure)
void hLex2S(scfmon rad, int e1, int a2, int e2, varset var, int Nvar, scfmon w)
scfmon hInit(ideal S, ideal Q, int *Nexist, ring tailRing)
void hOrdSupp(scfmon stc, int Nstc, varset var, int Nvar)
void hSupp(scfmon stc, int Nstc, varset var, int *Nvar)
#define id_TestTail(A, lR, tR)
void hElimR(scfmon rad, int *e1, int a2, int e2, varset var, int Nvar)
int status int void size_t count
void hLexR(scfmon rad, int Nrad, varset var, int Nvar)
void hLexS(scfmon stc, int Nstc, varset var, int Nvar)