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
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
|
// Brain Party
// Copyright (C) 2010 Paul Hudson (http://www.tuxradar.com/brainparty)
// Brain Party 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 3
// 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.
#ifndef __BPList_H__
#define __BPList_H__
#include <vector>
#include <algorithm>
#include "Texture.h"
#include "Colour.h"
#include "BPPoint.h"
using namespace std;
template <class T>
class BPList {
private:
vector<T> data;
public:
int Count;
BPList();
~BPList();
void Add(T item);
bool Contains(T item);
void Clear();
int IndexOf(T item);
void Insert(int pos, T item);
void Remove(T item);
void RemoveAt(int pos);
void SetValue(int pos, T val);
void Shuffle();
T operator[] (int position);
};
template <class T>
BPList<T>::BPList() {
Count = 0;
}
template <class T>
BPList<T>::~BPList() {
}
template <class T>
void BPList<T>::Add(T item) {
data.push_back(item);
++Count;
}
template <class T>
bool BPList<T>::Contains(T item) {
typename std::vector<T>::iterator result = find(data.begin(), data.end(), item);
return result != data.end();
}
template <class T>
void BPList<T>::Clear() {
data.clear();
Count = 0;
}
template <class T>
T BPList<T>::operator[] (int position) {
return data[position];
}
template <class T>
void BPList<T>::Insert(int pos, T item) {
data.insert(data.begin() + pos, item);
++Count;
}
template <class T>
void BPList<T>::Shuffle() {
random_shuffle(data.begin(), data.end());
}
template <class T>
void BPList<T>::Remove(T item) {
typename std::vector<T>::iterator result = find(data.begin(), data.end(), item);
if (result != data.end()) {
data.erase(result);
--Count;
}
}
template <class T>
void BPList<T>::RemoveAt(int pos) {
data.erase(data.begin() + pos);
--Count;
}
template <class T>
int BPList<T>::IndexOf(T item) {
typename std::vector<T>::iterator result = find(data.begin(), data.end(), item);
if (result == data.end()) return -1;
return result - data.begin();
}
template <class T>
void BPList<T>::SetValue(int pos, T val) {
data[pos] = val;
}
template <class T>
class BPPList {
private:
vector<T> data;
public:
int Count;
BPPList();
~BPPList();
void Add(T item);
bool Contains(T item);
void Clear(bool safe_delete=true);
int IndexOf(T item);
void Insert(int pos, T item);
void Remove(T item);
void RemoveAt(int pos);
void SetValue(int pos, T val);
void Shuffle();
T operator[] (int position);
};
template <class T>
BPPList<T>::BPPList() {
Count = 0;
}
template <class T>
BPPList<T>::~BPPList() {
}
template <class T>
void BPPList<T>::Add(T item) {
data.push_back(item);
++Count;
}
template <class T>
bool BPPList<T>::Contains(T item) {
typename std::vector<T>::iterator result = find(data.begin(), data.end(), item);
return result != data.end();
}
template <class T>
void BPPList<T>::Clear(bool safe_delete) {
if (safe_delete) {
for (int i = data.size() - 1; i >= 0; --i) {
T item = data[i];
SAFE_DELETE(item);
}
}
data.clear();
Count = 0;
}
template <class T>
T BPPList<T>::operator[] (int position) {
return data[position];
}
template <class T>
void BPPList<T>::Insert(int pos, T item) {
data.insert(data.begin() + pos, item);
++Count;
}
template <class T>
void BPPList<T>::Shuffle() {
random_shuffle(data.begin(), data.end());
}
template <class T>
void BPPList<T>::Remove(T item) {
typename std::vector<T>::iterator result = find(data.begin(), data.end(), item);
if (result != data.end()) {
data.erase(result);
--Count;
}
}
template <class T>
void BPPList<T>::RemoveAt(int pos) {
data.erase(data.begin() + pos);
--Count;
}
template <class T>
int BPPList<T>::IndexOf(T item) {
typename std::vector<T>::iterator result = find(data.begin(), data.end(), item);
if (result == data.end()) return -1;
return result - data.begin();
}
template <class T>
void BPPList<T>::SetValue(int pos, T val) {
data[pos] = val;
}
#endif
|
