 |
My Project
debian-1:4.1.2-p1+ds-2
|
Go to the documentation of this file.
31 scfmon hInit(ideal S, ideal
Q,
int *Nexist, ring tailRing)
74 for (
i = sl;
i>0;
i--)
81 for (
i = ql;
i>0;
i--)
92 for (
i = sl;
i>0;
i--)
102 for (
i = ql;
i>0;
i--)
149 for (
i=ev_length-1;
i>=0;
i--)
160 scfmon ex = exist, co = stc;
163 for (
i = Nexist;
i>0;
i--)
165 if (((**ex) == 0) || ((**ex) == ak))
179 int nv, i0, i1,
i,
j;
182 for (
i = 1;
i <= nv;
i++)
207 int i, i1,
j, jj,
k,
l;
212 v1 = (
float *)
omAlloc(Nvar *
sizeof(
float));
213 temp = (
int *)
omAlloc(Nstc *
sizeof(
int));
215 for (
i = 1;
i <= Nvar;
i++)
221 for (
j = 1;
j < Nstc;
j++)
238 else if (
x < temp[
k])
240 for (
l = jj;
l >
k;
l--)
258 o = (float)Nstc/(
float)jj;
259 for(
j = 0;
j < jj;
j++)
269 v1[
i-1] =
h * (float)jj;
273 for (
i = 1;
i < Nvar;
i++)
282 for (
l =
i;
l >
j;
l--)
302 while ((co[a]!=
NULL) && (a<Nco)) a++;
305 for (
j = a;
j < Nco;
j++)
350 else if (o[k1] < n[k1])
403 else if (stc[
i]!=
NULL)
416 int nc = *Nrad, z = 0,
i,
j,
k;
427 if ((o[
k]!=0) && (n[
k]==0))
440 if ((o[
k]==0) && (n[
k]!=0))
446 else if (!o[
k] && n[
k])
542 else if (o[k1] > n[k1])
545 for (tmp_k =
j; tmp_k >
i; tmp_k--)
546 stc[tmp_k] = stc[tmp_k - 1];
570 int j = 1,
i = 0,
k, k1;
602 else if (o[k1] && !n[k1])
604 for (
k =
j;
k >
i;
k--)
625 scmon pure,
int *Npure)
627 int nc = *Nstc, np = 0, nq = 0,
j,
i, i1, c,
l;
629 for (
j = a;
j < nc;
j++)
660 else if (
x[
l] < pure[
l])
677 int nc = *e1, z = 0,
i,
j,
k, k1;
679 if (!nc || (a2 == e2))
747 int nc = *e1, z = 0,
i,
j,
k, k1;
749 if (!nc || (a2 == e2))
818 int j0 = 0,
j = 0,
i = a2,
k, k1;
823 rad[
i - a2] = rad[
i];
852 memcpy(rad,
w, (e1 + e2 - a2) *
sizeof(
scmon));
856 else if (o[k1] > n[k1])
873 memcpy(rad,
w, (e1 + e2 - a2) *
sizeof(
scmon));
886 int j0 = 0,
j = 0,
i = a2,
k, k1;
891 rad[
i - a2] = rad[
i];
921 memcpy(rad,
w, (e1 + e2 - a2) *
sizeof(
scmon));
925 else if (o[k1] && !n[k1])
942 memcpy(rad,
w, (e1 + e2 - a2) *
sizeof(
scmon));
1004 for (
i = Nvar;
i>0;
i--)
1016 for (
i = Nvar;
i!=0;
i--)
1018 if (xmem[
i]->mo!=
NULL)
1030 if ((
x==
NULL) || (lm > lx))
1040 memcpy(
x, old, lm *
sizeof(
scmon));
1062 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)
scfmon hGetmem(int lm, scfmon old, monp monmem)
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)
STATIC_VAR scfmon hsecure
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)
VAR ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
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)