104 lines
4.1 KiB
C
104 lines
4.1 KiB
C
/*
|
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
|
* you may not use this file except in compliance with the License.
|
|
* You may obtain a copy of the License at
|
|
*
|
|
* http://www.apache.org/licenses/LICENSE-2.0
|
|
*
|
|
* Unless required by applicable law or agreed to in writing, software
|
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
* See the License for the specific language governing permissions and
|
|
* limitations under the License.
|
|
*
|
|
* -----------------------------------------------------------------------------
|
|
* File: LinkedList.c
|
|
* Description:
|
|
* This file contains the functions for modifying the Linked List. It includes
|
|
* functions to append, Insert before, Insert after, Insert at index,
|
|
* Get, Remove element, Remove at index, Check if has element and Check if is empty.
|
|
*
|
|
* Author: Mineplay
|
|
* -----------------------------------------------------------------------------
|
|
*/
|
|
#include "../../Include/Fledasty/Core/LinkedList.h"
|
|
|
|
#include <Hallocy/Core/Allocator.h>
|
|
#include <Hallocy/Core/Memory.h>
|
|
#include <Hallocy/Utils/Error.h>
|
|
|
|
FledastyError fledasty_linked_list_initialize(FledastyLinkedList *new_linked_list, void *values, const size_t values_size, const size_t element_byte_size) {
|
|
if (new_linked_list == NULL) {
|
|
return FLEDASTY_ERROR_FAILED_ALLOCATION;
|
|
}
|
|
|
|
new_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;
|
|
} else {
|
|
new_linked_list->size = values_size;
|
|
|
|
new_linked_list->start = (FledastyLinkedListNode*)hallocy_malloc(sizeof(FledastyLinkedListNode));
|
|
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_linked_list->start->next = NULL;
|
|
|
|
FledastyLinkedListNode *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) {
|
|
FledastyLinkedListNode *new_node = (FledastyLinkedListNode*)hallocy_malloc(sizeof(FledastyLinkedListNode));
|
|
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->next = NULL;
|
|
last_node->next = new_node;
|
|
last_node = new_node;
|
|
}
|
|
|
|
new_linked_list->end = last_node;
|
|
}
|
|
|
|
return FLEDASTY_ERROR_NONE;
|
|
}
|
|
|
|
FledastyError fledasty_linked_list_destroy(FledastyLinkedList *current_linked_list) {
|
|
if (current_linked_list == NULL) {
|
|
return FLEDASTY_ERROR_INVALID_POINTER;
|
|
}
|
|
|
|
FledastyLinkedListNode *previous_node = NULL;
|
|
FledastyLinkedListNode *current_node = current_linked_list->start;
|
|
while (current_node != NULL) {
|
|
previous_node = current_node;
|
|
current_node = current_node->next;
|
|
|
|
HallocyError result = hallocy_free(previous_node->value);
|
|
if (result == HALLOCY_ERROR_NONE) {
|
|
return FLEDASTY_ERROR_FAILED_ALLOCATION;
|
|
}
|
|
|
|
result = hallocy_free(previous_node);
|
|
if (result == HALLOCY_ERROR_NONE) {
|
|
return FLEDASTY_ERROR_FAILED_ALLOCATION;
|
|
}
|
|
}
|
|
|
|
return FLEDASTY_ERROR_NONE;
|
|
}
|
|
|
|
FledastyError fledasty_linked_list_append(FledastyLinkedList *current_linked_list, void *value) {
|
|
if (current_linked_list == NULL || value == NULL) {
|
|
return FLEDASTY_ERROR_INVALID_POINTER;
|
|
}
|
|
|
|
FledastyLinkedListNode *new_node = (FledastyLinkedListNode*)hallocy_malloc(sizeof(FledastyLinkedListNode));
|
|
|
|
new_node->value = hallocy_malloc(current_linked_list->element_byte_size);
|
|
hallocy_copy_memory(new_node->value, value, current_linked_list->element_byte_size);
|
|
new_node->next = NULL;
|
|
|
|
current_linked_list->end->next = new_node;
|
|
|
|
return FLEDASTY_ERROR_NONE;
|
|
}
|