#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <assert.h>


int _test_linked_list_on_stack_example() {
    mu_start();
    //────────────────────
    // probably don't want to copy/adapt this example
    // this is valid, but a little awkward
    Node second_node = { .next = NULL, .string = "Hello" };
    Node head = { .next = &second_node, .string = "Hello" };
    Strings needles = {
        .head = &head,
        .tail = &second_node,
        .num_strings = 0
    };

    // other code


    // do not call free_strings in this example, all nodes
    // are stack allocated and strings are data segment strings
    //free_strings(&needles);
    //────────────────────
    mu_end();
}

// okay to copy/adapt
// helper to not always need to call strlen
void _append_needle(char const* string, Strings* a_strings) {
    append_substring(string, strlen(string), a_strings);
}

int _test_split_string_two_delimiters_one_match() {
    mu_start();
    //────────────────────
    Strings needles = {
        .head = NULL,
        .tail = NULL,
        .num_strings = 0
    };
    _append_needle("+", &needles);
    _append_needle("-", &needles);
    char const* input = "Hello+World";
    Strings result = splti_string(input, needles);

    // list size checks
    mu_check(result.num_strings == 3);
    mu_check(result.head != NULL);
    mu_check(result.head->next != NULL);
    mu_check(result.head->next->next != NULL);
    mu_check(result.head->next->next->next == NULL);
    mu_check(result.tail == result.head->next->next);

    // string checks
    mu_check_strings_equal("Hello", result.head->string);
    mu_check_strings_equal("World", result.head->next->next->string);
    // delimiter checks
    mu_check_strings_equal("+", result.head->next->string);

    free_strings(&needles);
    free_strings(&result);
    //────────────────────
    mu_end();
}

int main(int argc, char* argv[]) {
    
    return EXIT_SUCCESS;
}
/* vim: set tabstop=4 shiftwidth=4 fileencoding=utf-8 noexpandtab: */