Circular Linked Queue Copy Constructor and Assignment Operator Not Working?

wc3promet · #1 17-Oct-2004, 07:55

Circular Linked Queue Copy Constructor and Assignment Operator Not Working?

Testing out Deep Copying... It ends up that no copying was done.

1st Scenario

CPP / C++ / C Code:

queue q1,q2
.
.
.
q1=q2;

2nd Scenario

CPP / C++ / C Code:

queue *q1=NULL;
queue *q2=NULL;
q1 = new queue;
q2 = new queue;
.
.
.
*q2= *q1;

Copy Constructor #1

CPP / C++ / C Code:

queue::queue(const queue &rhs)
{ 
 
	if(queueIsEmpty()) 
   	{ 
		   	tail=NULL; 
   	}
   
	else
   	{
    		// MAKE A NEW TAIL PTR;
    		tail = new node; 
     	tail->element = rhs.tail->element;
     	
    		// MAKE A NEW HEAD PTR;
    		node *head = new node; 
     	head->element = rhs.tail->next->element;
     	
     	// CURRENT POSITION IN RHS LIST
     	node *ptr=rhs.tail->next;
     
     do
     {
      enqueue(ptr->element);
      ptr=ptr->next;
      
     } 
     while(ptr !=rhs.tail);

    } 
}

Overloaded Copy Constructor #2

CPP / C++ / C Code:

queue::queue(const queue &*rhs)
{ 
 
	if(queueIsEmpty()) 
   	{ 
		   	tail=NULL; 
   	}
   
	else
   	{
    		// MAKE A NEW TAIL PTR;
    		tail = new node; 
     	tail->element = rhs.tail->element;
     	
    		// MAKE A NEW HEAD PTR;
    		node *head = new node; 
     	head->element = rhs.tail->next->element;
     	
     	// CURRENT POSITION IN RHS LIST
     	node *ptr=rhs.tail->next;
     
     do
     {
      enqueue(ptr->element);
      ptr=ptr->next;
      
     } 
     while(ptr !=rhs.tail);

    } 
}

Assignment Operator #1, for q1=q2;

CPP / C++ / C Code:

const queue& queue::operator=(const queue &rhs)
{
if(queueIsEmpty()) 
   	{ 
		   	tail=NULL; 
   	}
   
	else
   	{
    		// MAKE A NEW TAIL PTR;
    		tail = new node; 
     	tail->element = rhs.tail->element;
     	
    		// MAKE A NEW HEAD PTR;
    		node *head = new node; 
     	head->element = rhs.tail->next->element;
     	
     	// CURRENT POSITION IN RHS LIST
     	node *ptr=rhs.tail->next;
     
     do
     {
      enqueue(ptr->element);
      ptr=ptr->next;
      
     } 
     while(ptr !=rhs.tail);

    } 
    return *this;
}

Overloaded Assignment Operator #2, for *q1=*q2;

CPP / C++ / C Code:

const queue& queue::operator=(const queue &*rhs)
{
if(queueIsEmpty()) 
   	{ 
		   	tail=NULL; 
   	}
   
	else
   	{
    		// MAKE A NEW TAIL PTR;
    		tail = new node; 
     	tail->element = rhs.tail->element;
     	
    		// MAKE A NEW HEAD PTR;
    		node *head = new node; 
     	head->element = rhs.tail->next->element;
     	
     	// CURRENT POSITION IN RHS LIST
     	node *ptr=rhs.tail->next;
     
     do
     {
      enqueue(ptr->element);
      ptr=ptr->next;
      
     } 
     while(ptr !=rhs.tail);

    } 
    return *this;
}

Thread Tools	Search this Thread
Show Printable Version Email this Page	Search this Thread: Advanced Search
Rate This Thread
Rate This Thread:

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
Question about linked list and queue	Kay Chan	C++ Forum	7	02-Sep-2004 09:27