Question

I'm having trouble getting this program to compile and run. It is in C++ Language and being run with CodeBlocks.

Problem Statement: create and manage a linked list.

Program will loop displaying a menu of user operations concerning the management of a linked list. Included will be:

      H create link at head

      R remove link at head

      T create link at tail

      K remove link at tail

      I remove link at ID   

      S search for data value

      L get length of list  

      D display list        

      Q quit program        

    

Upon termination of the program, each remaining link will be removed.

Each link will contain a data element of type ‘double’ and an integer ID. The data elements need not be unique but the ID values will be automatically assigned by the program, starting at 1 and incrementing whenever a link is created. Once set, the ID value will not change during the running of the program. It will be used as an identifier when identifying and deleting a link which is not either at the front or the back (head or tail) of the list.

main.cpp_______________________________________________________________________________________________

#include
#include "linkedList.h"
#include "linkedList.cpp"

using namespace std;

char menu(void);

int main()
{
linkedList links;
int linkCount = 0;
int value;
double dataValue;

while(true)
{
switch(tolower(menu()))
{
case 'h': // create new link at head
cout << "Please enter a double dataValue: ";
cin >> dataValue;
links.addAtHead(dataValue);
linkCount += 1;
break;
case 'r': // remove link at head
links.removeAtHead();
linkCount -= 1;
break;
case 't': // create new link at tail
cout << "Please enter a double dataValue: ";
cin >> dataValue;
links.addAtTail(dataValue);
linkCount += 1;
break;
case 'k': // remove link at tail
links.removeAtTail();
linkCount -= 1;
break;
case 'i': // remove link at ID match
cout << "Please enter an integer ID value: ";
cin >> value;
links.removeAtID(value);
linkCount -= 1;
break;
case 'd': // display entire list
cout << links.showFirstValue() << endl;
for (int i = 2; i <= linkCount; ++i)
{
cout << links.showNextValue() << endl;
}
break;
case 'l':
cout << links.getLength() << " links in list." << endl;
break;
case 'q': // end program
return 0;
break;
default:
cout << "Unknown request code." << endl << endl;
break;
case 's': // search list for value
cout << "Please enter a double data value: ";
cin >> dataValue;
int ID = links.findValue(dataValue);
if (ID == 0)
{
cout << "Data value not found in list." << endl;
}
else
{
cout << "Data value found in list at ID " << ID << endl;
}
break;
}
}
}

char menu(void)
{
char reqCode;

cout << endl
<< " **************************" << endl
<< " * H create link at head *" << endl
<< " * R remove link at head *" << endl
<< " * T create link at tail *" << endl
<< " * K remove link at tail *" << endl
<< " * I remove link at ID *" << endl
<< " * S search for data value*" << endl
<< " * L get length of list *" << endl
<< " * D display list *" << endl
<< " * Q quit program *" << endl
<< " **************************" << endl

<< "Please enter request code ";
cin >> reqCode;

return reqCode;
}

linkedList.h_____________________________________________________________________________________________

#ifndef LINKEDLIST_H
#define LINKEDLIST_H

#include
#include "node.h"

// This class manages a linked list of doubles. It is
// specific to doubles and otherwise would need changes.
class linkedList
{
public:
linkedList(void);
virtual ~linkedList(void);
void addAtHead(double n);
void addAtTail(double n);
int getLength(void);
void removeAtHead(void);
void removeAtTail(void);
void removeAtID(int n);
double showFirstValue(void);
double showNextValue(void);
int findValue(double n);

private:
node *head; // anchor at front of list
node *tail; // anchor at back of list
node *next; // controls "showNextValue()"
int nodeID; // source of node ID in node
};

#endif // LINKEDLIST_H

linkedList.cpp__________________________________________________________________________________________

#include "linkedList.h"
#include
#include "node.h"

linkedList::linkedList(void)
{
head = new node(0, NULL, 0);
tail = new node(0, NULL, 0);
head->setNext(tail);
tail->setNext(tail);
head->setValue(0.0);
tail->setValue(0.0);
nodeID = 0;
}

linkedList::~linkedList(void)
{
node *backup = head->getNext();
node *nextNode = backup->getNext();
while (backup != tail)
{
delete backup;
backup = nextNode;
nextNode = backup->getNext();
}
delete tail;
delete head;
}

