![//This is the main file
#include "item.h"
#include "itemList.h"
int main()
{
//create a list of items
ItemList groceryList;
//create temp variables
Item anItem;
int count = 0, newNum = 0;
char newName[MAXCHAR], findName[MAXCHAR];
//read from user and add to list
cin >> count;
cin.ignore(100, 'n');
for(int i = 0; i < count; i++)
{
cin >> newName;
cin >> newNum;
cin.ignore(100, 'n');
anItem.setItemName(newName);
anItem.setNumItems(newNum);
groceryList.InsertAtFront(anItem);
}
groceryList.showList();
cin >> findName;
if(!groceryList.findItem(findName))
{
cout << "Item not found!";
}
return 0;
}
item.h
//Item header file
//
#pragma once
#include <iostream>
#include <cstring>
using namespace std;
//constant for char arrays
const int MAXCHAR = 101;
//class definition
class Item {](https://image.slidesharecdn.com/thisisthemainfileincludeitemhincludeitemlist-230318111347-345f7ee1/85/This-is-the-main-file-include-itemh-include-itemList-pdf-1-320.jpg)
![private:
char *itemName;
int numberOfItems;
public:
//Constructors
Item();
Item(char *, int);
//copy constructor
Item(const Item &anItem);
//destructor
~Item();
//mutators
void setItemName(char *);
void setNumItems(int);
//accessors
void getItemName(char *);
int getNumItems();
//print item
void printItem();
//assignment op overloading
Item& operator= (const Item& anItem);
};
item.cpp
//This is the implementation file for item.h (the Item class)
#include "item.h"
//default constructor
Item::Item()
{
//allocate memory for itemName
itemName = new char[MAXCHAR];
strcpy(this->itemName, "no name");
numberOfItems = 0;
}
//constructor with parameters
Item::Item(char tempItemName[], int tempNumItems)
{
//allocate memory for itemName
itemName = new char[strlen(tempItemName) + 1];
strcpy(itemName, tempItemName);
numberOfItems = tempNumItems;
}
//Copy Constructor](https://image.slidesharecdn.com/thisisthemainfileincludeitemhincludeitemlist-230318111347-345f7ee1/85/This-is-the-main-file-include-itemh-include-itemList-pdf-2-320.jpg)
![Item::Item(const Item &anItem)
{
//allocate memory for itemName
itemName = new char[strlen(anItem.itemName) + 1];
strcpy(itemName, anItem.itemName);
numberOfItems = anItem.numberOfItems;
}
//destructor
Item::~Item()
{
//deallocate the memory for itemName
if(itemName)
{
delete [] itemName;
itemName = NULL;
}
}
//mutator functions
void Item::setItemName(char *newItemName)
{
if(itemName)
{
delete [] itemName;
}
itemName = new char[strlen(newItemName) + 1];
strcpy(itemName, newItemName);
}
//for numberofitems
void Item::setNumItems(int newNum)
{
numberOfItems = newNum;
}
//accessor functions
void Item::getItemName(char *returnItemName)
{
strcpy(returnItemName, itemName);
}
int Item::getNumItems()
{
return numberOfItems;
}
//print the item](https://image.slidesharecdn.com/thisisthemainfileincludeitemhincludeitemlist-230318111347-345f7ee1/85/This-is-the-main-file-include-itemh-include-itemList-pdf-3-320.jpg)
This is the main file include itemh include itemList.pdf
- 1. //This is the main file #include "item.h" #include "itemList.h" int main() { //create a list of items ItemList groceryList; //create temp variables Item anItem; int count = 0, newNum = 0; char newName[MAXCHAR], findName[MAXCHAR]; //read from user and add to list cin >> count; cin.ignore(100, 'n'); for(int i = 0; i < count; i++) { cin >> newName; cin >> newNum; cin.ignore(100, 'n'); anItem.setItemName(newName); anItem.setNumItems(newNum); groceryList.InsertAtFront(anItem); } groceryList.showList(); cin >> findName; if(!groceryList.findItem(findName)) { cout << "Item not found!"; } return 0; } item.h //Item header file // #pragma once #include <iostream> #include <cstring> using namespace std; //constant for char arrays const int MAXCHAR = 101; //class definition class Item {
- 2. private: char *itemName; int numberOfItems; public: //Constructors Item(); Item(char *, int); //copy constructor Item(const Item &anItem); //destructor ~Item(); //mutators void setItemName(char *); void setNumItems(int); //accessors void getItemName(char *); int getNumItems(); //print item void printItem(); //assignment op overloading Item& operator= (const Item& anItem); }; item.cpp //This is the implementation file for item.h (the Item class) #include "item.h" //default constructor Item::Item() { //allocate memory for itemName itemName = new char[MAXCHAR]; strcpy(this->itemName, "no name"); numberOfItems = 0; } //constructor with parameters Item::Item(char tempItemName[], int tempNumItems) { //allocate memory for itemName itemName = new char[strlen(tempItemName) + 1]; strcpy(itemName, tempItemName); numberOfItems = tempNumItems; } //Copy Constructor
- 3. Item::Item(const Item &anItem) { //allocate memory for itemName itemName = new char[strlen(anItem.itemName) + 1]; strcpy(itemName, anItem.itemName); numberOfItems = anItem.numberOfItems; } //destructor Item::~Item() { //deallocate the memory for itemName if(itemName) { delete [] itemName; itemName = NULL; } } //mutator functions void Item::setItemName(char *newItemName) { if(itemName) { delete [] itemName; } itemName = new char[strlen(newItemName) + 1]; strcpy(itemName, newItemName); } //for numberofitems void Item::setNumItems(int newNum) { numberOfItems = newNum; } //accessor functions void Item::getItemName(char *returnItemName) { strcpy(returnItemName, itemName); } int Item::getNumItems() { return numberOfItems; } //print the item
- 4. void Item::printItem() { cout << numberOfItems << ' ' << itemName << endl; } //assignment operator overload Item& Item::operator= (const Item& anItem) { //if it is a self copy, don't do anything if (this == &anItem) return *this; //make current object *this a copy of the passed in item else { this->setItemName(anItem.itemName); this->numberOfItems = anItem.numberOfItems; return *this; } } itemList.h //This is the itemList header file. //Class for a list of items #pragma once #include "item.h" //define class for a list of items class ItemList { private: //struct for each Node struct Node { Item data; Node *next; }; Node *head; Node *tail; int size; public: //constructors ItemList(); //destructor ~ItemList(); //database functions
- 5. void InsertAtFront(Item &); bool findItem(char *); void showList(); int getSize(); }; itemList.cpp //The implementation file itemList.h, ItemList class #include "itemList.h" //constructors ItemList::ItemList() { head = NULL; tail = NULL; size = 0; } //destructor ItemList::~ItemList() { //delete list Node *curr = head; while(curr) { head = curr->next; delete curr; curr = head; } tail = NULL; } //Add an item to the list /*Your code goes here */ //Returns the size of the list int ItemList::getSize(){ return size; } //displays the list void ItemList::showList() { Node *curr; for(curr = head; curr; curr = curr->next) { curr->data.printItem(); }
- 6. cout << endl; } //finds an item with the given name /* Your code goes here */ 22.10 LAB: Inventory (Linear Linked lists: insert at the front of a list and find something) Given main), define the following functions: - An InsertAtFront0 member function in the ItemList class that inserts items at the front of a linked list (always add to the head pointer). - A findltem0 function in the ItemList class that returns something Check the prototypes in itemList.h before you write the functions. Do not change these prototypes. Do not change anything else in any other files. The code in main0 reads input from the user and calls the InsertAtFront() function to add the items. The first input is the number of items followed by the item name and the number of items separated by space. Then it reads an item name from the user and finds the item in the list. Ex. If the input is: 4 plates 100 spoons 200 cups 150 forks 200 forks the output is: