Ds-with-cpp-312639/QueueArrayRepresentation.cpp at master · Ethcelon/Ds-with-cpp-312639 · 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
#include<iostream>
#include<stdbool.h>
using namespace std;
template<class T>
class queue
{
    private:
        int max_size;
        int front1;
        int rear1;
        T *element;
    public:
        queue(int msize);
        queue();
        ~queue();
        bool is_empty()
        {
            return (front1 == rear1 + 1);
        }

        bool is_full()
        {
            return (rear1+1 == max_size);
        }

        T get_front()
        {
            if(!is_empty())
                return(element[front1]);
            else
                return 0;
        }

        T get_rear()
        {
            if(!is_empty())
                return(element[rear1]);
            else
                return 0;
        }
        void insert(T ele);
        T pop();
        void display();
}; // Class queue


    template<class T>
queue<T>::queue(int msize)
{
    max_size = msize;
    element = new T[max_size];
    rear1 = -1;
    front1 = 0;
}

    template<class T>
queue<T>::queue()
{
    max_size = 10;
    element = new T[max_size];
    rear1 = -1;
    front1 = 0;
}


    template<class T>
queue<T>::~queue()
{
    delete[] element;
}

    template<class T>
void queue<T>::insert(T ele)
{
    if(!is_full())
    {
        rear1 += 1;
        element[rear1] = ele;
    }
    else
        cout<<"\nERROR : The queue is full!\n";
}

    template<class T>
T queue<T>::pop()
{
    if(!is_empty())
    {
        T temp;
        temp = element[front1];
        front1 += 1;
        return temp;
    }
    else
    {
        cout<<"\nERROR : The queue is empty!!\n";
        return -1;
    }
}

    template<class T>
void queue<T>::display()
{
    if(!is_empty())
    {
        for(int i=front1;i<=rear1;i++)
        {
            cout<<"\t"<<element[i];
        }
    }
    else
    {
        cout<<"\nempty queue\n";
    }
}

int main()
{
    queue<int> Q(10);
    cout<<"\nchecking for empty"<<Q.is_empty()<<endl;
    cout<<"\nInserting elements into queue\n";
    for(int i=0;i<10;i++)
    {
        Q.insert(i*10);

        if(i%3 == 0){
            Q.display();
            cout<<endl;}
    }

    cout<<"\nchecking for full:"<<Q.is_full();
    cout<<"\n popping elements now! \n";
    for(int i=0;i<=10;i++)
    {    cout<<"\npopped:"<<Q.pop()<<endl;
        if(i%3 == 0)
            Q.display();
    }
}