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
|
#ifndef PK_PKARR_H
#define PK_PKARR_H
#include <stdint.h>
#include "pkmem.h" /* delete me */
struct pk_arr {
uint32_t next;
uint32_t reserved;
uint32_t stride;
uint32_t alignment;
struct pk_membucket *bkt;
void *data;
};
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);
#endif /* PK_PKARR_H */
#ifdef PK_IMPL_ARR
#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)
{
arr->next = 0;
arr->reserved = 0;
if (arr->data != NULL) pk_delete(arr->data, arr->stride * arr->reserved, arr->bkt);
arr->data = NULL;
}
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) {
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;
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;
}
void
pk_arr_append(struct pk_arr *arr, void *data)
{
if (arr->reserved == arr->next) {
uint32_t new_count = arr->reserved == 0 ? PK_ARR_INITIAL_COUNT : arr->reserved * PK_ARR_GROW_RATIO;
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;
}
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;
arr->next -= 1;
}
#endif /* PK_IMPL_ARR */
|
