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
|
/* ScummVM - Scumm Interpreter
* Copyright (C) 2002-2004 The ScummVM project
*
* 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., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*
* $Header$
*/
#ifndef COMMON_LIST_H
#define COMMON_LIST_H
#include "common/scummsys.h"
#include <assert.h>
namespace Common {
/**
* Simple double linked list, modelled after the list template of the standard
* C++ library.
* Warning: as of now, this code is 100% untested.
*/
template <class T>
class List {
protected:
struct NodeBase {
NodeBase *_prev;
NodeBase *_next;
};
template <class T2>
struct Node : public NodeBase {
T2 _data;
Node<T2>(const T2 &x) : _data(x) {}
};
template <class T2>
struct Iterator {
NodeBase *_node;
Iterator<T2>() : _node(0) {}
Iterator<T2>(NodeBase *node) : _node(node) {}
// Prefix inc
Iterator<T2> &operator++() {
if (_node)
_node = _node->_next;
return *this;
}
// Postfix inc
Iterator<T2> operator++(int) {
Iterator<T2> tmp = *this;
if (_node)
_node = _node->_next;
return tmp;
}
// Prefix dec
Iterator<T2> &operator--() {
if (_node)
_node = _node->_prev;
return *this;
}
// Postfix dec
Iterator<T2> operator--(int) {
Iterator<T2> tmp = *this;
if (_node)
_node = _node->_prev;
return tmp;
}
T2& operator*() const {
assert(_node);
return static_cast<Node<T2>*>(_node)->_data;
}
T2* operator->() const {
return &(operator*());
}
bool operator==(const Iterator<T2>& x) const {
return _node == x._node;
}
bool operator!=(const Iterator<T2>& x) const {
return _node != x._node;
}
};
NodeBase *_anchor;
public:
typedef Iterator<T> iterator;
typedef Iterator<const T> const_iterator;
public:
List<T>() {
_anchor = new NodeBase;
_anchor->_prev = _anchor;
_anchor->_next = _anchor;
}
List<T>(const List<T>& list) {
_anchor = new NodeBase;
_anchor->_prev = _anchor;
_anchor->_next = _anchor;
insert(begin(), list.begin(), list.end());
}
~List<T>() {
clear();
delete _anchor;
}
void push_front(const T& element) {
insert(begin(), element);
}
void push_back(const T& element) {
insert(end(), element);
}
void insert(iterator pos, const T& element) {
NodeBase *newNode = new Node<T>(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<T> *node = static_cast<Node<T> *>(pos._node);
prev->_next = next;
next->_prev = prev;
delete node;
return next;
}
iterator erase(iterator first, iterator last) {
while (first != last)
erase(first++);
return last;
}
// void remove(const T &val) {
// ...
// }
List<T>& operator =(const List<T>& list) {
if (this != &list) {
// TODO: This could (and should) be optimized, by reusing
// the existing nodes...
clear();
insert(begin(), list.begin(), list.end());
}
return *this;
}
uint size() const {
int n = 0;
for (const_iterator i = begin(); i != end(); ++i)
++n;
return n;
}
void clear() {
erase(begin(), end());
}
bool isEmpty() const {
return (_anchor == _anchor->_next);
}
iterator begin() {
return _anchor->_next;
}
iterator end() {
return _anchor;
}
const_iterator begin() const {
return _anchor->_next;
}
const_iterator end() const {
return _anchor;
}
};
} // End of namespace Common
#endif
|
