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
|
/**
* @file lv_array.c
* Array.
* The nodes are dynamically allocated by the 'lv_mem' module,
*/
/*********************
* INCLUDES
*********************/
#include "lv_array.h"
#include "../stdlib/lv_mem.h"
#include "../stdlib/lv_string.h"
#include "lv_assert.h"
/*********************
* DEFINES
*********************/
/**********************
* TYPEDEFS
**********************/
/**********************
* STATIC PROTOTYPES
**********************/
/**********************
* STATIC VARIABLES
**********************/
/**********************
* MACROS
**********************/
/**********************
* GLOBAL FUNCTIONS
**********************/
void lv_array_init(lv_array_t * array, uint32_t capacity, uint32_t element_size)
{
array->size = 0;
array->capacity = capacity;
array->element_size = element_size;
array->data = lv_malloc(capacity * element_size);
LV_ASSERT_MALLOC(array->data);
}
void lv_array_deinit(lv_array_t * array)
{
if(array->data) {
lv_free(array->data);
array->data = NULL;
}
array->size = 0;
array->capacity = 0;
}
void lv_array_copy(lv_array_t * target, const lv_array_t * source)
{
if(lv_array_is_empty(source)) {
return;
}
lv_array_deinit(target);
lv_array_init(target, source->capacity, source->element_size);
lv_memcpy(target->data, source->data, source->size * source->element_size);
target->size = source->size;
}
void lv_array_shrink(lv_array_t * array)
{
if(array->size <= array->capacity / LV_ARRAY_DEFAULT_SHRINK_RATIO) {
lv_array_resize(array, array->size);
}
}
lv_result_t lv_array_remove(lv_array_t * array, uint32_t index)
{
if(index >= array->size) {
return LV_RESULT_INVALID;
}
/*Shortcut*/
if(index == array->size - 1) {
array->size--;
lv_array_shrink(array);
return LV_RESULT_OK;
}
uint8_t * start = lv_array_at(array, index);
uint8_t * remaining = start + array->element_size;
uint32_t remaining_size = (array->size - index - 1) * array->element_size;
lv_memmove(start, remaining, remaining_size);
array->size--;
lv_array_shrink(array);
return LV_RESULT_OK;
}
lv_result_t lv_array_erase(lv_array_t * array, uint32_t start, uint32_t end)
{
if(end > array->size) {
end = array->size;
}
if(start >= end) {
return LV_RESULT_INVALID;
}
/*Shortcut*/
if(end == array->size) {
array->size = start;
lv_array_shrink(array);
return LV_RESULT_OK;
}
uint8_t * start_p = lv_array_at(array, start);
uint8_t * remaining = start_p + (end - start) * array->element_size;
uint32_t remaining_size = (array->size - end) * array->element_size;
lv_memcpy(start_p, remaining, remaining_size);
array->size -= (end - start);
lv_array_shrink(array);
return LV_RESULT_OK;
}
void lv_array_resize(lv_array_t * array, uint32_t new_capacity)
{
uint8_t * data = lv_realloc(array->data, new_capacity * array->element_size);
LV_ASSERT_NULL(data);
array->data = data;
array->capacity = new_capacity;
if(array->size > new_capacity) {
array->size = new_capacity;
}
}
lv_result_t lv_array_concat(lv_array_t * array, const lv_array_t * other)
{
LV_ASSERT_NULL(array->data);
uint32_t size = other->size;
if(array->size + size > array->capacity) {
/*array is full*/
lv_array_resize(array, array->size + size);
}
uint8_t * data = array->data + array->size * array->element_size;
lv_memcpy(data, other->data, array->element_size * size);
array->size += size;
return LV_RESULT_OK;
}
lv_result_t lv_array_push_back(lv_array_t * array, const void * element)
{
LV_ASSERT_NULL(array->data);
if(array->size == array->capacity) {
/*array is full*/
lv_array_resize(array, array->capacity + LV_ARRAY_DEFAULT_CAPACITY);
}
uint8_t * data = array->data + array->size * array->element_size;
lv_memcpy(data, element, array->element_size);
array->size++;
return LV_RESULT_OK;
}
void * lv_array_at(const lv_array_t * array, uint32_t index)
{
if(index >= array->size) {
return NULL;
}
LV_ASSERT_NULL(array->data);
return array->data + index * array->element_size;
}
lv_result_t lv_array_assign(lv_array_t * array, uint32_t index, const void * value)
{
uint8_t * data = lv_array_at(array, index);
if(data == NULL) return LV_RESULT_INVALID;
lv_memcpy(data, value, array->element_size);
return LV_RESULT_OK;
}
uint32_t lv_array_size(const lv_array_t * array)
{
return array->size;
}
uint32_t lv_array_capacity(const lv_array_t * array)
{
return array->capacity;
}
bool lv_array_is_empty(const lv_array_t * array)
{
return array->size == 0;
}
bool lv_array_is_full(const lv_array_t * array)
{
return array->size == array->capacity;
}
void lv_array_clear(lv_array_t * array)
{
array->size = 0;
}
void * lv_array_front(const lv_array_t * array)
{
return lv_array_at(array, 0);
}
void * lv_array_back(const lv_array_t * array)
{
return lv_array_at(array, lv_array_size(array) - 1);
}
/**********************
* STATIC FUNCTIONS
**********************/
|
