This repository was archived by the owner on Jan 27, 2023. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathintQueue.h
More file actions
59 lines (42 loc) · 1.59 KB
/
Copy pathintQueue.h
File metadata and controls
59 lines (42 loc) · 1.59 KB
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
/*--------------------------------------------------------------------------+
| Name: Jerome Richards |
| Course: CNS-2400 F01 |
| |
| Program: Queue |
| File: intQueue.h |
| |
| Class declaration for intQueue |
+--------------------------------------------------------------------------*/
#ifndef INTQUEUE_H
#define INTQUEUE_H
#include <string>
#include "intNode.h"
using namespace std;
class intQueue
{
public:
// default constructor
intQueue();
// copy constructor
intQueue( const intQueue& tmpQ );
// assignment operator
intQueue& operator=( const intQueue& rhs );
// destructor
~intQueue();
enum ErrorCode { SUCCESS, UNDERFLOW, OVERFLOW, UNKNOWN };
ErrorCode Append( const NodeData& tmpData );
ErrorCode Serve();
ErrorCode Retrieve( NodeData& tmpData ) const;
bool Full() const;
bool Empty() const;
int Size() const;
string getErrStr( ErrorCode errCode ) const;
private:
intNode* _itsFront;
intNode* _itsRear;
static const int _itsMAX = 10;
int _itsCount;
void deepCopy( const intQueue& tmpQ );
void deleteNodes();
};
#endif