Question

C++ program, item.cpp implementation.

Implementation: You are supposed to write three classes, called Item, Node and Inventory respectively Item is a plain data class with item id, name, price and quantity information accompanied by getters and setters Node is a plain linked list node class with Item pointer and next pointer (with getters/setters) Inventory is an inventory database class that provides basic linked list operations, delete load from file / formatted print functionalities. The majority of implementation will be done in this class as well as find / add / The following diagram illustrates the data structure maintained by your Inventory class: Inventory Node Item head id item 30001 DietCoke next name price 1.99 35 quantity item id 30002 CokeZero next name price 1.98 32 quantity item id 40001 Milk1Gal next name price 2.49 _quantity 30 nullptr The top left corner of the above figure shows the only private data member of the Inventory class: _head, a pointer to the first node in the linked list. The value is nullptr if the list is empty. Just to the right of these two data members is a column (in blue) of list nodes linked. Each node of the (singly) linked list has a next field, and an item field storing a pointer to an Item object. The Item object that the item field of each node points to are displayed (in green) to the right. The types of the four fields are int, string, double, and int, respectively For all nodes in the list except the last node, the next field of the node at position pos will point to the next node. Thenext field of the last node will point to nullptr Note that the order of the items is last-come-first-out. That is, the most recently added node is at the head. We do not manage a tail pointer this time Files you will submit: stockmgmt.cpp item.h contains your main function contains the Item class declaration contains the Item class member function definitions contains the Node/Inventory class declaration contains the Node/Inventory class member function definitions item.cpp inventory.h inventory.cpp The following table explains each of the members that you will need to implement. Description Class Access Member id int name: string price: double Private ID Private Item name Item price Quantity of item in stock Creates an item using the values given by the parameters. Private quantity: int Itemint, Private Public const string&, double, int) int getID() const Item Public Accessor, returns the ID

Answer 1

This class contains the item class definitions and declarations:

#include<string>

using namespace std;

class Item

{

private:

int _id;

string _name;

double _price;

int _quantity;

public:

Item(int _id,const string& _name,double _price,int _quantity);

void setId(int id)

{ _id=id;}

void setprice(double amount)

{ _price=amount;}

void setquantity(int quant)

{ _quanitity = quant;}

void getId(int id)

{ return _id;}

void getprice(double amount)

{ return _price;}

void getquantity(int quant)

{ return _quantity;}

The class i'am going to write is the Inventory class and consists of all the class member function definitions and initializations. Here we use stack methods as last come first out method is used here.

template<class T>

class dynstack

{

private:

struct StackNode;

{

T value;

Stacknode *next;

};

Stacknode *top;

public:

Dynstack()

{ top = null; }

void push(T);

void pop(T &);

bool isEmpty();

};

template <class t>

voidDynstack<T>::push(T num)

{

Stacknode *newNode;

newNode = new Stacknode;

newNode ->value = num;

if(isEmpty())

{

top = newNode;

newNode->next = Null

}

else

{

newNOde->next = top;

top = newNode;

}

}

template<class T>

void Dynstack<T>::pop(T &num)

{

Stacknode *temp;

if(isempty())

{

cout<<"The stack is empty";

}

else

{

num = top->value;

temp = top->next;

top = temp;

}

}

template <class T>

bool Dynstack<T>::isEmpty()

{

bool status;

if(!top)

status = true;

else

status = false;

return status;

}

main function:

#include<iostream>

#include "Item.h"

#include"Dynstack.h"

using namespace std;

int main()

{

DynStack<Item>stack; #create a stack

Item item; #create an object

int choice;

char _name;

double _price;

int _quantity;

do

{

count<"Inventory Menu";

cout<<"1.ENter a part in to the inventory";

cout<<"2.take a part from the inventory";

cout<<"3.Quit";

cout<<"Please take a choice";

cin>>choice;

while(<choice<1||choice>3)

{

cout<<"please enter the choice";

cin<<"choice';

}

swich(choice)

{

case 1 :

cout<<"Enter the items Name";

cin>>_name;

item.setname(_name);

cout<<"Enter the price";

item.setprice(_price);

count<<"Enter the quantity";

item.setquantity(_quantity);

stack.push(item);

break;

case 2:

cout<<"You have chosen to take a part from inventory";

if(stack.isEmpty())

count<<"No parts to be removed;

else

{

stack.pop(item);

cout<<"The part removed was";

cout<<"Name"<<item.getname();

cout<<"Price"<<item.getprice();

cout<<"Quantity"<<item.getquantity();

}

break;

case 3:

while(!stack.isEmpty())

{

stack.pop(item);

cout<<"The part left in ithe inventory";

cout<<"Name"<<item.getname();

cout<<"Price"<<item.getprice();

cout<<"quantity"<<item.getquantity();

}

}

}

}

hope this helps! Please revert if any help needed.