forked from VladimirBalun/Algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathStack.cpp
More file actions
212 lines (191 loc) · 4.56 KB
/
Copy pathStack.cpp
File metadata and controls
212 lines (191 loc) · 4.56 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
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
#include <iostream>
#include <stdexcept>
template<typename Type>
class Stack
{
public:
using value_type = Type;
using size_type = std::size_t;
using reference = value_type&;
using const_reference = const value_type&;
public:
explicit Stack() = default;
explicit Stack(const Stack& another) noexcept
: m_head(copy_node(another.m_head)), m_size(another.m_size) {}
explicit Stack(Stack&& another) noexcept;
Stack& operator=(const Stack& another) noexcept;
Stack& operator=(Stack&& another) noexcept;
void swap(Stack& another) noexcept;
template<typename... Args>
void emplace(Args&&... args) noexcept;
void push(const Type& value) noexcept;
void push(Type&& value) noexcept;
void pop();
void clear() noexcept;
reference top();
const_reference top() const;
constexpr size_type size() const noexcept;
constexpr bool empty() const noexcept;
~Stack();
private:
struct Node
{
Type value = Type();
Node* prev = nullptr;
};
Node* copy_node(Node* another) const noexcept;
private:
Node* m_head = nullptr;
size_type m_size = 0;
};
template<typename Type>
Stack<Type>::Stack(Stack&& another) noexcept
: m_head(another.m_head), m_size(another.m_size)
{
another.m_size = 0;
another.m_head = nullptr;
}
template<typename Type>
Stack<Type>& Stack<Type>::operator=(const Stack& another) noexcept
{
if (this != &another)
{
if (!empty())
clear();
m_head = copy_node(another.m_head);
m_size = another.m_size;
}
return *this;
}
template<typename Type>
Stack<Type>& Stack<Type>::operator=(Stack&& another) noexcept
{
if (this != &another)
{
if (!empty())
clear();
m_head = another.m_head;
m_size = another.m_size;
another.m_head = nullptr;
another.m_size = 0;
}
return *this;
}
template<typename Type>
auto Stack<Type>::copy_node(Node* another) const noexcept -> Node*
{
if (!another)
return nullptr;
return new Node{ another->value, copy_node(another->next) };
}
template<typename Type>
void Stack<Type>::swap(Stack& another) noexcept
{
if (this != &another)
{
Node* another_head = another.m_head;
std::size_t another_size = another.m_size;
another.m_head = m_head;
another.m_size = m_size;
m_head = another_head;
m_size = another_size;
}
}
template<typename Type>
template<typename... Args>
void Stack<Type>::emplace(Args&&... args) noexcept
{
m_head = new Node{ { std::forward<Args>(args)... }, m_head };
m_size++;
}
template<typename Type>
void Stack<Type>::push(const Type& value) noexcept
{
m_head = new Node{ value, m_head };
m_size++;
}
template<typename Type>
void Stack<Type>::push(Type&& value) noexcept
{
m_head = new Node{ value, m_head };
m_size++;
}
template<typename Type>
void Stack<Type>::pop()
{
if (!empty())
{
Node* temp = m_head;
m_head = m_head->prev;
delete temp;
m_size--;
}
else
{
throw std::runtime_error("Stack is empty. Could not delete the last element.");
}
}
template<typename Type>
void Stack<Type>::clear() noexcept
{
Node* iterator = m_head;
while (iterator)
{
Node* temp = iterator;
iterator = iterator->prev;
delete temp;
}
m_size = 0;
m_head = nullptr;
}
template<typename Type>
typename Stack<Type>::reference Stack<Type>::top()
{
if (!empty())
return m_head->value;
else
throw std::runtime_error("Stack is empty. Could not give the last element.");
}
template<typename Type>
typename Stack<Type>::const_reference Stack<Type>::top() const
{
if (!empty())
return m_head->value;
else
throw std::runtime_error("Stack is empty. Could not give the last element.");
}
template<typename Type>
constexpr typename Stack<Type>::size_type Stack<Type>::size() const noexcept
{
return m_size;
}
template<typename Type>
constexpr bool Stack<Type>::empty() const noexcept
{
return m_size == 0;
}
template<typename Type>
Stack<Type>::~Stack()
{
clear();
}
int main()
{
try
{
Stack<int> stack;
for (const auto& val : { 4, 6, 7, 2, 8, 8 })
stack.push(val);
while (!stack.empty())
{
std::cout << "Value: " << stack.top() << std::endl;
stack.pop();
}
return EXIT_SUCCESS;
}
catch (const std::exception& e)
{
std::cerr << "Error! Cause: " << e.what() << std::endl;
return EXIT_FAILURE;
}
}