A-star/queue.cpp at master · uzipaz/A-star · 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
#include "queue.h"

//template <class T>
queue::queue()
{
    CurrentSize = 0;
}

//template <class T>
void queue::insert(int element)
{
    data[CurrentSize++] = element;
}

//template <class T>
int queue::remove()
{
    if (!isEmpty())
    {
        int return_var = data[0];

        for (int i = 1; i < CurrentSize; i++)
        {
            data[i - 1] = data[i];
        }

        if (CurrentSize > 0)
            CurrentSize--;

        return return_var;
    }

    return -1;
}

int queue::removeFromBack()
{
    return data[--CurrentSize];
}

//template <class T>
bool queue::isEmpty()
{
    return (CurrentSize == 0);
}

void queue::emptyQueue()
{
    CurrentSize = 0;
}

//template <class T>
int queue::returnAtFront()
{
    return data[0];
}

//template <class T>
int queue::returnAtBack()
{
    return data[CurrentSize - 1];
}

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


//template class queue<int>;