 |
My Project
debian-1:4.1.1-p2+ds-4build1
|
Go to the documentation of this file. 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
int ReducePoly(Poly *x, Poly *y)
Poly * FindMinList(jList *)
const CanonicalForm int const CFList const Variable & y
void ProlVar(Poly *, int)
int ValidatePoly(Poly *, TreeM *)
void insert_(TreeM **tree, Poly *item)
void InitHistory(Poly *p)
Poly * is_div_(TreeM *root, poly item)
int ComputeBasis(jList *, jList *)
int ReducePolyLead(Poly *x, Poly *y)
void InsertInCount(jList *, Poly *)
void SetProl(Poly *, int)
void ControlProlong(Poly *)
void PNF(Poly *, TreeM *)
void DestroyTree(NodeM *)
void(* poly_function)(Poly *)
Poly * is_present(jList *, poly)
int ProlCompare(Poly *, Poly *)
ListNode * CreateListNode(Poly *x)
void SetMult(Poly *, int)
int ListGreatMoveDegree(jList *, jList *, poly)
void ForEachPNF(jList *, int)
int ListGreatMoveOrder(jList *, jList *, poly)
void NFL(Poly *, TreeM *)
void Initialization(char *)
void ForEachControlProlong(jList *)
void ClearProl(Poly *x, int i)
void DestroyListNode(ListNode *x)
void DestroyList(jList *)
void ClearMult(Poly *, int)
Poly * NewPoly(poly p=NULL)
const ExtensionInfo & info
< [in] sqrfree poly
void InsertInList(jList *, Poly *)