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
|
/* ScummVM - Scumm Interpreter
* Copyright (C) 2004-2005 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 SAGA_LIST_H__
#define SAGA_LIST_H__
#include "common/list.h"
namespace Saga {
template <class T>
class SortedList : public Common::List<T> {
public:
typedef int ( CompareFunction ) (const T& , const T&);
typedef typename Common::List<T>::iterator iterator;
typedef typename Common::List<T>::const_iterator const_iterator;
public:
iterator pushFront(const T& element) {
return insert(Common::List<T>::begin(), element);
}
iterator pushBack(const T& element) {
return insert(Common::List<T>::end(), element);
}
iterator insert(iterator pos, const T& element) {
Common::List<T>::insert(pos, element);
return --pos;
}
iterator pushFront() {
return insert(Common::List<T>::begin());
}
iterator pushBack() {
return insert(Common::List<T>::end());
}
iterator insert(iterator pos) {
T init;
return insert(pos, init);
}
iterator pushFront(const T& element, CompareFunction* compareFunction) {
return insert(Common::List<T>::begin(), element, compareFunction);
}
iterator pushBack(const T& element, CompareFunction* compareFunction) {
return insert(Common::List<T>::end(), element, compareFunction);
}
iterator insert(iterator pos, const T& element, CompareFunction* compareFunction) {
int res;
for (iterator i = Common::List<T>::begin(); i != Common::List<T>::end(); ++i) {
res = compareFunction(element, i.operator*());
if (res < 0) {
return insert(i, element);
}
}
return pushBack(element);
}
iterator reorderUp(iterator pos, CompareFunction* compareFunction) {
iterator i(pos);
int res;
--i;
while (i != Common::List<T>::end()) {
res = compareFunction(i.operator*(), pos.operator*());
if (res <= 0) {
T temp(*pos);
erase(pos);
++i;
return insert(i, temp);
}
--i;
}
return pos;
}
iterator reorderDown(iterator pos, CompareFunction* compareFunction) {
iterator i(pos);
int res;
++i;
while (i != Common::List<T>::end()) {
res = compareFunction(i.operator*(), pos.operator*());
if (res >= 0) {
T temp(*pos);
erase(pos);
return insert(i, temp);
}
++i;
}
return pos;
}
iterator eraseAndPrev(iterator pos) {
assert(pos != Common::List<T>::end());
iterator res(pos);
--res;
erase(pos);
return res;
}
void remove(const T* val) {
for (iterator i = Common::List<T>::begin(); i != Common::List<T>::end(); ++i)
if(val == i.operator->()) {
erase(i);
return;
}
}
bool locate(const T* val, iterator& foundedIterator) {
for (iterator i = Common::List<T>::begin(); i != Common::List<T>::end(); ++i)
if (val == i.operator->())
{
foundedIterator = i;
return true;
}
return false;
}
};
} // End of namespace Saga
#endif
|