void linkedList::addAtHead(double n)
{
head->setNext(new node(n, head->getNext(), ++nodeID));
}

void linkedList::addAtTail(double n)
{
node *temp = head->getNext();
while(temp->getNext() != tail)
{
temp = temp->getNext();
}
temp->setNext(new node(n, tail, ++nodeID));
}

int linkedList::getLength(void)
{
int nodeCounter = 0;
node *nextNode = head;
while (nextNode->getNext() != tail)
{
nodeCounter += 1;
nextNode = nextNode->getNext();
}
return nodeCounter;
}

void linkedList::removeAtHead(void)
{
node *temp = head->getNext();
head->setNext(temp->getNext());
delete temp;
}

void linkedList::removeAtTail(void)
{
node *backup = head;
node *nextNode = backup->getNext();
while (nextNode->getNext() != tail)
{
backup = nextNode;
nextNode = backup->getNext();
}
backup->setNext(nextNode->getNext());
delete nextNode;
}

void linkedList::removeAtID(int n)
{
}

double linkedList::showFirstValue(void)
{
next = head->getNext();
return next->getValue();
}

double linkedList::showNextValue(void)
{
return next->getValue();
}

int linkedList::findValue(double n)
{
node *nextNode = head->getNext();
while (nextNode != tail)
{
if (n == nextNode->getValue())
{
return nextNode->getID();
}
nextNode = nextNode->getNext();
}
return 0;
}
node.cpp_________________________________________________________________________________________________

#include "node.h"
#include

node::node(double d, node *n, int ID)
{
data = d;
nodeID = ID;
next = n;
}

node::~node()
{
//dtor
}

void node::setNext(node *n)
{
next = n;
}

node *node::getNext(void)
{
return next;
}

void node::setValue(double v)
{
data = v;
}

double node::getValue(void)
{
return data;
}

int node::getID(void)
{
return nodeID;
}
node.h_______________________________________________________________________________________________

#ifndef NODE_H
#define NODE_H

#include

class node
{

node(double d, node *n, int ID);
~node(void);
void setNext(node *n);
node *getNext(void);
void setValue(double v);
double getValue(void);
int getID(void);

double data;

int nodeID;
node *next;
};

#endif // NODE_H

Answer 1

//==== main.cpp ===========================================================//

#include <iostream>
#include "linkedList.h"

using namespace std;

char menu(void);

int main()
{
/** -------------- Error Resolved -------------------- **/
// linkedList<int> links;
// Class linkedList is not template class
// Use normal class object

linkedList links;

int linkCount = 0;
int value;
double dataValue;

while(true)
{
switch(tolower(menu()))
{
case 'h': // create new link at head
cout << "Please enter a double dataValue: ";
cin >> dataValue;
links.addAtHead(dataValue);
linkCount += 1;
break;
case 'r': // remove link at head
links.removeAtHead();
linkCount -= 1;
break;
case 't': // create new link at tail
cout << "Please enter a double dataValue: ";
cin >> dataValue;
links.addAtTail(dataValue);
linkCount += 1;
break;
case 'k': // remove link at tail
links.removeAtTail();
linkCount -= 1;
break;
case 'i': // remove link at ID match
cout << "Please enter an integer ID value: ";
cin >> value;
links.removeAtID(value);
linkCount -= 1;
break;
case 'd': // display entire list
cout << links.showFirstValue() << endl;
for (int i = 2; i <= linkCount; ++i)
{
cout << links.showNextValue() << endl;
}
break;
case 'l':
cout << links.getLength() << " links in list." << endl;
break;
case 'q': // end program
return 0;
break;
default:
cout << "Unknown request code." << endl << endl;
break;
case 's': // search list for value
cout << "Please enter a double data value: ";
cin >> dataValue;
int ID = links.findValue(dataValue);
if (ID == 0)
{
cout << "Data value not found in list." << endl;
}
else
{
cout << "Data value found in list at ID " << ID << endl;
}
break;
}
}
}

