queue-Array/QueueAsArray.h at main · Danhh-zk/queue-Array · GitHub

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
141
142
143
144
145
146
147
#pragma once
#include "QueueAsArray.h"
#include <iostream>
using namespace std;

template <class Type>
class QueueAsArray
{
private:
    int maxQueueSize;

    int count;
    int queueFront;
    int queueRear;
    Type* list;

public:
    QueueAsArray(int queueSize = 100);
    void initializeQueue();
    void destroyQueue();
    bool isEmptyQueue();
    bool isFullQueue();
    void addQueue(Type queueElement);
    void deQueue(Type& deqElement);

    ~QueueAsArray();

    const QueueAsArray<Type>& operator=(const QueueAsArray<Type>&);

    QueueAsArray(const QueueAsArray<Type>& otherQueue);
};

template <class Type>

void QueueAsArray<Type>::initializeQueue()
{
    queueFront = 0;

    queueRear = maxQueueSize - 1;

    count = 0;
}

template <class Type>
void QueueAsArray<Type>::destroyQueue()
{
    queueFront = 0;

    queueRear = maxQueueSize - 1;
    count = 0;
}

template <class Type>

bool QueueAsArray<Type>::isEmptyQueue()
{
    return (count == 0);
}

template <class Type>
bool QueueAsArray<Type>::isFullQueue()
{
    return (count == maxQueueSize);
}

template <class Type>
void QueueAsArray<Type>::addQueue(Type newElement)
{
    if (!isFullQueue())
    {
        queueRear = (queueRear + 1) % maxQueueSize;

        count++;

        list[queueRear] = newElement;
    }

    else

        cout << "cant add " << endl;
}

template <class Type>
void QueueAsArray<Type>::deQueue(Type& deqElement)

{

    if (!isEmptyQueue())
    {
        deqElement = list[queueFront];

        count--;

        queueFront = (queueFront + 1) % maxQueueSize;
    }
    else
        cout << "can't delete from empty queue." << endl;
}

template <class Type>

QueueAsArray<Type>::QueueAsArray(int queueSize)
{
    if (queueSize <= 0)
    {
        cout << "Creating an array of size 188. " << endl;

        maxQueueSize = 100;
    }
    else

        maxQueueSize = queueSize;

    queueFront = 0;

    queueRear = maxQueueSize - 1;

    count = 0;

    list = new Type[maxQueueSize];
}

template <class Type>

QueueAsArray<Type>::~QueueAsArray()
{
    delete[] list;
}

template <class Type>

const QueueAsArray<Type>& QueueAsArray<Type>::operator=(const QueueAsArray<Type>& otherQueue)

{

    cout << "Write the definition of the function "
        << "to overload the assignment operator" << endl;
}

template <class Type>

QueueAsArray<Type>::QueueAsArray(const QueueAsArray<Type>& otherQueue)

{

    cout << "Write the definition of the copy constructor" << endl;
}