Added tests for algo*, fixing ft_bsearch and ft_mergesort

9 files changed, 286 insertions, 0 deletions

diff --git a/test/src/algo/test_ft_bsearch.c b/test/src/algo/test_ft_bsearch.c
new file mode 100644
index 0000000..27858ee
--- /dev/null
+++ b/test/src/algo/test_ft_bsearch.c
@@ -0,0 +1,55 @@
+#include "libft_test.h"
+
+TEST_GROUP(ft_bsearch);
+
+TEST_SETUP(ft_bsearch)
+{}
+
+TEST_TEAR_DOWN(ft_bsearch)
+{}
+
+TEST(ft_bsearch, basic)
+{
+	int arr[] = {3, 4, 1, 2, 7, 189, -1, -134, 7, 1, 34};
+	t_ftsearch_const consts;
+
+	int a = 189;
+	consts.key =  &a;
+	consts.compar = ft_compar_int;
+
+	size_t nelp = sizeof(arr) / sizeof(int);
+	qsort(arr, nelp, sizeof(int), ft_compar_int);
+
+	void *ptr = ft_bsearch(arr, nelp, sizeof(int), &consts);
+	TEST_ASSERT_EQUAL_PTR(bsearch(consts.key, arr, nelp, sizeof(int), consts.compar), ptr);
+
+	int b = 123;
+	consts.key = &b;
+	ptr = ft_bsearch(arr, nelp, sizeof(int), &consts);
+	TEST_ASSERT_NULL(ptr);
+
+	int c = -134;
+	consts.key = &c;
+	ptr = ft_bsearch(arr, nelp, sizeof(int), &consts);
+	TEST_ASSERT_EQUAL_PTR(bsearch(consts.key, arr, nelp, sizeof(int), consts.compar), ptr);
+
+	int e = 1;
+	consts.key = &e;
+	ptr = ft_bsearch(arr, nelp, sizeof(int), &consts);
+	TEST_ASSERT_EQUAL_PTR(bsearch(consts.key, arr, nelp, sizeof(int), consts.compar), ptr);
+
+	int d = -1;
+	consts.key = &d;
+	ptr = ft_bsearch(arr, nelp, sizeof(int), &consts);
+	TEST_ASSERT_EQUAL_PTR(bsearch(consts.key, arr, nelp, sizeof(int), consts.compar), ptr);
+
+	int f = 34;
+	consts.key = &f;
+	ptr = ft_bsearch(arr, nelp, sizeof(int), &consts);
+	TEST_ASSERT_EQUAL_PTR(bsearch(consts.key, arr, nelp, sizeof(int), consts.compar), ptr);
+
+	int g = 7;
+	consts.key = &g;
+	ptr = ft_bsearch(arr, nelp, sizeof(int), &consts);
+	TEST_ASSERT_EQUAL_PTR(bsearch(consts.key, arr, nelp, sizeof(int), consts.compar), ptr);
+}
diff --git a/test/src/algo/test_ft_compar_int.c b/test/src/algo/test_ft_compar_int.c
new file mode 100644
index 0000000..39cc322
--- /dev/null
+++ b/test/src/algo/test_ft_compar_int.c
@@ -0,0 +1,20 @@
+#include "libft_test.h"
+
+TEST_GROUP(ft_compar_int);
+
+TEST_SETUP(ft_compar_int)
+{}
+
+TEST_TEAR_DOWN(ft_compar_int)
+{}
+
+TEST(ft_compar_int, basic)
+{
+	int a = 4;
+	int b = 3;
+
+	TEST_ASSERT_GREATER_THAN(0, ft_compar_int(&a, &b));
+	TEST_ASSERT_LESS_THAN(0, ft_compar_int(&b, &a));
+	TEST_ASSERT_EQUAL(0, ft_compar_int(&a, &a));
+	TEST_ASSERT_EQUAL(0, ft_compar_int(&b, &b));
+}
diff --git a/test/src/algo/test_ft_heapsort.c b/test/src/algo/test_ft_heapsort.c
new file mode 100644
index 0000000..6c2c3fb
--- /dev/null
+++ b/test/src/algo/test_ft_heapsort.c
@@ -0,0 +1,27 @@
+#include "libft_test.h"
+
+TEST_GROUP(ft_heapsort);
+
+TEST_SETUP(ft_heapsort)
+{}
+
+TEST_TEAR_DOWN(ft_heapsort)
+{}
+
+static int compar(const void *a, const void *b)
+{
+	return *(int*)a - *(int*)b;
+}
+
+TEST(ft_heapsort, basic)
+{
+	TEST_IGNORE();
+	int arr[] = {3, 4, 1, 2, 7, 189, -1, -134, 7, 1, 34};
+	int sorted_arr[sizeof(arr)];
+
+	memcpy(sorted_arr, arr, sizeof(arr));
+	qsort(sorted_arr, sizeof(arr) / sizeof(int), sizeof(int), compar);
+
+	ft_heapsort(arr, sizeof(arr) / sizeof(int), sizeof(int), compar);
+	TEST_ASSERT_EQUAL_INT_ARRAY(sorted_arr, arr, sizeof(arr) / sizeof(int));
+}
diff --git a/test/src/algo/test_ft_is_set.c b/test/src/algo/test_ft_is_set.c
new file mode 100644
index 0000000..604ec53
--- /dev/null
+++ b/test/src/algo/test_ft_is_set.c
@@ -0,0 +1,23 @@
+#include "libft_test.h"
+
+TEST_GROUP(ft_is_set);
+
+TEST_SETUP(ft_is_set)
+{}
+
+TEST_TEAR_DOWN(ft_is_set)
+{}
+
+static int compar(const void *a, const void *b)
+{
+	return *(int*)a - *(int*)b;
+}
+
+TEST(ft_is_set, basic)
+{
+	int arr[] = {3, 4, 1, 2, 7, 189, -1, -134, 7, 1, 34};
+	int unique_arr[] = {3, 4, 2, 189, -1, -134, 7, 1, 34};
+
+	TEST_ASSERT_FALSE(ft_is_set(arr, sizeof(arr) / sizeof(int), sizeof(int), compar));
+	TEST_ASSERT_TRUE(ft_is_set(unique_arr, sizeof(unique_arr) / sizeof(int), sizeof(int), compar));
+}
diff --git a/test/src/algo/test_ft_lfind.c b/test/src/algo/test_ft_lfind.c
new file mode 100644
index 0000000..0080d55
--- /dev/null
+++ b/test/src/algo/test_ft_lfind.c
@@ -0,0 +1,38 @@
+#include "libft_test.h"
+
+TEST_GROUP(ft_lfind);
+
+TEST_SETUP(ft_lfind)
+{}
+
+TEST_TEAR_DOWN(ft_lfind)
+{}
+
+TEST(ft_lfind, basic)
+{
+	int arr[] = {3, 4, 1, 2, 7, 189, -1, -134, 7, 1, 34};
+	t_ftsearch_const consts;
+
+	int a = 189;
+	consts.key =  &a;
+	consts.compar = ft_compar_int;
+
+	size_t nelp = sizeof(arr) / sizeof(int);
+	void *ptr = ft_lfind(arr, &nelp, sizeof(int), &consts);
+	TEST_ASSERT_EQUAL_PTR(arr + 5, ptr);
+
+	int b = 123;
+	consts.key = &b;
+	ptr = ft_lfind(arr, &nelp, sizeof(int), &consts);
+	TEST_ASSERT_NULL(ptr);
+
+	int c = 34;
+	consts.key = &c;
+	ptr = ft_lfind(arr, &nelp, sizeof(int), &consts);
+	TEST_ASSERT_EQUAL_PTR(arr + 10, ptr);
+
+	int d = 3;
+	consts.key = &d;
+	ptr = ft_lfind(arr, &nelp, sizeof(int), &consts);
+	TEST_ASSERT_EQUAL_PTR(arr, ptr);
+}
diff --git a/test/src/algo/test_ft_lsearch.c b/test/src/algo/test_ft_lsearch.c
new file mode 100644
index 0000000..13fae13
--- /dev/null
+++ b/test/src/algo/test_ft_lsearch.c
@@ -0,0 +1,52 @@
+#include "libft_test.h"
+
+TEST_GROUP(ft_lsearch);
+
+TEST_SETUP(ft_lsearch)
+{}
+
+TEST_TEAR_DOWN(ft_lsearch)
+{}
+
+TEST(ft_lsearch, basic)
+{
+	int arr[32] = {3, 4, 1, 2, 7, 189, -1, -134, 7, 1, 34};
+	t_ftsearch_const consts;
+
+	int a = 189;
+	consts.key =  &a;
+	consts.compar = ft_compar_int;
+
+	size_t nelp = 11;
+	void *ptr = ft_lsearch(arr, &nelp, sizeof(int), &consts);
+	TEST_ASSERT_EQUAL_PTR(arr + 5, ptr);
+
+	int c = 34;
+	consts.key = &c;
+	ptr = ft_lsearch(arr, &nelp, sizeof(int), &consts);
+	TEST_ASSERT_EQUAL_PTR(arr + 10, ptr);
+
+	int d = 3;
+	consts.key = &d;
+	ptr = ft_lsearch(arr, &nelp, sizeof(int), &consts);
+	TEST_ASSERT_EQUAL_PTR(arr, ptr);
+
+	int b = 123;
+	consts.key = &b;
+	ptr = ft_lsearch(arr, &nelp, sizeof(int), &consts);
+	TEST_ASSERT_EQUAL(12, nelp);
+	TEST_ASSERT_EQUAL(123, arr[11]);
+	TEST_ASSERT_EQUAL_PTR(arr + 11, ptr);
+
+	ptr = ft_lsearch(arr, &nelp, sizeof(int), &consts);
+	TEST_ASSERT_EQUAL(12, nelp);
+	TEST_ASSERT_EQUAL(123, arr[11]);
+	TEST_ASSERT_EQUAL_PTR(arr + 11, ptr);
+
+	int e = 1234;
+	consts.key = &e;
+	ptr = ft_lsearch(arr, &nelp, sizeof(int), &consts);
+	TEST_ASSERT_EQUAL(13, nelp);
+	TEST_ASSERT_EQUAL(1234, arr[12]);
+	TEST_ASSERT_EQUAL_PTR(arr + 12, ptr);
+}
diff --git a/test/src/algo/test_ft_mergesort.c b/test/src/algo/test_ft_mergesort.c
new file mode 100644
index 0000000..567e31d
--- /dev/null
+++ b/test/src/algo/test_ft_mergesort.c
@@ -0,0 +1,26 @@
+#include "libft_test.h"
+
+TEST_GROUP(ft_mergesort);
+
+TEST_SETUP(ft_mergesort)
+{}
+
+TEST_TEAR_DOWN(ft_mergesort)
+{}
+
+static int compar(const void *a, const void *b)
+{
+	return *(int*)a - *(int*)b;
+}
+
+TEST(ft_mergesort, basic)
+{
+	int arr[] = {3, 4, 1, 2, 7, 189, -1, -134, 7, 1, 34};
+	int sorted_arr[sizeof(arr)];
+
+	memcpy(sorted_arr, arr, sizeof(arr));
+	qsort(sorted_arr, sizeof(arr) / sizeof(int), sizeof(int), compar);
+
+	ft_mergesort(arr, sizeof(arr) / sizeof(int), sizeof(int), compar);
+	TEST_ASSERT_EQUAL_INT_ARRAY(sorted_arr, arr, sizeof(arr) / sizeof(int));
+}
diff --git a/test/src/algo/test_ft_qsort.c b/test/src/algo/test_ft_qsort.c
new file mode 100644
index 0000000..25a5ef6
--- /dev/null
+++ b/test/src/algo/test_ft_qsort.c
@@ -0,0 +1,26 @@
+#include "libft_test.h"
+
+TEST_GROUP(ft_qsort);
+
+TEST_SETUP(ft_qsort)
+{}
+
+TEST_TEAR_DOWN(ft_qsort)
+{}
+
+static int compar(const void *a, const void *b)
+{
+	return *(int*)a - *(int*)b;
+}
+
+TEST(ft_qsort, basic)
+{
+	int arr[] = {3, 4, 1, 2, 7, 189, -1, -134, 7, 1, 34};
+	int sorted_arr[sizeof(arr)];
+
+	memcpy(sorted_arr, arr, sizeof(arr));
+	qsort(sorted_arr, sizeof(arr) / sizeof(int), sizeof(int), compar);
+
+	ft_qsort(arr, sizeof(arr) / sizeof(int), sizeof(int), compar);
+	TEST_ASSERT_EQUAL_INT_ARRAY(sorted_arr, arr, sizeof(arr) / sizeof(int));
+}
diff --git a/test/src/algo/test_ft_reverse.c b/test/src/algo/test_ft_reverse.c
new file mode 100644
index 0000000..feca520
--- /dev/null
+++ b/test/src/algo/test_ft_reverse.c
@@ -0,0 +1,19 @@
+#include "libft_test.h"
+
+TEST_GROUP(ft_reverse);
+
+TEST_SETUP(ft_reverse)
+{}
+
+TEST_TEAR_DOWN(ft_reverse)
+{}
+
+TEST(ft_reverse, basic)
+{
+	int arr[] = {3, 4, 1, 2, 7, 189, -1, -134, 7, 1, 34};
+	int rev_arr[] = {34, 1, 7, -134, -1, 189, 7, 2, 1, 4, 3};
+
+	ft_reverse(arr, sizeof(arr) / sizeof(int), sizeof(int));
+	TEST_ASSERT_EQUAL_INT_ARRAY(rev_arr, arr, sizeof(arr) / sizeof(int));
+
+}