Generalised-Data-Structures-Library/Queue.cpp at main · yogikh2005/Generalised-Data-Structures-Library · 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
148
149
150
#include<iostream>
using namespace std;

/////////////////////////////////////////////////////////////////////////////////////////////////////////////////
//              Queue using Generic Approach
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////

#pragma pack(1)
template <class T>
class Queuenode
{
    public:
        T data;
        Queuenode<T> *next;

        Queuenode(T no)
        {
            this->data = no;
            this->next = NULL;
        }
};

template <class T>
class Queue
{
    private:
        Queuenode<T> *first;
        Queuenode<T> *last;
        int iCount;

    public:
        Queue();
        void enqueue(T);
        T dequeue();
        void Display();
        int Count();
};

template <class T>
Queue<T> :: Queue()
{
    cout<<"Queue gets created successfully.\n\n";
    this->first = NULL;
    this->last = NULL;
    this->iCount = 0;
}

template <class T>
void Queue<T> :: enqueue(T no)
{
    Queuenode<T> * newn = NULL;

    newn = new Queuenode<T>(no);

    if((this->first == NULL) &&(this->last == NULL))
    {
        this->first = newn;
        this->last = newn;
    }
    else
    {
        this->last->next = newn;
        this->last = newn;
    }

    this->iCount++;
}

template <class T>
T Queue<T> :: dequeue()
{
    T Value = 0;
    Queuenode<T> * temp = this->first;

    if((this->first == NULL) &&(this->last == NULL))
    {
        cout<<"Queue is Empty\n";
        return -1;
    }

    Value = this->first->data;

    this->first = this->first->next;
    delete temp;

    this->iCount--;
    return Value;
}

template <class T>
void Queue<T> :: Display()
{
    Queuenode<T> * temp = NULL;

    temp = this->first;

    if((this->first == NULL) &&(this->last == NULL))
    {
        cout<<"Queue is empty\n";
        return;
    }

    while(temp != NULL)
    {
        cout<<"| "<<temp->data<<" | - ";
        temp = temp->next;
    }
    cout<<"\n";
}

template <class T>
int Queue<T> :: Count()
{
    return this->iCount;
}

int main()
{
    cout<<"------------------------------------ QUEUE ------------------------------------\n";

    Queue<double> * qobj = new Queue<double>();

    qobj->enqueue(11.56789);
    qobj->enqueue(21.56789);
    qobj->enqueue(51.56789);
    qobj->enqueue(101.56789);

    qobj->Display();
    cout<<"Number of elements in Queue are: "<<qobj->Count()<<"\n\n";

    cout<<"Removed element is: "<<qobj->dequeue()<<"\n";

    qobj->Display();
    cout<<"Number of elements in Queue are: "<<qobj->Count()<<"\n\n";

    cout<<"Removed element is: "<<qobj->dequeue()<<"\n";

    qobj->Display();
    cout<<"Number of elements in Queue are: "<<qobj->Count()<<"\n\n";

    qobj->enqueue(121.56789);
    cout<<"Enqueued element: 121.56789\n";
    qobj->Display();
    cout<<"Number of elements in Queue are: "<<qobj->Count()<<"\n\n";

    delete qobj;

    return 0;

}