aboutsummaryrefslogtreecommitdiff
path: root/Project1/program.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'Project1/program.cpp')
-rw-r--r--Project1/program.cpp54
1 files changed, 44 insertions, 10 deletions
diff --git a/Project1/program.cpp b/Project1/program.cpp
index 4029c61..5b28a17 100644
--- a/Project1/program.cpp
+++ b/Project1/program.cpp
@@ -22,7 +22,7 @@ int main()
contact_list contacts(MAX);
size_t t = 0;
- contacts.set_size(sizeof(newContact));
+ contacts.set_size(MAX);
while (O == 1)
{
//cout << MAX << endl;
@@ -39,16 +39,50 @@ int main()
{
case 1:
//addNew(newContact, MAX, t);
+ //contacts.AddContact(newContact);
+ //addContact(newContact, contacts.get_size(), contacts[MAX]);
+ for (auto i = 0u; i < MAX; ++i)
+ {
+ char firstName[30];
+ char lastName[30];
+ char Email[105];
+ char StreetAddress[45];
+ char City[35];
+ char State[4];
+ int Zip = 0;
+ newContact.Set_a(0);
+ newContact.Set_id(i + 1);
+ //newContact[i].count = t;
+ cin.ignore(1000, '\n');
+ cout << "Please enter each piece of information when you are prompted to" << endl;
+ cout << "enter first name: " << endl;
+ cin >> firstName;
+ newContact.Set_firstName(firstName);
+ cout << "enter last name: " << endl;
+ cin >> lastName;
+ newContact.Set_lastName(lastName);
+ cout << "enter Email: " << endl;
+ cin >> Email;
+ newContact.Set_email(Email);
+ cout << "enter Street Address: " << endl;
+ cin >> StreetAddress;
+ newContact.Set_streetAddress(StreetAddress);
+ cout << "enter city: " << endl;
+ cin >> City;
+ newContact.Set_city(City);
+ cout << "enter State as two letter abbreviation: " << endl;
+ cin >> State;
+ newContact.Set_state(State);
+ cout << "Please enter the next value as a series of numbers" << endl;
+ cout << "enter Zip: " << endl;
+ cin >> Zip;
+ newContact.Set_zip(Zip);
+ size_t id = i + 1;
+ newContact.Set_id(id);
+ newContact.print();
+ break;
+ }
contacts.AddContact(newContact);
- //if (t >= MAX) // Check if the number of contacts exceeds MAX
- //{
- // contact* newContactTemp = new contact[MAX * 2]; // Double the size
- // for (size_t i = 0; i < MAX; ++i) // Copy existing contacts
- // newContactTemp[i] = newContact[i];
- // delete[] newContact; // Deallocate old memory
- // newContact = newContactTemp; // Update pointer
- // MAX *= 2; // Update MAX
- //}
break;
case 2:
//contacts.Update(newContact);