Linked-List-Int.h

struct ListNodeInt
{
    int value;
    struct ListNodeInt *next;
};

typedef struct ListNodeInt ListNodeInt;


/// @brief Prints the values of the list.
/// @param list The pointer to the first node of the list.
void listIntPrint(ListNodeInt* list);

/// @brief Adds provided value in the list.
/// @param list The pointer to the first node of the list.
/// @param value The value to be added at the end of the list.
/// @return The address of the first node of the list.
ListNodeInt* listIntAdd(ListNodeInt* list, int value);

/// @brief Adds provided value in the list so that it remains sorted.
/// @param list The pointer to the first node of the list.
/// @param value The value to be added in the list.
/// @return The address of the first node of the list.
ListNodeInt* listIntAddSorted(ListNodeInt* list, int value);

/// @brief Updates value at given index in list.
/// @param list The pointer to the frist node of the list.
/// @param index The index of the node to have value updated.
/// @param oldValue The value that is currently in that node.
/// @param newValue The value that will replace the old one.
/// @return The address of the first node of the list or NULL if operation could not be completed.
ListNodeInt* listIntUpdate(ListNodeInt* list, int index, int oldValue, int newValue);

/// @brief Removes first occurence of the provided value from the list, if it is present.
/// @param list The pointer to the first node of the list.
/// @param value The value to be removed from the list.
/// @return The address of the first node of the list or NULL if list is empty.
ListNodeInt* listIntRemove(ListNodeInt* list, int value);

/// @brief Finds the provided value in the list, if it is present.
/// @param list The pointer to the first node of the list.
/// @param value The value to be found in the list.
/// @return The address of the node that contains the value provided or NULL if the value doen not exist in list.
ListNodeInt* listIntFind(ListNodeInt* list, int value);

/// @brief A function to get the last node of the list.
/// @param list The pointer to the first node of the list.
/// @return The last node of the list or NULL if list is empty(NULL).
ListNodeInt* getLastIntNode(ListNodeInt* list);

/// @brief A function to get the node at specified index in the list.
/// @param list The pointer to the first node of the list.
/// @param index The index of the wanted node.
/// @return The node at the specified index, or NULL if list is empty or index is out of bounds.
ListNodeInt* getIndexIntNode(ListNodeInt* list, int index);

/// @brief A function to get the index of a node that would contain the given value if added sorted in the current list.
/// @param list The pointer to the first node of the list.
/// @param value The value to be used.
/// @return (Index of the node after which the value should be inserted) + 1 = Index at which the value should be inserted.
int getSortedIndexOfValue(ListNodeInt* list, int value);