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

feat(doubly linked list): implemented append function

Browse source
This commit is contained in:
Mineplay 2025-04-26 09:20:11 -05:00
parent 0c306da31c
commit d0c552362b
3 changed files with 55 additions and 23 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

6
Include/Fledasty/Core/DoublyLinkedList.h
View file

@ -39,7 +39,9 @@ typedef struct {
FledastyDoublyLinkedListNode *start, *end;
} FledastyDoublyLinkedList;
FledastyError fledasty_doubly_linked_list_initialize(FledastyDoublyLinkedList *new_linked_list, void *values, const size_t values_size, const size_t element_byte_size);
FledastyError fledasty_doubly_list_destroy(FledastyDoublyLinkedList *current_linked_list);
FledastyError fledasty_doubly_linked_list_initialize(FledastyDoublyLinkedList *new_doubly_linked_list, void *values, const size_t values_size, const size_t element_byte_size);
FledastyError fledasty_doubly_list_destroy(FledastyDoublyLinkedList *current_doubly_linked_list);
FledastyError fledasty_doubly_linked_list_append(FledastyDoublyLinkedList *current_doubly_linked_list, void *value);
#endif

62
Src/Core/DoublyLinkedList.c
View file

@ -27,31 +27,31 @@
#include <Hallocy/Core/Memory.h>
#include <Hallocy/Utils/Error.h>
FledastyError fledasty_doubly_linked_list_initialize(FledastyDoublyLinkedList *new_linked_list, void *values, const size_t values_size, const size_t element_byte_size) {
if (new_linked_list == NULL) {
FledastyError fledasty_doubly_linked_list_initialize(FledastyDoublyLinkedList *new_doubly_linked_list, void *values, const size_t values_size, const size_t element_byte_size) {
if (new_doubly_linked_list == NULL) {
return FLEDASTY_ERROR_FAILED_ALLOCATION;
}
new_linked_list->element_byte_size = element_byte_size;
new_doubly_linked_list->element_byte_size = element_byte_size;
if (values == NULL || values_size == 0) {
new_linked_list->size = 0;
new_linked_list->start = NULL;
new_linked_list->end = NULL;
new_doubly_linked_list->size = 0;
new_doubly_linked_list->start = NULL;
new_doubly_linked_list->end = NULL;
} else {
new_linked_list->size = values_size;
new_doubly_linked_list->size = values_size;
new_linked_list->start = (FledastyDoublyLinkedListNode*)hallocy_malloc(sizeof(FledastyDoublyLinkedListNode));
new_linked_list->start->value = hallocy_malloc(new_linked_list->element_byte_size);
hallocy_copy_memory(new_linked_list->start->value, values, new_linked_list->element_byte_size);
new_doubly_linked_list->start = (FledastyDoublyLinkedListNode*)hallocy_malloc(sizeof(FledastyDoublyLinkedListNode));
new_doubly_linked_list->start->value = hallocy_malloc(new_doubly_linked_list->element_byte_size);
hallocy_copy_memory(new_doubly_linked_list->start->value, values, new_doubly_linked_list->element_byte_size);
new_linked_list->start->previous = NULL;
new_linked_list->start->next = NULL;
new_doubly_linked_list->start->previous = NULL;
new_doubly_linked_list->start->next = NULL;
FledastyDoublyLinkedListNode *last_node = new_linked_list->start;
for (size_t index = new_linked_list->element_byte_size; index < new_linked_list->size * new_linked_list->element_byte_size; index += new_linked_list->element_byte_size) {
FledastyDoublyLinkedListNode *last_node = new_doubly_linked_list->start;
for (size_t index = new_doubly_linked_list->element_byte_size; index < new_doubly_linked_list->size * new_doubly_linked_list->element_byte_size; index += new_doubly_linked_list->element_byte_size) {
FledastyDoublyLinkedListNode *new_node = (FledastyDoublyLinkedListNode*)hallocy_malloc(sizeof(FledastyDoublyLinkedListNode));
new_node->value = hallocy_malloc(new_linked_list->element_byte_size);
hallocy_copy_memory(new_node->value, (unsigned char*)values + index, new_linked_list->element_byte_size);
new_node->value = hallocy_malloc(new_doubly_linked_list->element_byte_size);
hallocy_copy_memory(new_node->value, (unsigned char*)values + index, new_doubly_linked_list->element_byte_size);
new_node->previous = last_node;
new_node->next = NULL;
@ -60,18 +60,18 @@ FledastyError fledasty_doubly_linked_list_initialize(FledastyDoublyLinkedList *n
last_node = new_node;
}
new_linked_list->end = last_node;
new_doubly_linked_list->end = last_node;
}
return FLEDASTY_ERROR_NONE;
}
FledastyError fledasty_doubly_list_destroy(FledastyDoublyLinkedList *current_linked_list) {
if (current_linked_list == NULL) {
FledastyError fledasty_doubly_list_destroy(FledastyDoublyLinkedList *current_doubly_linked_list) {
if (current_doubly_linked_list == NULL) {
return FLEDASTY_ERROR_INVALID_POINTER;
}
FledastyDoublyLinkedListNode *current_node = current_linked_list->start;
FledastyDoublyLinkedListNode *current_node = current_doubly_linked_list->start;
while (current_node->next != NULL) {
current_node = current_node->next;
@ -92,4 +92,24 @@ FledastyError fledasty_doubly_list_destroy(FledastyDoublyLinkedList *current_lin
}
return FLEDASTY_ERROR_NONE;
}
}
FledastyError fledasty_doubly_linked_list_append(FledastyDoublyLinkedList *current_doubly_linked_list, void *value) {
if (current_doubly_linked_list == NULL || value == NULL) {
return FLEDASTY_ERROR_INVALID_POINTER;
}
FledastyDoublyLinkedListNode *new_node = (FledastyDoublyLinkedListNode*)hallocy_malloc(sizeof(FledastyDoublyLinkedListNode));
new_node->value = hallocy_malloc(current_doubly_linked_list->element_byte_size);
hallocy_copy_memory(new_node->value, value, current_doubly_linked_list->element_byte_size);
new_node->previous = current_doubly_linked_list->end;
new_node->next = NULL;
current_doubly_linked_list->end->next = new_node;
current_doubly_linked_list->end = new_node;
current_doubly_linked_list->size += 1;
return FLEDASTY_ERROR_NONE;
}

10
Tests/Main.c
View file

@ -142,6 +142,16 @@ int main() {
FledastyDoublyLinkedList test_doubly_linked_list;
fledasty_doubly_linked_list_initialize(&test_doubly_linked_list, (int[]){11, 12, 13, 14, 15}, 5, sizeof(int));
for (int i = 0; i < 10; i += 1) {
fledasty_doubly_linked_list_append(&test_doubly_linked_list, &i);
}
FledastyDoublyLinkedListNode *test_doubly_linked_list_node = test_doubly_linked_list.start;
for (int i = 0; i < test_doubly_linked_list.size; i += 1) {
printf("Doubly linked list get: %d\n", *(int*)test_doubly_linked_list_node->value);
test_doubly_linked_list_node = test_doubly_linked_list_node->next;
}
fledasty_doubly_list_destroy(&test_doubly_linked_list);
printf("Done\n");
return 0;