Robotics-Code/Queue Management.cpp at main · Claude-Davis/Robotics-Code · 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
#include <iostream>
using namespace std;

class Queue {
	int size;
	int* queue;

	public:
	Queue() {
		size = 0;
		queue = new int[100];
	}
	void remove() {
		if (size == 0) {
			cout << "Queue is empty"<<endl;
			return;
		}
		else {
			for (int i = 0; i < size - 1; i++) {
				queue[i] = queue[i + 1];
			}
			size--;
		}
	}
	void print() {
		if (size == 0) {
			cout << "Queue is empty"<<endl;
			return;
		}
		for (int i = 0; i < size; i++) {
			cout<<queue[i]<<" <- ";
		}
		cout <<endl;
	}
	void add(int item) {
		if(size == 100) {
			cout << "Queue is full"<<endl;
			return;
		}
		queue[size] = item;
		size++;
	}
};

int main() {
	Queue q;
	q.add(42); q.add(2); q.add(8); q.add(1);
	q.print();
	q.remove();
	q.add(128);
	q.print();
	q.remove();
	q.remove();
	q.print();

	return 0;
}