C++ : Hi, I have been given a ton of program to build which composed two classes
ID: 664727 • Letter: C
Question
C++ :
Hi, I have been given a ton of program to build which composed two classes( linkedList.h and unorderedLinkedList.h) and their implementation codes.
My task was to add the operation divideMid to the class linkedList as follows:
void divideMid(linkedList &sublist) ; so that : suppose myList points to the list with element 34 65 27 89 12 (in this order), myList.divideMid(sublist) divides myList into two sublists: myList points to the list with the elements 34 65 27, and sublist points to the sublist with elements 89 12.
I'm ask to ask to write the definition of the function template to implement the operation divideMid. Also i have been given a main Program called Ch16_Ex5_mainProgram to test my function. Output MUST look like this:
I Did the job but it refused to compile for some reasons i don't know. So i'm not even sure that my function work. I need help to fix all that. Thanks !
GIVEN PROGRAMS:
Main Program : (Ch16_Ex5_mainProgram)
//22 34 56 4 19 2 89 90 0 14 32 88 125 56 11 43 55 -999
#include
#include "unorderedLinkedList.h"
using namespace std;
int main()
{
unorderedLinkedList list, subList;
int num;
cout << "Enter numbers ending with -999" << endl;
cin >> num;
while (num != -999)
{
list.insertLast(num);
cin >> num;
}
cout << endl;
cout << "List: ";
list.print();
cout << endl;
cout << "Length of the list: " << list.length() << endl;
?
list.divideMid(subList);
cout << "Lists after splitting list" << endl;
cout << "list: ";
list.print();
cout << endl;
cout << "Length of the list: " << list.length() << endl;
cout << "sublist: ";
subList.print();
cout << endl;
cout << "Length of subList: " << subList.length() << endl;
system("pause");
return 0;
}
GIVEN CLASSES:
class:(linkedList.h and all its implementations and comments)
#ifndef H_LinkedList
#define H_LinkedList
#include
template<class Type>
struct nodeType
{
int info;
nodeType *link;
};
?
template<class Type>
class linkedList
{
public:
?
const linkedList& operator=
(const linkedList&);
//Overload the assignment operator.
void initializeList();
//Initializes the list to an empty state.
//Postcondition: first = NULL, last = NULL,
// count = 0
bool isEmptyList();
//Function to determine whether the list is empty.
//Postcondition: Returns true if the list is empty;
// otherwise, returns false.
?
?
int length();
//Function to return the number of nodes in the
//list.
//Postcondition: The value of count is returned.
void destroyList();
//Function to delete all the nodes from the list.
//Postcondition: first = NULL, last = NULL,
// count = 0
Type front();
//Function to return the first element of the list.
//Precondition: The list must exist and must not be
//empty.
//Postcondition: If the list is empty, then the
// program terminates; otherwise,
// the first element of the list is
// returned.
Type back();
//Function to return the last element of the
//list.
//Precondition: The list must exist and must not
//be empty.
//Postcondition: If the list is empty, then the
// program terminates; otherwise,
// the last element of the list is
// returned.
?
?
bool search(const Type& searchItem);
//Function to determine whether searchItem is in
//the list.
//Postcondition: Returns true if searchItem is found
// in the list; otherwise, it returns
// false.
?
?
void insertFirst(const Type& newItem);
//Function to insert newItem in the list.
//Postcondition: first points to the new list
// and newItem is inserted at the
// beginning of the list.
?
?
void insertLast(const Type& newItem);
//Function to return newItem at the end of the
//list.
//Postcondition: first points to the new list,
// newItem is inserted at the end
// of the list, and last points to
// the last node in the list.
?
?
void deleteNode(const Type& deleteItem);
//Function to delete deleteItem from the list.
//Postcondition: If found, the node containing
// deleteItem is deleted from the
// list, first points to the first
// node, and last points to the last
// node of the updated list.
?
void print() const ;
?
void divideMid(linkedList &sublist);
//This operation splits the given list in two sublists of
//(almost) equal size.
//Post: first points the first node and last
// points to the last node of the first sublist
// sublist.first points to the first node and sublist.last
// points to the last node of the second sub list.
?
?
?
?
linkedList();
//default constructor
//Initializes the list to an empty state.
//Postcondition: first = NULL, last = NULL,
// count = 0
?
?
linkedList(const linkedList& otherList);
//copy constructor
?
?
~linkedList();
//destructor
//Deletes all the nodes from the list.
//Postcondition: The list object is destroyed.
?
?
protected:
int count; //variable to store the number of
//elements in the list
nodeType *first; //pointer to the first node of
//the list
nodeType *last; //pointer to the last node of
//the list
private:
void copyList(const linkedList& otherList);
//Function to make a copy of otherList.
//Postcondition: A copy of otherList is created
// and assigned to this list.
};
?
?
?
template<class Type>
bool linkedList::isEmptyList()
{
return(first == NULL);
}
?
template<class Type>
linkedList::linkedList() // default constructor
{
first = NULL;
last = NULL;
count = 0;
}
?
template<class Type>
void linkedList::destroyList()
{
nodeType *temp; //pointer to deallocate the memory
//occupied by the node
while(first != NULL) //while there are nodes in the list
{
temp = first; //set temp to the current node
first = first->link; //advance first to the next node
delete temp; //deallocate memory occupied by temp
}
?
?
last = NULL; //initialize last to NULL; first has already
//been set to NULL by the while loop
count = 0;
}
?
?
?
?
template<class Type>
void linkedList::initializeList()
{
destroyList(); //if the list has any nodes, delete them
}
?
template<class Type>
void linkedList::print() const
{
nodeType *current ; //pointer to traverse the list
current = first ; //set current so that it points to the first node
while (current != NULL) // while more data to print
{
cout<< current->info << " ";
current = current->link ;
}
}//end print
?
template<class Type>
int linkedList::length()
{
return count;
} // end length
?
template<class Type>
Type linkedList::front()
{
assert(first != NULL);
return first->info; //return the info of the first node
}//end front
?
template<class Type>
Type linkedList::back()
{
assert(last != NULL);
return last->info; //return the info of the first node
}//end back
?
template<class Type>
bool linkedList::search(const Type& searchItem)
{
nodeType *current; //pointer to traverse the list
bool found;
current = first; //set current to point to the
//first node in the list
found = false; //set found to false
while(current != NULL && !found) //search the list
if(current->info == searchItem) //item is found
found = true;
else
current = current->link; //make current point
//to the next node
return found;
}//end search
?
?
template<class Type>
void linkedList::insertFirst(const Type& newItem)
{
nodeType *newNode; //pointer to create the new node
newNode = new nodeType; //create the new node
assert(newNode != NULL); //If unable to allocate memory,
//terminate the program
newNode->info = newItem; //store the new item in the node
newNode->link = first; //insert newNode before first
first = newNode; //make first point to the
//actual first node
count++; //increment count
if(last == NULL) //if the list was empty, newNode is also
//the last node in the list
last = newNode;
}
?
?
template<class Type>
void linkedList::insertLast(const Type& newItem)
{
nodeType *newNode; //pointer to create the new node
newNode = new nodeType; //create the new node
assert(newNode != NULL); //If unable to allocate memory,
//terminate the program
newNode->info = newItem; //store the new item in the node
newNode->link = NULL; //set the link field of newNode
//to NULL
if(first == NULL) //if the list is empty, newNode is
//both the first and last node
{
first = newNode;
last = newNode;
count++; //increment count
}
else //the list is not empty, insert newNode after last
{
last->link = newNode; //insert newNode after last
last = newNode; //make last point to the actual last node
count++; //increment count
}
}//end insertLast
?
?
template<class Type>
void linkedList::deleteNode(const Type& deleteItem)
{
nodeType *current; //pointer to traverse the list
nodeType *trailCurrent; //pointer just before current
bool found;
if(first == NULL) //Case 1; list is empty.
cout<<"Can not delete from an empty list. ";
else
{
if(first->info == deleteItem) //Case 2
{
current = first;
first = first->link;
count--;
if(first == NULL) //list had only one node
last = NULL;
delete current;
}
else //search the list for the node with the given info
{
found = false;
trailCurrent = first; //set trailCurrent to point to
//the first node
current = first->link; //set current to point to the
//second node
while((!found) && (current != NULL))
{
if(current->info != deleteItem)
{
trailCurrent = current;
current = current-> link;
}
else
found = true;
} // end while
if(found) //Case 3; if found, delete the node
{
trailCurrent->link = current->link;
count--;
if(last == current) //node to be deleted was
//the last node
last = trailCurrent; //update the value of last
delete current; //delete the node from the list
}
else
cout<<"Item to be deleted is not in the list."<
} //end else
} //end else
} //end deleteNode
?
?
template<class Type>
linkedList::~linkedList() // destructor
{
destroyList();
}//end destructor
?
?
?
?
template<class Type>
void linkedList::copyList
(const linkedList& otherList)
{
nodeType *newNode; //pointer to create a node
nodeType *current; //pointer to traverse the list
if(first != NULL) //if list is nonempty, make it empty
destroyList();
if(otherList.first == NULL) //otherList is empty
{
first = NULL;
last = NULL;
count = 0;
}
else
{
current = otherList.first; //current points to the
//list to be copied
count = otherList.count;
?
?
//copy the first node
first = new nodeType; //create the node
?
?
assert(first != NULL);
?
?
first->info = current->info; //copy the info
first->link = NULL; //set the link field of
//the node to NULL
last = first; //make last point to the
//first node
current = current->link; //make current point to the
//next node
?
?
//copy the remaining list
while(current != NULL)
{
newNode = new nodeType; //create a node
?
?
assert(newNode!= NULL);
?
?
newNode->info = current->info; //copy the info
newNode->link = NULL; //set the link of
//newNode to NULL
last->link = newNode; //attach newNode after last
last = newNode; //make last point to
//the actual last node
current = current->link; //make current point to
//the next node
}//end while
}//end else
}//end copyList
?
?
?
//copy constructor
template<class Type>
linkedList::linkedList
(const linkedList& otherList)
{
first = NULL;
copyList(otherList);
}//end copy constructor
?
?
//overload the assignment operator
template<class Type>
const linkedList& linkedList::operator=
(const linkedList& otherList)
{
if(this != &otherList) //avoid self-copy
{
copyList(otherList);
}//end else
?
?
return *this;
}
?
?
template<class Type>
void linkedList::divideMid(linkedList &sublist)
{
nodeType *current;
nodeType *mid;
?
?
if (first == NULL)
{
sublist.first = NULL;
sublist.last = NULL;
}
else
if (first->link == NULL)
{
sublist.first = NULL;
sublist.last = NULL;
}
else
{
mid = first;
current = first->link;
if (current != NULL)
current = current->link;
while (current != NULL)
{
mid = mid->link;
current = current->link;
if (current != NULL)
current = current->link;
}
sublist.first = mid->link;
sublist.last = last;
last = mid;
last->link = NULL;
}
}
#endif
class:(unorderedLinkedList and its implementations and comments)
#ifndef H_UnorderedLinkedList
#define H_UnorderedLinkedList
#include "linkedlist.h"
using namespace std;
template<class Type>
class unorderedLinkedList :
public linkedList
{
public:
bool search(const Type& searchItem) const;
void insertFirst(const Type& newItem) ;
void insertLast(const Type& newItem);
void deleteNode(const Type& deleteItem);
};
?
?
?
template<class Type>
bool unorderedLinkedList::
search(const Type& searchItem) const
{
nodeType *current; // pointer to traverse the list
bool found = false;
current = first; //set current to point to the first node in the list
while (current != NULL && !found) // search the list
if (current->info == searchItem) //searchItem is found
found = true;
else
current = current->link ; // make current point to the next node
return found ;
?
}//end search
?
template<class Type>
void unorderedLinkedList::insertFirst(const Type& newItem)
{
nodeType *newNode; // pointer to create the new node
newNode = new nodeType ; // create the new node
newNode->info = newItem ; // store the item in the node
newNode->link = first ; //insert newNode before first
first = newNode ; //make first point to the
//actual first node
count++; //increment count
if (last == NULL) //if the list was empty, newNode is also the last node in the list
last = newNode ;
}//end insertFirst
?
template<class Type>
void unorderedLinkedList::insertLast(const Type& newItem)
{
nodeType *newNode; // pointer to create the new node
newNode = new nodeType ; // create the new node
newNode->info = newItem ; // store the item in the node
newNode->info = NULL ; // set the field of the newNode to NULL
if (first == NULL) //if the first list is empty, newNode is both the first and last node
{
first = last ;
last = first ;
count++ ; //increment count
}
else // the last is not empty, insert newNode after last
{
last-> = newNode ; //insert newNode after last
last = newNode ; //make last point to the actual
//last node in the list
count++ ;
}
}//end insertLast
?
template<class Type>
void unorderedlinkedList::deleteNode (const Type& deleteItem)
{
nodeType *current; //pointer to traverse the list
nodeType *trailCurrent; //pointer just before current
bool found;
if (first == NULL) //Case 1; list is empty
cout<<" Cannot delete from an empty list."<
else
{
if(first->info == deleteItem) //Case 2
{
current = first;
first = first->link;
count--;
if(first == NULL) //list had only one node
{
last = NULL;
}
delete current;
}
else //search the list for the node with the given info
{
found = false;
trailCurrent = first; //set trailCurrent to point to
//the first node
current = first->link; //set current to point to the
//second node
while((!found) && (current != NULL))
{
if(current->info != deleteItem)
{
trailCurrent = current;
current = current-> link;
}
else
found = true;
} // end while
if(found) //Case 3; if found, delete the node
{
trailCurrent->link = current->link;
count--;
if(last == current) //node to be deleted was
//the last node
last = trailCurrent; //update the value of last
delete current; //delete the node from the list
}
else
cout<<"Item to be deleted is not in the list."<
} //end else
} //end else
} //end deleteNode
?
#endif
Explanation / Answer
I checked this code in my compiler ,it is showing compilation errors due to class template variables defined in class template definition.
Below compilation errors were seen while compiling the above code:
So, for resolving the above compilation errors,i would like to give you the basic template example from which you will be able to remove these compilation errors:
For eg:
We have below class template T and two structures Base and Derived and derived class is accessing the independent variables of Base.
It will not compile the above code because foo(variable) is a independent name so it's looked up at template definition time, and this lookup doesn't consider the base class template because Base can be explicitly specialized later so there's no guarantee that it actually has a member called foo.
To fix this, use this->foo or Base<T>::foo to make it a dependent name, or add a usingdeclaration in Derived to bring foo in scope - using Base<T>::foo;
In a similar way,you have to make changes in your code for solving the above compilation errors.
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.