char menu(void)
{
char reqCode;

cout << endl
<< " **************************" << endl
<< " * H create link at head *" << endl
<< " * R remove link at head *" << endl
<< " * T create link at tail *" << endl
<< " * K remove link at tail *" << endl
<< " * I remove link at ID *" << endl
<< " * S search for data value*" << endl
<< " * L get length of list *" << endl
<< " * D display list *" << endl
<< " * Q quit program *" << endl
<< " **************************" << endl

<< "Please enter request code ";
cin >> reqCode;

return reqCode;
}

//==== linkedList.h ===========================================================//

#ifndef LINKEDLIST_H
#define LINKEDLIST_H

#include <string>
#include "node.h"

// This class manages a linked list of doubles. It is
// specific to doubles and otherwise would need changes.
class linkedList
{
public:
linkedList(void);
virtual ~linkedList(void);
void addAtHead(double n);
void addAtTail(double n);
int getLength(void);
void removeAtHead(void);
void removeAtTail(void);
void removeAtID(int n);
double showFirstValue(void);
double showNextValue(void);
int findValue(double n);

private:
node *head; // anchor at front of list
node *tail; // anchor at back of list
node *next; // controls "showNextValue()"
int nodeID; // source of node ID in node
};

#endif // LINKEDLIST_H

//==== linkedList.cpp ===========================================================//

#include <cstdlib>
#include "node.h"
#include "linkedList.h"

linkedList::linkedList(void)
{
head = new node(0, NULL, 0);
tail = new node(0, NULL, 0);
head->setNext(tail);
tail->setNext(tail);
head->setValue(0.0);
tail->setValue(0.0);
nodeID = 0;
}

linkedList::~linkedList(void)
{
node *backup = head->getNext();
node *nextNode = backup->getNext();
while (backup != tail)
{
delete backup;
backup = nextNode;
nextNode = backup->getNext();
}
delete tail;
delete head;
}

void linkedList::addAtHead(double n)
{
head->setNext(new node(n, head->getNext(), ++nodeID));
}

void linkedList::addAtTail(double n)
{
node *temp = head->getNext();
while(temp->getNext() != tail)
{
temp = temp->getNext();
}
temp->setNext(new node(n, tail, ++nodeID));
}

int linkedList::getLength(void)
{
int nodeCounter = 0;
node *nextNode = head;
while (nextNode->getNext() != tail)
{
nodeCounter += 1;
nextNode = nextNode->getNext();
}
return nodeCounter;
}

void linkedList::removeAtHead(void)
{
node *temp = head->getNext();
head->setNext(temp->getNext());
delete temp;
}

void linkedList::removeAtTail(void)
{
node *backup = head;
node *nextNode = backup->getNext();
while (nextNode->getNext() != tail)
{
backup = nextNode;
nextNode = backup->getNext();
}
backup->setNext(nextNode->getNext());
delete nextNode;
}

void linkedList::removeAtID(int n)
{
}

double linkedList::showFirstValue(void)
{
next = head->getNext();
return next->getValue();
}

double linkedList::showNextValue(void)
{
return next->getValue();
}

int linkedList::findValue(double n)
{
node *nextNode = head->getNext();
while (nextNode != tail)
{
if (n == nextNode->getValue())
{
return nextNode->getID();
}
nextNode = nextNode->getNext();
}
return 0;
}

//==== node.h ===========================================================//

#ifndef NODE_H
#define NODE_H

#include <string>

class node
{

/** -------------- Error Resolved -------------------- **/
// Use public,private,protected
// Acess specifier according to uses
// Member function as public
// Member variable as private

public :

node(double d, node *n, int ID);
~node(void);
void setNext(node *n);
node *getNext(void);
void setValue(double v);
double getValue(void);
int getID(void);

private :
double data;
int nodeID;
node *next;
};

#endif // NODE_H

//==== node.cpp ===========================================================//

#include "node.h"
#include <cstdlib>

node::node(double d, node *n, int ID)
{
data = d;
nodeID = ID;
next = n;
}

node::~node()
{
//dtor
}

void node::setNext(node *n)
{
next = n;
}

node *node::getNext(void)
{
return next;
}

void node::setValue(double v)
{
data = v;
}

double node::getValue(void)
{
return data;
}

int node::getID(void)
{
return nodeID;
}