Fledasty/Src/Core/LinkedList.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));
        if (new_linked_list->start == NULL) {
            return FLEDASTY_ERROR_FAILED_ALLOCATION;
        }

        new_linked_list->start->value = hallocy_malloc(new_linked_list->element_byte_size);
        if (new_linked_list->start->value == NULL) {
            hallocy_free(new_linked_list->start);
            return FLEDASTY_ERROR_FAILED_ALLOCATION;
        }

        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));
            if (new_node == NULL) {
                FledastyLinkedListNode *previous_node = NULL;
                FledastyLinkedListNode *current_node = new_linked_list->start;
                while (current_node != NULL) {
                    previous_node = current_node;
                    current_node = current_node->next;

                    hallocy_free(previous_node->value);
                    hallocy_free(previous_node);
                }

                return FLEDASTY_ERROR_FAILED_ALLOCATION;
            }
            
            new_node->value = hallocy_malloc(new_linked_list->element_byte_size);
            if (new_node->value == NULL) {
                hallocy_free(new_node);
                
                FledastyLinkedListNode *previous_node = NULL;
                FledastyLinkedListNode *current_node = new_linked_list->start;
                while (current_node != NULL) {
                    previous_node = current_node;
                    current_node = current_node->next;

                    hallocy_free(previous_node->value);
                    hallocy_free(previous_node);
                }

                return FLEDASTY_ERROR_FAILED_ALLOCATION;
            }

            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;

        if (hallocy_free(previous_node->value) != HALLOCY_ERROR_NONE) {
            return FLEDASTY_ERROR_FAILED_ALLOCATION;
        }

        if (hallocy_free(previous_node) != 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));
    if (new_node == NULL) {
        return FLEDASTY_ERROR_FAILED_ALLOCATION;
    }

    new_node->value = hallocy_malloc(current_linked_list->element_byte_size);
    if (new_node->value == NULL) {
        hallocy_free(new_node);
        return FLEDASTY_ERROR_FAILED_ALLOCATION;
    }

    hallocy_copy_memory(new_node->value, value, current_linked_list->element_byte_size);
    new_node->next = NULL;
    
    current_linked_list->end->next = new_node;
    current_linked_list->end = new_node;
    current_linked_list->size += 1;

    return FLEDASTY_ERROR_NONE;
}

FledastyError fledasty_linked_list_insert_at_index(FledastyLinkedList *current_linked_list, const size_t index, void *value) {
    if (current_linked_list == NULL || value == NULL) {
        return FLEDASTY_ERROR_INVALID_POINTER;
    }

    if (index > current_linked_list->size) {
        return FLEDASTY_ERROR_INDEX_OUT_OF_RANGE;
    }

    FledastyLinkedListNode *new_node = (FledastyLinkedListNode*)hallocy_malloc(sizeof(FledastyLinkedListNode));
    if (new_node == NULL) {
        return FLEDASTY_ERROR_FAILED_ALLOCATION;
    }

    new_node->value = hallocy_malloc(current_linked_list->element_byte_size);
    if (new_node->value == NULL) {
        hallocy_free(new_node);
        return FLEDASTY_ERROR_FAILED_ALLOCATION;
    }

    hallocy_copy_memory(new_node->value, value, current_linked_list->element_byte_size);
    if (index == 0) {
        new_node->next = current_linked_list->start;
        current_linked_list->start = new_node;
    } else if (index == current_linked_list->size) {
        new_node->next = NULL;
        current_linked_list->end->next = new_node;
        current_linked_list->end = new_node;
    } else {
        FledastyLinkedListNode *current_node = current_linked_list->start;
        for (size_t node = 0; node < index - 1; node += 1) {
            current_node = current_node->next;
        }
    
        new_node->next = current_node->next;
        current_node->next = new_node;
    }

    current_linked_list->size += 1;
    return FLEDASTY_ERROR_NONE;
}

FledastyError fledasty_linked_list_insert_before_value(FledastyLinkedList *current_linked_list, void *before_value, void *value) {
    if (current_linked_list == NULL || before_value == NULL || value == NULL) {
        return FLEDASTY_ERROR_INVALID_POINTER;
    }

    FledastyLinkedListNode *previous_node = NULL;
    FledastyLinkedListNode *current_node = current_linked_list->start;
    while (current_node != NULL) {
        if (hallocy_compare_memory(current_node->value, before_value, current_linked_list->element_byte_size)) {
            FledastyLinkedListNode *new_node = (FledastyLinkedListNode*)hallocy_malloc(sizeof(FledastyLinkedListNode));
            if (new_node == NULL) {
                return FLEDASTY_ERROR_FAILED_ALLOCATION;
            }

            new_node->value = hallocy_malloc(current_linked_list->element_byte_size);
            if (new_node->value == NULL) {
                hallocy_free(new_node);
                return FLEDASTY_ERROR_FAILED_ALLOCATION;
            }

            hallocy_copy_memory(new_node->value, value, current_linked_list->element_byte_size);
            if (previous_node == NULL) {
                new_node->next = current_linked_list->start;
                current_linked_list->start = new_node;
            } else {
                new_node->next = current_node;
                previous_node->next = new_node;
            }

            current_linked_list->size += 1;
            return FLEDASTY_ERROR_NONE;
        }

        previous_node = current_node;
        current_node = current_node->next;
    }
    
    return FLEDASTY_ERROR_VALUE_NOT_FOUND;
}

