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
const CanonicalForm int const CFList const Variable & y
Poly * NewPoly(poly p=NULL)
void SetMult(Poly *, int)
void InitHistory(Poly *p)
void DestroyList(jList *)
ListNode * CreateListNode(Poly *x)
int ProlCompare(Poly *, Poly *)
int ReducePolyLead(Poly *x, Poly *y)
void ForEachPNF(jList *, int)
Poly * is_div_(TreeM *root, poly item)
void SetProl(Poly *, int)
int ValidatePoly(Poly *, TreeM *)
void InsertInCount(jList *, Poly *)
void ProlVar(Poly *, int)
void DestroyListNode(ListNode *x)
Poly * is_present(jList *, poly)
int ListGreatMoveOrder(jList *, jList *, poly)
Poly * FindMinList(jList *)
void ControlProlong(Poly *)
void ClearProl(Poly *x, int i)
void ClearMult(Poly *, int)
void Initialization(char *)
int ListGreatMoveDegree(jList *, jList *, poly)
int ReducePoly(Poly *x, Poly *y)
void(* poly_function)(Poly *)
int ComputeBasis(jList *, jList *)
void DestroyTree(NodeM *)
void ForEachControlProlong(jList *)
void InsertInList(jList *, Poly *)
void NFL(Poly *, TreeM *)
void PNF(Poly *, TreeM *)
void insert_(TreeM **tree, Poly *item)