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
|
#ifndef PK_PKARR_H
#define PK_PKARR_H
#include <stdint.h>
#include "pkmem.h" /* deleteme */
struct pk_arr {
uint32_t next;
uint32_t reserved;
uint32_t stride;
uint32_t alignment;
struct pk_membucket *bkt;
void *data;
};
typedef bool(pk_arr_item_compare)(void *user_data, void *item);
void pk_arr_clear(struct pk_arr *arr);
void pk_arr_reset(struct pk_arr *arr);
void pk_arr_reserve(struct pk_arr *arr, uint32_t count);
void pk_arr_resize(struct pk_arr *arr, uint32_t count);
void pk_arr_move_to_back(struct pk_arr *arr, uint32_t index);
void pk_arr_append(struct pk_arr *arr, void *data);
void pk_arr_remove_at(struct pk_arr *arr, uint32_t index);
uint32_t pk_arr_find_first_index(struct pk_arr *arr, void *user_data, pk_arr_item_compare *fn);
#endif /* PK_PKARR_H */
#ifdef PK_IMPL_ARR
#include "./pkmacros.h" /* deleteme */
#ifndef PK_ARR_GROW_RATIO
#define PK_ARR_GROW_RATIO 1.5
#endif
#ifndef PK_ARR_INITIAL_COUNT
#define PK_ARR_INITIAL_COUNT 16
#endif
void
pk_arr_clear(struct pk_arr *arr)
{
arr->next = 0;
}
void
pk_arr_reset(struct pk_arr *arr)
{
if (arr->data != NULL) pk_delete(arr->data, arr->stride * arr->reserved, arr->bkt);
arr->data = NULL;
arr->next = 0;
arr->reserved = 0;
}
void
pk_arr_reserve(struct pk_arr *arr, uint32_t count)
{
if (arr->reserved >= count) return;
void *new_data = pk_new(arr->stride * count, arr->alignment, arr->bkt);
if (arr->data != NULL) {
if (arr->next != 0) {
memcpy(new_data, arr->data, arr->stride * arr->reserved);
}
pk_delete(arr->data, arr->stride * arr->reserved, arr->bkt);
}
arr->reserved = count;
arr->data = new_data;
}
void
pk_arr_resize(struct pk_arr *arr, uint32_t count)
{
pk_arr_reserve(arr, count);
arr->next = count;
}
void
pk_arr_move_to_back(struct pk_arr *arr, uint32_t index)
{
if (arr->reserved == 0) return;
if (arr->next <= 1) return;
#ifdef PK_ARR_MOVE_IN_PLACE
uint32_t i, ii;
char *target = (char *)pk_new(arr->stride, arr->alignment, arr->bkt);
char *buffer = (char *)arr->data;
// copy bytes to temp buffer
for (ii = 0, i = arr->stride * index; ii < arr->stride; ++ii, ++i) {
target[ii] = buffer[i];
}
// shift everything forward
// arr->stride = 8
// arr->next = 2
// index = 0
//
// for (i = 0; i < 8; ++i) {
// b[i] = b[i + 8]
// }
// b[00] = b[08]
// b[01] = b[09]
// ...
// b[07] = b[15]
for (i = arr->stride * index; i < (arr->stride * (arr->next - 1)); ++i) {
buffer[i] = buffer[i + arr->stride];
}
// copy temp buffer back into arr
// arr->stride = 8
// arr->next = 2
// index = 0
//
// for (ii = 0, i = 8; ii < 8; ++ii, ++i) {
// b[i] = t[ii]
// }
// b[08] = t[00]
// b[09] = t[01]
// ...
// b[15] = t[07]
for (ii = 0, i = arr->stride * (arr->next - 1); ii < arr->stride; ++ii, ++i) {
buffer[i] = target[ii];
}
pk_delete(target, arr->stride, arr->bkt);
#else
char *new_data = (char *)pk_new(arr->stride * arr->reserved, arr->alignment, arr->bkt);
if (index > 0) {
memcpy(new_data, arr->data, arr->stride * index);
}
memcpy(
new_data + (arr->stride * (arr->next - 1)),
((char *)arr->data) + (arr->stride * index),
arr->stride);
memcpy(
new_data + (arr->stride * index),
((char *)arr->data) + (arr->stride * (index + 1)),
arr->stride * (arr->next - index - 1));
pk_delete(arr->data, arr->stride * arr->reserved, arr->bkt);
arr->data = (void *)new_data;
#endif
}
void
pk_arr_append(struct pk_arr *arr, void *data)
{
if (arr->reserved == arr->next) {
uint32_t new_count = PK_MAX(arr->reserved == 0 ? PK_ARR_INITIAL_COUNT : arr->reserved * PK_ARR_GROW_RATIO, arr->reserved + 1);
void *new_data = pk_new(arr->stride * new_count, arr->alignment, arr->bkt);
if (arr->data != NULL) {
memcpy(new_data, arr->data, arr->stride * arr->reserved);
pk_delete(arr->data, arr->stride * arr->reserved, arr->bkt);
}
arr->data = new_data;
arr->reserved = new_count;
}
memcpy(((char *)arr->data) + (arr->stride * arr->next), data, arr->stride);
arr->next += 1;
return;
}
void
pk_arr_remove_at(struct pk_arr *arr, uint32_t index)
{
if (arr->reserved == 0) return;
if (index == arr->next - 1) {
arr->next -=1;
return;
}
#ifdef PK_ARR_MOVE_IN_PLACE
uint32_t i;
char *buffer = (char *)arr->data;
// shift everything forward
// arr->stride = 8
// arr->next = 3
// index = 0
//
// for (i = 0; i < 16; ++i) {
// b[i] = b[i + 8]
// }
// b[00] = b[08]
// b[01] = b[09]
// ...
// b[15] = b[23]
for (i = arr->stride * index; i < arr->stride * arr->next; ++i) {
buffer[i] = buffer[i + arr->stride];
}
#else
char *new_data = (char *)pk_new(arr->stride * arr->reserved, arr->alignment, arr->bkt);
if (index > 0) {
memcpy(new_data, arr->data, arr->stride * index);
}
memcpy(
new_data + (arr->stride * index),
((char *)arr->data) + (arr->stride * (index + 1)),
arr->stride * (arr->next - index - 1));
pk_delete(arr->data, arr->stride * arr->reserved, arr->bkt);
arr->data = (void *)new_data;
#endif
arr->next -= 1;
}
uint32_t
pk_arr_find_first_index(struct pk_arr *arr, void *user_data, pk_arr_item_compare *fn)
{
uint32_t i;
char *char_data = (char *)arr->data;
for (i = 0; i < arr->next; ++i) {
if (fn(user_data, char_data + (arr->stride * i))) return i;
}
return -1;
}
#endif /* PK_IMPL_ARR */
|
