The function prototypes inside the header files for each container are not accompanied by docstrings describing their purpose, arguments, and return values.

Modify DSCList to implement a doubly linked list

Description

DSCList implements a singly linked list. To enhance the functionality of this library, modify DSCList so that it implements a doubly linked list.

Tasks

1. Update the DSCNode structure:

   • Add a new member prev of type DSCNode * to store the pointer to the previous node.

2. Modify the DSCList structure:

   • Add a new member tail of type DSCList * to store the pointer to the last node in the list.

3. Update the dsc_list_create() function:

   • Initialize the tail member of the newly created list to NULL.

4. Update the dsc_list_destroy() function:

   • Ensure that all nodes are properly freed and the head and tail pointers are set to NULL after destruction.

5. Modify the dsc_list_push_front() function:

   • Update the prev pointer of the new node to NULL.
   • If the list is empty, set the tail pointer to the new node.

6. Implement a new function dsc_list_push_back():

   • Create a new function to insert a node at the end of the list.
   • Update the next pointer of the current last node to the new node.
   • Update the prev pointer of the new node to the current last node.
   • Update the tail pointer to the new node.

7. Update the dsc_list_insert_after() function:

   • Modify the function to handle the prev pointers correctly when inserting a node after a specific node.
   • Update the tail pointer if the new node is inserted at the end of the list.

8. Implement a new function dsc_list_insert_before():

   • Create a new function to insert a node before a specific node in the list.
   • Update the prev and next pointers accordingly.
   • Update the head pointer if the new node is inserted at the beginning of the list.

9. Update the dsc_list_pop_front() function:

   • Modify the function to handle the prev pointer of the new head node.
   • Update the tail pointer if the list becomes empty after removing the front node.

10. Implement a new function dsc_list_pop_back():

    • Create a new function to remove the last node from the list.
    • Update the next pointer of the new last node to NULL.
    • Update the tail pointer to the new last node.

11. Update the dsc_list_remove() and dsc_list_remove_all() functions:

    • Modify these functions to handle the prev and next pointers correctly when removing nodes from the list.
    • Update the head and tail pointers if necessary.

12. Update the dsc_list_get_head() function:

    • Rename the function to dsc_list_get_front() for consistency.

13. Implement a new function dsc_list_get_tail():

    • Create a new function to retrieve the last node of the list using the tail pointer.

14. Update the documentation:

    • Modify the comments and documentation to reflect the changes made to the linked list implementation.
    • Provide clear explanations and examples of how to use the new doubly linked list functions.

15. Update the unit tests:

    • Modify the existing unit tests to cover the new doubly linked list implementation.
    • Add new test cases to ensure the correctness of the new functions and the proper handling of edge cases.

16. Update the README and other relevant documentation:

    • Mention the support for doubly linked lists in the README file.

17. Perform thorough testing:

    • Compile the library with the modifications and ensure there are no compilation errors.
    • Run the updated unit tests and verify that all tests pass successfully.
    • Test the doubly linked list implementation with various scenarios and edge cases to ensure its correctness and robustness.

18. Refactor and optimize (optional):

    • Review the modified code and look for any opportunities to refactor and optimize the implementation.
    • Consider any potential performance improvements or code simplifications.