list.c

/**
 * Various list operations
 */

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#include "list.h"
#include "task.h"

// add a new task to the list of tasks
void insert(struct node** head, Task* newTask) {
    // add the new task to the list
    struct node* newNode = malloc(sizeof(struct node));

    newNode->task = newTask;
    newNode->next = *head;
    *head = newNode;
}

// delete the selected task from the list
void delete(struct node** head, Task* task) {
    struct node* temp;
    struct node* prev;

    temp = *head;
    // special case - beginning of list
    if (temp != NULL && strcmp(task->name, temp->task->name) == 0) {
        *head = temp->next;  // Move head to next node
        free(temp->task->name);
        free(temp->task);
        free(temp);  // Free the removed node
    } else {
        // interior or last element in the list
        prev = *head;
        temp = temp->next;

        while (temp != NULL && strcmp(task->name, temp->task->name) != 0) {
            prev = temp;
            temp = temp->next;
        }

        // If found, remove it
        if (temp != NULL) {
            prev->next = temp->next;
            free(temp->task->name);
            free(temp->task);
            free(temp);  // Free the removed node
        }
    }
}

// traverse the list
void traverse(struct node* head) {
    struct node* temp;
    temp = head;

    while (temp != NULL) {
        printf("[%s] [%d] [%d]\n", temp->task->name, temp->task->priority,
               temp->task->burst);
        temp = temp->next;
    }
}