I needed some help on this assignment. The only thing that needs editing is the bold code. Everything else is methods/drivers to run the code. Instructions are also bolded.

// From Malik, C++ Data Structures. // Do not modify // Do not submit.

#ifndef H_arrayListType #define H_arrayListType class arrayListType { public: bool isEmpty() const; //Function to determine whether the list is empty //Postcondition: Returns true if the list is empty; // otherwise, returns false.

bool isFull() const; //Function to determine whether the list is full //Postcondition: Returns true if the list is full; // otherwise, returns false.

int listSize() const; //Function to determine the number of elements in //the list. //Postcondition: Returns the value of length.

int maxListSize() const; //Function to determine the maximum size of the list //Postcondition: Returns the value of maxSize.

void print() const; //Function to output the elements of the list //Postcondition: Elements of the list are output on the // standard output device.

bool isItemAtEqual(int location, int item) const; //Function to determine whether item is the same as //the item in the list at the position specified //by location. //Postcondition: Returns true if list[location] // is the same as item; otherwise, // returns false. // If location is out of range, an // appropriate message is displayed.

virtual void insertAt(int location, int insertItem) = 0; //Function to insert insertItem in the list at the //position specified by location. //Note that this is an abstract function. //Postcondition: Starting at location, the elements of // the list are shifted down, // list[location] = insertItem; length++; // If the list is full or location is out of // range, an appropriate message is displayed.

virtual void insertEnd(int insertItem) = 0; //Function to insert insertItem at the end of //the list. Note that this is an abstract function. //Postcondition: list[length] = insertItem; and length++; // If the list is full, an appropriate // message is displayed.

void removeAt(int location); //Function to remove the item from the list at the //position specified by location //Postcondition: The list element at list[location] is // removed and length is decremented by 1. // If location is out of range, an // appropriate message is displayed.

void retrieveAt(int location, int& retItem) const; //Function to retrieve the element from the list at the //position specified by location //Postcondition: retItem = list[location] // If location is out of range, an // appropriate message is displayed.

virtual void replaceAt(int location, int repItem) = 0; //Function to replace the elements in the list //at the position specified by location. //Note that this is an abstract function. //Postcondition: list[location] = repItem // If location is out of range, an // appropriate message is displayed.

void clearList(); //Function to remove all the elements from the list //After this operation, the size of the list is zero. //Postcondition: length = 0;

virtual int seqSearch(int searchItem) const = 0; //Function to search the list for searchItem. //Note that this is an abstract function. //Postcondition: If the item is found, returns the // location in the array where the item is // found; otherwise, returns -1.

virtual void remove(int removeItem) = 0; //Function to remove removeItem from the list. //Note that this is an abstract function. //Postcondition: If removeItem is found in the list, // it is removed from the list and length // is decremented by one.

arrayListType(int size = 100); //Constructor //Creates an array of the size specified by the //parameter size. The default array size is 100. //Postcondition: The list points to the array, length = 0, // and maxSize = size;

arrayListType (const arrayListType& otherList); //Copy constructor

virtual ~arrayListType(); //Destructor //Deallocate the memory occupied by the array.

protected: int *list; //array to hold the list elements int length; //variable to store the length of the list int maxSize; //variable to store the maximum //size of the list };

#endif

------------------------------------------------------------------------------------------------------------------------------

// From Malik, C++ Data Structures.

// Do not modify

// Do not submit.

#include

#include "arrayListType.h"

using namespace std;

bool arrayListType::isEmpty() const

{

return (length == 0);

} //end isEmpty

bool arrayListType::isFull() const

{

return (length == maxSize);

} //end isFull

int arrayListType::listSize() const

{

return length;

} //end listSize

int arrayListType::maxListSize() const

{

return maxSize;

} //end maxListSize

void arrayListType::print() const

{

for (int i = 0; i < length; i++)

cout << list[i] << " ";

cout << endl;

} //end print

bool arrayListType::isItemAtEqual(int location, int item) const

