blob: 41450bfbbeae53d1d20cf1ee04bbc47b08ad756c (
plain)
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
|
/* ScummVM - Scumm Interpreter
* Copyright (C) 2006 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*
* $URL$
* $Id$
*
*/
#ifndef PARALLACTION_DEFS_H
#define PARALLACTION_DEFS_H
#include "common/stdafx.h"
#include "common/list.h"
namespace Parallaction {
// TODO (LIST): this struct won't be used anymore as soon as List<> is enforced throughout the code.
struct Node {
Node* _prev;
Node* _next;
Node() {
_prev = 0;
_next = 0;
}
virtual ~Node() {
}
};
template <class T>
class ManagedList : public Common::List<T> {
public:
typedef typename Common::List<T> Common_List;
typedef typename Common::List<T>::iterator iterator;
~ManagedList() {
clear();
}
void clear() {
erase(Common_List::begin(), Common_List::end());
}
iterator erase(iterator pos) {
if (pos != Common_List::end())
delete *pos;
return Common_List::erase(pos);
}
iterator erase(iterator first, iterator last) {
for (iterator it = first; it != last; it++)
delete *it;
return Common_List::erase(first, last);
}
};
} // namespace Parallaction
#endif
|
