In C++, Using classes, design an online address book to keep track of the names,
ID: 3839016 • Letter: I
Question
In C++, Using classes, design an online address book to keep track of the names, addresses, phone numbers, and dates of birth of family members, close friends, and certain business associates. Your program should be able to handle a maximum of 500 entries. a. Define a class, addressType, that can store a street address, city, state, and zip code. Use the appropriate functions to print and store the address. Also, use constructors to automatically initialize the data members. b. Define a class extPersonType using the class personType (as defined in Example 1-12, Chapter 1), the class dateType (as designed in Programming Exercise 2 of Chapter 2), and the class addressType. Add a data member to this class to classify the person as a family member, friend, or business associate. Also, add a data member to store the phone number. Add (or override) the functions to print and store the appropriate information. Use constructors to automatically initialize the data members. c. Derive the class addressBookType from the class arrayListType, as defined in this chapter, so that an object of type addressBookType can store objects of type extPersonType. An object of type addressBookType should be able to process a maximum of 500 entries. Add necessary operations to the class addressBookType so that the program should perform the following operations: i. Load the data into the address book from a disk. ii. Search for a person by last name. iii. Print the address, phone number, and date of birth (if it exists) of a given person. iv. Print the names of the people whose birthdays are in a given month or between two given dates. v. Print the names of all the people having the same status, such as family, friend, or business. vi. Print the names of all the people between two last names.
Explanation / Answer
addressBookType.h
#include<iostream>
#include "elemType.h"
using namespace std;
template<class elemType>
class addressBookType {
public:
const addressBookType<elemType>& operator=(const addressBookType<elemType>&);
//Overloads the assignment operator
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 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, const elemType& item) const;
//Function to determine whether the item is the same
//as the item in the list at the position specified by
//Postcondition: Returns true if list[location]
// is the same as the item; otherwise,
// returns false.
void insertAt(int location, const elemType& insertItem);
//Function to insert an item in the list at the
//position specified by location. The item to be inserted
//is passed as a parameter to the function.
//Postcondition: Starting at location, the elements of the
// list are shifted down, list[location] = insertItem;,
// and length++;. If the list is full or location is
// out of range, an appropriate message is displayed.
void insertEnd(const elemType& insertItem);
//Function to insert an item at the end of the list.
//The parameter insertItem specifies the item to be inserted.
//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, elemType& 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.
void replaceAt(int location, const elemType& repItem);
//Function to replace the elements in the list at the
//position specified by location. The item to be replaced
//is specified by the parameter repItem.
//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;
int seqSearch(const elemType& item) const;
//Function to search the list for a given item.
//Postcondition: If the item is found, returns the location
// in the array where the item is found; otherwise,
// returns -1.
void insert(const elemType& insertItem);
//Function to insert the item specified by the parameter
//insertItem at the end of the list. However, first the
//list is searched to see whether the item to be inserted
//is already in the list.
//Postcondition: list[length] = insertItem and length++
// If the item is already in the list or the list
// is full, an appropriate message is displayed.
void remove(const elemType& removeItem);
//Function to remove an item from the list. The parameter
//removeItem specifies the item to be removed.
//Postcondition: If removeItem is found in the list,
// it is removed from the list and length is
// decremented by one.
addressBookType(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
addressBookType(const addressBookType<elemType>& otherList);
//copy constructor
~addressBookType();
//destructor
//Deallocates the memory occupied by the array.
protected:
elemType *list; //array to hold the list elements
int length; //to store the length of the list
int maxSize; //to store the maximum size of the list
};
template<class elemType>
addressBookType<elemType>::addressBookType(
const addressBookType<elemType>& otherList) {
maxSize = otherList.maxSize;
length = otherList.length;
list = new elemType[maxSize]; //create the array
assert(list != NULL); //terminate if unable to allocate
//memory space
for (int j = 0; j < length; j++) //copy otherList
list[j] = otherList.list[j];
} //end copy constructor
template<class elemType>
bool addressBookType<elemType>::isEmpty() const {
return (length == 0);
}
template<class elemType>
bool addressBookType<elemType>::isFull() const {
return (length == maxSize);
}
template<class elemType>
int addressBookType<elemType>::listSize() const {
return length;
}
template<class elemType>
int addressBookType<elemType>::maxListSize() const {
return maxSize;
}
template<class elemType>
void addressBookType<elemType>::print() const {
for (int i = 0; i < length; i++)
cout << list[i] << " ";
cout << endl;
}
template<class elemType>
bool addressBookType<elemType>::isItemAtEqual(int location,
const elemType& item) const {
return (list[location] == item);
}
template<class elemType>
void addressBookType<elemType>::insertAt(int location,
const elemType& insertItem) {
if (location < 0 || location >= maxSize)
cerr << "The position of the item to be inserted " << "is out of range"
<< endl;
else if (length >= maxSize) //list is full
cerr << "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
template<class elemType>
void addressBookType<elemType>::insertEnd(const elemType& insertItem) {
if (length >= maxSize) //the list is full
cerr << "Cannot insert in a full list" << endl;
else {
list[length] = insertItem; //insert the item at the end
length++; //increment the length
}
} //end insertEnd
template<class elemType>
void addressBookType<elemType>::removeAt(int location) {
if (location < 0 || location >= length)
cerr << "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
template<class elemType>
void addressBookType<elemType>::retrieveAt(int location,
elemType& retItem) const {
if (location < 0 || location >= length)
cerr << "The location of the item to be retrieved is "
<< "out of range." << endl;
else
retItem = list[location];
} //end retrieveAt
template<class elemType>
void addressBookType<elemType>::replaceAt(int location, const elemType& repItem) {
if (location < 0 || location >= length)
cerr << "The location of the item to be replaced is " << "out of range."
<< endl;
else
list[location] = repItem;
} //end replaceAt
template<class elemType>
void addressBookType<elemType>::clearList() {
length = 0;
} //end clearList
template<class elemType>
addressBookType<elemType>::addressBookType(int size) {
if (size < 0) {
cerr << "The array size must be positive. Creating "
<< "an array of size 100. " << endl;
maxSize = 100;
} else
maxSize = size;
length = 0;
list = new elemType[maxSize];
assert(list != NULL);
}
template<class elemType>
addressBookType<elemType>::~addressBookType() {
delete[] list;
}
template<class elemType>
const addressBookType<elemType>& addressBookType<elemType>::operator=(
const addressBookType<elemType>& otherList) {
if (this != &otherList) //avoid self-assignment
{
delete[] list;
maxSize = otherList.maxSize;
length = otherList.length;
list = new elemType[maxSize]; //create the array
assert(list != NULL); //if unable to allocate memory
//space, terminate the program
for (int i = 0; i < length; i++)
list[i] = otherList.list[i];
}
return *this;
}
template<class elemType>
int addressBookType<elemType>::seqSearch(const elemType& item) const {
int loc;
bool found = false;
for (loc = 0; loc < length; loc++)
if (list[loc] == item) {
found = true;
break;
}
if (found)
return loc;
else
return -1;
} //end seqSearch
template<class elemType>
void addressBookType<elemType>::insert(const elemType& insertItem) {
int loc;
if (length == 0) //list is empty
list[length++] = insertItem; //insert the item and
//increment the length
else if (length == maxSize)
cerr << "Cannot insert in a full list." << endl;
else {
loc = seqSearch(insertItem);
if (loc == -1) //the item to be inserted
//does not exist in the list
list[length++] = insertItem;
else
cerr << "the item to be inserted is already in "
<< "the list. No duplicates are allowed." << endl;
}
} //end insert
template<class elemType>
void addressBookType<elemType>::remove(const elemType& removeItem) {
int loc;
if (length == 0)
cerr << "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
addressType.h
#include<iostream>
using namespace std;
class addressType {
public:
addressType(string, string, string, string);
addressType();
void print() const;
private:
string streetAddress;
string city;
string state;
string zipCode;
};
/***
*
*/
addressType::addressType(string s, string c, string state, string zip) {
this->streetAddress = s;
this->city = c;
this->state = state;
this->zipCode = zip;
}
void addressType::print() const {
cout << streetAddress << ", " << city << ", " << state << ", " << zipCode
<< endl;
}
dateType.h
#include<iostream>
using namespace std;
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 print() const;
//Function to output the date in the form mm-dd-yyyy.
bool isLeapYear(int);
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:
int dMonth; //variable to store the month
int dDay; //variable to store the day
int dYear; //variable to store the year
};
//Constructor with parameters
dateType::dateType(int month, int day, int year) {
setDate(month, day, year);
}
void dateType::setDate(int month, int day, int year) {
if (month >= 1 and month <= 12) {
dMonth = month;
}
if (day >= 1 and day <= 31) {
dDay = day;
}
dYear = year;
}
bool dateType::isLeapYear(int year) {
if (((year % 4 == 0) && (year % 100 == 0) && (year % 400 == 0))) {
return true;
}
return false;
}
int dateType::getDay() const {
return dDay;
}
int dateType::getMonth() const {
return dMonth;
}
int dateType::getYear() const {
return dYear;
}
void dateType::print() const {
cout << dMonth << "-" << dDay << "-" << dYear;
}
elemType.h
#include"extPersonType.h"
class elemType {
public:
bool isEmpty();
bool isFull();
void search(const elemType& searchItem, bool& found);
void insert(const elemType& newElement);
void remove(const elemType& removeElement);
void destroyList();
void printList();
elemType();
private:
extPersonType list[100]; //array to hold the list elements
int length;
};
personType.h
#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 the first name.
//Postcondition: The value of firstName is returned.
string getLastName() const;
string setRelation(string) const;
//Function to return the last name.
//Postcondition: The value of lastName is returned.
personType();
//Default constructor
//Sets firstName and lastName to null strings.
//Postcondition: firstName = ""; lastName = "";
personType(string first, string last);
//Constructor with parameters.
//Sets firstName and lastName according to the parameters.
//Postcondition: firstName = first; lastName = last;
private:
string firstName; //variable to store the first name
string lastName; //variable to store the last name
};
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;
}
//Default constructor
personType::personType() {
firstName = "";
lastName = "";
}
//Constructor with parameters
personType::personType(string first, string last) {
firstName = first;
lastName = last;
}
extPersonType.h
//************************************************************
// Author: Rahul Raj
//
// class extPersonType
// This class specifies the members to implement a name.
//************************************************************
#include <string>
#include "dateType.h"
#include "personType.h"
#include "addressType.h"
using namespace std;
class extPersonType {
public:
void print() const;
extPersonType(string phoneNumber, string relation, personType person,
dateType date, addressType address);
//Constructor with parameters.
private:
string phoneNumber;
string relation;
personType person;
dateType date;
addressType address;
};
extPersonType::extPersonType(string phoneNumber, string relation,
personType person, dateType date, addressType address) {
this->phoneNumber = phoneNumber;
this->relation = relation;
this->person = person;
this->address = address;
this->date = date;
}
void extPersonType::print() const {
person.print();
cout << endl;
cout << "He is " << relation << endl;
address.print();
cout << endl;
cout << "He was born in ";
date.print();
cout << endl;
cout << "Phone Number: " << phoneNumber << endl;
}
Test.cpp
#include<iostream>
#include"addressBookType.h"
using namespace std;
int main() {
addressBookType<extPersonType> entries[500];
cout << "Load Names: ";
extPersonType temp("12313"."friend",personType("Nick","Johnson"),date(12,2,2015),addressType("","","",""));
entries[0] = temp;
return 0;
}