{

if (location < 0 || location >= length)

{

cout << "The location of the item to be removed "

<< "is out of range." << endl;

return false;

}

else

return (list[location] == item);

} //end isItemAtEqual

void arrayListType::removeAt(int location)

{

if (location < 0 || location >= length)

cout << "The location of the item to be removed "

<< "is out of range." << endl;

else

{

for (int i = location; i < length - 1; i++)

list[i] = list[i+1];

length--;

}

} //end removeAt

void arrayListType::retrieveAt(int location, int& retItem) const

{

if (location < 0 || location >= length)

cout << "The location of the item to be retrieved is "

<< "out of range" << endl;

else

retItem = list[location];

} //end retrieveAt

void arrayListType::clearList()

{

length = 0;

} //end clearList

arrayListType::arrayListType(int size)

{

if (size <= 0)

{

cout << "The array size must be positive. Creating "

<< "an array of the size 100." << endl;

maxSize = 100;

}

else

maxSize = size;

length = 0;

list = new int[maxSize];

} //end constructor

arrayListType::~arrayListType()

{

delete [] list;

} //end destructor

arrayListType::arrayListType(const arrayListType& otherList)

{

maxSize = otherList.maxSize;

length = otherList.length;

list = new int[maxSize]; //create the array

for (int j = 0; j < length; j++) //copy otherList

list [j] = otherList.list[j];

}//end copy constructor

-------------------------------------------------------------------------------------------------------------

// Driver implemenation from Malik, C++ Data Structures.

// Do not modify

// Do not submit.

// Sample Data: 18 42 78 22 42 5 42 57

#include

#include "unorderedSetType.h"

using namespace std;

int main()

{

unorderedSetType intList(25); //Line 1

int number; //Line 2

cout << "List 3: Enter 8 integers: "; //Line 3

for (int count = 0; count < 8; count++) //Line 4

{

cin >> number; //Line 5

intList.insertEnd(number); //Line 6

}

cout << endl; //Line 7

cout << "Line 8: intList: "; //Line 8

intList.print(); //Line 9

cout << endl; //Line 10

cout << "Line 11: Enter the number to be "

<< "deleted: "; //Line 11

cin >> number; //Line 12

cout << endl; //Line 13

intList.remove(number); //Line 14

cout << "Line 15: After removing " << number

<< " intList: "; //Line 15

intList.print(); //Line 16

cout << endl; //Line 17

cout << "Line 18: Enter the search item: "; //Line 18

cin >> number; //Line 19

cout << endl; //Line 20

if (intList.seqSearch(number) != -1) //Line 21

cout << "Line 22: " << number

<< " found in intList." << endl; //Line 22

else //Line 23

cout << "Line 24: " << number

<< " is not in intList." << endl; //Line 24

return 0;

}

-----------------------------------------------------------------

(Instructions)

PA3 (Unordered) Sets As explained in chapter 12 of our textbook, a set is a collection of distinct elements of the same type. Your task is to design the class unorderedSetType , deriving from the class unorderedArrayListType , to manipulate sets. Note that you need to redefine only the functions insertAt() , insertEnd() , and replaceAt() . If the item to be inserted is already in the list, the functions insertAt() and insertEnd() output an appropriate message. Similarly, if the item to be replaced is already in the list, the function replaceAt() outputs an appropriate message. Several header and source files are provided in their entirety. You need to modify only the two files unorderedSetType.h unorderedSetTypeImp.cpp , replacing the ToDos with your code. A driver program (containing a main() function) is provided. Compile your modified files together with the other provided files into one executable for your own testing. Submit only your two modified source files. Zipping them into one file for submission is optional. (after Malik, C++ Programming: Program Design Including Data Structures, 7E)

-------------------------------------------------------------------------------------------------------------------------------

// From Malik, C++ Data Structures. // Do not modify // Do not submit.

#ifndef H_unorderedArrayListType #define H_unorderedArrayListType

#include "arrayListType.h" class unorderedArrayListType: public arrayListType { public: virtual void insertAt(int location, int insertItem); virtual void insertEnd(int insertItem); virtual void replaceAt(int location, int repItem); virtual int seqSearch(int searchItem) const; virtual void remove(int removeItem);

