CSCI104/queue_own.cpp at master · pkoppise/CSCI104 · 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
#include<iostream>
using namespace std;

class QueueInt
{
private:
	int *data;
	int size_t;
	int capacity;
	int front;
	int rear;
public:
	QueueInt(int cap):size_t(0),capacity(cap)
	{
		front =  -1;
		rear  =  -1;
		data  = new int[capacity];
	}

    ~QueueInt() {
    	delete []data;
    }

    int size() const { return size_t; }

    bool empty() const { return (front == -1 && rear == -1); }

    bool full() const  { return rear == (capacity - 1); }

    void push_back(const int& val)
    {
    	if(full())
    	{
    		cout << "Queue is full" << endl;
    		return;
    	}

    	if(empty())
    	{
    		front = 0;
    	}

    	rear++;
    	data[rear] = val;
    	size_t++;
    }

    void pop_front()
    {
    	if(empty())
    	{
    		cout << "Queue is empty" << endl;
    		return;
    	}
    	else if(front == rear) {
    		front = -1;
    		rear = -1;
    		size_t--;
    	}
    	else
    	{
        	front++;
        	size_t--;
    	}
    }

    int frontValue() const { return data[front]; }

    void displayQueue() const {
    	for(int i = front; i <= rear; i++)
    	{
    		cout << data[i] << " ";
    	}
    	cout << endl;
    }
};

int main()
{
	QueueInt q(5);

	q.pop_front();

	q.push_back(6);
	q.push_back(7);
	q.push_back(8);
	q.push_back(9);
	q.push_back(10);

	cout << q.size() << endl;

    q.displayQueue();

    q.push_back(11);
    q.displayQueue();

    cout << q.frontValue() << endl;

    q.pop_front();
    q.pop_front();
    q.displayQueue();
    cout << q.size() << endl;
    cout << q.frontValue() << endl;

    q.push_back(11);
    q.displayQueue();

    return 0;
}