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
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
|
/****************************************************************************************/
/* */
/* 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; (See "COPYING"). If not, If not, see <http://www.gnu.org/licenses/>. */
/* */
/*--------------------------------------------------------------------------------------*/
/* */
/* Copyright Joerg Anders, TU Chemnitz, Fakultaet fuer Informatik, GERMANY */
/* ja@informatik.tu-chemnitz.de */
/* */
/* */
/****************************************************************************************/
/* Actually I wanted to use GArray and GPtrArray but this
* leads to random crashes in malloc on X86_64. A Glib-Bug ???
*/
#ifndef DYN_ARRAY_H
#define DYN_ARRAY_H
#include <gtk/gtk.h>
#include <cstring>
#define CHECK_SIZES
#define MAX_LEN 8192
#define DELAULT_LEN 10
#define SEG_LEN 10
template <typename T>
class NedDynArray {
public:
NedDynArray();
~NedDynArray<T>();
void insert(unsigned int idx, T element);
void append(T element);
T getAt(unsigned int idx);
T* getPointerAt(unsigned int idx);
unsigned int getLen() {return m_len;}
void setLen(unsigned int len, bool zero);
void empty(bool zero);
void zeroArray();
void sort(int (*comfunc)(const void *, const void *));
T* getFirst();
T* getNext();
T* skip(int len);
T* getFirst2(int len);
T* getNext2();
T* getFirst3();
T* getNext3();
T* getArray();
private:
void allocateArray();
#ifdef CHECK_SIZES
void dynarray_abort(const char *s);
#endif
unsigned long m_len;
unsigned long m_allocLen;
T *m_array;
T *m_int_ptr, *m_end_ptr;
T *m_int_ptr2, *m_end_ptr2;
T *m_int_ptr3;
unsigned long m_element_size;
};
/* ------------------------------------------- Implementation --------------------------------------------- */
#include <stdlib.h>
#include <stdio.h>
static void erroraus(const char *s) {
fprintf(stderr, "%s\n", s);
}
#ifdef CHECK_SIZES
template <typename T>
void NedDynArray<T>::dynarray_abort(const char *s) {
//fprintf(stderr, s);
erroraus(s);
exit(-1);
}
#endif
template <typename T>
NedDynArray<T>::NedDynArray() : m_len(0), m_allocLen(0), m_array(NULL) {
m_element_size = sizeof(T);
}
template <typename T>
NedDynArray<T>::~NedDynArray() {
if (m_len > 0) {
g_free(m_array);
}
}
template <typename T>
void NedDynArray<T>::allocateArray() {
unsigned int newsize, newalloclen;
if (m_len == 0) return;
newsize = m_element_size * m_len;
if (newsize >= m_allocLen) {
newalloclen = m_allocLen + m_element_size * SEG_LEN;
if (newalloclen < newsize) {
newalloclen = newsize;
}
m_allocLen = newalloclen;
if (m_array == NULL) {
if ((m_array = (T*) g_try_malloc(m_allocLen)) == NULL) {
dynarray_abort("NedDynArray<T>::allocateArray: malloc error\n");
}
}
else {
if ((m_array = (T*) g_try_realloc(m_array, m_allocLen)) == NULL) {
dynarray_abort("NedDynArray<T>::allocateArray: realloc error\n");
}
}
}
}
template <typename T>
void NedDynArray<T>::insert(unsigned int idx, T element) {
#ifdef CHECK_SIZES
if (idx >= m_len) {
dynarray_abort("NedDynArray<T>::insert\n");
}
#endif
m_array[idx] = element;
}
template <typename T>
void NedDynArray<T>::append(T element) {
#ifdef CHECK_SIZES
if (m_len + 1 > MAX_LEN) {
dynarray_abort("NedDynArray<T>::append\n");
}
#endif
m_len++;
allocateArray();
m_array[m_len-1] = element;
}
template <typename T>
T NedDynArray<T>::getAt(unsigned int idx) {
#ifdef CHECK_SIZES
if (idx >= m_len) {
printf("idx = %u, m_len = %lu\n", idx, m_len);
dynarray_abort("NedDynArray<T>::insert\n");
}
#endif
return m_array[idx];
}
template <typename T>
T* NedDynArray<T>::getPointerAt(unsigned int idx) {
#ifdef CHECK_SIZES
if (idx >= m_len) {
printf("idx = %u, m_len = %lu\n", idx, m_len);
dynarray_abort("NedDynArray<T>::insert\n");
}
#endif
return m_array + idx;
}
template <typename T>
T* NedDynArray<T>::getFirst() {
m_int_ptr = m_array;
m_end_ptr = m_array + m_len;
if (m_len < 1) {
return NULL;
}
return m_int_ptr;
}
template <typename T>
T* NedDynArray<T>::getNext() {
m_int_ptr++;
if (m_int_ptr >= m_end_ptr) {
return NULL;
}
return m_int_ptr;
}
template <typename T>
T* NedDynArray<T>::skip(int len) {
m_int_ptr += len;
if (m_int_ptr >= m_end_ptr) {
return NULL;
}
return m_int_ptr;
}
template <typename T>
T* NedDynArray<T>::getFirst2(int len) {
#ifdef CHECK_SIZES
if (m_len < 1) {
dynarray_abort("NedDynArray<T>::getFirst2(1)\n");
}
if (m_int_ptr >= m_end_ptr) {
dynarray_abort("NedDynArray<T>::getFirst2(2)\n");
}
if (m_int_ptr + len > m_end_ptr) {
dynarray_abort("NedDynArray<T>::getFirst2(2)\n");
}
#endif
m_int_ptr2 = m_int_ptr;
m_end_ptr2 = m_int_ptr2 + len;
return m_int_ptr2;
}
template <typename T>
T* NedDynArray<T>::getNext2() {
m_int_ptr2++;
if (m_int_ptr2 >= m_end_ptr2) {
return NULL;
}
return m_int_ptr2;
}
template <typename T>
T* NedDynArray<T>::getFirst3() {
#ifdef CHECK_SIZES
if (m_len < 1) {
dynarray_abort("NedDynArray<T>::getFirst3(1)\n");
}
if (m_int_ptr2 >= m_end_ptr) {
dynarray_abort("NedDynArray<T>::getFirst3(2)\n");
}
#endif
m_int_ptr3 = m_int_ptr2 + 1;
if (m_int_ptr3 >= m_end_ptr2) return NULL;
return m_int_ptr3;
}
template <typename T>
T* NedDynArray<T>::getNext3() {
m_int_ptr3++;
if (m_int_ptr3 >= m_end_ptr2) {
return NULL;
}
return m_int_ptr3;
}
template <typename T>
T* NedDynArray<T>::getArray() {
#ifdef CHECK_SIZES
if (m_len < 1) {
dynarray_abort("NedDynArray<T>::getArray\n");
}
#endif
return m_array;
}
template <typename T>
void NedDynArray<T>::setLen(unsigned int len, bool zero) {
#ifdef CHECK_SIZES
if (len > MAX_LEN) {
printf("len = %d, MAX_LEN = %d\n", len, MAX_LEN); fflush(stdout);
dynarray_abort("NedDynArray::setLen\n");
}
#endif
m_len = len;
allocateArray();
if (zero) {
memset(m_array, 0, m_allocLen);
}
}
template <typename T>
void NedDynArray<T>::sort(int (*comfunc)(const void *, const void *)) {
if (m_len < 2) return;
qsort(m_array, m_len, m_element_size, comfunc);
}
template <typename T>
void NedDynArray<T>::empty(bool zero) {
if (zero && m_len > 0) {
memset(m_array, 0, m_allocLen);
}
m_len = 0;
}
template <typename T>
void NedDynArray<T>::zeroArray() {
if (m_len > 0) {
memset(m_array, 0, m_allocLen);
}
}
#endif /* DYN_ARRAY_H */
|
