Question

This is a C++ program about link list, please help me complete the codes, thanks!(the .h file has been provided)

/*
 * List.h
 * 
 * Class Description: List data collection ADT.
 * Class Invariant: Data collection with the following characteristics:
 *                   - Each element is unique (no duplicates).
 *                   - (What other characteristic does our List have?)
 *
 * 
 * 
 */

#pragma once

// You can add #include statements if you wish.
#include <string>
#include "Patient.h"

using namespace std;


class List  {

private:

/* 
 * You can add more attributes to this class, 
 * but you cannot remove the attributes below 
 * nor can you change them.
 */

        static const int MAX_ELEMENTS = 5; // Small capacity so can test when data collection becomes full
                                           // ***As we are testing the code of our assignment, we can  
                                           //    change the value given to this constant.***
        Patient elements[MAX_ELEMENTS];    // Data structure with capacity of MAX_ELEMENTS
        int elementCount;                  // Current element count in element array
        int capacity;                      // Actual maximum capacity of element array   

public:

/* 
 * You can add more methods to this interface, 
 * but you cannot remove the methods below 
 * nor can you change their prototype.
 * 
 */

        // Default constructor
        List();

        // Description: Returns the total element count currently stored in List.
        int  getElementCount() const;

        // Description: Insert an element.
        // Precondition: newElement must not already be in data collection.  
        // Postcondition: newElement inserted and elementCount has been incremented.   
        bool insert(const Patient& newElement);

        // Description: Remove an element. 
        // Postcondition: toBeRemoved is removed and elementCount has been decremented. 
        bool remove( const Patient& toBeRemoved );
        
        // Description: Remove all elements.
        void removeAll();
   
        // Description: Search for target element.
        //              Returns a pointer to the element if found,
        //              otherwise, returns NULL.
        Patient* search(const Patient& target);
   

}; // end List.h

Answer 1

//Please upvote for the answer.

//Patient.h

#pragma once

#include <string>

using namespace std;

class Patient

{

public:

Patient();

Patient(string name);

~Patient();

private:

string m_strName;

public:

void SetName(string str);

string GetName();

bool operator==(const Patient& target);

};

//Patient.cpp

#include "Patient.h"

Patient::Patient()

{

}

Patient::Patient(string name)

{

m_strName = name;

}

Patient::~Patient()

{

}

void Patient::SetName(string str)

{

m_strName = str;

}

string Patient::GetName()

{

return m_strName;

}

bool Patient::operator==(const Patient & target)

{

bool isSame = (m_strName == target.m_strName);

return isSame;

}

//List.h

#pragma once

/*

* List.h

*

* Class Description: List data collection ADT.

* Class Invariant: Data collection with the following characteristics:

*                   - Each element is unique (no duplicates).

*                   - (What other characteristic does our List have?)

*

*

*

*/

#pragma once

// You can add #include statements if you wish.

#include <string>

#include "Patient.h"

using namespace std;

class List {

private:

/*

* You can add more attributes to this class,

* but you cannot remove the attributes below

* nor can you change them.

*/

static const int MAX_ELEMENTS = 5; // Small capacity so can test when data collection becomes full

  // ***As we are testing the code of our assignment, we can

  //   change the value given to this constant.***

Patient elements[MAX_ELEMENTS];    // Data structure with capacity of MAX_ELEMENTS

int elementCount;                  // Current element count in element array

int capacity;                      // Actual maximum capacity of element array   

public:

/*

* You can add more methods to this interface,

* but you cannot remove the methods below

* nor can you change their prototype.

*

*/

// Default constructor

List();

// Description: Returns the total element count currently stored in List.

int getElementCount() const;

// Description: Insert an element.

// Precondition: newElement must not already be in data collection.

// Postcondition: newElement inserted and elementCount has been incremented.   

bool insert(const Patient& newElement);

// Description: Remove an element.

// Postcondition: toBeRemoved is removed and elementCount has been decremented.

bool remove(const Patient& toBeRemoved);

// Description: Remove all elements.

void removeAll();

// Description: Search for target element.

//              Returns a pointer to the element if found,

//              otherwise, returns NULL.

Patient* search(const Patient& target);

void DisplayList();

}; // end List.h

//List.cpp

#include "List.h"

#include<iostream>

#include<string>

using namespace std;

List::List()

{

elementCount = 0;

}

int List::getElementCount() const

{

return elementCount;

}

bool List::insert(const Patient & newElement)

{

if (elementCount >= MAX_ELEMENTS)

{

cout << "Element can't be inserted" << endl;

return false;

}

elements[elementCount] = newElement;

elementCount++;

}

bool List::remove(const Patient & toBeRemoved)

{

bool isElementFound = false;

int i = 0;

for ( i = 0;i < elementCount && !isElementFound;i++)

{

if (elements[i] == toBeRemoved)

{

//element found in the array.

isElementFound = true;

}

}

if (isElementFound)

{

cout << "Patient - " << elements[i].GetName() << " Will be removed" << endl;

for (--i;i < elementCount-1;i++)

{

elements[i] = elements[i + 1];

}

elementCount -= 1;

}

return false;

}

void List::removeAll()

{

elementCount = 0;

}

Patient * List::search(const Patient & target)

{

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

{

if (elements[i] == target)

{

return &elements[i];

}

}

return NULL;

}

void List::DisplayList()

{

cout << "Paitents count: " << elementCount << endl;

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

cout << elements[i].GetName()<<endl;

cout << endl;

}

//Main Program

#include "List.h"

#include "Patient.h"

#include<iostream>

using namespace std;

int main()

{

List obj;

cout<<"Initial Count" << obj.getElementCount() << endl;

Patient p1("John");

Patient p2("Mary");

Patient p3("David");

Patient p4("Stark");

Patient p5("keith");

Patient p6("Tom");

obj.insert(p1);

obj.insert(p2);

obj.DisplayList();

obj.insert(p3);

obj.insert(p4);

obj.insert(p5);

obj.DisplayList();

obj.insert(p6);

obj.remove(p4);

obj.DisplayList();

obj.insert(p6);

obj.DisplayList();

Patient* p = obj.search(p3);

if (p != NULL)

cout << "patient search result- " << p->GetName() << endl;

p = obj.search(p4);

if (p == NULL)

cout << "Patient not found" << endl;

obj.removeAll();

obj.DisplayList();

}

//sample output