My Project
Loading...
Searching...
No Matches
Public Member Functions | Private Attributes
RNode Class Reference

#include <f5lists.h>

Public Member Functions

 RNode ()
 
 RNode (RuleOld *r)
 
 ~RNode ()
 
RNodeinsert (RuleOld *r)
 
RNodeinsert (int i, poly t)
 
RNodeinsertOrdered (RuleOld *r)
 
RNodegetNext ()
 
RuleOldgetRuleOld ()
 
int getRuleOldIndex ()
 
poly getRuleOldTerm ()
 
void print ()
 

Private Attributes

RuleOlddata
 
RNodenext
 

Detailed Description

Definition at line 290 of file f5lists.h.

Constructor & Destructor Documentation

◆ RNode() [1/2]

RNode::RNode ( )

Definition at line 967 of file f5lists.cc.

967 {
968 //Print("HIER RNODE CONSTRUCTOR\n");
969 data = NULL;
970 next = NULL;
971}
RNode * next
Definition: f5lists.h:293
RuleOld * data
Definition: f5lists.h:292
#define NULL
Definition: omList.c:12

◆ RNode() [2/2]

RNode::RNode ( RuleOld r)

Definition at line 973 of file f5lists.cc.

973 {
974 data = r;
975 next = NULL;
976}

◆ ~RNode()

RNode::~RNode ( )

Definition at line 978 of file f5lists.cc.

978 {
979 //Print("DELETE RuleOld\n");
980 delete data;
981}

Member Function Documentation

◆ getNext()

RNode * RNode::getNext ( )

Definition at line 1023 of file f5lists.cc.

1023 {
1024 return next;
1025}

◆ getRuleOld()

RuleOld * RNode::getRuleOld ( )

Definition at line 1027 of file f5lists.cc.

1027 {
1028 return data;
1029}

◆ getRuleOldIndex()

int RNode::getRuleOldIndex ( )

Definition at line 1031 of file f5lists.cc.

1031 {
1032 return data->getIndex();
1033}
int getIndex()
Definition: f5data.h:252

◆ getRuleOldTerm()

poly RNode::getRuleOldTerm ( )

Definition at line 1035 of file f5lists.cc.

1035 {
1036 return data->getTerm();
1037}
poly getTerm()
Definition: f5data.h:256

◆ insert() [1/2]

RNode * RNode::insert ( int  i,
poly  t 
)

Definition at line 989 of file f5lists.cc.

989 {
990 //Print("IN INSERT: ");
991 //pWrite(t);
992 RuleOld* r = new RuleOld(i,t);
993 //Print("ADDRESS OF RuleOld: %p\n",r);
994 RNode* newElement = new RNode(r);
995 //Print("ADDRESS OF RNODE: %p\n",newElement);
996 //Print("ADDRESS OF RNODE DATA: %p\n",newElement->getRuleOld());
997 newElement->next = this;
998 return newElement;
999}
int i
Definition: cfEzgcd.cc:132
Definition: f5lists.h:290
RNode()
Definition: f5lists.cc:967

◆ insert() [2/2]

RNode * RNode::insert ( RuleOld r)

Definition at line 983 of file f5lists.cc.

983 {
984 RNode* newElement = new RNode(r);
985 newElement->next = this;
986 return newElement;
987}

◆ insertOrdered()

RNode * RNode::insertOrdered ( RuleOld r)

Definition at line 1002 of file f5lists.cc.

1002 {
1003 RNode* newElement = new RNode(r);
1004 RNode* temp = this;
1005 if(NULL == temp) {
1006 newElement->next = temp;
1007 return newElement;
1008 }
1009 if(1 == pLmCmp(newElement->getRuleOldTerm(),temp->getRuleOldTerm())) {
1010 newElement->next = temp;
1011 return newElement;
1012 }
1013 else {
1014 while(NULL != temp && 1 == pLmCmp(temp->getRuleOldTerm(),newElement->getRuleOldTerm())) {
1015 temp = temp->getNext();
1016 }
1017 newElement->next = temp;
1018 return this;
1019 }
1020}
poly getRuleOldTerm()
Definition: f5lists.cc:1035
RNode * getNext()
Definition: f5lists.cc:1023
#define pLmCmp(p, q)
returns 0|1|-1 if p=q|p>q|p<q w.r.t monomial ordering
Definition: polys.h:105

◆ print()

void RNode::print ( )

Definition at line 1039 of file f5lists.cc.

1039 {
1040 RNode* temp = this;
1041 while(NULL != temp) {
1042 pWrite(temp->getRuleOldTerm());
1043 Print("%d\n\n",temp->getRuleOldIndex());
1044 temp = temp->getNext();
1045 }
1046}
int getRuleOldIndex()
Definition: f5lists.cc:1031
#define Print
Definition: emacs.cc:80
void pWrite(poly p)
Definition: polys.h:308

Field Documentation

◆ data

RuleOld* RNode::data
private

Definition at line 292 of file f5lists.h.

◆ next

RNode* RNode::next
private

Definition at line 293 of file f5lists.h.


The documentation for this class was generated from the following files: