Question

Hello, I have some errors in my C++ code when I try to debug it. I tried to follow the requirements stated below:

To complete and verify the following features: is Empty? Add-push front Append push back Remove --pop front remove-pop back Length of Queue? Clear To solve real world problem, the programer uses ADT like list, stack, queue, set, map, ... etc. to build our data mode In AS8, we pick and choose STL queue and stack to build a postfix calculator. In this assignment you are to Design your own linked-list, a series of integer nodes. The private attributes of this IntLinked Queue including a integer node struct and private control variables and meth ds: private: struct Node { int data; Node *next; Node *front; // -> first item Node *rear; // ->last item Node *p://traversal position Node *pp; // previous position int size; † The traversal and usage of position pointers is covered in above Section 2 item 4 video tutorial. The Integer Linked Queue, IntLinkedQueue class should have the following member functions: Constructor, Destructor', // return all dynamically allocated nodes bool isEmptyO; int getSize(); // size of the queue void clear(); // clear the entire queue string toString 0; // return a string of a comma(,) delimited items e.g. "1,2,3,4" Front and Rear port access the following 4 methods return operation success or failure as True/False, and pass the it m value In/Out as a reference. bool add(int &); // Front add bool append(int &) // Rear append bool fremove(int &); // Front remove bool remove(int &); // Rear remove The following subscription operator[] overload is optional. The Overloading subscriptor below will be covered in Module 10, you are encouraged to study and apply it here. int& operator[] (const int &sub)

$cout << \nUse menu to test a Queue class instance, \n; menu; // main menu while while(stay) { // main menu while starts cou$

Code:

// Linked.h
#ifndef INTLINKEDQUEUE
#define INTLINKEDQUEUE
#include <iostream>
usingnamespace std;
class IntLinkedQueue
{
private: struct Node {
int data;
Node *next;
};
Node *front; // -> first item
Node *rear; // -> last item
Node *p; // traversal position
Node *pp ; // previous position
int size; // number of elements in the queue

public:
IntLinkedQueue();
~IntLinkedQueue();
bool isEmpty();
int getSize(); // size of the queue
void clear(); // clear the entire queue
string toString(); // return a string of a comma(,) delimited items e.g. "1, 2, 3, 4"
bool add(int &); // Front add
bool append(int &); // Rear append
bool fremove(int &); // Front remove
bool rremove(int &); // Rear remove
int& operator[] (const int &sub);
};
#endif
//end of Linked.h

// Linked.cpp
#include <sstream>
#include <stdexcept>
#include "Linked.h"

// constructor to create an empty queue
IntLinkedQueue::IntLinkedQueue()
{
front = nullptr;
rear = nullptr;
p = nullptr;
pp = nullptr;
size = 0;
}

// destructor to delete all the nodes of the queue
IntLinkedQueue::~IntLinkedQueue()
{
clear();
}

// function to return true if the queue is empty else false
bool IntLinkedQueue::isEmpty()
{
return(front == nullptr);
}

// function to return the number of elements in the queue
int IntLinkedQueue::getSize()
{
return size;
}

// function to delete the nodes of the queue
void IntLinkedQueue::clear()
{
// loop continues until front is null
while(front != nullptr)
{
p = front;
front = front->next;
delete(p);
}

rear = nullptr;
p = nullptr;
pp = nullptr;
size = 0;
}

// function to return string representation of the queue
string IntLinkedQueue::toString()
{
string str = "";
p = front;
while(p != rear)
{
stringstream ss;
ss << p->data;
str += ss.str()+", ";
p = p->next;
}

if(p != nullptr)
{
stringstream ss;
ss << p->data;
str += ss.str();
}

return str;
}

// function to add a new element at the front of queue
bool IntLinkedQueue:: add(int &n)
{
// create a new node
Node *node = new Node;
node->data = n;
node->next = front;
front = node;
// if empty queue, set rear to node
if(rear == nullptr)
rear = node;
size++;
return true;
}

// function to add a new element at the end of queue
bool IntLinkedQueue:: append(int &n)
{
// create a new node
Node *node = new Node;
node->data = n;
node->next = nullptr;
// if empty queue, set front to node
if(front == nullptr)
front = node;
else // else set next of rear to node
rear->next = node;
rear = node; // set rear to node
size++;
return true;
}

// function to remove the front element of queue
bool IntLinkedQueue:: fremove(int &n)
{
if(!isEmpty()) // queue is not empty
{
n = front->data; // get the front data
// set front to node next to front
Node *temp = front;
front = front->next;
if(front == nullptr) // after removal, if front is null, set rear to null
rear = nullptr;
delete(temp);
size--;
return true;
}

return false; // queue is empty
}

// function to remove the last element of queue
bool IntLinkedQueue::rremove(int &n)
{
if(!isEmpty()) // queue is not empty
{
n = rear->data; // get the last data
// if queue contains one element,set front and rear to null
if(front == rear)
{
p = front;
front = nullptr;
rear = nullptr;
delete(p);
}else
{

p = front;
// loop to get the second last node of the
while(p->next != rear)
p = p->next;

rear = p; // set rear to curr
p = p->next;
rear->next = nullptr; // set next to rear to null
delete(p);
}
size--;
return true;
}

return false; // queue is empty
}

// function to return the element at index sub
int& IntLinkedQueue:: operator[] (const int &sub)
{
// validate index
if(sub >= 0 && sub < size)
{
if(sub == 0) // return front data
return front->data;
else if(sub == size-1) // return last data
return rear->data;
else
{
int index = 0;
p = front;
// loop to get the node at index
while(index < sub)
{
p = p->next;
index++;
}

return p->data; // return the data
}
}else
throw out_of_range("Index out of range");
}

//end of Linked.cpp

// main.cpp
#include "Linked.cpp"
#include <vector>
#include <string>
#include <sstream>
using namespace std;
void menu()
{

std::cout<<"---\tAS9 Linked List Test Menu\t---"<<endl
<<"\t"<<"N - to bulk create New Queue"<<endl
<<"\t"<<"I - Index access"<<endl
<<"\t"<<"D - to Display"<<endl
<<"\t"<<"E - isEmpty?"<<endl
<<"\t"<<"A - to Add ~ pushfront"<<endl
<<"\t"<<"a - to append ~ pushback"<<endl
<<"\t"<<"R - to Remove ~ popfront"<<endl
<<"\t"<<"r - to Remove ~ popback"<<endl
<<"\t"<<"L - length of Queue"<<endl
<<"\t"<<"C - to Clear"<<endl
<<"\t"<<"Q - to Quit this program"<<endl
<<"\t"<<"H - this menu"<<endl;
}

int main()
{

bool stay = true;
// create one instance for each of the test classes
cout << "\nInstanciate an object of Queue\n";
string catchVar;
// To hold values popped off the Queue
IntLinkedQueue q;
cout << "\nFirst, test with hard-wired data sets!\n" << "For example, \nyou may use one set of tokens for all test classes: \n";
string choice; // user input for choices
string str; // user input for list, delimiter, ...
int s[] = {1, 3, 5, 7, 9};
vector<int> input(s, end(s));
// show the initial item list
int input_size = input.size();
for (auto item : input )
{
cout << item << ((input_size <= 1) ? " " : ", ");
input_size--;
}

cout << endl; // initialize the Queue class instances
for (auto i: input) q.append( i );
cout << "\nUse menu to test a Queue class instance.\n";
menu();
// main menu while
while(stay)
{
// main menu while starts
cout << "\n Enter your command: ";
stay = true;
cin >> choice;
cin.ignore();
int pos;
string input;
string token;
int item;
stringstream sst;
stringstream ss;
int Queue_size;
if(choice.size() == 1)
{
char ch = choice[0];
//vector dump;
string value;
switch(ch) {
// main menu switch starts
case 'N':
case 'n':
{
if(!q.isEmpty())
q.clear();
cout << "Enter a line of comma (,) delmited data set: ";
getline (cin, input); // user input -> string
ss << input; // string -> stream
while ( getline(ss, token, ',') )
{
// stream -> string token
stringstream sst(token);
sst >> item;
q.append(item);
}
break;
}

case 'i':
case 'I':
{

std::cout<<"Enter the 0-based index: ";
cin>>pos;
if(pos >=0 && pos< q.getSize()){
char temp;
std::cout<<"The Queue["<<pos<<"] is "<<q[pos];
std::cout<<endl<<"To modify y/n? ";
cin>>temp;
switch(temp){
case'Y':
case 'y':
std::cout<<"What is the new number? ";
cin>>item;
q[pos] = item;
break;
}
}

break;
}

case 'd':
case 'D':
cout<<q.toString()<<endl;
break;

case 'e':
case 'E':
if(q.isEmpty())
cout<<"Queue is empty"<<endl;
else
cout<<"Queue is not empty"<<endl;
break;

case 'A':
std::cout<<"Enter a number:";
cin>>item;
std::cout<<"You entered: "<<item<<endl;
q.add(item);
cout<<"Queue: "<<q.toString()<<endl;
break;

case 'a':
std::cout<<"Enter a number:";
cin>>item;
std::cout<<"You entered: "<<item<<endl;
q.append(item);
cout<<"Queue: "<<q.toString()<<endl;
break;

case 'R':
if(q.fremove(item)){
cout<<"Removed "<<item<<endl;
cout<<"Queue: "<<q.toString()<<endl;
}else
cout<<"Queue is empty"<<endl;

break;

case 'r':
if(q.rremove(item))
{
cout<<"Removed "<<item<<endl;
cout<<"Queue: "<<q.toString()<<endl;
}else
cout<<"Queue is empty"<<endl;

break;
case 'l':
case 'L':
cout<<"Number of Entries in Queue: "<<q.getSize()<<endl;
break;

case 'c':
case 'C':
q.clear();
cout<<"Queue is cleared"<<endl;
break;

case 'q':
case 'Q':
stay = false;
break;

case 'h':
case 'H':
menu();
break;
}
}
}

cout<<"Program exit!"<<endl;
return 0;
}

//end of main.cpp

Answer 1

Note :-

I'm using tdm-gcc , g++ version is 5.1.0

---Code Fix---

On building the code the following error show's up

2020>g++ -std=C++11 -o main main.cpp Linked.cpp CCPEAfB8.o:Linked.cpp:(.text+0x0): multiple definition of IntLinkedQueue:: IntLinkedQueue()" CCOPH2v.o:main.cpp:(.text+0x0): first defined here CCPEAfB8.o:Linked.cpp:(.text+0x0): multiple definition of IntLinkedQueue:: IntLinkedQueue()" CCOPH2v.o:main.cpp:(.text+0x0): first defined here CCPEAfB8.o:Linked.cpp:(.text+0x46): multiple definition of IntLinkedQueue:: IntLinkedQueue()" CCOPH2v.o:main.cpp:(.text+0x46): first defined here CCPEAfB8.o:Linked.cpp:(. text+x46): multiple definition of IntLinkedQueue::IntLinkedQueue' CCOPH2v.o:main.cpp:(.text+0x46): first defined here CCPEAfB8.o:Linked.cpp:(.text+0x62): multiple definition of IntLinkedQueue: : isEmpty()' CCOPH2v.o:main.cpp:(.text+0x62): first defined here CCPEAfB8.o:Linked.cpp:(.text+ox7a): multiple definition of IntLinkedQueue::getSize()' CCOPH2v.o:main.cpp:(.text+0x7a): first defined here CCPEAfB8.o:Linked.cpp:(.text+0x8c): multiple definition of IntLinkedQueue::clear()" CCOPH2v.o:main.cpp:(.text+0x8c): first defined here CCPEAfB8.o:Linked.cpp:(.text+0x10e): multiple definition of IntLinkedQueue::toString[abi:cxx11])" CCOPH2v.o:main.cpp:(.text+0x10e): first defined here CCPEAfB8.o:Linked.cpp:(.text+0x3a2): multiple definition of IntLinkedQueue::add (int&)' CCOPH2v.o:main.cpp:(.text+0x3a2): first defined here CCPEAfB8.0:Linked.cpp:(.text+0x410): multiple definition of IntLinkedQueue:: append(int& CCOPH2v.o:main.cpp:(.text+0x410): first defined here CCPEAfB8.o:Linked.cpp:(.text+0x4a4): multiple definition of IntLinkedQueue: :fremove(int&)' CCOPH2v.o:main.cpp:(. text+x4a4): first defined here CCPEAfB8.o:Linked.cpp:(.text+0x538): multiple definition of IntLinkedQueue: :rremove(int&)' CCOPH2v.o:main.cpp:(. text+0x538): first defined here CCPEAfB8.o:Linked.cpp:(. text+0x660): multiple definition of IntLinkedQueue:: operator[](int const&)' CCOPH2v.o:main.cpp:(.text+0x660): first defined here

