#include <f5lists.h>

Public Member Functions
	RTagNode ()

	RTagNode (RNode *r)

	RTagNode (RNode r, RTagNode n)

	~RTagNode ()

RTagNode *	insert (RNode *r)

RNode *	getRNode ()

RTagNode *	getNext ()

RNode *	get (int idx, int length)

void	set (RNode *)

void	print ()

Private Attributes
RNode *	data

RTagNode *	next

Detailed Description

Definition at line 337 of file f5lists.h.

Constructor & Destructor Documentation

◆ RTagNode() [1/3]

RTagNode::RTagNode ( )

Definition at line 1109 of file f5lists.cc.

                   {
    data = NULL;
    next = NULL;
}

◆ RTagNode() [2/3]

RTagNode::RTagNode ( RNode * r )

Definition at line 1114 of file f5lists.cc.

                           {
    data = r;
    next = NULL;
}

◆ RTagNode() [3/3]

RTagNode::RTagNode	(	RNode *	r,
		RTagNode *	n
	)

Definition at line 1119 of file f5lists.cc.

                                        {
 
    data = r;
    next = n;
}

◆ ~RTagNode()

RTagNode::~RTagNode ( )

Definition at line 1125 of file f5lists.cc.

                    {
    delete data;
}

Member Function Documentation

◆ get()

RNode * RTagNode::get	(	int	idx,
		int	length
	)

Definition at line 1150 of file f5lists.cc.

                                        {
    if(idx==1 || idx==0) {
        // NOTE: We set this NULL as putting it the last element in the list, i.e. the element having
        //       RNode* = NULL would cost lots of iterations at each step of F5inc, with increasing
        //       length of the list this should be prevented
        return NULL;
    }
    else {
        int j;
        RTagNode* temp = this;
    //Print("\n\nHIER IN GET IDX\n");
    //Print("FOR LOOP: %d\n",length-idx+1);
    for(j=1; j<=length-idx+1; j++) {
            temp = temp->next;
        }
        return temp->data;
    }
}

◆ getNext()

RTagNode * RTagNode::getNext ( )

Definition at line 1143 of file f5lists.cc.

                            {
    return next;
}

◆ getRNode()

RNode * RTagNode::getRNode ( )

Definition at line 1137 of file f5lists.cc.

                          {
    //Print("%p\n", this);
    //Print("%p\n",this->data);
    return this->data;
}

◆ insert()

RTagNode * RTagNode::insert ( RNode * r )

Definition at line 1130 of file f5lists.cc.

                                   {
    //Print("Hier1\n");
    RTagNode* newElement  = new RTagNode(r, this);
    //Print("Hier2\n");
    return newElement;
}

◆ print()

void RTagNode::print ( )

Definition at line 1174 of file f5lists.cc.

                     {
    RTagNode* temp  =   this;
    if(NULL != temp && NULL != temp->getRNode()) {
        Print("1. element: %d,  ",getRNode()->getRuleOld()->getIndex());
        pWrite(getRNode()->getRuleOld()->getTerm());
        temp    =   temp->next;
        int i   =   2;
        while(NULL != temp->getRNode() && NULL != temp) {
            Print("%d. element: %d,  ",i,getRNode()->getRuleOld()->getIndex());
            pWrite(getRNode()->getRuleOld()->getTerm());
            temp    =   temp->next;
            i++;
        }
    }
}

◆ set()

void RTagNode::set ( RNode * r )

Definition at line 1169 of file f5lists.cc.

                           {
    this->data  =   r;
}

Field Documentation

◆ data

RNode* RTagNode::data

private

Definition at line 339 of file f5lists.h.

◆ next

RTagNode* RTagNode::next