1 #ifndef __JANET_INTERFACE__
2 #define __JANET_INTERFACE__
6 #define GCM(sz) omAlloc((sz))
7 #define GCMA(sz) omAlloc((sz))
8 #define GCF(x) omFree((x))
10 #define ListNode struct LISTNODE
11 #define TreeM struct TREEM
12 #define NodeM struct NODEM
101 #endif //JANET_INTERFACE
const CanonicalForm int const CFList const Variable & y
void ForEachPNF(jList *, int)
int ProlCompare(Poly *, Poly *)
void InitHistory(Poly *p)
void insert_(TreeM **tree, Poly *item)
void SetProl(Poly *, int)
void InsertInList(jList *, Poly *)
int ValidatePoly(Poly *, TreeM *)
void NFL(Poly *, TreeM *)
void ProlVar(Poly *, int)
Poly * FindMinList(jList *)
void InsertInCount(jList *, Poly *)
Poly * NewPoly(poly p=NULL)
void PNF(Poly *, TreeM *)
int ComputeBasis(jList *, jList *)
Poly * is_present(jList *, poly)
Poly * is_div_(TreeM *root, poly item)
int ListGreatMoveDegree(jList *, jList *, poly)
void(* poly_function)(Poly *)
void ClearProl(Poly *x, int i)
void ForEachControlProlong(jList *)
void DestroyTree(NodeM *)
int ReducePolyLead(Poly *x, Poly *y)
void ControlProlong(Poly *)
int ReducePoly(Poly *x, Poly *y)
void SetMult(Poly *, int)
void Initialization(char *)
ListNode * CreateListNode(Poly *x)
void DestroyList(jList *)
int ListGreatMoveOrder(jList *, jList *, poly)
void DestroyListNode(ListNode *x)
void ClearMult(Poly *, int)