43 static int Mask[8]={0x80,0x40,0x20,0x10,0x8,0x4,0x2,0x1};
#define pLmCmp(p, q)
returns 0|1|-1 if p=q|p>q|p
void DestroyListNode(ListNode *x)
void ProlVar(Poly *temp, int i)
ListNode * CreateListNode(Poly *x)
const poly kBucketGetLm(kBucket_pt bucket)
void DestroyList(jList *x)
void insert_(TreeM **tree, Poly *item)
#define pLmDelete(p)
assume p != NULL, deletes Lm(p)->coef and Lm(p)
Poly * FindMinList(jList *L)
int ProlCompare(Poly *item1, Poly *item2)
static long p_Totaldegree(poly p, const ring r)
int ReducePolyLead(Poly *x, Poly *y)
static int(* ListGreatMove)(jList *, jList *, poly)
void p_SimpleContent(poly ph, int smax, const ring r)
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy ...
kBucket_pt kBucketCreate(ring bucket_ring)
Creation/Destruction of buckets.
static int pLength(poly a)
void ControlProlong(Poly *x)
Poly * is_div_(TreeM *tree, poly item)
int ListGreatMoveOrder(jList *A, jList *B, poly x)
void div_l(poly item, NodeM *x, int from)
int GetMult(Poly *x, int i)
void ClearProl(Poly *x, int i)
ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
#define pGetExp(p, i)
Exponent.
int ReducePoly(Poly *x, poly from, Poly *y)
int ValidatePoly(Poly *x, TreeM *)
long p_Deg(poly a, const ring r)
void kBucketDestroy(kBucket_pt *bucket_pt)
#define pLmInit(p)
like pInit, except that expvector is initialized to that of p, p must be != NULL
void ksOldSpolyTail(poly p1, poly q, poly q2, poly spNoether, ring r)
int sp_div(poly m1, poly m2, int from)
void DestroyPoly(Poly *x)
Poly * is_present(jList *F, poly x)
#define pIsConstant(p)
like above, except that Comp might be != 0
void InsertInList(jList *x, Poly *y)
void PrintS(const char *s)
void ForEachPNF(jList *x, int i)
void p_Content(poly ph, const ring r)
void(* poly_function)(Poly *)
void InsertInCount(jList *x, Poly *y)
void SetMult(Poly *x, int i)
long(* pFDegProc)(poly p, ring r)
void Initialization(char *Ord)
void InitHistory(Poly *p)
int ComputeBasis(jList *_lT, jList *_lQ)
int GetProl(Poly *x, int i)
Poly * is_div_upper(poly item, NodeM *x, int from)
KINLINE poly ksOldSpolyRed(poly p1, poly p2, poly spNoether)
void ForEachControlProlong(jList *x)
void DestroyTree(NodeM *G)
void PNF(Poly *p, TreeM *F)
void NFL(Poly *p, TreeM *F)
#define pCopy(p)
return a copy of the poly