Data-Structures/ArrayQueueType.cpp at main · Salmamohamedd/Data-Structures · 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
template <class Type>
queueType<Type>::queueType(int maxSize) {
    maxQueueSize = maxSize;
    list = new Type[maxQueueSize];
    queueFront = 0;
    queueRear = - 1;
    count = 0;
}

template<class Type>
bool queueType<Type>::isEmptyQueue() const {
    return (count == 0);
}

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

template <class Type>
Type queueType<Type>::front() const
{
    assert(!isEmptyQueue());
    return list[queueFront];
}

template <class Type>
Type queueType<Type>::back() const
{
    assert(!isEmptyQueue());
    return list[queueRear];
}

template <class Type>
void queueType<Type>::enqueue(const Type& newElement)
{
    if (!isFullQueue())
    {
        cout << "Inserting " << newElement << "\n";
        queueRear = (queueRear + 1) % maxQueueSize;
    //use the
    //mod operator to advance queueRear
    //because the array is circular

        count++;
        list[queueRear] = newElement;


    }
    else
        cout << "Cannot add to a full queue." << endl;
}

template <class Type>
Type queueType<Type>::dequeue()
{
    if (!isEmptyQueue())
    {
        int x = list[queueFront];
        cout << "Removing " << x << endl;
        queueFront = (queueFront + 1) % maxQueueSize;
        //use the
        //mod operator to advance queueFront
        //because the array is circular
        count--;
        return x;
    }
    else
        cout << "Cannot remove from an empty queue" << endl;
}

template <class Type>
int queueType<Type>::queueSize(){
    return count;
}

template <class Type>
void queueType<Type>::clear(){
    count = 0;
    queueRear = -1;
    queueFront = 0;
}

template <class Type>
void queueType<Type>::print(){
    if (isEmptyQueue()) {
        cout << "The queue is empty." << endl;
    } else {
        int frontIndex = queueFront;
        for (int i = 0; i < count; i++) {
            cout << list[frontIndex] << " ";
            frontIndex = (frontIndex + 1) % maxQueueSize;
        }
        cout << "\n";
    }
}