unorderedArrayListType(int size = 100); //Constructor };

#endif

--------------------------------------------------------------------------------------------

// From Malik, C++ Data Structures.

// Do not modify

// Do not submit.

#include

#include "unorderedArrayListType.h"

using namespace std;

void unorderedArrayListType::insertAt(int location,

int insertItem)

{

if (location < 0 || location >= maxSize)

cout << "The position of the item to be inserted "

<< "is out of range." << endl;

else if (length >= maxSize) //list is full

cout << "Cannot insert in a full list" << endl;

else

{

for (int i = length; i > location; i--)

list[i] = list[i - 1]; //move the elements down

list[location] = insertItem; //insert the item at

//the specified position

length++; //increment the length

}

} //end insertAt

void unorderedArrayListType::insertEnd(int insertItem)

{

if (length >= maxSize) //the list is full

cout << "Cannot insert in a full list." << endl;

else

{

list[length] = insertItem; //insert the item at the end

length++; //increment the length

}

} //end insertEnd

int unorderedArrayListType::seqSearch(int searchItem) const

{

int loc;

bool found = false;

loc = 0;

while (loc < length && !found)

if (list[loc] == searchItem)

found = true;

else

loc++;

if (found)

return loc;

else

return -1;

} //end seqSearch

void unorderedArrayListType::remove(int removeItem)

{

int loc;

if (length == 0)

cout << "Cannot delete from an empty list." << endl;

else

{

loc = seqSearch(removeItem);

if (loc != -1)

removeAt(loc);

else

cout << "The item to be deleted is not in the list."

<< endl;

}

} //end remove

void unorderedArrayListType::replaceAt(int location, int repItem)

{

if (location < 0 || location >= length)

cout << "The location of the item to be "

<< "replaced is out of range." << endl;

else

list[location] = repItem;

} //end replaceAt

unorderedArrayListType::unorderedArrayListType(int size)

: arrayListType(size)

{

} //end constructor

---------------------------------------------------------------------------------------------------

/* Replace 'ToDo's with your code. Name Modified */ #ifndef H_unorderedSetType #define H_unorderedSetType #include "unorderedArrayListType.h" /* ToDo: Derive a public class called unorderedArrayListType from the class unorderedSetType . Declare public member functions insertAt(), insertEnd(), and replaceAt() with prototypes identical to the corresponding ones in unorderedArrayListType ( See unorderedArrayListType.h ) Declare a constructor that accepts one parameter of type int, that defaults to 100 if not passed. */

#endif

---------------------------------------------------------------------------------------------------

// Hint File /* Replace 'ToDo's with your code. Name Modified */ #include #include "unorderedSetType.h" using namespace std;

void unorderedSetType::insertAt(int location, int insertItem) { if (location < 0 || location >= maxSize) cout << "The position of the item to be inserted " << "is out of range." << endl; else if (length >= maxSize) //list is full cout << "Cannot insert in a full list" << endl; else { /* ToDo : Use the parent function seqSearch() to locate the item if it is already in the list. Call the result 'loc'. */ if (loc == -1) { /* ToDo : Move everything one step down the list. Insert the item at the specified position. Increment the length. */ } else cout << "The item to be inserted is already in the list." << endl; } } //end insertAt

void unorderedSetType::insertEnd(int insertItem) { // ToDo : implement this function. } //end insertEnd

void unorderedSetType::replaceAt(int location, int repItem) { if (location < 0 || location >= length) cout << "The location of the item to be " << "replaced is out of range." << endl; else { /* ToDo : Use the parent function seqSearch() to locate the item if it is already in the list. Call the result 'loc'. */ if (loc == -1) /* Todo : Replace the value at list[location] with the new value. */ else cout << "The item to be inserted is already in the list." << endl; } } //end replaceAt

unorderedSetType::unorderedSetType(int size) : unorderedArrayListType(size) { } //end constructor