 |
My Project
debian-1:4.1.1-p2+ds-4build2
|
void insertOrdered(RuleOld *r)
RTagNode * insert(RNode *r)
RNode * get(int idx, int length)
PNode(poly p, PNode *n)
functions working on the class PNode
void insertSP(LPolyOld *lp)
LNode * getFirstCurrentIdx()
CNode * insert(CPairOld *c)
LTagNode * insert(LNode *l)
static BOOLEAN length(leftv result, leftv arg)
LNode * get(int i, int length)
void insertFirst(LNode *l)
RuleOld * getTestedRuleOld()
void insertByDeg(LPolyOld *lp)
LNode * getGPrevRedCheck()
RNode * insertOrdered(RuleOld *r)
void setFirstCurrentIdx(LNode *l)
void insertByLabel(poly t, int i, poly p, RuleOld *r=NULL)
class PNode of nodes of polynomials
LNode * insert(LPolyOld *lp)
LNode * insertByDeg(LPolyOld *lp)
RNode * insert(RuleOld *r)
void setRuleOld(RuleOld *r)
LNode * getcompletedRedCheck()
LNode * insertFirst(LNode *l)
class PList of lists of PNodes
void insertWithoutSort(CPairOld *c)
LNode * insertSP(LPolyOld *lp)
CNode * insertWithoutSort(CPairOld *cp)
void insert(LPolyOld *lp)
PList()
functions working on the class PList
LNode * insertByLabel(poly t, int i, poly p, RuleOld *r)