StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PODeleting and Re-Adding Nodes in C++
primarykey
Id
18994729
data
AcceptedAnswerId
0
AnswerCount
1
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2013-09-25T01:24:36.297
FavoriteCount
0
LastActivityDate
2013-09-25T01:40:43.620
LastEditDate
LastEditorUserId
0
OwnerUserId
835695
ParentId
0
PostTypeId
1
Score
0
ViewCount
179
LastEditorDisplayName
text
Body
I'm using a linked list to implement a concordance program. If the same word is read multiple times, I need to delete the current node, increment the count, and add a new node. I can't add any more functions to this program. I'm thinking I'll have to use get_count somehow, but I'm not sure. For example, instead of it looking like this: THE 1 THE 1 It should be: THE 2 How can I accomplish this? Thanks in advance! Header file: <pre><code>#ifndef CONCORDANCE_H #define CONCORDANCE_H #include <iostream> #include <cstdlib> const int MAX = 8; class Concordance { public: typedef char Word[MAX+1]; // CONSTRUCTOR Concordance() { first = NULL; } // DESTRUCTOR ~Concordance(); // MODIFICATION MEMBER FUNCTIONS void insert(Word& word, int& n); void remove(Word& word); int get_count(Word& word); // OTHER FUNCTIONS int length() const; friend std::ostream& operator << (std::ostream& out_s, Concordance& c); private: // NODE STRUCT struct Node { Word wd; int count; Node *next; }; Node *first; // GET_NODE FUNCTION Node* get_node(Word& word, int& count, Node* link); }; #endif </code></pre> Class: <pre><code>//class definition #include "concordance.h" #include <iostream> #include <cstring> #include <iomanip> using namespace std; Concordance::~Concordance() { Node *temp; while(first != NULL) { temp = first; first = first -> next; delete temp; } } void Concordance::insert(Word& word, int& n) { Node *prev; if(first == NULL || strcmp(first -> wd, word) > 0) first = get_node(word, n, first); else { prev = first; while(prev -> next != NULL && strcmp(prev -> next -> wd, word) < 0) prev = prev -> next; prev -> next = get_node(word, n, prev -> next); } } void Concordance::remove(Word& word) { Node *prev, *temp; prev = temp; if(prev -> wd == word) { first = first -> next; delete prev; } else { while(strcmp(prev -> next -> wd, word) > 0) prev = prev -> next; temp = prev -> next; prev -> next = temp -> next; delete temp; } } int Concordance::get_count(Word& word) { while(strcmp(first -> wd, word) != 0) first = first -> next; return first -> count; } int Concordance::length() const { Node *cursor; int length; length = 0; for(cursor = first; cursor != NULL; cursor = cursor -> next ) length++; return length; } Concordance::Node* Concordance::get_node (Word& word, int& count, Node* link) { Node *temp; temp = new Node; strcpy(temp-> wd, word); temp-> next = link; temp -> count = count+1; return temp; } ostream& operator << (ostream& out_s, Concordance& c) { Concordance::Node *output; out_s << "Word" << setw(10) << " " << "Count" << setw(8) << endl; out_s << "--------------------" << endl; for(output = c.first; output != NULL && output->next != NULL; output = output-> next ) out_s << left << setw(10) << output-> wd << right << setw(9) << output -> count << endl; if(output != NULL) out_s << output-> wd << setw(13) << " " << output -> count << endl; out_s << "--------------------" << endl; return out_s; } </code></pre>
Tags
<c++>
Title
Deleting and Re-Adding Nodes in C++
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. This table or related slice is empty.
PostTypePostTypeId
1. PTQuestion
UserLastEditorUserId
1. This table or related slice is empty.
UserOwnerUserId
1. USMitchell
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
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
1. This table or related slice is empty.

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.