Add the function min as an abstract function to the class arrayListType to retur
ID: 3669702 • Letter: A
Question
Add the function min as an abstract function to the class arrayListType to return the smallest element of the list. Also, write the definition of the function min in the class unorderedArrayListType and write a program to test this function. Use these files.
mainProgram.cpp
arrayListType.h
arrayListType.Imp.cpp
unorderedArrayListType.h
unorderedArrayListTypeImp.cpp
For my mainProgram.cpp I have
//Main
#include <iostream>
#include "unorderedArrayListType.h"
using namespace std;
int main()
{
unorderedArrayListType<int> intList(25);
int number;
cout << "Enter 8 integers: ";
for (int count = 0; count < 8; count++)
{
cin >> number;
intList.insertEnd(number);
}
cout << endl;
cout << "intList: ";
intList.print();
cout << endl;
cout << "The smallest number in intList: "
<< intList.min() << endl;
system("pause");
return 0;
}
_______________________________________________________________________
//unOrderArrayListType.h
#ifndef H_unorderedArrayListType
#define H_unorderedArrayListType
#include "arrayListType.h"
template <class elemType>
class unorderedArrayListType : public arrayListType<elemType>
{
public:
void insertAt(int location, const elemType& insertItem);
void insertEnd(const elemType& insertItem);
void replaceAt(int location, const elemType& repItem);
int seqSearch(const elemType& searchItem) const;
void remove(const elemType& removeItem);
unorderedArrayListType(int size = 100);
};
template <class elemType>
void unorderedArrayListType<elemType>::insertAt(int location, const elemType& insertItem)
{
for (int i = length; i > location; i--)
list[i] = list[i - 1];
list[location] = insertItem;
length++;
}
#endif
_______________________________________________________________________
//arrayListType.h
#ifndef H_arrayListType
#define H_arrayListType
#include <iostream>
using namespace std;
template <class elemType>
class arrayListType
{
public:
const arrayListType<elemType>&operator=(const arrayListType<elemType>&);
bool isEmpty() const;
bool isFull() const;
int listSize() const;
int maxListSize() const;
void print() const;
bool isItemAtEqual(int location, const elemType& item) const;
virtual void insertAt(int location, const elemType& insertItem) = 0;
virtual void insertEnd(const elemType& insertItem) = 0;
void removeAt(int location);
void retrieveAt(int location, elemType& retItem) const;
virtual void replaceAt(int location, const elemType& repItem) = 0;
void clearList();
virtual int seqSearch(const elemType& searchItem) const;
virtual void remove(const elemType& removeItem) = 0;
arrayListType(int size = 100);
arrayListType(const arrayListType<elemType>& otherList);
virtual ~arrayListType();
protected:
elemType *list;
int length;
int maxSize;
};
template <class elemType>
bool arrayListType<elemType>::isEmpty() const
{
return (length == 0);
}
#endif
I'm getting an error saying that intList.min() has no member. How would I go about adding in a member for .min()? Also, is there anyway I can spread out my code to all of the files that are required? I don't have any code in unOrderArrayListTypeImp.cpp and arrayListTypeImp.cpp
Explanation / Answer
main.cpp
#include <iostream>
#include "unorderedSetType.h"
#include "stdafx.h"
using namespace std;
int main()
{
unorderedSetType intList(25);
int number;
cout << "Enter 8 integers: ";
for (int count = 0; count < 8; count++)
{
cin >> number;
intList.insertEnd(number);
}
cout << endl;
cout << "intList: ";
intList.print();
cout << endl;
cout << "Inserting an item..." << endl;
intList.insertAt(0, 6);
cout << "Replacing an item..." << endl;
intList.replaceAt(3, 4);
cout << "Inserting an item..." << endl;
intList.insertAt(0, 15);
cout << "intList: ";
intList.print();
return 0;
}
unorderedArrayListType.h
#ifndef UNORDEREDARRAYLISTTYPE_H
#define UNORDEREDARRAYLISTTYPE_H
#include "arrayListType.h"
class unorderedArrayListType : public arrayListType {
public:
void insertAt(int location, int insertItem);
// Function to insert an item at a particular location
// Postcondition: The item has been added to the list and the length has
// been increased by 1.
void insertEnd(int insertItem);
// Function to insert an item at the end of the list
// Postcondition: The item has been added at the end of the list and the
// length has been increased by 1.
void replaceAt(int location, int repItem);
// Function to replace an item in the list.
// Postcondition: repItem overrwrites the item at the specified location
// in the list. The length of the list is unchanged.
int seqSearch(int searchItem) const;
// 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.
void remove(int removeItem);
// Function to remove an item from the list
// Postcondition: If the item is found in the list, it is removed and the
// length of the list is decreased by 1; if the item is not in the list
// an appropriate message is displayed.
void removeAll(int removeItem);
// Function to remove all occurrences of an item from the list
// Postcondition: If the item is found in the the list, all occurrences are
// removed and the length of the list is decreased accordingly. If the
// item is not in the list an appropriate message is displayed.
unorderedArrayListType(int size = 100);
//Constructor.
};
#endif /* UNORDEREDARRAYLISTTYPE_H */
unorderedArrayListType.cpp
#include <iostream>
#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::removeAll(int removeItem) {
int loc;
if (length == 0)
cout << "Cannot delete from an empty list." << endl;
else{
// Find and remove the first occurrence of removeItem (if there is one)
loc = seqSearch(removeItem);
if (loc != -1)
removeAt(loc);
else
cout << "The item to be deleted is not in the list." << endl;
}
// Set up a loop to find other occurrences and delete them as well
while (loc != -1)
{
loc = seqSearch(removeItem);
if (loc != -1)
removeAt(loc);
}
}
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
arrayListType.h
#ifndef ARRAYLISTTYPE_H
#define ARRAYLISTTYPE_H
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 the 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 repItem the element 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.
virtual void removeAll(int removeItem) = 0;
// Function to remove all instances of removeItem from the list.
// Note that this is an abstract function.
// Postcondition: If there are any instances of removeItem in the list,
// they are all removed and the length of the list is decremented
// accordingly
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 /* ARRAYLISTTYPE_H */
arrayListType.cpp
#include <iostream>
#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) { //FIX: removed = because location should be allowed to equal length without an error.
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
stdafx.h
// stdafx.h : include file for standard system include files,
// or project specific include files that are used frequently, but
// are changed infrequently
//
#pragma once
#include "targetver.h"
#include <stdio.h>
//#include <tchar.h>
#include "unorderedSetType.h"
#include <iostream>
// TODO: reference additional headers your program requires here
targetver.h
#pragma once
// Including SDKDDKVer.h defines the highest available Windows platform.
// If you wish to build your application for a previous Windows platform, include WinSDKVer.h and
// set the _WIN32_WINNT macro to the platform you wish to support before including SDKDDKVer.h.
//#include <SDKDDKVer.h>
stdafx.cpp
// stdafx.cpp : source file that includes just the standard includes
// Assignment03.pch will be the pre-compiled header
// stdafx.obj will contain the pre-compiled type information
#include "stdafx.h"
// TODO: reference any additional headers you need in STDAFX.H
// and not in this file
unorderedSetType.h
/*
* File: unorderedSetType.h
*
*/
#ifndef UNORDEREDSETTYPE_H
#define UNORDEREDSETTYPE_H
#include "unorderedArrayListType.h"
class unorderedSetType : public unorderedArrayListType{
public:
void insertAt(int location, int insertItem);
// Function to insert an item at a particular location
// Postcondition: The item has been added to the list and the length has
// been increased by 1.
void insertEnd(int insertItem);
// Function to insert an item at the end of the list
// Postcondition: The item has been added at the end of the list and the
// length has been increased by 1.
void replaceAt(int location, int repItem);
// Function to replace an item in the list.
// Postcondition: repItem overrwrites the item at the specified location
// in the list. The length of the list is unchanged.
unorderedSetType setUnion(unorderedSetType set);
//returns a new set containing members of caller and parameter
unorderedSetType setIntersect(unorderedSetType set);
//returns a new set containing only members parameter and caller share.
unorderedSetType(int size = 100);
//constructor
};
#endif /* UNORDEREDSETTYPE_H */
unorderedSetType.cpp
/*
* File: unorderedSetType.cpp
*
*/
#include <iostream>
#include "unorderedSetType.h"
using namespace std;
void unorderedSetType::insertAt(int location, int insertItem){
bool isDuplicate = false;
for (int i = 0; i < this->listSize(); i++){
if (this->isItemAtEqual(i, insertItem)){
isDuplicate = true;
}
}
if (!isDuplicate){
unorderedArrayListType::insertAt(location, insertItem);
}
else{
cout << "A set cannot contain duplicate items." << endl;
}
}
void unorderedSetType::insertEnd(int insertItem){
bool isDuplicate = false;
for (int i = 0; i < this->listSize(); i++){
if (this->isItemAtEqual(i, insertItem)){
isDuplicate = true;
}
}
if (!isDuplicate){
unorderedArrayListType::insertEnd(insertItem);
}
else{
cout << "A set cannot contain duplicate items." << endl;
}
}
void unorderedSetType::replaceAt(int location, int repItem){
bool isDuplicate = false;
for (int i = 0; i < this->listSize(); i++){
if (this->isItemAtEqual(i, repItem)){
isDuplicate = true;
}
}
if (!isDuplicate){
unorderedArrayListType::replaceAt(location, repItem);
}
else{
cout << "A set cannot contain duplicate items." << endl;
}
}
unorderedSetType unorderedSetType::setUnion(unorderedSetType set){
int mergeTemp;
for (int i = 0; i < set.listSize(); i++){ //for all the items in the set
this->retrieveAt(i, mergeTemp); //set mergeTemp equal to each
if (!this->isItemAtEqual(i, mergeTemp)){ //if mergeTemp is NOT equal, append mergeTemp to the end of passed set.
set.insertEnd(mergeTemp);
}
}
return set;
}
unorderedSetType unorderedSetType::setIntersect(unorderedSetType set){
int mergeTemp;
int mergeTemp2;
unorderedSetType setTemp;
for (int i = 0; i < set.listSize(); i++){
set.retrieveAt(i, mergeTemp);
for (int j = 0; j < this->listSize(); j++){
this->retrieveAt(j, mergeTemp2);
if (mergeTemp == mergeTemp2)
setTemp.insertEnd(mergeTemp);
}
}
return setTemp;
}
unorderedSetType::unorderedSetType(int size){
}
output
Enter 8 integers: 1 2 3 4 5 6 7 8
intList: 1 2 3 4 5 6 7 8
Inserting an item...
A set cannot contain duplicate items.
Replacing an item...
A set cannot contain duplicate items.
Inserting an item...
intList: 15 1 2 3 4 5 6 7 8
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.