class PNode of nodes of polynomials More...

#include <f5lists.h>

Public Member Functions
	PNode (poly p, PNode *n)
	functions working on the class PNode

poly	getPoly ()

PNode *	getNext ()

PNode *	insert (poly p)

Private Attributes
poly	data

PNode *	next

Detailed Description

class PNode of nodes of polynomials

Definition at line 36 of file f5lists.h.

Constructor & Destructor Documentation

◆ PNode()

PNode::PNode	(	poly	p,
		PNode *	n )

functions working on the class PNode

Definition at line 25 of file f5lists.cc.

                             {
  data  = p;
  next  = n;
}

Member Function Documentation

◆ getNext()

PNode * PNode::getNext ( )

Definition at line 34 of file f5lists.cc.

                      {
  return this->next;
}

◆ getPoly()

poly PNode::getPoly ( )

Definition at line 30 of file f5lists.cc.

                    {
  return this->data;
}

◆ insert()

PNode * PNode::insert ( poly p )

Definition at line 37 of file f5lists.cc.

                           {
  poly q = pOne();
  q = pCopy(p);
  PNode* temp = this;
  if(NULL == temp) {
    PNode* pn = new PNode(q,temp);
    return pn;
  }
  if(1 == pLmCmp(q,temp->getPoly())) {
    PNode* pn = new PNode(q,temp);
    return pn;
  }
  if(0 == pLmCmp(q,temp->getPoly())) {
    return this;
  }
  if(-1 == pLmCmp(q,temp->getPoly())) {
    while(NULL != temp->getNext() && -1 == pLmCmp(q,temp->getNext()->getPoly())) {
      temp = temp->getNext();
    }
    if(NULL == temp->getNext() || 1 == pLmCmp(q,temp->getNext()->getPoly())) {
      PNode* pn = new PNode(q,temp->getNext());
      temp->next = pn;
      return this;
    }
    if(0 == pLmCmp(q,temp->getNext()->getPoly())) {
      return this;
    }
  }
}

Field Documentation

◆ data

poly PNode::data

private

Definition at line 38 of file f5lists.h.

◆ next

PNode* PNode::next