I need to build the main file. Can anyone help please? Thx!
XiaO yuEn
0
Newbie Poster
//addressBookType.h
#ifndef H_addressBookType
#define H_addressBookType
#include <iostream>
#include <fstream>
#include <string>
#include "extPersonType.h"
#include "orderedLinkedList.h"
using namespace std;
class addressBookType: public orderedLinkedList<extPersonType>
{
public:
void print() const;
void printNameInTheMonth(int month);
void printInfoOf(string lName);
void printNamesWithStatus(string status);
void printNamesBetweenLastNames(string last1,
string last2);
void insertNode(const extPersonType& eP);
void searchName(string lName);
void saveData(ofstream&);
addressBookType();
private:
nodeType<extPersonType>* searchList(string lName);
};
#endif//addressBookTypeImp.cpp
#include <iostream>
#include <fstream>
#include <string>
#include "addressBookType.h"
using namespace std;
void addressBookType::print() const
{
nodeType<extPersonType>* current = first;
while (current != NULL)
{
current->info.printInfo();
cout << endl;
current= current->link;
}
}
void addressBookType::printNameInTheMonth(int month)
{
nodeType<extPersonType>* current = first;
while (current != NULL)
{
if (current->info.isMonth(month))
{
current->info.print();
cout << endl;
}
current = current->link;
}
}
void addressBookType::printInfoOf(string lName)
{
nodeType<extPersonType>* location = searchList(lName);
if (location != NULL)
location->info.printInfo();
else
cout << lName << " is not in address book." << endl;
}
void addressBookType::printNamesWithStatus(string status)
{
nodeType<extPersonType>* current = first;
while (current != NULL)
{
if (current->info.isStatus(status))
{
current->info.print();
cout << endl;
}
current = current->link;
}
}
void addressBookType::printNamesBetweenLastNames(string last1,
string last2)
{
string lName;
nodeType<extPersonType>* current = first;
while(current != NULL)
{
lName = current->info.getLastName();
if (last1 <= lName && lName <= last2)
{
current->info.print();
cout << endl;
}
current = current->link;
}
}
void addressBookType::insertNode(const extPersonType& eP)
{
orderedLinkedList<extPersonType>::insert(eP);
}
void addressBookType::searchName(string lName)
{
nodeType<extPersonType>* location = searchList(lName);
if (location != NULL)
cout << lName << " is in the address book" << endl;
else
cout << lName << " is not in the address book" << endl;
}
nodeType<extPersonType>* addressBookType::searchList(string lName)
{
nodeType<extPersonType>* current = first;
bool found = false;
while (current != NULL)
{
if (current->info.isLastName(lName))
{
found = true;
break;
}
current = current->link;
}
return current;
}
void addressBookType::saveData(ofstream& outFile)
{
string firstN;
string lastN;
int month;
int day;
int year;
string street;
string city;
string state;
string zip;
string phone;
string pStatus;
nodeType<extPersonType>* current = first;
while (current != NULL)
{
current->info.getDOB(month, day, year);
current->info.getAddress(street,city,state,zip);
current->info.getPhoneNumber();
current->info.getStatus();
outFile << current->info.getFirstName() << " " << current->info.getLastName() << endl;
outFile << month << " " << day << " " << year << endl;
outFile << street << endl << city << endl << state << endl << zip << endl;
outFile << current->info.getPhoneNumber() << endl
<< current->info.getStatus() << endl;
current = current->link;
}
}
addressBookType::addressBookType()
{
}#ifndef H_addressType
#define H_addressType
#include <string>
using namespace std;
class addressType
{
public:
void print() const;
void setAddress(string sAddress, string c, string s, string z);
void getAddress(string& sAddress, string& c,
string& s, string& z);
addressType(string sAddress = "", string c = "",
string s = "", string z = "");
private:
string streetAddress;
string city;
string state;
string zip;
};
#endif#include <iostream>
#include <string>
#include "addressType.h"
using namespace std;
void addressType::print() const
{
cout << streetAddress << endl;
cout << city << ", " << state << " - " << zip << endl;
}
void addressType::setAddress(string sAddress, string c,
string s, string z)
{
streetAddress = sAddress;
city = c;
state = s;
zip = z;
}
void addressType::getAddress(string& sAddress, string& c,
string& s, string& z)
{
sAddress = streetAddress;
c = city;
s = state;
z = zip;
}
addressType::addressType(string sAddress, string c,
string s, string z)
{
streetAddress = sAddress;
city = c;
state = s;
zip = z;
}Shelly Malik
12 8 2000
Lincoln Drive
Omaha
Nebraska
68131
402-555-1212
Family
Donald Duck
10 6 1980
Disney Street
Orlando
Florida
11234
622-873-8920
Friend
Chelsea Tomak
12 8 1999
Kennedy Blvd
Omaha
Nebraska
68172
402-777-8888
Friend
Goof Goofy
2 6 1965
Disney Street
Los Angles
California
91340
215-782-9000
Family
Brave Balto
2 6 1975
Disney Road
Orlando
Florida
35672
415-782-5555
Business
Bash Bashfull
2 8 1965
Long Road
New York
New York
01101
212-782-8000
Friend#ifndef date_H
#define date_H
class dateType
{
public:
void setDate(int month, int day, int year);
//Function to set the date.
//The member variables dMonth, dDay, and dYear are set
//according to the parameters.
//Postcondition: dMonth = month; dDay = day;
// dYear = year
int getDay() const;
//Function to return the day.
//Postcondition: The value of dDay is returned.
int getMonth() const;
//Function to return the month.
//Postcondition: The value of dMonth is returned.
int getYear() const;
//Function to return the year.
//Postcondition: The value of dYear is returned.
void printDate() const;
//Function to output the date in the form mm-dd-yyyy.
dateType(int month = 1, int day = 1, int year = 1900);
//Constructor to set the date
//The member variables dMonth, dDay, and dYear are set
//according to the parameters.
//Postcondition: dMonth = month; dDay = day; dYear = year;
// If no values are specified, the default
// values are used to initialize the member
// variables.
private:
bool isLeapYear(int y);
//Function to check if a year is a leap year
int dMonth; //variable to store the month
int dDay; //variable to store the day
int dYear; //variable to store the year
};
#endif//Implementation file date
#include <iostream>
#include "dateType.h"
using namespace std;
void dateType::setDate(int month, int day, int year)
{
if (year >= 1)
dYear = year;
else
dYear = 1900;
if (1 <= month && month <= 12)
dMonth = month;
else
dMonth = 1;
switch (dMonth)
{
case 1:
case 3:
case 5:
case 7:
case 8:
case 10:
case 12:
if (1 <= day && day <= 31)
dDay = day;
else
dDay = 1;
break;
case 4:
case 6:
case 9:
case 11:
if (1 <= day && day <= 30)
dDay = day;
else
dDay = 1;
break;
case 2:
if (isLeapYear(year))
{
if (1 <= day && day <= 29)
dDay = day;
else
dDay = 1;
}
else
{
if (1 <= day && day <= 28)
dDay = day;
else
dDay = 1;
}
}
}
int dateType::getDay() const
{
return dDay;
}
int dateType::getMonth() const
{
return dMonth;
}
int dateType::getYear() const
{
return dYear;
}
void dateType::printDate() const
{
cout << dMonth << "-" << dDay << "-" << dYear;
}
//constructor with parameter
dateType::dateType(int month, int day, int year)
{
setDate(month, day, year);
}
bool dateType::isLeapYear(int y)
{
if ((y % 4 == 0 && y % 100 != 0) || (y % 400 == 0))
return true;
else
return false;
}
This attachment is potentially unsafe to open.
It may be an executable that is capable of making changes to your file system, or it may require specific software to open.
Use caution and only open this attachment if you are comfortable working with msword files.
//extPersonType
#ifndef H_extPersonType
#define H_extPersonType
#include <string>
#include "addressType.h"
#include "dateType.h"
#include "personType.h"
class extPersonType: public personType
{
public:
void printAddress() const;
void printInfo() const;
void setInfo(string fName, string lName,
int month, int day, int year,
string street, string c, string s,
string z, string phone, string pStatus);
void setInfo(string fName, string lName,
dateType d, addressType ad,
string phone, string pStatus);
bool isLastName(string lName) const;
void getAddress(string& sAddress, string& c,
string& s, string& z);
string getStatus() const;
string getPhoneNumber() const;
bool isStatus(string status);
bool isDOB(int month, int day, int year);
void getDOB(int& month, int& day, int& year);
bool isMonth(int month) const;
extPersonType(string fName = "", string lName = "",
int month = 1, int day = 1, int year = 1900,
string street = "", string c = "", string s = "",
string z = "", string phone = "", string pStatus = "");
bool operator==(const extPersonType&) const;
bool operator!=(const extPersonType&) const;
bool operator<=(const extPersonType&) const;
bool operator<(const extPersonType&) const;
bool operator>=(const extPersonType&) const;
bool operator>(const extPersonType&) const;
private:
addressType address;
dateType dob;
string phoneNumber;
string personStatus;
};
#endif//extPersonTypeImp.cpp
#include <iostream>
#include <string>
#include "extPersonType.h"
void extPersonType::printAddress() const
{
personType::print();
cout << endl;
address.print();
}
void extPersonType::printInfo() const
{
personType::print();
cout << endl;
cout << "Date of Birth: ";
dob.printDate();
cout << endl;
cout << "Phone Number: " << phoneNumber << endl;
cout << "Person Type: " << personStatus << endl;
address.print();
cout << endl;
}
void extPersonType::setInfo(string fName, string lName,
int month, int day, int year,
string street, string c, string s,
string z, string phone, string pStatus)
{
personType::setName(fName,lName);
dob.setDate(month, day, year);
address.setAddress(street,c , s, z);
phoneNumber = phone;
personStatus = pStatus;
}
void extPersonType::setInfo(string fName, string lName,
dateType d, addressType ad,
string phone, string pStatus)
{
personType::setName(fName,lName);
dob = d;
address = ad;
phoneNumber = phone;
personStatus = pStatus;
}
bool extPersonType::isLastName(string lName) const
{
return(getLastName() == lName);
}
void extPersonType::getAddress(string& sAddress, string& c,
string& s, string& z)
{
address.getAddress(sAddress, c, s, z);
}
string extPersonType::getPhoneNumber() const
{
return phoneNumber;
}
string extPersonType::getStatus() const
{
return personStatus;
}
bool extPersonType::isStatus(string status)
{
return (status == personStatus);
}
bool extPersonType::isDOB(int month, int day, int year)
{
return (dob.getMonth() == month && dob.getDay() == day
&& dob.getYear() == year);
}
void extPersonType::getDOB(int& month, int& day, int& year)
{
month = dob.getMonth();
day = dob.getDay();
year = dob.getYear();
}
bool extPersonType::isMonth(int month) const
{
return(dob.getMonth() == month);
}
extPersonType::extPersonType(string fName, string lName,
int month, int day, int year,
string street, string c, string s,
string z, string phone, string pStatus)
{
personType::setName(fName,lName);
dob.setDate(month, day, year);
address.setAddress(street,c,s,z);
phoneNumber = phone;
personStatus = pStatus;
}
bool extPersonType::operator==(const extPersonType& right) const
{
return (getFirstName() == right.getFirstName()
&& getLastName() == right.getLastName());
}
bool extPersonType::operator!=(const extPersonType& right) const
{
return (!(*this == right));
}
bool extPersonType::operator<=(const extPersonType& right) const
{
return(*this < right || *this == right);
}
bool extPersonType::operator<(const extPersonType& right) const
{
return ((getLastName() < right.getLastName()) ||
(getLastName() == right.getLastName()
&& getFirstName() < right.getFirstName()));
}
bool extPersonType::operator>=(const extPersonType& right) const
{
return (*this > right || *this == right);
}
bool extPersonType::operator>(const extPersonType& right) const
{
return ((getLastName() > right.getLastName()) ||
(getLastName() == right.getLastName()
&& getFirstName() > right.getFirstName()));
}The attachment preview is chopped off after the first 10 KB. Please download the entire file.
#ifndef H_LinkedListType
#define H_LinkedListType
#include <iostream>
#include <cassert>
using namespace std;
//Definition of the node
template <class Type>
struct nodeType
{
Type info;
nodeType<Type> *link;
};
template <class Type>
class linkedListIterator
{
public:
linkedListIterator();
//Default constructor
//Postcondition: current = NULL;
linkedListIterator(nodeType<Type> *ptr);
//Constructor with a parameter.
//Postcondition: current = ptr;
Type operator*();
//Function to overload the dereferencing operator *.
//Postcondition: Returns the info contained in the node.
linkedListIterator<Type> operator++();
//Overload the pre-increment operator.
//Postcondition: The iterator is advanced to the next
// node.
bool operator==(const linkedListIterator<Type>& right) const;
//Overload the equality operator.
//Postcondition: Returns true if this iterator is equal to
// the iterator specified by right,
// otherwise it returns the value false.
bool operator!=(const linkedListIterator<Type>& right) const;
//Overload the not equal to operator.
//Postcondition: Returns true if this iterator is not
// equal to the iterator specified by
// right; otherwise it returns the value
// false.
private:
nodeType<Type> *current; //pointer to point to the current
//node in the linked list
};
template <class Type>
linkedListIterator<Type>::linkedListIterator()
{
current = NULL;
}
template <class Type>
linkedListIterator<Type>::
linkedListIterator(nodeType<Type> *ptr)
{
current = ptr;
}
template <class Type>
Type linkedListIterator<Type>::operator*()
{
return current->info;
}
template <class Type>
linkedListIterator<Type> linkedListIterator<Type>::operator++()
{
current = current->link;
return *this;
}
template <class Type>
bool linkedListIterator<Type>::operator==
(const linkedListIterator<Type>& right) const
{
return (current == right.current);
}
template <class Type>
bool linkedListIterator<Type>::operator!=
(const linkedListIterator<Type>& right) const
{ return (current != right.current);
}
//***************** class linkedListType ****************
template <class Type>
class linkedListType
{
public:
const linkedListType<Type>& operator=
(const linkedListType<Type>&);
//Overload the assignment operator.
void initializeList();
//Initialize the list to an empty state.
//Postcondition: first = NULL, last = NULL, count = 0;
bool isEmptyList() const;
//Function to determine whether the list is empty.
//Postcondition: Returns true if the list is empty,
// otherwise it returns false.
void print() const;
//Function to output the data contained in each node.
//Postcondition: none
int length() const;
//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() const;
//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, the program
// terminates; otherwise, the first
// element of the list is returned.
Type back() const;
//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, the program
// terminates; otherwise, the last
// element of the list is returned.
virtual bool search(const Type& searchItem) const = 0;
//Function to determine whether searchItem is in the list.
//Postcondition: Returns true if searchItem is in the
// list, otherwise the value false is
// returned.
virtual void insertFirst(const Type& newItem) = 0;
//Function to insert newItem at the beginning of the list.
//Postcondition: first points to the new list, newItem is
// inserted at the beginning of the list,
// last points to the last node in the list,
// and count is incremented by 1.
virtual void insertLast(const Type& newItem) = 0;
//Function to insert newItem at the end of the list.
//Postcondition: first points to the new list, newItem
// is inserted at the end of the list,
// last points to the last node in the list,
// and count is incremented by 1.
virtual void deleteNode(const Type& deleteItem) = 0;
//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, last
// points to the last node of the updated
// list, and count is decremented by 1.
linkedListIterator<Type> begin();
//Function to return an iterator at the begining of the
//linked list.
//Postcondition: Returns an iterator such that current is
// set to first.
linkedListIterator<Type> end();
//Function to return an iterator one element past the
//last element of the linked list.
//Postcondition: Returns an iterator such that current is
// set to NULL.
linkedListType();
//default constructor
//Initializes the list to an empty state.
//Postcondition: first = NULL, last = NULL, count = 0;
linkedListType(const linkedListType<Type>& otherList);
//copy constructor
~linkedListType();
//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<Type> *first; //pointer to the first node of the list
nodeType<Type> *last; //pointer to the last node of the list
private:
void copyList(const linkedListType<Type>& otherList);
//Function to make a copy of otherList.
//Postcondition: A copy of otherList is created and
// assigned to this list.
};
template <class Type>
bool linkedListType<Type>::isEmptyList() const
{
return(first == NULL);
}
template <class Type>
linkedListType<Type>::linkedListType() //default constructor
{
first = NULL;
last = NULL;
count = 0;
}
template <class Type>
void linkedListType<Type>::destroyList()
{
nodeType<Type> *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 the 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 linkedListType<Type>::initializeList()
{
destroyList(); //if the list has any nodes, delete them
}
template <class Type>
void linkedListType<Type>::print() const
{
nodeType<Type> *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 linkedListType<Type>::length() const
{
return count;
} //end length
template <class Type>
Type linkedListType<Type>::front() const
{
assert(first != NULL);
return first->info; //return the info of the first node
}//end front
template <class Type>
Type linkedListType<Type>::back() const
{
assert(last != NULL);
return last->info; //return the info of the last node
}//end back
template <class Type>
linkedListIterator<Type> linkedListType<Type>::begin()
{
linkedListIterator<Type> temp(first);
return temp;
}
template <class Type>
linkedListIterator<Type> linkedListType<Type>::end()
{
linkedListIterator<Type> temp(NULL);
return temp;
}
template <class Type>
void linkedListType<Type>::copyList
(const linkedListType<Type>& otherList)
{
nodeType<Type> *newNode; //pointer to create a node
nodeType<Type> *current; //pointer to traverse the list
if (first != NULL) //if the 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<Type>; //create the node
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#ifndef H_orderedListType
#define H_orderedListType
#include "linkedList.h"
using namespace std;
template <class Type>
class orderedLinkedList: public linkedListType<Type>
{
public:
bool search(const Type& searchItem) const;
//Function to determine whether searchItem is in the list.
//Postcondition: Returns true if searchItem is in the list,
// otherwise the value false is returned.
void insert(const Type& newItem);
//Function to insert newItem in the list.
//Postcondition: first points to the new list, newItem
// is inserted at the proper place in the
// list, and count is incremented by 1.
void insertFirst(const Type& newItem);
//Function to insert newItem at the beginning of the list.
//Postcondition: first points to the new list, newItem is
// inserted at the beginning of the list,
// last points to the last node in the
// list, and count is incremented by 1.
void insertLast(const Type& newItem);
//Function to insert newItem at the end of the list.
//Postcondition: first points to the new list, newItem
// is inserted at the end of the list,
// last points to the last node in the
// list, and count is incremented by 1.
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 of the
// new list, and count is decremented by 1.
// If deleteItem is not in the list, an
// appropriate message is printed.
};
template <class Type>
bool orderedLinkedList<Type>::search(const Type& searchItem) const
{
bool found = false;
nodeType<Type> *current; //pointer to traverse the list
current = first; //start the search at the first node
while (current != NULL && !found)
if (current->info >= searchItem)
found = true;
else
current = current->link;
if (found)
found = (current->info == searchItem); //test for equality
return found;
}//end search
template <class Type>
void orderedLinkedList<Type>::insert(const Type& newItem)
{
nodeType<Type> *current; //pointer to traverse the list
nodeType<Type> *trailCurrent; //pointer just before current
nodeType<Type> *newNode; //pointer to create a node
bool found;
newNode = new nodeType<Type>; //create the node
newNode->info = newItem; //store newItem in the node
newNode->link = NULL; //set the link field of the node
//to NULL
if (first == NULL) //Case 1
{
first = newNode;
last = newNode;
count++;
}
else
{
current = first;
found = false;
while (current != NULL && !found) //search the list
if (current->info >= newItem)
found = true;
else
{
trailCurrent = current;
current = current->link;
}
if (current == first) //Case 2
{
newNode->link = first;
first = newNode;
count++;
}
else //Case 3
{
trailCurrent->link = newNode;
newNode->link = current;
if (current == NULL)
last = newNode;
count++;
}
}//end else
}//end insert
template<class Type>
void orderedLinkedList<Type>::insertFirst(const Type& newItem)
{
insert(newItem);
}//end insertFirst
template<class Type>
void orderedLinkedList<Type>::insertLast(const Type& newItem)
{
insert(newItem);
}//end insertLast
template<class Type>
void orderedLinkedList<Type>::deleteNode(const Type& deleteItem)
{
nodeType<Type> *current; //pointer to traverse the list
nodeType<Type> *trailCurrent; //pointer just before current
bool found;
if (first == NULL) //Case 1
cout << "Cannot delete from an empty list." << endl;
else
{
current = first;
found = false;
while (current != NULL && !found) //search the list
if (current->info >= deleteItem)
found = true;
else
{
trailCurrent = current;
current = current->link;
}
if (current == NULL) //Case 4
cout << "The item to be deleted is not in the "
<< "list." << endl;
else
if (current->info == deleteItem) //the item to be
//deleted is in the list
{
if (first == current) //Case 2
{
first = first->link;
if (first == NULL)
last = NULL;
delete current;
}
else //Case 3
{
trailCurrent->link = current->link;
if (current == last)
last = trailCurrent;
delete current;
}
count--;
}
else //Case 4
cout << "The item to be deleted is not in the "
<< "list." << endl;
}
}//end deleteNode
#endif//personType.h
#ifndef H_personType
#define H_personType
#include <string>
using namespace std;
class personType
{
public:
void print() const;
//Function to output the first name and last name
//in the form firstName lastName.
void setName(string first, string last);
//Function to set firstName and lastName according
//to the parameters.
//Postcondition: firstName = first; lastName = last
string getFirstName() const;
//Function to return firstName and lastName via the
//parameters.
//Postcondition: The value of firstName is returned
string getLastName() const;
//Function to return firstName and lastName via the
//parameters.
//Postcondition: The value of lastName is returned
personType(string first = "", string last = "");
//Constructor
//Sets firstName and lastName according to the parameters.
//The default values of the parameters are empty strings.
//Postcondition: firstName = first; lastName = last
bool operator==(const personType&) const;
bool operator!=(const personType&) const;
bool operator<=(const personType&) const;
bool operator<(const personType&) const;
bool operator>=(const personType&) const;
bool operator>(const personType&) const;
private:
string firstName; //store the first name
string lastName; //store the last name
};
#endif//personTypeImp.cpp
#include <iostream>
#include <string>
#include "personType.h"
using namespace std;
void personType::print() const
{
cout << firstName << " " << lastName;
}
void personType::setName(string first, string last)
{
firstName = first;
lastName = last;
}
string personType::getFirstName() const
{
return firstName;
}
string personType::getLastName() const
{
return lastName;
}
personType::personType(string first, string last)
{
firstName = first;
lastName = last;
}
bool personType::operator==(const personType& right) const
{
return(firstName == right.firstName &&
lastName == right.lastName);
}
bool personType::operator!=(const personType& right) const
{
return(firstName != right.firstName ||
lastName != right.lastName);
}
bool personType::operator<=(const personType& right) const
{
return(*this < right || *this == right);
}
bool personType::operator<(const personType& right) const
{
return((lastName < right.lastName) ||
(lastName == right.lastName &&
firstName < right.firstName));
}
bool personType::operator>=(const personType& right) const
{
return(*this > right || *this == right);
}
bool personType::operator>(const personType& right) const
{
return((lastName > right.lastName) ||
(lastName == right.lastName &&
firstName > right.firstName));
}
Ancient Dragon
5,243
Achieved Level 70
Team Colleague
Featured Poster
>>Can anyone help please? Thx!
Sure can. See below
int main()
{
// put your code here
}
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.