51{
53
56 ideal I=(ideal)
v->Data();
59 {
61 {
62 goto zero;
63 }
64 else
66 }
67 if (is_zero)
68 goto zero;
70 {
72 int ideal_length;
73 if (flag==1)
75 else
77
79
80 int ideal_index=0;
81
83
84 while(iT)
85 {
86 pTest(iT->info->root);
87 if ((flag==1) && dpO)
88 {
89
91 {
92 result->m[ideal_length-ideal_index-1]=
pCopy(iT->info->root);
94 result->m[ideal_length-ideal_index-1]
96
97 ideal_index++;
98 }
99 }
100 else
101 {
102 result->m[ideal_length-ideal_index-1]=
pCopy(iT->info->root);
104 result->m[ideal_length-ideal_index-1]
106
107 ideal_index++;
108 }
109 iT=iT->next;
110 }
111
112 if ((flag==1) && (dpO==0))
113 {
114
117 }
123 }
124 else
126
127zero:
133}
void DestroyList(jList *x)
ideal kInterRedOld(ideal F, ideal Q)
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy
long p_Deg(poly a, const ring r)
#define pIsConstant(p)
like above, except that Comp must be 0
ideal idInit(int idsize, int rank)
initialise an ideal / module
void idSkipZeroes(ideal ide)
gives an ideal/module the minimal possible size
static BOOLEAN jInitBasis(ideal v, jList **TT, jList **QQ)