StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PODeep copy of doubly linked list
primarykey
Id
14883584
data
AcceptedAnswerId
14883664
AnswerCount
1
ClosedDate
2013-02-15T00:03:42.557
CommentCount
6
CommunityOwnedDate
CreationDate
2013-02-14T20:37:39.297
FavoriteCount
0
LastActivityDate
2017-01-31T10:59:46.240
LastEditDate
2017-01-31T10:59:46.240
LastEditorUserId
6879826
OwnerUserId
2069621
ParentId
0
PostTypeId
1
Score
0
ViewCount
1709
LastEditorDisplayName
text
Body
I am having trouble doing a deep copy of my doubly linked list. This is a homework assignment, so I'd like to know why my code is not working, rather than get working code that I don't understand. Here is my class: <pre><code>#include "textAnalyzer.h" #include <string> #include <iostream> #include <sstream> TextAnalyzer::Node* TextAnalyzer::createNode(const string& word, const int wordFrequency, Node* const previous, Node* const next) { return new Node(word, wordFrequency, previous, next); } void TextAnalyzer::releaseNodes() { Node* del = tail; while(tail != NULL) { tail = tail->previous; tail->next = del; delete del; del = tail; } delete [] head; delete [] tail; head = tail = del = NULL; } void TextAnalyzer::copyNodes(Node* const copyHead) { head = new Node(*copyHead); Node* iter = head->next; for(Node* np = copyHead->next; np != NULL; np = np->next) { iter->next = new Node(*np); iter = iter->next; } iter = NULL; } TextAnalyzer::TextAnalyzer():head(createNode("0",0,NULL,NULL)),tail(head) {} TextAnalyzer::TextAnalyzer(const TextAnalyzer& copyObject) { copyNodes(copyObject.head); } TextAnalyzer::~TextAnalyzer() { releaseNodes(); } TextAnalyzer TextAnalyzer::operator=(const TextAnalyzer& assignObject) { return TextAnalyzer(assignObject); } void TextAnalyzer::insertWord(const string& word) { Node* iter = head->next; while(iter != NULL) { if(iter->word == word) iter->wordFrequency++; else if(iter->word[0] == word[0] && iter->next != NULL) { Node* temp = iter->next; iter->next = createNode(word, 1, iter, temp); iter = iter->next; temp->previous = iter; temp = NULL; } else if(iter->word[0] == word[0] && iter->next == NULL) { iter = createNode(word, 1, tail, NULL); tail = iter; } else iter = iter->next; } iter = NULL; } int TextAnalyzer::wordCount() const { Node* iter = head->next; int count = 0; while(iter != NULL) count++; return count; } int TextAnalyzer::wordCountWithInitialCharacter(const char startsWith) { Node* iter = head->next; int count = 0; for(int i = 0; i < wordCount(); i++) { if(startsWith == iter->word[0]) count++; iter->previous = iter; iter = iter->next; } iter = NULL; return count; } string TextAnalyzer::toString() const { Node* iter = head->next; string desc = "List of words: \n"; ostringstream convert; for(int i = 0; i < wordCount(); i++) { convert << iter->word[0] << " words:\n" << iter->word << "(" << iter->wordFrequency << ")\n"; iter->previous = iter; iter = iter->next; } iter = NULL; return desc + convert.str(); } </code></pre> Here is the interface: <pre><code>#ifndef TEXTANALYZER_H #define TEXTANALYZER_H #include <iostream> #include <string> using namespace std; class TextAnalyzer { private: /* * Class: Node * * This class represents a node in a sorted doubly linked list that stores a * list of words and their frequency of occurrence. */ class Node { public: string word; int wordFrequency; Node* previous; Node* next; Node(const string& word, const int wordFrequency, Node* const previous, Node* const next) : word(word), wordFrequency(wordFrequency), previous(previous), next(next) {} }; // end ListNode /*********************************************************************/ Node* head; Node* tail; /* * Releases all the memory allocated to the list. */ void releaseNodes(); /* * Makes a deep copy of the object. */ void copyNodes(Node* const copyHead); /* * Returns a populated Node. * Throws a bad_alloc exception if memory is not allocated. */ Node* createNode(const string& word, const int wordFrequency, Node* const previous, Node* const next); public: /* * Initializes head and tail, each to a dymmy node. */ TextAnalyzer(); /* * Makes a deep copy of the object passed in. * Calls copyNodes() to do the actual work. */ TextAnalyzer(const TextAnalyzer& copyObject); /* * Releases all the memory allocated to the object. * Calls the releaseNodes() method to do the actual work. */ ~TextAnalyzer(); /* * Makes a deep copy of the rhs object. */ TextAnalyzer operator =(const TextAnalyzer& assignObject); /* * Inserts the word in a sorted order into the list. * * If no Node exists with that initial character, one is added in * sorted order. If one does exist (same word), then the word frequency * of that word is incremented by one. */ void insertWord(const string& word); /* * Returns a count of all the words in the list. */ int wordCount() const; /* * Returns a count of all the words with the initial character. */ int wordCountWithInitialCharacter(const char startsWith); /* * Returns a description of the object. The string is formatted as: * [A words:] * [<word>(<count>)] * [<word>(<count>)] * ... * * [B words:] * [<word>(<count>)] * [<word>(<count>)] * ... * *... */ string toString() const; }; #endif </code></pre> I am required to use the interface given above. My problem is that I get an error in my copy constructor saying "The object has qualifiers that are not compatible" or something similar. I am assuming this is because <code>copyObject</code> is constant. However, I am at a loss as to how to do this otherwise, can someone tell me what I am missing here? I am fairly new to C++, I am more experienced with Java so that could be why I'm being confused. EDIT: Thanks for the responses. I think I was about to figure out how to successfully do a deep copy. I've updated my code to show what I have completed so far. Now that I have compiled the code, I've gotten a new error. "unhandled exception 0xc0000005" every time I run it. I googled it and believe it to be an error caused by attempting to dereference a null pointer. The debugger shows it is thrown in my <code>releaseNodes()</code> method. <pre><code>void TextAnalyzer::releaseNodes() { Node* del = tail; while(tail != NULL) { tail = tail->previous; //error on this line tail->next = del; delete del; del = tail; } delete [] head; delete [] tail; head = tail = del = NULL; } </code></pre> Above is just my <code>releaseNodes()</code> method, with a comment showing where the debugger says the error originates. Id like to see if the rest of my code works since I am new to C++ and it is very likely my logic is flawed elsewhere as well, unfortunately until this error is resolved I can't test anything. I'm still tracing through my code trying to find what could be causing it. If anyone can point me in the right direction it would be appreciated.
Tags
<c++><list><deep-copy><doubly-linked-list>
Title
Deep copy of doubly linked list
singulars
PostAcceptedAnswerId
1. PO
 singulars
 PostTypePostTypeId
 PTAnswer
PostParentId
1. This table or related slice is empty.
PostTypePostTypeId
1. PTQuestion
UserLastEditorUserId
1. This table or related slice is empty.
UserOwnerUserId
1. USuser2069621
plurals
PostLinksPostIdRelatedPostId
1. PL
 singulars
 LinkTypeLinkTypeId
 LTLinked
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. This table or related slice is empty.
PostsParentIdCreationDate
1. PO
 singulars
 PostTypePostTypeId
 PTAnswer
VotesPostIdCreationDate
1. This table or related slice is empty.
CommentsPostId

Querying!

Guidance

A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.