How can you implement a copy constructor for ADT queue

[ecestd]

how do you implement a copy constructor for this pointer-based ADT
queue

#include <cassert // for assert
#include <new // for bad_alloc

using namespace std;
//private:{Queue: :Queue(const Queue& Q)}
Queue::Queue() : backPtr(0), frontPtr(0)
{
} // end default constructor

Queue::Queue(co nst Queue& Q) throw(OutOfStor ageException)
{


/////////// Implementation
here!!!!!!///////////////


} // end copy constructor

Queue::~Queue()
{
while (!isEmpty() )
{
dequeue();
} // end while
assert ( (backPtr == 0) && (frontPtr == 0) );
} // end destructor

bool Queue::isEmpty( ) const
{
return backPtr == 0;
} // end isEmpty

void Queue::enqueue( const QueueItemType& newItem)
throw(OutOfStor ageException)
{
try
{
QueueNode *newPtr = new QueueNode;

newPtr->item = newItem;

newPtr->next = 0;

if (isEmpty() )
{
frontPtr = newPtr;
}
else
{
backPtr->next = newPtr;
} // end if

backPtr = newPtr;
}
catch(bad_alloc e)
{
throw OutOfStorageExc eption("Memory allocation failed.");
} // end try/catch
} // end enqueue

void Queue::dequeue( ) throw(OutOfData Exception)
{
if (isEmpty() )
{
throw OutOfDataExcept ion("Empty queue, cannot dequeue");
}
else
{ // queue is not empty; remove front
QueueNode *tempPtr = frontPtr;
if (frontPtr == backPtr) // special case?
{ // yes, one node in queue
frontPtr = 0;
backPtr = 0;
}
else
{
frontPtr = frontPtr->next;
} // end if
tempPtr->next = 0; // defensive strategy
delete tempPtr;
} // end if
} // end dequeue

void Queue::dequeue( QueueItemType& queueFront)
throw(OutOfData Exception)
{
if (isEmpty() )
{
throw OutOfDataExcept ion("Empty queue, cannot dequeue");
}
else
{ // queue is not empty; retrieve front
queueFront = frontPtr->item;
dequeue(); // delete front
} // end if
} // end dequeue

void Queue::getFront (QueueItemType& queueFront) const
throw(OutOfData Exception)
{
if (isEmpty() )
{
throw OutOfDataExcept ion("Empty queue, cannot getFront");
}
else
{
// queue is not empty; retrieve front
queueFront = frontPtr->item;
} // end if
} // end getFront

[=?UTF-8?B?RXJpayBXaWtzdHLDtm0=?=]

On 2007-10-28 18:13, ecestd wrote:

how do you implement a copy constructor for this pointer-based ADT
queue

#include <cassert // for assert
#include <new // for bad_alloc

using namespace std;
//private:{Queue: :Queue(const Queue& Q)}
Queue::Queue() : backPtr(0), frontPtr(0)
{
} // end default constructor

Queue::Queue(co nst Queue& Q) throw(OutOfStor ageException)
{

Use Q.frontPtr to get the fist node in the other queue and start copying
elements from there.

void Queue::dequeue( QueueItemType& queueFront)

I do not see the point of this function, the exception safe way is to
use a combination of getFront() and dequeue() to remove elements from
the queue.

void Queue::getFront (QueueItemType& queueFront) const

Make this one return the first object instead of returning it through a
reference (or at the very least make the parameter a pointer instead of
a reference).

--
Erik Wikström

[ecestd]

On Oct 28, 12:47 pm, Erik Wikström <Erik-wikst...@telia. comwrote:

On 2007-10-28 18:13, ecestd wrote:

how do you implement a copy constructor for this pointer-based ADT
queue

#include <cassert // for assert
#include <new // for bad_alloc

using namespace std;
//private:{Queue: :Queue(const Queue& Q)}

Queue::Queue() : backPtr(0), frontPtr(0)
{
} // end default constructor

Queue::Queue(co nst Queue& Q) throw(OutOfStor ageException)

///////////

what to put here so that it copies. I left this blank coz this is
where it has to be implemented. The program runs but then it crashes
if you type a string. Also what is the significance of cerr<<"type
whatever you want" <<endl? . The prorum after it runs it breaks at
this point tempPtr->next = 0; // defensive strategy

delete tempPtr; What could be the problem?

Use Q.frontPtr to get the fist node in the other queue and start copying
elements from there.

void Queue::dequeue( QueueItemType& queueFront)

I do not see the point of this function, the exception safe way is to
use a combination of getFront() and dequeue() to remove elements from
the queue.

void Queue::getFront (QueueItemType& queueFront) const

Make this one return the first object instead of returning it through a
reference (or at the very least make the parameter a pointer instead of
a reference).

--
Erik Wikström