forked from VladimirBalun/Algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathQueue.cpp
More file actions
166 lines (149 loc) · 3.36 KB
/
Copy pathQueue.cpp
File metadata and controls
166 lines (149 loc) · 3.36 KB
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
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
#include <cstdint>
#include <iostream>
#include <stdexcept>
template<typename Type>
class Queue
{
public:
explicit Queue() = default;
explicit Queue(const Queue& another) noexcept
: mHead(copyNode(another.mHead)), mSize(another.mSize) {}
explicit Queue(Queue&& another) noexcept;
Queue& operator = (const Queue& another) noexcept;
Queue& operator = (Queue&& another) noexcept;
void push(const Type& value) noexcept;
void pop();
void clear() noexcept;
Type front() const;
constexpr std::size_t getSize() const noexcept;
constexpr bool isEmpty() const noexcept;
~Queue();
private:
struct Node
{
Type value = Type();
Node* next = nullptr;
};
Node* copyNode(Node* other) noexcept;
private:
Node* mHead = nullptr;
std::size_t mSize = 0;
};
template<typename Type>
Queue<Type>::Queue(Queue&& another) noexcept
: mHead(another.mHead), mSize(another.mSize)
{
another.mSize = 0;
another.mHead = nullptr;
}
template<typename Type>
Queue<Type>& Queue<Type>::operator = (const Queue& another) noexcept
{
if (this != &another)
{
if (!isEmpty())
clear();
mHead = copyNode(another.mHead);
mSize = another.mSize;
}
return *this;
}
template<typename Type>
Queue<Type>& Queue<Type>::operator = (Queue&& another) noexcept
{
if (this != &another)
{
if (!isEmpty())
clear();
mHead = another.mHead;
another.mHead = nullptr;
mSize = another.mSize;
another.mSize = 0;
}
return *this;
}
template<typename Type>
auto Queue<Type>::copyNode(Node* another) noexcept -> Node*
{
if (!another)
return nullptr;
return new Node{ another->value, copyNode(another->next) };
}
template<typename Type>
void Queue<Type>::push(const Type& value) noexcept
{
Node* newElem = new Node{ value, mHead };
mHead = newElem;
mSize++;
}
template<typename Type>
void Queue<Type>::pop()
{
if (!isEmpty())
{
Node* tmpPtr = mHead;
mHead = mHead->next;
delete tmpPtr;
mSize--;
}
else
{
throw std::runtime_error("Queue is empty. Could not delete the first element.");
}
}
template<typename Type>
void Queue<Type>::clear() noexcept
{
Node* iterator = mHead;
while (iterator)
{
Node* tmpPtr = iterator;
iterator = iterator->next;
delete tmpPtr;
}
mSize = 0;
mHead = nullptr;
}
template<typename Type>
Type Queue<Type>::front() const
{
if (!isEmpty())
return mHead->value;
else
throw std::runtime_error("Queue is empty. Could not give the first element.");
}
template<typename Type>
constexpr std::size_t Queue<Type>::getSize() const noexcept
{
return mSize;
}
template<typename Type>
constexpr bool Queue<Type>::isEmpty() const noexcept
{
return mSize == 0;
}
template<typename Type>
Queue<Type>::~Queue()
{
clear();
}
int main()
{
try
{
Queue<int> queue;
for (auto &val : { 4, 6, 7, 2, 8, 8 })
queue.push(val);
while (!queue.isEmpty())
{
std::cout << "Value: " << queue.front() << std::endl;
queue.pop();
}
return EXIT_SUCCESS;
}
catch (const std::exception& e)
{
std::cerr << "Error! Cause: " << e.what() << std::endl;
return EXIT_SUCCESS;
}
}