blob: fbab91492e92265ecf799f1c4f78b27e088dc39a (
plain) (
blame)
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
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
|
#ifndef LINKEDLIST
#define LINKEDLIST
#include <stdexcept>
template <class T>
class LinkedList {
struct Node {
T data;
Node* next;
Node(const T& data, Node* next = nullptr) : data(data), next(next) {}
};
Node* head;
Node* tail;
unsigned listSize;
Node* nodeAt(unsigned index);
public:
class Iterator {
Node* current;
Iterator(Node* current) : current(current) {}
public:
Iterator& operator++() {
if (current == nullptr) return *this;
current = current->next;
return *this;
}
Iterator operator++(int) {
Iterator old = *this;
++(*this);
return old;
}
bool operator==(Iterator& other) {
return this->current == other.current;
}
bool operator!=(Iterator& other) {
return !(*this == other);
}
T& operator*() {
return current->data;
}
friend class LinkedList;
};
Iterator begin();
Iterator end();
class ConstIterator {
const Node* current;
ConstIterator(Node* current) : current(current) {}
public:
ConstIterator& operator++() {
if (current == nullptr) return *this;
current = current->next;
return *this;
}
ConstIterator operator++(int) {
ConstIterator old = *this;
++(*this);
return old;
}
bool operator==(const ConstIterator* other) const {
return this->current == other->current;
}
bool operator!=(const ConstIterator* other) const {
return !(*this == *other);
}
const T& operator*() const {
return current->data;
}
friend class LinkedList;
};
ConstIterator cbegin() const;
ConstIterator cend() const;
void push_front(const T& elem);
void push_back(const T& elem);
void push_at(unsigned ind, const T& elem);
void pop_front();
void pop_back();
void pop_at(unsigned ind);
T& front();
unsigned size();
bool empty();
LinkedList() : head(nullptr) {}
~LinkedList();
LinkedList(LinkedList& other) = delete;
LinkedList& operator=(LinkedList& other) = delete;
};
template <class T>
typename LinkedList<T>::Iterator LinkedList<T>::begin() {
return Iterator(head);
}
template <class T>
typename LinkedList<T>::Iterator LinkedList<T>::end() {
return Iterator(nullptr);
}
template <class T>
typename LinkedList<T>::ConstIterator LinkedList<T>::cbegin() const {
return ConstIterator(head);
}
template <class T>
typename LinkedList<T>::ConstIterator LinkedList<T>::cend() const {
return ConstIterator(nullptr);
}
template <class T>
typename LinkedList<T>::Node* LinkedList<T>::nodeAt(unsigned index) {
if (index > listSize)
throw std::runtime_error("Index too large!");
Node* nat;
for (nat = head; index > 0; index--) {
nat = nat->next;
}
return nat;
}
template <class T>
void LinkedList<T>::push_front(const T& elem) {
if (empty()) {
head = tail = new Node(elem);
}
else {
head = new Node(elem, head);
}
listSize++;
}
template <class T>
void LinkedList<T>::push_back(const T& elem) {
if (empty()) {
head = tail = new Node(elem);
}
else {
tail = (tail->next = new Node(elem));
}
listSize++;
}
template <class T>
void LinkedList<T>::push_at(unsigned ind, const T& elem) {
if (ind >= listSize) {
push_back(elem);
}
else if (ind == 0) {
push_front(elem);
}
else {
Node* prev = nodeAt(ind - 1);
prev->next = new Node(elem, prev->next);
listSize++;
}
}
template <class T>
void LinkedList<T>::pop_front() {
if (empty())
throw std::runtime_error("Pop empty list!");
Node* old = head;
head = head->next;
delete old;
listSize--;
if (empty()) tail = nullptr;
}
template <class T>
void LinkedList<T>::pop_back() {
if (empty())
throw std::runtime_error("Pop empty list!");
Node* old = tail;
tail = nodeAt(listSize - 2);
tail->next = nullptr;
delete old;
listSize--;
if (empty()) head = nullptr;
}
template <class T>
void LinkedList<T>::pop_at(unsigned ind) {
if (ind >= listSize - 1) {
pop_back();
}
else if (ind == 0) {
pop_front();
}
else {
Node* prev = nodeAt(ind - 1);
Node* curr = prev->next;
prev->next = curr->next;
delete curr;
listSize--;
}
}
template <class T>
T& LinkedList<T>::front() {
return head->data;
}
template <class T>
unsigned LinkedList<T>::size() {
return listSize;
}
template <class T>
bool LinkedList<T>::empty() {
return listSize == 0;
}
template <class T>
LinkedList<T>::~LinkedList() {
while (!empty())
pop_front();
}
#endif
|
