Mineplay/Fledasty
1
0
Fork 0
Code Issues 5 Pull requests 1 Projects 1 Releases Packages Wiki Activity Actions

feat(dynamic array): implemented get function for dynamic array

Browse source
This commit is contained in:
Mineplay 2025-04-24 17:51:53 -05:00
parent 42f537ebd1
commit 4388756371
3 changed files with 21 additions and 5 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
Include/Fledasty/Core/DynamicArray.h
View file

@ -41,4 +41,6 @@ FledastyError fledasty_dynamic_array_destroy(FledastyDynamicArray *current_dynam
FledastyError fledasty_dynamic_array_append(FledastyDynamicArray *current_dynamic_array, void *value);
FledastyError fledasty_dynamic_array_insert_at_index(FledastyDynamicArray *current_dynamic_array, const size_t index, void *value);
void *fledasty_dynamic_array_get(FledastyDynamicArray *current_dynamic_array, const size_t index);
#endif

11
Src/Core/DynamicArray.c
View file

@ -101,8 +101,17 @@ FledastyError fledasty_dynamic_array_insert_at_index(FledastyDynamicArray *curre
}
unsigned char *insert_pointer = current_dynamic_array->buffer + (index * current_dynamic_array->element_byte_size);
hallocy_move_memory(insert_pointer, insert_pointer + current_dynamic_array->element_byte_size, (current_dynamic_array->size - index) * current_dynamic_array->element_byte_size);
hallocy_move_memory(insert_pointer + current_dynamic_array->element_byte_size, insert_pointer, (current_dynamic_array->size - index) * current_dynamic_array->element_byte_size);
hallocy_copy_memory(insert_pointer, value, current_dynamic_array->element_byte_size);
current_dynamic_array->size += 1;
return FLEDASTY_ERROR_NONE;
}
void *fledasty_dynamic_array_get(FledastyDynamicArray *current_dynamic_array, const size_t index) {
if (current_dynamic_array == NULL || index >= current_dynamic_array->size) {
return NULL;
}
return current_dynamic_array->buffer + (index * current_dynamic_array->element_byte_size);
}

13
Tests/Main.c
View file

@ -33,11 +33,11 @@ int main() {
}
int *peeked_queue_data = (int*)fledasty_queue_peek(&test_queue);
printf("Peeked: %d\n", *peeked_queue_data);
printf("Queue peeked: %d\n", *peeked_queue_data);
for (int i = test_queue.size; i > 0; i -= 1) {
int *popped_data = (int*)fledasty_queue_pop(&test_queue);
printf("Popped: %d\n", *popped_data);
printf("Queue popped: %d\n", *popped_data);
}
if (fledasty_queue_is_empty(&test_queue)) {
@ -54,11 +54,11 @@ int main() {
}
int *peeked_stack_data = (int*)fledasty_stack_peek(&test_stack);
printf("Peeked: %d\n", *peeked_stack_data);
printf("Stack peeked: %d\n", *peeked_stack_data);
for (int i = test_stack.size; i > 0; i -= 1) {
int *popped_data = (int*)fledasty_stack_pop(&test_stack);
printf("Popped: %d\n", *popped_data);
printf("Stack popped: %d\n", *popped_data);
}
if (fledasty_stack_is_empty(&test_stack)) {
@ -76,6 +76,11 @@ int main() {
int insert_value = 18;
fledasty_dynamic_array_insert_at_index(&test_dynamic_array, 1, &insert_value);
for (int i = 0; i < test_dynamic_array.size; i += 1) {
int *dynamic_array_data = (int*)fledasty_dynamic_array_get(&test_dynamic_array, i);
printf("Dynamic array get: %d\n", *dynamic_array_data);
}
fledasty_dynamic_array_destroy(&test_dynamic_array);
printf("Done\n");
return 0;