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
|
#include "DynamicArray.h"
/*
* This file, as the rest of the project is under MIT license.
* see http://opensource.org/licenses/MIT
*
* Author Gustav Hartvigsson <gustav.hartvigsson _at_ gmail.com> 2014
*/
struct _DynamicArray {
void ** array;
size_t max_size;
size_t len;
};
DynamicArray * dynamic_array_new (size_t len) {
DynamicArray * self = malloc (sizeof(DynamicArray));
self->max_size = len;
self->len = 0;
self->array = malloc (len);
return self;
}
void dynamic_array_free (DynamicArray * self) {
free (self->array);
free (self);
}
void * dynamic_array_get (DynamicArray * self, size_t index) {
return self->array[index];
}
size_t dynamic_array_len (DynamicArray * self) {
return self->len;
}
void dynamic_array_add (DynamicArray * self, void * data) {
if (self->len == self->max_size) {
self->array = realloc (self->array, self->max_size + ARRAY_PADDING);
self->max_size = self->max_size + ARRAY_PADDING;
}
self->array[self->len + 1] = data;
self->len++;
}
void ** dynamic_array_dump_array (DynamicArray * self) {
void ** ret_val = malloc (self->len + 1);
for (int i = 0; i >= self->len; i++) {
ret_val[i] = self->array[i];
}
ret_val[self->len + 1] = NULL;
return ret_val;
}
void dynamic_array_for_each (DynamicArray * self, ForEachFunc func,
void * data) {
for (int i = 0; i <= self->len; i++) {
func (self, self->array[i], data);
}
}
|