blob: 030eccc2c9c2264eb6dbbec4083af7732beb3c30 (
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
|
#pragma once
#include <memory>
namespace std {
template <class T, class Allocator = std::allocator<T>>
class list {
public:
struct node {
T value;
node *prev;
node *next;
};
template <class V>
struct generic_iterator {
node *the_node;
bool operator ==(const generic_iterator &other) const {
return the_node == other.the_node;
}
bool operator !=(const generic_iterator &other) const {
return the_node != other.the_node;
}
V &operator *() {
return the_node->value;
}
V *operator ->() {
return &the_node->value;
}
generic_iterator &operator ++() {
the_node = the_node->next;
return *this;
}
};
using iterator = generic_iterator<T>;
using const_iterator = generic_iterator<const T>;
private:
node *first_node;
node *last_node;
size_t count;
public:
void push_back(const T &value) {
node *n = new node { .value = value,
.prev = last_node, .next = 0 };
if (last_node) last_node->next = n;
else first_node = n;
last_node = n;
++count;
}
void push_back(T &&value) {
node *n = new node {
.value = std::move(value),
.prev = last_node, .next = 0 };
if (last_node) last_node->next = n;
else first_node = n;
last_node = n;
++count;
}
iterator erase(iterator pos) {
--count;
auto *n = pos.the_node;
auto *r = n->next;
if (n->prev) n->prev->next = n->next;
else first_node = n->next;
if (n->next) n->next->prev = n->prev;
else last_node = n->prev;
delete n;
return iterator { .the_node = r };
}
iterator begin() noexcept { return iterator { .the_node = first_node }; }
iterator end() noexcept { return iterator { .the_node = 0 }; }
const_iterator begin() const noexcept { return iterator { .the_node = first_node }; }
const_iterator end() const noexcept { return iterator { .the_node = 0 }; }
const_iterator cbegin() const noexcept { return iterator { .the_node = first_node }; }
const_iterator cend() const noexcept { return iterator { .the_node = 0 }; }
size_t remove(const T &value) {
size_t removed = 0;
auto it = begin();
while (it != end())
if (*it == value) {
it = erase(it);
++removed;
}
else
++it;
count -= removed;
return removed;
}
list() : first_node(0), last_node(0), count(0) {}
list(const list &other) : first_node(0), last_node(0), count(0) {
for (node *n = other.first_node; n; n = n->next)
push_back(n->value);
}
list(list &&other) : first_node(other.first_node),
last_node(other.last_node), count(other.count) {
other.first_node = 0;
other.last_node = 0;
other.count = 0;
}
void clear() {
if (count == 0) return;
for (node *n = first_node->next; n; n = n->next)
delete n->prev;
delete last_node;
first_node = 0;
last_node = 0;
count = 0;
}
~list() {
clear();
}
list &operator =(const list &other) {
clear();
for (node *n = other.first_node; n; n = n->next)
push_back(n->value);
return *this;
}
list &operator =(list &&other) {
clear();
first_node = other.first_node;
last_node = other.last_node;
count = other.count;
other.first_node = 0;
other.last_node = 0;
other.count = 0;
return *this;
}
T &back() { return last_node->value; }
const T &back() const { return last_node->value; }
size_t size() const noexcept { return count; }
};
}
|