FledastyError fledasty_linked_list_insert_after_value(FledastyLinkedList *current_linked_list, void *after_value, void *value) {
    if (current_linked_list == NULL || after_value == NULL || value == NULL) {
        return FLEDASTY_ERROR_INVALID_POINTER;
    }

    FledastyLinkedListNode *current_node = current_linked_list->start;
    while (current_node != NULL) {
        if (hallocy_compare_memory(current_node->value, after_value, current_linked_list->element_byte_size)) {
            FledastyLinkedListNode *new_node = (FledastyLinkedListNode*)hallocy_malloc(sizeof(FledastyLinkedListNode));
            if (new_node == NULL) {
                return FLEDASTY_ERROR_FAILED_ALLOCATION;
            }

            new_node->value = hallocy_malloc(current_linked_list->element_byte_size);
            if (new_node->value == NULL) {
                hallocy_free(new_node);
                return FLEDASTY_ERROR_FAILED_ALLOCATION;
            }

            hallocy_copy_memory(new_node->value, value, current_linked_list->element_byte_size);
            if (current_node == current_linked_list->end) {
                new_node->next = NULL;

                current_linked_list->end->next = new_node;
                current_linked_list->end = new_node;
            } else {
                new_node->next = current_node->next;
                current_node->next = new_node;
            }

            current_linked_list->size += 1;
            return FLEDASTY_ERROR_NONE;
        }

        current_node = current_node->next;
    }

    return FLEDASTY_ERROR_VALUE_NOT_FOUND;
}

FledastyError fledasty_linked_list_remove_at_index(FledastyLinkedList *current_linked_list, const size_t index) {
    if (current_linked_list == NULL) {
        return FLEDASTY_ERROR_INVALID_POINTER;
    }

    if (index >= current_linked_list->size) {
        return FLEDASTY_ERROR_INDEX_OUT_OF_RANGE;
    }

    FledastyLinkedListNode *previous_node = NULL;
    FledastyLinkedListNode *current_node = current_linked_list->start;
    for (size_t node = 0; node < index; node += 1) {
        previous_node = current_node;
        current_node = current_node->next;
    }

    if (current_node == current_linked_list->end) {
        current_linked_list->end = previous_node;
    }

    if (previous_node == NULL) {
        current_linked_list->start = current_node->next;
    } else {
        previous_node->next = current_node->next;
    }

    if (hallocy_free(current_node->value) != HALLOCY_ERROR_NONE) {
        return FLEDASTY_ERROR_FAILED_ALLOCATION;
    }

    if (hallocy_free(current_node) != HALLOCY_ERROR_NONE) {
        return FLEDASTY_ERROR_FAILED_ALLOCATION;
    }

    current_linked_list->size -= 1;
    return FLEDASTY_ERROR_NONE;
}

FledastyError fledasty_linked_list_remove_value(FledastyLinkedList *current_linked_list, void *value) {
    if (current_linked_list == NULL || value == NULL) {
        return FLEDASTY_ERROR_INVALID_POINTER;
    }

    FledastyLinkedListNode *previous_node = NULL;
    FledastyLinkedListNode *current_node = current_linked_list->start;
    while (current_node != NULL) {
        if (hallocy_compare_memory(current_node->value, value, current_linked_list->element_byte_size)) {
            if (current_node == current_linked_list->end) {
                current_linked_list->end = previous_node;
            }

            if (previous_node == NULL) {
                current_linked_list->start = current_node->next;
            } else {
                previous_node->next = current_node->next;
            }

            if (hallocy_free(current_node->value) != HALLOCY_ERROR_NONE) {
                return FLEDASTY_ERROR_FAILED_ALLOCATION;
            }
            
            if (hallocy_free(current_node) != HALLOCY_ERROR_NONE) {
                return FLEDASTY_ERROR_FAILED_ALLOCATION;
            }

            current_linked_list->size -= 1;
            return FLEDASTY_ERROR_NONE;
        }

        previous_node = current_node;
        current_node = current_node->next;
    }

    return FLEDASTY_ERROR_VALUE_NOT_FOUND;
}

FledastyError fledasty_linked_list_clear(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;

        if (hallocy_free(previous_node->value) != HALLOCY_ERROR_NONE) {
            return FLEDASTY_ERROR_FAILED_ALLOCATION;
        }

        if (hallocy_free(previous_node) != HALLOCY_ERROR_NONE) {
            return FLEDASTY_ERROR_FAILED_ALLOCATION;
        }
    }
    
    current_linked_list->start = NULL;
    current_linked_list->end = NULL;

    current_linked_list->size = 0;
    return FLEDASTY_ERROR_NONE;
}

bool fledasty_linked_list_has_value(const FledastyLinkedList *current_linked_list, void *value) {
    if (current_linked_list == NULL || value == NULL) {
        return false;
    }

    FledastyLinkedListNode *current_node = current_linked_list->start;
    while (current_node != NULL) {
        if (hallocy_compare_memory(current_node->value, value, current_linked_list->element_byte_size)) {
            return true;
        }

        current_node = current_node->next;
    }

    return false;
}