image-manipulation/Queue.cpp at master · robertroeder/image-manipulation · 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
/*
 *  Queue.cpp
 */

#include "Queue.h"

using namespace std;

Queue::Queue( int maxSize )
{
	max = maxSize;
	front = 0;
	rear = -1;
	data = new coordQ [max];
}

Queue::Queue( const Queue& copiedQueue )
{
	max = copiedQueue.max;
	data = new coordQ [max];
	front = copiedQueue.front;
	rear = copiedQueue.rear;
	coordQ * copiedPtr = copiedQueue.data;
	coordQ * newArray = data;
	for( int index = 0; index < max; index ++ )
	{
		newArray[index] = copiedPtr[index];
	}

}

Queue::~Queue()
{
	delete [] data;
}

bool Queue::enqueue( coordQ insert )
{

	if (rear == (max - 1) )
	{
		return false;
	}

	rear++;
	data[rear] = insert;
	return true;
}

coordQ Queue::dequeue()
{
	if (rear != -1 )
	{
	coordQ returned = data[front];
	for ( int index = front; index < rear; index ++ )
	{
		data[index] = data[index+1];
	}
	rear--;

	return returned;
	}
}

bool Queue::empty() const
{
	if (rear == -1)
	{
		return true;
	}

	return false;

}

bool Queue::full() const
{
	if (rear == (max-1))
	{
		return true;
	}

	return false;
}

bool Queue::clear ()
{
	rear = -1;
	return true;
}

Queue& Queue::operator=( const Queue& copiedQueue )
{
	max = copiedQueue.max;
	data = new coordQ [max];
	front = copiedQueue.front;
	rear = copiedQueue.rear;
	coordQ * copiedPtr = copiedQueue.data;
	coordQ * newArray = data;
	for( int index = 0; index < max; index ++ )
	{
		newArray[index] = copiedPtr[index];
	}

}