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
|
/* ScummVM - Graphic Adventure Engine
*
* ScummVM is the legal property of its developers, whose names
* are too numerous to list here. Please refer to the COPYRIGHT
* file distributed with this source distribution.
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*
* $URL$
* $Id$
*/
#ifndef COMMON_LIST_H
#define COMMON_LIST_H
#include "common/list_intern.h"
namespace Common {
/**
* Simple double linked list, modeled after the list template of the standard
* C++ library.
*/
template<typename t_T>
class List {
protected:
typedef ListInternal::NodeBase NodeBase;
typedef ListInternal::Node<t_T> Node;
NodeBase _anchor;
public:
typedef ListInternal::Iterator<t_T> iterator;
typedef ListInternal::ConstIterator<t_T> const_iterator;
typedef t_T value_type;
public:
List() {
_anchor._prev = &_anchor;
_anchor._next = &_anchor;
}
List(const List<t_T> &list) {
_anchor._prev = &_anchor;
_anchor._next = &_anchor;
insert(begin(), list.begin(), list.end());
}
~List() {
clear();
}
void push_front(const t_T &element) {
insert(begin(), element);
}
void push_back(const t_T &element) {
insert(end(), element);
}
void insert(iterator pos, const t_T &element) {
ListInternal::NodeBase *newNode = new Node(element);
newNode->_next = pos._node;
newNode->_prev = pos._node->_prev;
newNode->_prev->_next = newNode;
newNode->_next->_prev = newNode;
}
template<typename iterator2>
void insert(iterator pos, iterator2 first, iterator2 last) {
for (; first != last; ++first)
insert(pos, *first);
}
iterator erase(iterator pos) {
assert(pos != end());
NodeBase *next = pos._node->_next;
NodeBase *prev = pos._node->_prev;
Node *node = static_cast<Node *>(pos._node);
prev->_next = next;
next->_prev = prev;
delete node;
return iterator(next);
}
iterator reverse_erase(iterator pos) {
assert(pos != end());
NodeBase *next = pos._node->_next;
NodeBase *prev = pos._node->_prev;
Node *node = static_cast<Node *>(pos._node);
prev->_next = next;
next->_prev = prev;
delete node;
return iterator(prev);
}
iterator erase(iterator first, iterator last) {
while (first != last)
erase(first++);
return last;
}
void remove(const t_T &val) {
iterator i = begin();
const iterator e = end();
while (i != e)
if (val == *i)
i = erase(i);
else
++i;
}
void pop_front() {
iterator i = begin();
i = erase(i);
}
List<t_T> &operator=(const List<t_T> &list) {
if (this != &list) {
iterator i;
const iterator e = end();
const_iterator i2;
const_iterator e2 = list.end();
for (i = begin(), i2 = list.begin(); (i != e) && (i2 != e2) ; ++i, ++i2) {
static_cast<Node *>(i._node)->_data = static_cast<const Node *>(i2._node)->_data;
}
if (i == e)
insert(i, i2, e2);
else
erase(i, e);
}
return *this;
}
uint size() const {
int n = 0;
for (const NodeBase *cur = _anchor._next; cur != &_anchor; cur = cur->_next)
++n;
return n;
}
void clear() {
erase(begin(), end());
}
bool empty() const {
return (&_anchor == _anchor._next);
}
iterator begin() {
return iterator(_anchor._next);
}
iterator reverse_begin() {
return iterator(_anchor._prev);
}
iterator end() {
return iterator(&_anchor);
}
const_iterator begin() const {
return const_iterator(_anchor._next);
}
const_iterator reverse_begin() const {
return const_iterator(_anchor._prev);
}
const_iterator end() const {
return const_iterator(const_cast<NodeBase*>(&_anchor));
}
};
} // End of namespace Common
#endif
|