This error happens since Linked.cpp has a definition of all the defined functions , and then when it is included in main.cpp - during compilation the functions defined in Linked.cpp is added(included) to main.cpp

V/ main.cpp #include "Linked.cpp" #include <vectors #include <string> #include <sstream> using namespace std; void menu()

This confuses the linker since it doesn't understand which function is to be called - To fix this include the header file in main.cpp and then build the executable

Linked.h X Linked.cpp X main.cpp X V/ main.cpp #include "Linked.h" #include <vector #include <string> #include <stream> using namespace std;

Chegg\.. \27-84-2020>g++ -std=C++11 -o main main.cpp Linked.cpp Chegg \27-04-2020/main Instanciate an object of Queue First, test with hard-wired data sets! For example, you may use one set of tokens for all test classes: 1, 3, 5, 7, 9 Use menu to test a Queue class instance. AS9 Linked List Test Menu N - to bulk create New Queue I - Index access D - to Display E - isEmpty? A - to Add ~ pushfront a - to append ~ pushback R - to Remove ~ popfront r - to Remove ~ popback L - length of Queue C - to Clear Q - to quit this program H - this menu Enter your command:

Output :-

Use menu to test a Queue class instance. AS9 Linked List Test Menu N - to bulk create New Queue I - Index access D - to Display E - isEmpty? A - to Add ~ pushfront a - to append ~ pushback R - to Remove ~ popfront r - to Remove ~ popback L - length of Queue C - to Clear Q - to Quit this program H - this menu Enter your command: D 1, 3, 5, 7, 9 Enter your command: a Enter a number: 11 You entered: 11 Queue: 1, 3, 5, 7, 9, 11 Enter your command: R Removed 1 Queue: 3, 5, 7, 9, 11 Enter your command: D 3, 5, 7, 9, 11 Enter your command: L Number of Entries in Queue: 5 Enter your command: Q Program exit!