60 for(
int i=1;
i<=strat->
sl;
i++)
67 for(
int i=1;
i<=strat->
sl;
i++)
76 for(
int i=strat->
Ll;
i>=0;
i--)
81 strat->
P = strat->
L[
i];
92 if ((strat->
P.p ==
NULL) && (strat->
P.t_p ==
NULL))
101 if (
p==
NULL) red_result=0;
162 for(
int i=1;
i<=strat->
sl;
i++)
169 for(
int i=1;
i<=strat->
sl;
i++)
179 int parent_pid=getpid();
185 for(
int i=strat->
Ll;
i>=0;
i--)
189 for(
int i=cpus;
i>=0;
i--)
194 for (
int i=0;
i<cpus;
i++)
199 if (parent_pid!=getpid())
203 int ind=queue->dequeue();
226 if ((P.p ==
NULL) && (P.t_p ==
NULL))
236 if (
p==
NULL) red_result=0;
262 int remaining_childs=cpus;
263 while(remaining_childs>0)
265 res=rqueue->dequeue();
281 dummy=queue->dequeue();
static void * feOptValue(feOptIndex opt)
KINLINE TObject ** initR()
KINLINE unsigned long * initsevT()
void ksCreateSpoly(LObject *Pair, poly spNoether, int use_buckets, ring tailRing, poly m1, poly m2, TObject **R)
void initBba(kStrategy strat)
poly redNF(poly h, int &max_ind, int nonorm, kStrategy strat)
void initBuchMora(ideal F, ideal Q, kStrategy strat)
void initBuchMoraPos(kStrategy strat)
void initenterpairs(poly h, int k, int ecart, int isFromQ, kStrategy strat, int atR)
void initS(ideal F, ideal Q, kStrategy strat)
BOOLEAN kCheckSpolyCreation(LObject *L, kStrategy strat, poly &m1, poly &m2)
void initBuchMoraCrit(kStrategy strat)
void messageSets(kStrategy strat)
static LSet initL(int nr=setmaxL)
BOOLEAN kVerify2(ideal F, ideal Q)
BOOLEAN kVerify1(ideal F, ideal Q)
static void vmem_deinit()
static Status vmem_init()
void p_wrp(poly p, ring lmRing, ring tailRing)
VAR ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
Compatiblity layer for legacy polynomial operations (over currRing)
static void pLmFree(poly p)
frees the space of the monomial m, assumes m != NULL coef is not freed, m is not advanced
#define pInit()
allocates a new monomial and initializes everything to 0
static BOOLEAN rIsNCRing(const ring r)
long id_RankFreeModule(ideal s, ring lmRing, ring tailRing)
return the maximal component number found in any polynomial in s