/* This program is a database program that will store
video tape names, minutes, year released, and price
I want it to be professional so that *YOU* will want
to buy it and use it for a video store, j/k about that
but i want it to be professional */
// note to leor, display works fine, you must have
// pressed update
#include<iostre am>
#include<string >
using namespace std;
int totalnodes= 0; // the nodes in this case are tapes
template<class X>
class Lnode{
public:
X value;
Lnode * next;
};
template<class Y>
class linkedlist{
Lnode<Y> *head;
public:
linkedlist();
~linkedlist();
void addNode(Y &); // insert a video
void deleteNode(Y &);
void updateNode(Y &);
void displayNode()co nst;
void searchNode(cons t Y &);
};
class VideoTape{
string name;
double time;
int year;
double price;
public:
VideoTape();
VideoTape(strin g);
~VideoTape();
friend istream& operator >>(istream &,VideoTape &);
friend ostream& operator <<(ostream &,const VideoTape &);
friend bool operator < (const VideoTape &, const VideoTape &);
friend bool operator > (const VideoTape &, const VideoTape &);
friend bool operator != (const VideoTape &, const VideoTape &);
friend bool operator == (const VideoTape &, const VideoTape &);
void changetime(doub le);
void changeyear(int) ;
void changeprice(dou ble);
};
template<class Y>
linkedlist<Y>:: linkedlist(){
head = NULL;
}
template<class Y>
linkedlist<Y>:: ~linkedlist(){
Lnode<Y> *nodePtr;
nodePtr = head;
while(nodePtr != NULL)
{
head = nodePtr->next;
delete nodePtr;
nodePtr = head;
}
}
template<class Y>
void linkedlist<Y>:: addNode(Y &n){
Lnode<Y> * newnode, * nodePtr, * previousNode;
newnode = new Lnode<Y>;
newnode->value = n;
// Empty linked list
if(!head)
{
head = newnode;
newnode->next = NULL;
totalnodes++;
}
// not empty list
else
{
nodePtr = head;
// If head's value is greater and not equal to n
if(nodePtr->value > n && nodePtr->value != n){
previousNode = head;
head = newnode;
newnode->next = previousNode;
totalnodes++;
}
else{
// cycle through numbers while he pointer's value is less than n,
// and, also while the pointer's value does not equal n
while(nodePtr != NULL && nodePtr->value < n
&& nodePtr->value != n)
{
previousNode = nodePtr;
nodePtr = nodePtr->next;
}
// the while loop ends
// if the number is duplicate and the loop did not end at end of
// list
if(nodePtr != NULL)
if(nodePtr->value == n){
cout << "Tape name already exist" << endl;
cout << "Did not add tape" << endl;
return;
}
// if not then insert the newnode
previousNode->next = newnode;
newnode->next = nodePtr;
totalnodes++;
}
}
}
// Delete a node from the linked list
template<class Y>
void linkedlist<Y>:: deleteNode(Y &n)
{
Lnode<Y> *nodePtr, *previousnode;
//empty linked list
if(!head)
{
cout << "empty list" << endl;
return;
}
//delete the first node
if(head->value == n){
nodePtr = head->next;
delete head;
head = nodePtr;
totalnodes--;
}
else
{
nodePtr = head;
while(nodePtr != NULL && nodePtr->value != n){
previousnode = nodePtr;
nodePtr = nodePtr->next;
}
// if there is no number in the list that matches
// then the nodePtr points to NULL
if(nodePtr == NULL)
return;
previousnode->next = nodePtr->next;
delete nodePtr;
totalnodes--;
}
}
template<class Y>
void linkedlist<Y>:: updateNode(Y &n){
Lnode<Y> * nodePtr;
char choice;
double tmptime;
int tmpyear;
double tmpprice;
nodePtr = head;
if(!head){
cout << "The list is empty" << endl;
}
else{
while(nodePtr != NULL && nodePtr->value != n){
nodePtr = nodePtr->next;
}
if(nodePtr->value == n){
cout << nodePtr->value << endl;
cout << "Update the running time, year realeased, ";
cout << "or price" <<
endl;
cout << "a. Running time" << endl;
cout << "b. Year released" << endl;
cout << "c. Price" << endl;
cin.clear();
cin >> choice;
while(toupper(c hoice) != 'A' && toupper(choice) != 'B'
&& toupper(choice) != 'C'){
cout << "Invalid choice" << endl;
cout << "Please try again" << endl;
cout << "Update the running time, year realeased, ";
cout << "or price" <<
endl;
cout << "a. Running time" << endl;
cout << "b. Year released" << endl;
cout << "c. Price" << endl;
cin.clear();
cin >> choice;
}
switch(choice){
case 'A':
cout << "Enter the new running time" << endl;
cin >> tmptime;
nodePtr->value.changeti me(tmptime);
break;
case 'B':
cout << "Enter the new Year released" << endl;
cin >> tmpyear;
nodePtr->value.changeye ar(tmpyear);
break;
case 'C':
cout << "Enter the new Price" << endl;
cin >> tmpprice;
nodePtr->value.changepr ice(tmpprice);
break;
}
}
else if(nodePtr == NULL){
cout << "The video tape does not exist in the list";
cout << endl;
}
}
}
template<class Y>
void linkedlist<Y>:: displayNode()co nst {
Lnode<Y> * nodePtr;
nodePtr = head;
// Empty list
if(!head){
cout << "The list is empty" << endl;
return;
}
else{
cout << "Total of video tapes:" << totalnodes << endl;
cout << "Name\t\tRunnin g Time\tYear Released\tPrice " << endl;
while(nodePtr != NULL){
cout << nodePtr->value;
nodePtr = nodePtr->next;
}
cout << endl;
}
}
template<class Y>
void linkedlist<Y>:: searchNode(cons t Y &n){ // copyright by john cho
Lnode<Y> *nodePtr;
nodePtr = head;
// Empty list
if(!head){
cout << "The list is empty" << endl;
return;
}
else{
while(nodePtr != NULL && nodePtr->value != n){
nodePtr = nodePtr->next;
}
if(nodePtr->value == n)
cout << nodePtr->value;
else{
cout << "There is no such video tape in the list" << endl;
}
}
}
VideoTape::Vide oTape(){
time = 0;
year = 0;
price = 0;
}
VideoTape::Vide oTape(string n){
name = n;
time = 0;
year = 0;
price = 0;
}
VideoTape::~Vid eoTape(){
}
istream& operator >>(istream &in, VideoTape &vtape){
cout << "Enter Video Tape name" << endl;
in >> vtape.name;
cout << "Enter Running time" << endl;
in >> vtape.time;
cout << "Enter release year" << endl;
in >> vtape.year;
cout << "Enter price" << endl;
in >> vtape.price;
return in;
}
ostream& operator <<(ostream &out, const VideoTape &vtape2){
out << vtape2.name;
out << "\t\t";
out << vtape2.time;
out << "\t\t";
out << vtape2.year;
out << "\t\t$";
out << vtape2.price;
out << endl;
return out;
}
bool operator < (const VideoTape &a, const VideoTape &b){
return a.name < b.name;
}
bool operator > (const VideoTape &a, const VideoTape &b){
return a.name > b.name;
}
bool operator != (const VideoTape &a, const VideoTape &b){
return a.name != b.name;
}
bool operator == (const VideoTape &a, const VideoTape &b){
return a.name == b.name;
}
void VideoTape::chan getime(double t){
time = t;
}
void VideoTape::chan geyear(int y){
year = y;
}
void VideoTape::chan geprice(double p){
price = p;
}
int main(){
linkedlist<Vide oTape> thelist;
VideoTape avideo;
char choice;
string tapename;
do{
cout << "Videotape SYSTEM" << endl;
cout << "a. Add" << endl;
cout << "b. Delete" << endl;
cout << "c. Update" << endl;
cout << "d. Display" << endl;
cout << "e. Search" << endl;
cout << "x. Exit" << endl;
cin >> choice;
while(toupper(c hoice) != 'A' && toupper(choice) != 'B' &&
toupper(choice) != 'C' && toupper(choice) != 'D' &&
toupper(choice) != 'E' && toupper(choice) != 'X'){
cout << "Invalid entry, Please try again" << endl << endl;
cout << "Videotape SYSTEM" << endl;
cout << "a. Add" << endl;
cout << "b. Delete" << endl;
cout << "c. Update" << endl;
cout << "d. Display" << endl;
cout << "e. Search" << endl;
cout << "x. Exit" << endl;
cin.clear(); // clear multiple letters in the cin stream
cin >> choice;
cout << endl;
}
if(toupper(choi ce) == 'A'){
cout << "Enter a video tape" << endl;
cin >> avideo;
thelist.addNode (avideo);
}
else if(toupper(choi ce) == 'B'){
cout << "Enter a video tape name" << endl;
cin.clear(); // clear the istream
cin >> tapename;
thelist.deleteN ode(VideoTape(t apename));
}
else if(toupper(choi ce) == 'C'){
cout << "Enter a video tape name" << endl;
cin.clear(); // clear the istream
cin >> tapename;
thelist.updateN ode(VideoTape(t apename));
}
else if(toupper(choi ce) == 'D')
thelist.display Node();
else if(toupper(choi ce) == 'E'){
cout << "Enter a video tape name" << endl;
cin.clear();
cin >> tapename;
thelist.searchN ode(VideoTape(t apename));
}
}while(toupper( choice) != 'X');
return 0;
}
