/* SPDX-License-Identifier: BSD-3-Clause */
/*
* Copyright © 2010, Zed A. Shaw.
* Copyright © 2020 rsiddharth <s@ricketyspace.net>
*/
#include "minunit.h"
#include <darray_algos.h>
int testcmp(char **a, char **b)
{
return strcmp(*a, *b);
}
DArray *create_words()
{
DArray *result = DArray_create(0, 5);
char *words[] = { "asdfasfd",
"werwar", "13234", "asdfasfd", "oioj" };
int i = 0;
for (i = 0; i < 5; i++) {
DArray_push(result, words[i]);
}
return result;
}
int is_sorted(DArray *array)
{
int i = 0;
for (i = 0; i < DArray_count(array) -1; i++) {
if (strcmp(DArray_get(array, i), DArray_get(array, i + 1)) > 0) {
return 0;
}
}
return 1;
}
char *run_sort_test(int (*func) (DArray *, DArray_compare),
const char *name)
{
DArray *words = create_words();
mu_assert(!is_sorted(words), "Words should start not sorted.");
debug("--- Testing %s sorting algorithm", name);
int rc = func(words, (DArray_compare) testcmp);
mu_assert(rc == 0, "sort failed");
mu_assert(is_sorted(words), "didn't sort it");
DArray_destroy(words);
return NULL;
}
char *test_qsort()
{
return run_sort_test(DArray_qsort, "qsort");
}
char *test_fucked_qsort()
{
return run_sort_test(DArray_fucked_qsort, "fucked qsort");
}
char *test_heapsort()
{
return run_sort_test(DArray_heapsort, "heapsort");
}
char *test_fucked_heapsort()
{
return run_sort_test(DArray_fucked_heapsort, "fucked heapsort");
}
char *test_mergesort()
{
return run_sort_test(DArray_mergesort, "mergesort");
}
char *test_fucked_mergesort()
{
return run_sort_test(DArray_fucked_mergesort, "fucked mergesort");
}
char *all_tests()
{
mu_suite_start();
mu_run_test(test_qsort);
mu_run_test(test_fucked_qsort);
mu_run_test(test_heapsort);
mu_run_test(test_fucked_heapsort);
mu_run_test(test_mergesort);
mu_run_test(test_fucked_mergesort);
return NULL;
}
RUN_TESTS(all_tests);