StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

POC++ Linked List Class -> header file
primarykey
Id
12765517
data
AcceptedAnswerId
0
AnswerCount
1
ClosedDate
2012-10-10T13:06:16.870
CommentCount
4
CommunityOwnedDate
CreationDate
2012-10-07T02:01:54.967
FavoriteCount
0
LastActivityDate
2012-10-07T21:26:10.810
LastEditDate
2017-05-23T12:27:54.940
LastEditorUserId
-1
OwnerUserId
1450017
ParentId
0
PostTypeId
1
Score
0
ViewCount
11784
LastEditorDisplayName
text
Body
<blockquote> Possible Duplicate: <a href="https://stackoverflow.com/questions/5259714/undefined-reference-to-winmain16">undefined reference to `WinMain@16'</a> </blockquote> Ive been working on a circular, double linked list. Decided to create a class and use a header. I'm new to C++ so i checked to see how to implement it. I'm not sure if i correctly implemented the struct node within the list. After compiling the Clist.cpp file, i received this error. <pre><code>(.text+0xd2): undefined reference to `WinMain@16' collect2: ld returned 1 exit status Process terminated with status 1 (0 minutes, 1 seconds) 1 errors, 0 warnings d:\codeblocks\mingw\bin\..\lib\gcc\mingw32\4.4.1\..\..\..\libmingw32.a(main.o):main.c|| undefined reference to `WinMain@16'| </code></pre> -- <pre><code>#ifndef CLIST_H #define CLIST_H struct Node { char data; Node *prev, *next; Node (char d, Node *p, Node *n): data(d), prev(p), next(n) { if(p) prev->next = this; if(n) next->prev = this; } }; class Clist { public: Clist(char); virtual ~Clist(); Node *head; // current node that is being pointed to int size; bool isEmpty(); void addNodeBefore(char); // inserted before head void addNodeAfter(char); // inserted after head void addNodeBeforeData(char, Node*);// Same as above, inserted before/after a specific node void addNodeAfterData(char, Node*); void out(bool); // Prints the list, true starts from beginning, false starts from end void setData(char); void setPrev(Node*); void setNext(Node*); bool findData(char); // Searches through the list to find the char void deleteData(char, bool); }; #endif // CLIST_H </code></pre> -- <pre><code>#include "Clist.h" #include <string.h> #include <iostream> using namespace std; Clist::Clist(char d) { head = new Node(d, NULL, NULL); head->next = head->prev = head; size = 1; } Clist::~Clist() { Node *tmp = this->head; Node *temp; while(tmp->prev) tmp = tmp->prev; while(tmp) { temp = tmp->next; delete tmp; tmp = temp; } tmp = temp = NULL; } bool Clist::isEmpty() { return (this->size == 0);} void Clist::addNodeBefore(char d) { Node *n = head; Node *p = head->prev; Node *temp = new Node (d, p, n); size++; //cout << "added: " << temp->data << " before: " // << temp->prev->data << " after: " << temp->next->data << endl; } void Clist::addNodeAfter(char d) { Node *n = head->next; Node *p = head; Node *temp = new Node (d, p, n); size++; //cout << "added: " << temp->data << " before: " // << temp->prev->data << " after: " << temp->next->data << endl; } void Clist::out(bool dir) // True to traverse next, false to traverse prev { if (dir) { Node *tmp = head; do{ cout << tmp->data; tmp = tmp->next; }while(tmp != head); }else { Node *tmp = head; do{ cout << tmp->data; tmp = tmp->prev; }while(tmp != head); } cout << endl; } void Clist::setData(char Data) { this->head->data = Data; } void Clist::setPrev(Node* Prev) { this->head->prev = Prev; } void Clist::setNext(Node* Next) { this->head->next = Next; } bool Clist::findData(char search) { int counter = 0; Node *tmp = head; while(tmp->next != head) { if(tmp->data == search) counter++; tmp = tmp->next; } if (counter > 0) { cout << "'" << search << "' was found " << counter << " time(s)" << endl; return true; }else { cout << "'" << search << "' was not found" << endl; return false; } } void Clist::deleteData(char search, bool all) // If true, it will delete all nodes with the same search { // If false, it will delete the first Node only Node *tmp = head; while(tmp) { if(tmp->data == search) { cout << "Deleting " << search << endl; tmp->prev->next = tmp->next; tmp->next->prev = tmp->prev; if (false) return; } tmp = tmp->next; } } </code></pre> -- <pre><code>#include <string.h> #include <iostream> #include "Clist.h" using namespace std; int main(int argc, char* argv[]) { char s[]="abcfdefghijklmgnopqrsatuvwxyz"; Clist *list; // ptr to head of list Node *curr; // ptr to current node of the list // call constructor and initialize first Node list = new Clist(s[0]); for(size_t i=1; i < strlen(s); i++) // create the rest of the linked list list->addNodeAfter(s[i]); list->out(true); list->out(false); cin.get(); return 0; } </code></pre>
Tags
<c++><header><winmain>
Title
C++ Linked List Class -> header file
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. This table or related slice is empty.
PostTypePostTypeId
1. PTQuestion
UserLastEditorUserId
1. USCommunity
UserOwnerUserId
1. USGeorge
plurals
PostLinksPostIdRelatedPostId
1. PL
 singulars
 LinkTypeLinkTypeId
 LTLinked
2. PL
 singulars
 LinkTypeLinkTypeId
 LTDuplicate
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.