AirportSimulation/DEQ2.cpp at main · mmohamedkhaled/AirportSimulation · 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
#include<iostream>
using namespace std;


template <typename T>
DEQ2<T>::DEQ2() : head(nullptr), tail(nullptr), counter(0) {}

template <typename T>
void DEQ2<T>::Add_Front(node<T>* p_itemNode) {
    if (head == nullptr) {
        head = p_itemNode;
        tail = p_itemNode;
    } else {
        p_itemNode->setNext(head);
        head = p_itemNode;
    }
    counter++;
}


template <typename T>
void DEQ2<T>::Add_Rear(node<T>* p_itemNode) {
    if (head == nullptr) {
        head = p_itemNode;
        tail = p_itemNode;
    } else {
        tail->setNext(p_itemNode);
        tail=p_itemNode;
    }
    counter++;
}

template <typename T>
void DEQ2<T>::Remove_Front() {
    if (head != nullptr) {
        node<T>* temp = head;
        head = head->getNext();
        delete temp;
        counter--;
    }
}


template <typename T>
void DEQ2<T>::Remove_Rear() {
   if (head == nullptr) {

        return;
    }

    if (head->getNext() == nullptr) {
        delete head;
        head = nullptr;
        tail = nullptr;
    } else {
        node<T>* current = head;
        while (current->getNext() != tail) {
            current = current->getNext();
        }

        delete tail;
        tail = current;
        tail->setNext(nullptr);
    }

    counter--;
}


template <typename T>
T DEQ2<T>::View_Front()
{
    if (head != nullptr) {
        return head->getItem();
    }
    return 0;
}

template <typename T>
T DEQ2<T>::View_Rear() {
    if (tail != nullptr) {
        return tail->getItem();
    }
    return 0;
}

template <typename T>
bool DEQ2<T>::DEQisEmpty() {
    return head == nullptr;
}

template <typename T>
void DEQ2<T>::printList() {
    node<T>* current = head;
    while (current != nullptr) {
        cout << current->getItem() << " ";
        current = current->getNext();
    }
    cout << endl;
}

template <typename T>
int DEQ2<T>::DEQ_Length() {
    return counter;
}


template <typename T>
DEQ2<T>::~DEQ2() {
    while (head != nullptr) {
        node<T>* temp = head;
        head = head->getNext();
        delete temp;
    }
}