C++ Data Structure_mystack.pop() & myqueue.serve() infinite loop of eof()
C++ Data Structure_mystack.pop() & myqueue.serve() infinite loop of eof()
data file is like
append 20
push 50
push 20
pop
serve
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
|
#pragma once
#include <iostream>
#include <fstream>
#include <string>
#include <cstdlib>
#include <stack>
#include <queue>
#include "Queue.h"
#include "Stack.h"
using namespace std;
int main(){
Queue myqueue;
Stack mystack;
ifstream inputFile;
string fileName;
cout << "Enter the file name you would like to use with file type e.g. data.txt: ";
cin >> fileName;
inputFile.open(fileName);
string name;
int value;
cout << "Operation" << "\t" << "Stack" << "\t" << "Value" << "\t" << "Result" "\n";
cout << "------------------------------------------\n";
inputFile >> name >> value;
while (!inputFile.eof())
{
if (name == "push")
{
cout << name << "\t" << "\t" << "stack" << "\t" << value << "\t" << "success" << endl;
inputFile >> name >> value;
mystack.Push(value);
}
else if (name == "pop")
{
if (mystack.IsEmpty() == true)
{
cout << name << "\t" << "\t" << "stack" << "\t" << "---" << "\t" << "underflow" << endl;
}
else if (mystack.IsEmpty() == false)
{
cout << name << "\t" << "\t" << "stack" << "\t" << "---" << "\t" << "success" << endl;
}
inputFile >> name >> value;
mystack.Pop(value);
break;
}
else if (name == "append")
{
cout << name << "\t" << "\t" << "stack" << "\t" << value << "\t" << "success" << endl;
inputFile >> name >> value;
myqueue.append(value);
}
else if (name == "serve")
{
if (myqueue.IsEmpty() == true)
{
cout << name << "\t" << "\t" << "stack" << "\t" << "---" << "\t" << "underflow" << endl;
}
else if (myqueue.IsEmpty() == false)
{
cout << name << "\t" << "\t" << "stack" << "\t" << "---" << "\t" << "success" << endl;
}
inputFile >> name >> value;
myqueue.serve(value);
break;
}
}
cout << endl;
cout << "Stack" << endl;
cout << "-------" << endl;
mystack.Print();
cout << endl;
cout << "Queue" << endl;
cout << "-------" << endl;
myqueue.Print();
inputFile.close();
cout << endl;
system("Pause");
}
//-----------------------------------------------------------
// serve data from the queue.
//-----------------------------------------------------------
void Queue::serve(int &item)
{
// Check if empty
if (IsEmpty())
cout << "underflow\n";
// serve data
else
{
item = Data[Front];
Front = (Front + 1) % QUEUE_SIZE;
Count--;
}
}
//-----------------------------------------------------------
// Pop data from the stack.
//-----------------------------------------------------------
void Stack::Pop(int &Number)
{
// Check for empty stack
if (IsEmpty())
return;
// Extract information from node
Number = Head->Number;
// Pop item from linked list
SNode *Temp = Head;
Head = Head->Next;
delete Temp;
Length--;
// cout << "Pop " << Number << endl;
}
<Stack>
bool Stack::IsEmpty()
{
return (Length == 0);
}
<Queue>
bool Queue::IsEmpty()
{
return (Count <= 0);
}
|
Last edited on
Topic archived. No new replies allowed.